/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue.line487.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 00:35:26,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 00:35:26,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 00:35:26,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 00:35:26,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 00:35:26,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 00:35:26,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 00:35:26,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 00:35:26,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 00:35:26,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 00:35:26,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 00:35:26,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 00:35:26,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 00:35:26,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 00:35:26,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 00:35:26,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 00:35:26,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 00:35:26,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 00:35:26,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 00:35:26,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 00:35:26,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 00:35:26,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 00:35:26,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 00:35:26,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 00:35:26,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 00:35:26,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 00:35:26,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 00:35:26,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 00:35:26,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 00:35:26,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 00:35:26,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 00:35:26,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 00:35:26,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 00:35:26,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 00:35:26,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 00:35:26,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 00:35:26,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 00:35:26,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 00:35:26,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 00:35:26,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 00:35:26,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 00:35:26,339 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-04 00:35:26,376 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 00:35:26,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 00:35:26,377 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 00:35:26,377 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 00:35:26,378 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 00:35:26,378 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 00:35:26,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 00:35:26,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 00:35:26,379 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 00:35:26,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 00:35:26,379 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 00:35:26,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 00:35:26,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 00:35:26,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 00:35:26,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 00:35:26,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 00:35:26,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 00:35:26,380 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 00:35:26,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 00:35:26,381 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 00:35:26,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 00:35:26,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 00:35:26,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 00:35:26,381 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 00:35:26,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 00:35:26,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:35:26,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 00:35:26,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 00:35:26,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 00:35:26,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 00:35:26,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 00:35:26,383 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 00:35:26,383 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 00:35:26,383 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 00:35:26,383 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 00:35:26,383 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 00:35:26,384 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 00:35:26,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 00:35:26,384 INFO L138 SettingsManager]: * Independence relation used for POR 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 [2022-10-04 00:35:26,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 00:35:26,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 00:35:26,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 00:35:26,671 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 00:35:26,672 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 00:35:26,673 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue.line487.bpl [2022-10-04 00:35:26,674 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue.line487.bpl' [2022-10-04 00:35:26,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 00:35:26,734 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 00:35:26,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 00:35:26,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 00:35:26,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 00:35:26,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:26" (1/1) ... [2022-10-04 00:35:26,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:26" (1/1) ... [2022-10-04 00:35:26,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:26" (1/1) ... [2022-10-04 00:35:26,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:26" (1/1) ... [2022-10-04 00:35:26,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:26" (1/1) ... [2022-10-04 00:35:26,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:26" (1/1) ... [2022-10-04 00:35:26,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:26" (1/1) ... [2022-10-04 00:35:26,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 00:35:26,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 00:35:26,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 00:35:26,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 00:35:26,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:26" (1/1) ... [2022-10-04 00:35:26,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:35:26,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:35:26,885 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) [2022-10-04 00:35:26,892 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 [2022-10-04 00:35:26,926 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-10-04 00:35:26,926 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-10-04 00:35:26,926 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-10-04 00:35:26,926 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-10-04 00:35:26,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 00:35:26,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 00:35:26,928 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-04 00:35:27,120 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 00:35:27,121 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 00:35:27,795 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 00:35:27,814 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 00:35:27,814 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-04 00:35:27,817 INFO L202 PluginConnector]: Adding new model queue.line487.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:35:27 BoogieIcfgContainer [2022-10-04 00:35:27,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 00:35:27,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 00:35:27,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 00:35:27,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 00:35:27,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:26" (1/2) ... [2022-10-04 00:35:27,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4ff49e and model type queue.line487.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:35:27, skipping insertion in model container [2022-10-04 00:35:27,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:35:27" (2/2) ... [2022-10-04 00:35:27,830 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.line487.bpl [2022-10-04 00:35:27,838 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 00:35:27,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 00:35:27,847 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 00:35:27,847 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 00:35:28,051 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 00:35:28,119 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:35:28,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:35:28,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:35:28,126 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:35:28,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-04 00:35:28,159 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:35:28,166 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:35:28,172 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@1c57bebd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:35:28,172 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:35:28,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:35:28,849 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:35:28,852 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 00:35:28,866 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:35:28,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:35:28,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:35:28,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:35:28,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-10-04 00:35:28,886 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:35:28,890 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:35:28,891 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@1c57bebd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:35:28,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:35:28,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:35:28,930 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:35:28,933 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 00:35:28,941 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:35:28,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:35:28,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:35:28,976 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:35:28,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-10-04 00:35:28,981 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:35:28,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:35:28,983 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@1c57bebd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:35:28,983 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:35:28,983 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 00:35:28,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:35:28,984 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:35:28,984 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 00:35:28,989 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:35:28,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:35:28,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:35:28,992 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:35:29,002 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:35:29,003 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:35:29,003 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@1c57bebd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:35:29,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:35:29,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-10-04 00:35:29,142 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:35:29,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:35:29,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2066130039, now seen corresponding path program 1 times [2022-10-04 00:35:29,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:35:29,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967892275] [2022-10-04 00:35:29,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:35:29,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:35:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:35:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:35:29,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:35:29,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967892275] [2022-10-04 00:35:29,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967892275] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:35:29,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:35:29,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-04 00:35:29,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969700675] [2022-10-04 00:35:29,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:35:29,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-04 00:35:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:35:29,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-04 00:35:29,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-04 00:35:29,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:35:29,810 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:35:29,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 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) [2022-10-04 00:35:29,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:35:30,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:30,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 00:35:30,613 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:35:30,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:35:30,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2131968224, now seen corresponding path program 1 times [2022-10-04 00:35:30,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:35:30,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321900055] [2022-10-04 00:35:30,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:35:30,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:35:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:35:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:35:32,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:35:32,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321900055] [2022-10-04 00:35:32,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321900055] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:35:32,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:35:32,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-10-04 00:35:32,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027700364] [2022-10-04 00:35:32,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:35:32,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-04 00:35:32,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:35:32,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-04 00:35:32,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2022-10-04 00:35:32,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:35:32,219 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:35:32,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 11.551724137931034) internal successors, (335), 30 states have internal predecessors, (335), 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) [2022-10-04 00:35:32,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:32,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:35:39,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:39,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-10-04 00:35:39,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 00:35:39,773 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:35:39,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:35:39,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1977838357, now seen corresponding path program 1 times [2022-10-04 00:35:39,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:35:39,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219132040] [2022-10-04 00:35:39,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:35:39,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:35:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:35:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1697 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2022-10-04 00:35:40,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:35:40,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219132040] [2022-10-04 00:35:40,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219132040] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:35:40,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:35:40,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 00:35:40,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223309924] [2022-10-04 00:35:40,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:35:40,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 00:35:40,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:35:40,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 00:35:40,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-04 00:35:40,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:35:40,284 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:35:40,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 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) [2022-10-04 00:35:40,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:40,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-10-04 00:35:40,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:35:40,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-10-04 00:35:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:40,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-04 00:35:40,645 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:35:40,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:35:40,646 INFO L85 PathProgramCache]: Analyzing trace with hash 971641964, now seen corresponding path program 1 times [2022-10-04 00:35:40,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:35:40,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953208025] [2022-10-04 00:35:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:35:40,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:35:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:35:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 794 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2022-10-04 00:35:41,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:35:41,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953208025] [2022-10-04 00:35:41,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953208025] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:35:41,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:35:41,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 00:35:41,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687620828] [2022-10-04 00:35:41,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:35:41,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 00:35:41,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:35:41,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 00:35:41,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-04 00:35:41,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:35:41,085 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:35:41,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 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) [2022-10-04 00:35:41,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:41,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-10-04 00:35:41,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:41,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:35:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:41,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-10-04 00:35:41,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:41,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:41,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-04 00:35:41,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:35:41,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:35:41,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1144012605, now seen corresponding path program 2 times [2022-10-04 00:35:41,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:35:41,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168613387] [2022-10-04 00:35:41,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:35:41,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:35:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:35:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 403 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2022-10-04 00:35:41,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:35:41,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168613387] [2022-10-04 00:35:41,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168613387] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:35:41,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:35:41,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-04 00:35:41,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386715718] [2022-10-04 00:35:41,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:35:41,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-04 00:35:41,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:35:41,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-04 00:35:41,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-04 00:35:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:35:41,635 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:35:41,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 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) [2022-10-04 00:35:41,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:41,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-10-04 00:35:41,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:41,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:41,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:35:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-10-04 00:35:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:42,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-04 00:35:42,260 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:35:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:35:42,260 INFO L85 PathProgramCache]: Analyzing trace with hash -651489926, now seen corresponding path program 1 times [2022-10-04 00:35:42,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:35:42,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198947621] [2022-10-04 00:35:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:35:42,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:35:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:35:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2960 backedges. 797 proven. 0 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2022-10-04 00:35:42,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:35:42,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198947621] [2022-10-04 00:35:42,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198947621] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:35:42,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:35:42,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-04 00:35:42,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155879858] [2022-10-04 00:35:42,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:35:42,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-04 00:35:42,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:35:42,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-04 00:35:42,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-04 00:35:42,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:35:42,832 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:35:42,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 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) [2022-10-04 00:35:42,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:42,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-10-04 00:35:42,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:42,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:42,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:42,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:35:42,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:42,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-10-04 00:35:42,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:42,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:42,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:42,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:35:42,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-04 00:35:42,992 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:35:42,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:35:42,992 INFO L85 PathProgramCache]: Analyzing trace with hash -389699591, now seen corresponding path program 1 times [2022-10-04 00:35:42,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:35:42,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93244915] [2022-10-04 00:35:42,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:35:42,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:35:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:35:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-04 00:35:44,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:35:44,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93244915] [2022-10-04 00:35:44,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93244915] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:35:44,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440764181] [2022-10-04 00:35:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:35:44,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:35:44,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:35:44,521 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) [2022-10-04 00:35:44,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-04 00:35:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:35:44,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 107 conjunts are in the unsatisfiable core [2022-10-04 00:35:44,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:35:45,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-04 00:35:45,381 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:35:45,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-10-04 00:35:46,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-04 00:35:46,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:35:46,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 00:35:47,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:35:47,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-04 00:35:48,295 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:35:48,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-10-04 00:35:48,520 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:35:48,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 18 [2022-10-04 00:35:48,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:35:48,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 00:35:49,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-04 00:35:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-10-04 00:35:49,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-04 00:35:49,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440764181] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:35:49,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-04 00:35:49,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [33] total 71 [2022-10-04 00:35:49,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808069991] [2022-10-04 00:35:49,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:35:49,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-10-04 00:35:49,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:35:49,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-10-04 00:35:49,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=4647, Unknown=0, NotChecked=0, Total=4970 [2022-10-04 00:35:49,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:35:49,139 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:35:49,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 13.256410256410257) internal successors, (517), 39 states have internal predecessors, (517), 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) [2022-10-04 00:35:49,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:49,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-10-04 00:35:49,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:49,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:49,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:49,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:35:49,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:35:54,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-10-04 00:35:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:35:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-10-04 00:35:54,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-04 00:35:54,394 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 [2022-10-04 00:35:54,394 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:35:54,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:35:54,395 INFO L85 PathProgramCache]: Analyzing trace with hash -494269978, now seen corresponding path program 1 times [2022-10-04 00:35:54,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:35:54,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548132398] [2022-10-04 00:35:54,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:35:54,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:35:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:35:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:35:56,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:35:56,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548132398] [2022-10-04 00:35:56,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548132398] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:35:56,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:35:56,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-10-04 00:35:56,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110090178] [2022-10-04 00:35:56,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:35:56,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-10-04 00:35:56,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:35:56,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-10-04 00:35:56,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2679, Unknown=0, NotChecked=0, Total=2862 [2022-10-04 00:35:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:35:56,747 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:35:56,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 6.528301886792453) internal successors, (346), 54 states have internal predecessors, (346), 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) [2022-10-04 00:35:56,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:56,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-10-04 00:35:56,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:56,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:35:56,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:35:56,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:35:56,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-10-04 00:35:56,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-10-04 00:36:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:36:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:36:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:36:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-10-04 00:36:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-10-04 00:36:07,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-04 00:36:07,781 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:36:07,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:36:07,781 INFO L85 PathProgramCache]: Analyzing trace with hash -513412045, now seen corresponding path program 1 times [2022-10-04 00:36:07,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:36:07,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984959063] [2022-10-04 00:36:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:36:07,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:36:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:36:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-04 00:36:09,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:36:09,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984959063] [2022-10-04 00:36:09,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984959063] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:36:09,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628867070] [2022-10-04 00:36:09,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:36:09,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:36:09,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:36:09,241 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) [2022-10-04 00:36:09,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-04 00:36:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:36:09,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 165 conjunts are in the unsatisfiable core [2022-10-04 00:36:09,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:36:09,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-04 00:36:09,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-04 00:36:10,006 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:36:10,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-04 00:36:10,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-04 00:36:10,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-04 00:36:10,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:10,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 00:36:11,880 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:36:11,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-10-04 00:36:11,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-04 00:36:13,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:36:13,671 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:36:13,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 54 [2022-10-04 00:36:13,989 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:36:13,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2022-10-04 00:36:14,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:14,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 00:36:14,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:36:14,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-04 00:36:15,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-04 00:36:15,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:15,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-04 00:36:16,122 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:36:16,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2022-10-04 00:36:16,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:16,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 00:36:16,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-10-04 00:36:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-10-04 00:36:16,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-04 00:36:16,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628867070] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:36:16,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-04 00:36:16,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [37] total 94 [2022-10-04 00:36:16,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503858266] [2022-10-04 00:36:16,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:36:16,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-10-04 00:36:16,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:36:16,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-10-04 00:36:16,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=8300, Unknown=0, NotChecked=0, Total=8742 [2022-10-04 00:36:16,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:16,573 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:36:16,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 9.672413793103448) internal successors, (561), 58 states have internal predecessors, (561), 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) [2022-10-04 00:36:16,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:16,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-10-04 00:36:16,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:36:16,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:36:16,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:16,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:36:16,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-10-04 00:36:16,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2022-10-04 00:36:16,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:28,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-10-04 00:36:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:36:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:36:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:36:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-10-04 00:36:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-10-04 00:36:28,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-10-04 00:36:28,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-10-04 00:36:28,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:36:28,552 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:36:28,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:36:28,552 INFO L85 PathProgramCache]: Analyzing trace with hash -396402827, now seen corresponding path program 1 times [2022-10-04 00:36:28,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:36:28,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185998337] [2022-10-04 00:36:28,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:36:28,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:36:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:36:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-04 00:36:32,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:36:32,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185998337] [2022-10-04 00:36:32,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185998337] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:36:32,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426356657] [2022-10-04 00:36:32,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:36:32,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:36:32,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:36:32,868 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) [2022-10-04 00:36:32,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-04 00:36:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:36:33,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 218 conjunts are in the unsatisfiable core [2022-10-04 00:36:33,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:36:33,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-04 00:36:33,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-04 00:36:33,784 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:36:33,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-04 00:36:33,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-04 00:36:34,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-04 00:36:34,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-04 00:36:35,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:35,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:35,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-10-04 00:36:36,040 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:36:36,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-10-04 00:36:36,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-04 00:36:38,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:36:38,447 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-10-04 00:36:38,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 60 [2022-10-04 00:36:38,748 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-10-04 00:36:38,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 52 [2022-10-04 00:36:39,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:39,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:39,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-10-04 00:36:40,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-10-04 00:36:40,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:40,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-10-04 00:36:42,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:36:42,636 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-10-04 00:36:42,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-10-04 00:36:43,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:43,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:43,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-10-04 00:36:43,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:43,584 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:36:43,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 38 [2022-10-04 00:36:43,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:43,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-04 00:36:44,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-04 00:36:45,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:45,492 INFO L356 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-10-04 00:36:45,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 37 [2022-10-04 00:36:45,727 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-04 00:36:45,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2022-10-04 00:36:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-04 00:36:45,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:36:51,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_903 (Array Int Int))) (not (= (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) is different from false [2022-10-04 00:36:51,725 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_903 (Array Int Int))) (not (= (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) is different from false [2022-10-04 00:36:51,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_903 (Array Int Int))) (not (= 20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80))))) is different from false [2022-10-04 00:36:51,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (not (= (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) is different from false [2022-10-04 00:36:51,784 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (not (= (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:51,795 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:51,847 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (= (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:51,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:51,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:52,126 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (let ((.cse0 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_899)))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:52,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (= (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:52,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:52,326 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_899 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:52,388 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (let ((.cse0 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_897)))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:52,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (= 20 (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:52,533 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:52,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:52,608 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:52,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (let ((.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* (select .cse1 .cse0) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:36:52,783 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (select .cse1 .cse0) 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|))))) is different from false [2022-10-04 00:36:52,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:36:53,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_899 Int) (v_ArrVal_897 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:36:53,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int)) (let ((.cse1 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_895))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse0 (+ 84 |c_~#queue~0.offset|))) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (select .cse2 .cse0) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:54,039 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int)) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int)) (let ((.cse0 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:54,097 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int)) (let ((.cse2 (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:54,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse1 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse0 (+ 84 |c_~#queue~0.offset|))) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= v_ArrVal_894 |c_t1Thread1of1ForFork1_write~int_#value#1|)) (< (+ (* 4 (select .cse2 .cse0)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:54,538 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse1 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse0 (+ 84 |c_~#queue~0.offset|))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) v_ArrVal_894) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ |c_~#queue~0.offset| (* (select .cse2 .cse0) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:54,617 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) v_ArrVal_894) (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:54,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_894) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:54,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork1_read~int_#value#1| 1) v_ArrVal_894) (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:54,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) v_ArrVal_894) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:54,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_894) (< (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse3))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))))) is different from false [2022-10-04 00:36:55,446 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse5 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_892)))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_894) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))))) is different from false [2022-10-04 00:36:55,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse2 (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_892)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_894) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))))) is different from false [2022-10-04 00:36:55,703 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_892)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse0 (+ 84 |c_~#queue~0.offset|))) (or (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (select .cse2 .cse0) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_894) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))))) is different from false [2022-10-04 00:37:06,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:06,148 INFO L356 Elim1Store]: treesize reduction 41, result has 53.9 percent of original size [2022-10-04 00:37:06,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 387 treesize of output 202 [2022-10-04 00:37:06,198 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:37:06,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 516 treesize of output 530 [2022-10-04 00:37:06,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:06,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:06,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:06,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:06,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 418 treesize of output 406 [2022-10-04 00:37:06,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 366 treesize of output 334 [2022-10-04 00:37:06,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 334 treesize of output 318 [2022-10-04 00:37:06,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:06,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:06,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 402 treesize of output 386 [2022-10-04 00:37:06,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-04 00:37:06,566 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:37:06,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2022-10-04 00:37:06,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-04 00:37:06,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:06,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:06,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:06,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:06,778 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:37:06,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 211 treesize of output 237 [2022-10-04 00:37:21,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 142 treesize of output 138 [2022-10-04 00:37:21,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-04 00:37:21,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-04 00:37:21,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:21,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-04 00:37:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 36 not checked. [2022-10-04 00:37:21,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426356657] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:37:21,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:37:21,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 80, 79] total 230 [2022-10-04 00:37:21,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702204897] [2022-10-04 00:37:21,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:37:21,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 230 states [2022-10-04 00:37:21,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:37:21,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 230 interpolants. [2022-10-04 00:37:21,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=36442, Unknown=133, NotChecked=14700, Total=52670 [2022-10-04 00:37:21,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:37:21,831 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:37:21,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 230 states, 230 states have (on average 6.604347826086957) internal successors, (1519), 230 states have internal predecessors, (1519), 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) [2022-10-04 00:37:21,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:37:21,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-10-04 00:37:21,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:37:21,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:37:21,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:37:21,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:37:21,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-10-04 00:37:21,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2022-10-04 00:37:21,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2022-10-04 00:37:21,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:37:40,778 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse43 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse17 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse10 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (.cse12 (+ |c_~#queue~0.offset| 80)) (.cse34 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|)) (.cse42 (select |c_#length| |c_~#queue~0.base|)) (.cse13 (select .cse43 .cse17)) (.cse36 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse44 (+ |c_ULTIMATE.start_init_~q#1.offset| 84))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse15 (select .cse36 .cse44)) (.cse8 (<= .cse13 0)) (.cse25 (< .cse42 (+ 92 |c_~#queue~0.offset|))) (.cse14 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|)) (.cse3 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse35 (+ |c_ULTIMATE.start_init_~q#1.offset| 80)) (.cse5 (select .cse34 .cse44)) (.cse11 (select |c_#length| |c_ULTIMATE.start_init_~q#1.base|)) (.cse16 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse9 (= (select .cse43 .cse12) 0)) (.cse6 (and (<= .cse42 4) .cse10)) (.cse7 (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (and (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |ULTIMATE.start_write~int_#ptr#1.base|))))) (.cse1 (<= (select .cse0 .cse17) 0)) (.cse4 (= (select .cse0 .cse12) 0))) (and (= (select .cse0 80) 0) (not (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) .cse1 (<= (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (= (select .cse2 80) 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select .cse3 80) 0) .cse4 (= .cse5 0) (or .cse6 (and .cse7 .cse8 .cse9)) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (or .cse10 (<= .cse11 91)) (<= (+ 4 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|)) (= (select .cse2 84) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (select .cse3 .cse12) 0) (<= .cse13 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select .cse0 84) 0) (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= (select .cse14 84) 0) (<= .cse15 0) (= 0 .cse15) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4))) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (not .cse16) .cse8 (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse10 (<= (select .cse3 .cse17) 0) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_887 Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_888 (Array Int Int)) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_890 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse24 (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_887)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_888))) (let ((.cse21 (select .cse24 |c_~#queue~0.base|))) (let ((.cse23 (store (store .cse21 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_890) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_892)) (.cse19 (+ 84 |c_~#queue~0.offset|))) (let ((.cse22 (store (store .cse24 |c_~#queue~0.base| (store .cse23 .cse19 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse18 (+ 88 |c_~#queue~0.offset|)) (.cse20 (select .cse22 |c_~#queue~0.base|))) (or (not (<= .cse18 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse19 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ |c_~#queue~0.offset| (* (select .cse20 .cse19) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (< (select |c_#length| |c_~#queue~0.base|) (+ |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| 4)) (not (<= .cse18 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)) (< (+ (* (select .cse21 .cse19) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|) (not (= (select (select (store (store (store .cse22 |c_~#queue~0.base| (store (store (store .cse20 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)) (< (+ (select .cse23 .cse19) 1) v_ArrVal_894)))))))) .cse25) (or (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_18| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_887 Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_885 Int) (v_ArrVal_894 Int) (v_ArrVal_888 (Array Int Int)) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_890 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse32 (store (let ((.cse33 (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_885)))) (store .cse33 |c_ULTIMATE.start_init_~q#1.base| (store (select .cse33 |c_ULTIMATE.start_init_~q#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_18| v_ArrVal_887))) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_888))) (let ((.cse28 (select .cse32 |c_~#queue~0.base|))) (let ((.cse26 (store (store .cse28 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_890) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_892)) (.cse27 (+ 84 |c_~#queue~0.offset|))) (let ((.cse30 (store (store .cse32 |c_~#queue~0.base| (store .cse26 .cse27 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse29 (+ 88 |c_~#queue~0.offset|)) (.cse31 (select .cse30 |c_~#queue~0.base|))) (or (< (+ (select .cse26 .cse27) 1) v_ArrVal_894) (< (+ (* (select .cse28 .cse27) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|) (not (<= v_ArrVal_885 |c_ULTIMATE.start_write~int_#value#1|)) (not (<= .cse29 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse27 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse30 |c_~#queue~0.base| (store (store (store .cse31 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (select |c_#length| |c_~#queue~0.base|) (+ |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| 4)) (not (<= .cse29 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)) (not (<= (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) |v_ULTIMATE.start_write~int_#ptr#1.offset_18|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (< (+ |c_~#queue~0.offset| (* (select .cse31 .cse27) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))))))) .cse25) (= (select .cse14 80) 0) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (not (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (= 7 |c_~#queue~0.base|) (= (select .cse34 .cse35) 0) (<= (select |c_#length| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 4) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= (select .cse3 84) 0) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= (select .cse36 .cse35) 0) (<= .cse5 0) (<= 4 |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1|) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id2~0#1.base|) 4) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse40 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_892)) (.cse41 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse38 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse40 .cse41 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse39 (select .cse38 |c_~#queue~0.base|)) (.cse37 (+ 84 |c_~#queue~0.offset|))) (or (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse37 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse38 |c_~#queue~0.base| (store (store (store .cse39 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (select .cse39 .cse37) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (< (+ (select .cse40 .cse41) 1) v_ArrVal_894) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))))) (or (<= .cse11 4) .cse16 (not (= |c_ULTIMATE.start_init_~q#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (<= 4 |c_t1Thread1of1ForFork1_write~int_#sizeOfWrittenType#1|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4) .cse9 (or .cse6 (and .cse7 .cse1 .cse4)))))) is different from false [2022-10-04 00:37:40,871 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= (select .cse1 80) 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= (select .cse1 84) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_892)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse4 (select .cse3 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse3 |c_~#queue~0.base| (store (store (store .cse4 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (< (+ (select .cse5 .cse6) 1) v_ArrVal_894) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:37:40,879 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select .cse0 84) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (<= (select .cse1 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse4 (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_892)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse6 |c_~#queue~0.base|))) (or (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (< (+ (select .cse4 .cse5) 1) v_ArrVal_894) (not (<= .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse6 |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))))) (= (select .cse0 80) 0) (<= |c_~#stored_elements~0.base| 6) (= (select .cse1 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-10-04 00:37:46,342 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 84 |c_~#queue~0.offset|)) (.cse8 (select .cse6 80)) (.cse3 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 80))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int)) (let ((.cse2 (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) (not (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| 80)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| (+ (select .cse3 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) 1)) (= (select .cse4 .cse5) 0) (= (select .cse6 84) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_~#queue~0.offset| 0) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 80))) (<= (select .cse3 .cse7) 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| (select .cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (= 20 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 80))) (= .cse8 0) (= .cse7 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select .cse4 .cse7) 1) (not (= .cse8 20)) (= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 0) (<= |c_~#stored_elements~0.base| 6) (= (select .cse3 .cse5) 0)))) is different from false [2022-10-04 00:37:46,348 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int)) (let ((.cse2 (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) (= (select .cse3 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse3 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:37:46,357 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int)) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int)) (let ((.cse0 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)))) (<= (select .cse3 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse3 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-10-04 00:37:46,363 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#stored_elements~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int)) (let ((.cse2 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_895))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-10-04 00:37:46,368 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_899 Int) (v_ArrVal_897 Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:37:46,374 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_899 Int) (v_ArrVal_897 Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) (= |c_t1Thread1of1ForFork1_empty_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (= |c_t1Thread1of1ForFork1_empty_#in~q#1.base| |c_~#queue~0.base|))) is different from false [2022-10-04 00:37:46,379 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_t1Thread1of1ForFork1_empty_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_empty_~q#1.base| |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_899 Int) (v_ArrVal_897 Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:37:46,388 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) (= (select .cse2 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse2 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:37:46,561 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (or (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (select .cse2 .cse1) 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:37:46,569 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (let ((.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* (select .cse1 .cse0) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse2 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse2 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:37:46,578 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:37:46,586 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= |c_t1Thread1of1ForFork1_read~int_#value#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:37:46,593 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) is different from false [2022-10-04 00:37:46,601 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (= 20 (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-10-04 00:37:47,000 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 .cse1) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse2 .cse3) 1) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4))) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 .cse3) 1) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_899 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (= (select .cse2 .cse1) 0))) is different from false [2022-10-04 00:37:47,005 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_899 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:37:47,010 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:37:47,017 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (= (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-10-04 00:37:47,269 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 .cse1) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse2 .cse3) 1) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (<= (select .cse0 .cse3) 1) (<= |c_~#stored_elements~0.base| 6) (= (select .cse2 .cse1) 0))) is different from false [2022-10-04 00:37:47,274 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:37:47,287 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-10-04 00:37:47,505 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse0 (+ |c_~#queue~0.offset| 80))) (and (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 0) (<= (select .cse1 .cse2) 1) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= .cse2 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6) (= (select .cse1 .cse0) 0))) is different from false [2022-10-04 00:37:47,509 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:37:47,521 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (not (= (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 0)) is different from false [2022-10-04 00:37:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:37:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-10-04 00:37:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:37:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:37:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:37:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:37:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-10-04 00:37:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-10-04 00:37:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-10-04 00:37:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-10-04 00:37:54,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-04 00:37:54,559 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 [2022-10-04 00:37:54,559 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:37:54,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:37:54,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1918603460, now seen corresponding path program 1 times [2022-10-04 00:37:54,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:37:54,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839683814] [2022-10-04 00:37:54,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:37:54,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:37:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:37:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-04 00:37:59,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:37:59,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839683814] [2022-10-04 00:37:59,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839683814] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:37:59,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69198996] [2022-10-04 00:37:59,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:37:59,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:37:59,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:37:59,300 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) [2022-10-04 00:37:59,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-04 00:37:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:37:59,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 1277 conjuncts, 215 conjunts are in the unsatisfiable core [2022-10-04 00:37:59,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:38:00,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-04 00:38:00,346 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:38:00,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-10-04 00:38:00,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-04 00:38:01,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:38:01,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 00:38:02,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:38:02,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-04 00:38:03,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:38:03,538 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:38:03,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-10-04 00:38:04,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:38:04,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 00:38:05,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:38:05,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-04 00:38:05,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-04 00:38:05,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:38:05,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-04 00:38:07,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:38:07,639 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:38:07,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-10-04 00:38:08,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:38:08,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 27 [2022-10-04 00:38:09,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:38:09,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-10-04 00:38:09,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-04 00:38:10,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:38:10,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 29 [2022-10-04 00:38:10,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:38:10,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 29 [2022-10-04 00:38:12,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:38:12,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 27 [2022-10-04 00:38:13,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:38:13,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 27 [2022-10-04 00:38:14,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 14 [2022-10-04 00:38:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-04 00:38:15,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:38:17,270 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (forall ((v_ArrVal_1038 Int)) (<= 0 (+ (* 4 (select (select (store |c_t2Thread1of1ForFork0_write~int_old_#memory_int#1| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (store (select |c_t2Thread1of1ForFork0_write~int_old_#memory_int#1| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038)) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|))) (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 80))))) (forall ((|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (forall ((v_ArrVal_1038 Int)) (< (+ (* 4 (select (select (store |c_t2Thread1of1ForFork0_write~int_old_#memory_int#1| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (store (select |c_t2Thread1of1ForFork0_write~int_old_#memory_int#1| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038)) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 80)))))) is different from false [2022-10-04 00:39:01,378 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (forall ((v_ArrVal_1038 Int)) (< (+ (* (select (select (let ((.cse0 (store |c_t2Thread1of1ForFork0_write~int_old_#memory_int#1| |c_t2Thread1of1ForFork0_write~int_#ptr#1.base| (store (select |c_t2Thread1of1ForFork0_write~int_old_#memory_int#1| |c_t2Thread1of1ForFork0_write~int_#ptr#1.base|) |c_t2Thread1of1ForFork0_write~int_#ptr#1.offset| v_ArrVal_1036)))) (store .cse0 |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (store (select .cse0 |c_t2Thread1of1ForFork0_dequeue_~q#1.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 80))))) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (forall ((v_ArrVal_1038 Int)) (<= 0 (+ (* (select (select (let ((.cse1 (store |c_t2Thread1of1ForFork0_write~int_old_#memory_int#1| |c_t2Thread1of1ForFork0_write~int_#ptr#1.base| (store (select |c_t2Thread1of1ForFork0_write~int_old_#memory_int#1| |c_t2Thread1of1ForFork0_write~int_#ptr#1.base|) |c_t2Thread1of1ForFork0_write~int_#ptr#1.offset| v_ArrVal_1036)))) (store .cse1 |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (store (select .cse1 |c_t2Thread1of1ForFork0_dequeue_~q#1.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038))) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|))) (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 80)))))) is different from false [2022-10-04 00:39:36,234 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (forall ((v_ArrVal_1038 Int)) (< (+ (* (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038)) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 80))))) (not (<= (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 88) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)))) (forall ((|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 88) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (forall ((v_ArrVal_1038 Int)) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038)) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|))) (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 80)))))))) is different from false [2022-10-04 00:39:52,879 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (< (+ 3 (* (select (store (store (select |c_#memory_int| |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (<= 0 (+ (* (select (store (store (select |c_#memory_int| |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|)))))))) is different from false [2022-10-04 00:39:53,933 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1035 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (< (+ 3 |c_~#queue~0.offset| (* (select (store (store (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4)) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((v_ArrVal_1035 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store (store (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4))))))))) is different from false [2022-10-04 00:39:54,030 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1035 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store (store (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4)))))))) (forall ((v_ArrVal_1035 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (< (+ 3 |c_~#queue~0.offset| (* (select (store (store (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4)) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2022-10-04 00:39:54,079 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1035 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4)))))))) (forall ((v_ArrVal_1035 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (< (+ 3 |c_~#queue~0.offset| (* (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4)) (select |c_#length| |c_~#queue~0.base|))))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|))))) is different from false [2022-10-04 00:39:54,425 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (<= 0 (+ (* (select (store (store (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1034) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (< (+ (* (select (store (store (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1034) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2022-10-04 00:39:54,531 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| Int)) (or (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (< (+ (* 4 (select (store (store (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| v_ArrVal_1034) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|))) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| |c_~#stored_elements~0.base|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| Int)) (or (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (<= 0 (+ (* 4 (select (store (store (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| v_ArrVal_1034) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|))))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:39:54,612 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| Int)) (or (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (< (+ (* (select (store (store (select (store (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| v_ArrVal_1034) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| |c_~#stored_elements~0.base|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| Int)) (or (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (<= 0 (+ (* (select (store (store (select (store (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| v_ArrVal_1034) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|))))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:39:54,964 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:39:54,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 34 [2022-10-04 00:39:54,974 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:39:54,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 218 treesize of output 220 [2022-10-04 00:39:54,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:39:54,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:39:54,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2022-10-04 00:39:54,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:39:54,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:39:54,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 162 treesize of output 146 [2022-10-04 00:39:55,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-04 00:39:55,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:39:55,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:39:55,017 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:39:55,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 144 [2022-10-04 00:39:55,096 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:39:55,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-10-04 00:39:55,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:39:55,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:39:55,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-10-04 00:39:55,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:39:55,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:39:55,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2022-10-04 00:39:57,317 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| Int)) (or (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80|)) (forall ((v_ArrVal_1030 Int)) (<= 0 (+ (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| v_ArrVal_1030) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset| 4))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| Int)) (or (forall ((v_ArrVal_1030 Int)) (< (+ (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| v_ArrVal_1030) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 7 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80|))))) is different from false [2022-10-04 00:39:58,198 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| Int)) (or (forall ((v_ArrVal_1030 Int)) (< (+ 7 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| v_ArrVal_1030) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80|)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| Int)) (or (forall ((v_ArrVal_1030 Int)) (<= 0 (+ (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| v_ArrVal_1030) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset| 4))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80|))))) is different from false [2022-10-04 00:41:05,079 WARN L233 SmtUtils]: Spent 13.60s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:41:20,737 WARN L233 SmtUtils]: Spent 14.27s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:41:38,800 WARN L233 SmtUtils]: Spent 17.82s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:41:58,355 WARN L233 SmtUtils]: Spent 19.32s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:42:18,150 WARN L233 SmtUtils]: Spent 19.39s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:42:35,712 WARN L233 SmtUtils]: Spent 17.28s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:42:45,880 WARN L233 SmtUtils]: Spent 9.86s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:42:47,272 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (forall ((v_ArrVal_1027 (Array Int Int))) (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1027) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) 0)))) (and (forall ((v_ArrVal_1030 Int) (v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1027) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|) (<= 0 (+ (* (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| v_ArrVal_1030) .cse1) 4) |c_~#queue~0.offset| 4))))) (forall ((v_ArrVal_1030 Int) (v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| Int)) (let ((.cse2 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1027) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|)) (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|) (< (+ 7 (* (select (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| v_ArrVal_1030) .cse3) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) .cse4) (or (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) .cse4))) is different from false [2022-10-04 00:42:47,402 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| Int)) (or (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| v_ArrVal_1027) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) 0) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| |c_~#stored_elements~0.base|)))))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1030 Int) (v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| v_ArrVal_1027) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|) (< (+ (* (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| v_ArrVal_1030) .cse1) 4) 7 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))))) (or .cse2 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1030 Int) (v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| Int)) (let ((.cse3 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| v_ArrVal_1027) |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (or (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|)) (<= 0 (+ (* (select (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| v_ArrVal_1030) .cse4) 4) |c_~#queue~0.offset| 4)) (< (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|)))))) (or .cse2 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))))) is different from false [2022-10-04 00:42:47,493 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| Int)) (or (< (+ (* 4 (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| v_ArrVal_1027) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) 0) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| |c_~#stored_elements~0.base|)))))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| Int)) (or (forall ((v_ArrVal_1030 Int) (v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| v_ArrVal_1027) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|)) (< (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|) (< (+ 7 (* (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| v_ArrVal_1030) .cse1) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| |c_~#stored_elements~0.base|)))) (or (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) .cse2) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) .cse2) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1030 Int) (v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| Int)) (let ((.cse3 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| v_ArrVal_1027) |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (or (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|)) (< (+ (* 4 (select .cse3 .cse4)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|) (<= 0 (+ (* (select (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| v_ArrVal_1030) .cse4) 4) |c_~#queue~0.offset| 4))))))))) is different from false [2022-10-04 00:42:47,963 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:42:47,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 191 treesize of output 152 [2022-10-04 00:42:47,975 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:42:47,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 264 treesize of output 258 [2022-10-04 00:42:47,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 264 treesize of output 256 [2022-10-04 00:42:47,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 256 treesize of output 252 [2022-10-04 00:42:47,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 271 treesize of output 263 [2022-10-04 00:42:47,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 263 treesize of output 259 [2022-10-04 00:42:48,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-04 00:42:48,208 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:42:48,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 177 [2022-10-04 00:43:03,492 WARN L233 SmtUtils]: Spent 6.47s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:43:26,154 WARN L233 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:43:40,205 WARN L233 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:43:55,232 WARN L233 SmtUtils]: Spent 12.31s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:44:07,681 WARN L233 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:44:19,237 WARN L233 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:44:32,564 WARN L233 SmtUtils]: Spent 11.73s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:44:46,202 WARN L233 SmtUtils]: Spent 10.21s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:44:58,334 INFO L356 Elim1Store]: treesize reduction 45, result has 63.7 percent of original size [2022-10-04 00:44:58,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 357 treesize of output 340 [2022-10-04 00:44:58,397 INFO L356 Elim1Store]: treesize reduction 95, result has 20.2 percent of original size [2022-10-04 00:44:58,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 294 treesize of output 307 [2022-10-04 00:44:58,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 242 treesize of output 234 [2022-10-04 00:44:58,457 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:44:58,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 11758 treesize of output 11728 [2022-10-04 00:44:58,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12524 treesize of output 11500 [2022-10-04 00:44:58,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11540 treesize of output 11528 [2022-10-04 00:44:59,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 Received shutdown request... [2022-10-04 00:48:52,617 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-10-04 00:48:52,619 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:48:52,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-10-04 00:48:52,654 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 00:48:52,654 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 00:48:52,654 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 00:48:52,655 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 [2022-10-04 00:48:52,655 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 00:48:52,655 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 [2022-10-04 00:48:52,835 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 [2022-10-04 00:48:52,835 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 600 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 7ms.. [2022-10-04 00:48:52,837 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-04 00:48:52,837 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was TIMEOUT (4/4) [2022-10-04 00:48:52,843 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-04 00:48:52,843 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-04 00:48:52,846 INFO L202 PluginConnector]: Adding new model queue.line487.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:48:52 BasicIcfg [2022-10-04 00:48:52,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-04 00:48:52,847 INFO L158 Benchmark]: Toolchain (without parser) took 806112.84ms. Allocated memory was 196.1MB in the beginning and 966.8MB in the end (delta: 770.7MB). Free memory was 145.2MB in the beginning and 470.7MB in the end (delta: -325.5MB). Peak memory consumption was 726.4MB. Max. memory is 8.0GB. [2022-10-04 00:48:52,847 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 196.1MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-04 00:48:52,847 INFO L158 Benchmark]: Boogie Preprocessor took 93.64ms. Allocated memory is still 196.1MB. Free memory was 145.2MB in the beginning and 141.5MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-04 00:48:52,847 INFO L158 Benchmark]: RCFGBuilder took 986.72ms. Allocated memory is still 196.1MB. Free memory was 141.5MB in the beginning and 131.1MB in the end (delta: 10.4MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-10-04 00:48:52,848 INFO L158 Benchmark]: TraceAbstraction took 805027.68ms. Allocated memory was 196.1MB in the beginning and 966.8MB in the end (delta: 770.7MB). Free memory was 130.4MB in the beginning and 470.7MB in the end (delta: -340.3MB). Peak memory consumption was 710.9MB. Max. memory is 8.0GB. [2022-10-04 00:48:52,848 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17ms. Allocated memory is still 196.1MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 93.64ms. Allocated memory is still 196.1MB. Free memory was 145.2MB in the beginning and 141.5MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 986.72ms. Allocated memory is still 196.1MB. Free memory was 141.5MB in the beginning and 131.1MB in the end (delta: 10.4MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * TraceAbstraction took 805027.68ms. Allocated memory was 196.1MB in the beginning and 966.8MB in the end (delta: 770.7MB). Free memory was 130.4MB in the beginning and 470.7MB in the end (delta: -340.3MB). Peak memory consumption was 710.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3821, positive: 3660, positive conditional: 3660, positive unconditional: 0, negative: 161, negative conditional: 161, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3821, positive: 3660, positive conditional: 3660, positive unconditional: 0, negative: 161, negative conditional: 161, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3690, positive: 3660, positive conditional: 0, positive unconditional: 3660, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3614, positive: 3584, positive conditional: 0, positive unconditional: 3584, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3690, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3614, unknown conditional: 0, unknown unconditional: 3614] , Statistics on independence cache: Total cache size (in pairs): 3614, Positive cache size: 3584, Positive conditional cache size: 0, Positive unconditional cache size: 3584, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Independence queries for same thread: 131, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 1, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 171, positive: 164, positive conditional: 164, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 7, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 24174, positive: 23617, positive conditional: 23617, positive unconditional: 0, negative: 557, negative conditional: 557, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 2822, Positive cache size: 2819, Positive conditional cache size: 0, Positive unconditional cache size: 2819, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 540, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 32828, positive: 31977, positive conditional: 31977, positive unconditional: 0, negative: 851, negative conditional: 851, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 7064, Positive cache size: 7043, Positive conditional cache size: 0, Positive unconditional cache size: 7043, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Independence queries for same thread: 1351, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 8473, positive: 7834, positive conditional: 7834, positive unconditional: 0, negative: 639, negative conditional: 639, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 9126, Positive cache size: 9102, Positive conditional cache size: 0, Positive unconditional cache size: 9102, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Independence queries for same thread: 1985, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7861, positive: 7235, positive conditional: 7235, positive unconditional: 0, negative: 626, negative conditional: 626, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 9498, Positive cache size: 9470, Positive conditional cache size: 0, Positive unconditional cache size: 9470, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Independence queries for same thread: 2598, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 8074, positive: 7450, positive conditional: 7450, positive unconditional: 0, negative: 624, negative conditional: 624, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 10414, Positive cache size: 10381, Positive conditional cache size: 0, Positive unconditional cache size: 10381, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Independence queries for same thread: 3208, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5721, positive: 5258, positive conditional: 5258, positive unconditional: 0, negative: 463, negative conditional: 463, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 10789, Positive cache size: 10754, Positive conditional cache size: 0, Positive unconditional cache size: 10754, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Independence queries for same thread: 3666, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3153, positive: 2884, positive conditional: 2884, positive unconditional: 0, negative: 269, negative conditional: 269, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 10876, Positive cache size: 10841, Positive conditional cache size: 0, Positive unconditional cache size: 10841, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Independence queries for same thread: 3935, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5732, positive: 5269, positive conditional: 5269, positive unconditional: 0, negative: 463, negative conditional: 463, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 11092, Positive cache size: 11057, Positive conditional cache size: 0, Positive unconditional cache size: 11057, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Independence queries for same thread: 4393, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5743, positive: 5280, positive conditional: 5280, positive unconditional: 0, negative: 463, negative conditional: 463, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 11112, Positive cache size: 11077, Positive conditional cache size: 0, Positive unconditional cache size: 11077, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Independence queries for same thread: 4851, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5786, positive: 5319, positive conditional: 5319, positive unconditional: 0, negative: 467, negative conditional: 467, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 11446, Positive cache size: 11411, Positive conditional cache size: 0, Positive unconditional cache size: 11411, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Independence queries for same thread: 5313, Statistics for Abstraction: - TimeoutResultAtElement [Line: 487]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 600 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 7ms.. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 1034 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 1034 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 5 procedures, 1034 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONASSERT with 2 thread instances CFG has 5 procedures, 1034 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 803.8s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 70.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 418, 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.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 71.7s InterpolantComputationTime, 8539 NumberOfCodeBlocks, 8539 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 9113 ConstructedInterpolants, 435 QuantifiedInterpolants, 115452 SizeOfPredicates, 303 NumberOfNonLiveVariables, 3711 ConjunctsInSsa, 490 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 6723/6947 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