/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_ok_longest.line352.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 00:57:57,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 00:57:57,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 00:57:57,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 00:57:57,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 00:57:57,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 00:57:57,060 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 00:57:57,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 00:57:57,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 00:57:57,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 00:57:57,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 00:57:57,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 00:57:57,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 00:57:57,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 00:57:57,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 00:57:57,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 00:57:57,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 00:57:57,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 00:57:57,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 00:57:57,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 00:57:57,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 00:57:57,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 00:57:57,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 00:57:57,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 00:57:57,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 00:57:57,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 00:57:57,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 00:57:57,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 00:57:57,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 00:57:57,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 00:57:57,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 00:57:57,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 00:57:57,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 00:57:57,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 00:57:57,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 00:57:57,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 00:57:57,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 00:57:57,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 00:57:57,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 00:57:57,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 00:57:57,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 00:57:57,089 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:57:57,114 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 00:57:57,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 00:57:57,115 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 00:57:57,115 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 00:57:57,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 00:57:57,116 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 00:57:57,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 00:57:57,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 00:57:57,117 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 00:57:57,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 00:57:57,118 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 00:57:57,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 00:57:57,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 00:57:57,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 00:57:57,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 00:57:57,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 00:57:57,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 00:57:57,119 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 00:57:57,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 00:57:57,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 00:57:57,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 00:57:57,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 00:57:57,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 00:57:57,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 00:57:57,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 00:57:57,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:57:57,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 00:57:57,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 00:57:57,122 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 00:57:57,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 00:57:57,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 00:57:57,122 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 00:57:57,122 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 00:57:57,122 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 00:57:57,123 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 00:57:57,123 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 00:57:57,123 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 00:57:57,123 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 00:57:57,123 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:57:57,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 00:57:57,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 00:57:57,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 00:57:57,433 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 00:57:57,435 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 00:57:57,437 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_ok_longest.line352.bpl [2022-10-04 00:57:57,437 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longest.line352.bpl' [2022-10-04 00:57:57,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 00:57:57,501 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 00:57:57,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 00:57:57,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 00:57:57,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 00:57:57,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_ok_longest.line352.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:57" (1/1) ... [2022-10-04 00:57:57,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_ok_longest.line352.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:57" (1/1) ... [2022-10-04 00:57:57,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_ok_longest.line352.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:57" (1/1) ... [2022-10-04 00:57:57,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_ok_longest.line352.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:57" (1/1) ... [2022-10-04 00:57:57,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_ok_longest.line352.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:57" (1/1) ... [2022-10-04 00:57:57,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_ok_longest.line352.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:57" (1/1) ... [2022-10-04 00:57:57,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_ok_longest.line352.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:57" (1/1) ... [2022-10-04 00:57:57,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 00:57:57,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 00:57:57,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 00:57:57,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 00:57:57,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_ok_longest.line352.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:57" (1/1) ... [2022-10-04 00:57:57,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:57:57,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:57:57,652 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:57:57,655 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:57:57,690 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-10-04 00:57:57,690 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-10-04 00:57:57,690 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-10-04 00:57:57,691 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-10-04 00:57:57,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 00:57:57,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 00:57:57,693 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:57:57,820 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 00:57:57,821 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 00:57:58,418 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 00:57:58,438 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 00:57:58,439 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-04 00:57:58,442 INFO L202 PluginConnector]: Adding new model queue_ok_longest.line352.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:57:58 BoogieIcfgContainer [2022-10-04 00:57:58,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 00:57:58,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 00:57:58,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 00:57:58,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 00:57:58,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longest.line352.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:57" (1/2) ... [2022-10-04 00:57:58,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b222006 and model type queue_ok_longest.line352.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:57:58, skipping insertion in model container [2022-10-04 00:57:58,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longest.line352.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:57:58" (2/2) ... [2022-10-04 00:57:58,461 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.line352.bpl [2022-10-04 00:57:58,469 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 00:57:58,477 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 00:57:58,478 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 00:57:58,478 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 00:57:58,642 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 00:57:58,688 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:57:58,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:57:58,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:57:58,696 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:57:58,699 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:57:58,728 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:57:58,734 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:57:58,741 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;@61b0e18d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:57:58,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:57:58,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:57:58,816 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:57:58,818 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 00:57:58,827 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:57:58,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:57:58,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:57:58,830 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:57:58,831 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:57:58,867 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:57:58,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:57:58,869 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;@61b0e18d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:57:58,869 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:57:59,196 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:57:59,200 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:57:59,204 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 00:57:59,216 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:57:59,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:57:59,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:57:59,223 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:57:59,231 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:57:59,231 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:57:59,232 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;@61b0e18d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:57:59,232 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:57:59,232 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 00:57:59,233 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:57:59,233 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:57:59,233 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 00:57:59,238 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:57:59,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:57:59,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:57:59,241 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:57:59,247 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:57:59,256 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:57:59,259 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:57:59,260 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:57:59,261 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;@61b0e18d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:57:59,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:58:00,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:58:00,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:58:00,865 INFO L85 PathProgramCache]: Analyzing trace with hash 332393026, now seen corresponding path program 1 times [2022-10-04 00:58:00,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:58:00,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842463566] [2022-10-04 00:58:00,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:58:00,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:58:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:58:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2022-10-04 00:58:01,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:58:01,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842463566] [2022-10-04 00:58:01,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842463566] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:58:01,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:58:01,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-04 00:58:01,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850441907] [2022-10-04 00:58:01,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:58:01,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-04 00:58:01,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:58:01,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-04 00:58:01,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-04 00:58:01,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:01,538 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:58:01,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 196.0) internal successors, (392), 2 states have internal predecessors, (392), 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:58:01,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:02,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:02,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 00:58:02,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:58:02,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:58:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash -939996530, now seen corresponding path program 1 times [2022-10-04 00:58:02,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:58:02,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648721085] [2022-10-04 00:58:02,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:58:02,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:58:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:58:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2022-10-04 00:58:03,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:58:03,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648721085] [2022-10-04 00:58:03,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648721085] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:58:03,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:58:03,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 00:58:03,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724846172] [2022-10-04 00:58:03,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:58:03,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 00:58:03,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:58:03,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 00:58:03,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-04 00:58:03,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:03,053 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:58:03,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.33333333333333) internal successors, (470), 6 states have internal predecessors, (470), 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:58:03,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:03,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:58:03,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 00:58:03,206 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:58:03,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:58:03,207 INFO L85 PathProgramCache]: Analyzing trace with hash 352971026, now seen corresponding path program 1 times [2022-10-04 00:58:03,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:58:03,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658113029] [2022-10-04 00:58:03,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:58:03,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:58:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:58:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-10-04 00:58:03,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:58:03,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658113029] [2022-10-04 00:58:03,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658113029] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:58:03,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778080190] [2022-10-04 00:58:03,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:58:03,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:58:03,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:58:03,796 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:58:03,798 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:58:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:58:04,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 69 conjunts are in the unsatisfiable core [2022-10-04 00:58:04,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:58:05,341 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 7 treesize of output 3 [2022-10-04 00:58:05,493 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:58:05,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:58:05,735 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:58:06,113 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:58:06,114 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:58:06,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:58:06,281 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:58:06,359 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:58:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 270 proven. 55 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-10-04 00:58:06,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:58:20,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_222 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| Int)) (or (< (+ (* (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_42|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| v_ArrVal_222) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)))) is different from false [2022-10-04 00:58:33,229 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_222 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_219) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| v_ArrVal_222) .cse1) 800)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42|)))) is different from false [2022-10-04 00:58:33,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_53| Int)) (or (forall ((v_ArrVal_222 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_53| v_ArrVal_219) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| v_ArrVal_222) .cse1)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_53| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:58:33,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_53| Int) (v_ArrVal_222 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_53| v_ArrVal_219) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| v_ArrVal_222) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_53| |c_~#stored_elements~0.base|)) (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42|)))) is different from false [2022-10-04 00:58:33,460 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:58:33,460 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 49 treesize of output 41 [2022-10-04 00:58:33,471 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:58:33,471 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 76 treesize of output 78 [2022-10-04 00:58:33,480 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 63 treesize of output 55 [2022-10-04 00:58:33,499 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:58:33,569 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:58:33,569 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 54 treesize of output 54 [2022-10-04 00:58:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 273 proven. 48 refuted. 0 times theorem prover too weak. 80 trivial. 4 not checked. [2022-10-04 00:58:34,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778080190] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:58:34,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:58:34,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 23, 25] total 55 [2022-10-04 00:58:34,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096566298] [2022-10-04 00:58:34,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:58:34,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-10-04 00:58:34,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:58:34,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-10-04 00:58:34,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2307, Unknown=65, NotChecked=404, Total=2970 [2022-10-04 00:58:34,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:34,377 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:58:34,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 18.145454545454545) internal successors, (998), 55 states have internal predecessors, (998), 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:58:34,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:34,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:58:34,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:35,533 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |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|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (<= 3212 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 1) (<= 3212 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (<= (+ |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1| 4 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|)) (<= 3204 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_53| Int) (v_ArrVal_222 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| Int)) (let ((.cse1 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_53| v_ArrVal_219) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| v_ArrVal_222) .cse2))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_53| |c_~#stored_elements~0.base|)) (< (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42|)))) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:58:35,538 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_53| Int) (v_ArrVal_222 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_53| v_ArrVal_219) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| v_ArrVal_222) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_53| |c_~#stored_elements~0.base|)) (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:58:35,542 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_53| Int)) (or (forall ((v_ArrVal_222 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_53| v_ArrVal_219) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| v_ArrVal_222) .cse1)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_53| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:58:35,927 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= |c_~#queue~0.offset| 0) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (forall ((v_ArrVal_222 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_219) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| v_ArrVal_222) .cse1) 800)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42|))))) is different from false [2022-10-04 00:58:36,405 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (forall ((v_ArrVal_222 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| Int)) (or (< (+ (* (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_42|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| v_ArrVal_222) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)))) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) 1) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (= .cse0 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= 3212 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (<= 3212 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (<= (+ |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1| 4 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|)) (<= 3204 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:58:36,731 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((v_ArrVal_222 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| Int)) (or (< (+ (* (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_42|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_42| v_ArrVal_222) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)))) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (= .cse0 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= 3212 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:58:40,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:40,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:58:40,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-10-04 00:58:40,122 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:58:40,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:58:40,302 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:58:40,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:58:40,302 INFO L85 PathProgramCache]: Analyzing trace with hash 610526483, now seen corresponding path program 1 times [2022-10-04 00:58:40,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:58:40,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646289177] [2022-10-04 00:58:40,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:58:40,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:58:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:58:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-04 00:58:40,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:58:40,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646289177] [2022-10-04 00:58:40,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646289177] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:58:40,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16728936] [2022-10-04 00:58:40,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:58:40,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:58:40,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:58:40,635 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:58:40,636 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:58:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:58:40,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 102 conjunts are in the unsatisfiable core [2022-10-04 00:58:40,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:58:40,915 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:58:40,966 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:58:41,062 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:58:41,063 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:58:41,106 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:58:41,501 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:58:41,701 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:58:41,702 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 1 case distinctions, treesize of input 13 treesize of output 13 [2022-10-04 00:58:41,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:58:41,765 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:58:42,320 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:58:42,722 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:58:42,723 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:58:42,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:58:42,892 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:58:42,966 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:58:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:58:43,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-04 00:58:43,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16728936] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:58:43,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-04 00:58:43,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [11] total 46 [2022-10-04 00:58:43,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15544811] [2022-10-04 00:58:43,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:58:43,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-10-04 00:58:43,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:58:43,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-10-04 00:58:43,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1927, Unknown=0, NotChecked=0, Total=2070 [2022-10-04 00:58:43,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:43,024 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:58:43,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 9.527777777777779) internal successors, (343), 36 states have internal predecessors, (343), 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:58:43,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:43,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:58:43,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-10-04 00:58:43,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:48,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:48,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:58:48,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-10-04 00:58:48,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-10-04 00:58:48,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-04 00:58:48,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:58:48,443 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:58:48,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:58:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2005206770, now seen corresponding path program 1 times [2022-10-04 00:58:48,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:58:48,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933869135] [2022-10-04 00:58:48,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:58:48,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:58:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:58:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-10-04 00:58:48,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:58:48,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933869135] [2022-10-04 00:58:48,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933869135] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:58:48,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230337092] [2022-10-04 00:58:48,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:58:48,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:58:48,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:58:48,796 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:58:48,824 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:58:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:58:49,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 162 conjunts are in the unsatisfiable core [2022-10-04 00:58:49,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:58:49,161 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:58:49,213 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:58:49,349 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:58:49,350 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:58:49,411 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:58:49,873 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:58:50,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:58:50,087 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:58:50,757 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:58:50,757 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:58:50,779 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:58:52,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:58:52,364 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:58:52,365 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:58:52,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:58:52,906 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 42 treesize of output 41 [2022-10-04 00:58:53,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:58:53,434 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 40 treesize of output 28 [2022-10-04 00:58:53,985 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:58:54,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:58:54,531 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 37 treesize of output 39 [2022-10-04 00:58:55,584 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:58:55,585 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 55 treesize of output 54 [2022-10-04 00:58:55,775 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:58:55,776 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 38 treesize of output 36 [2022-10-04 00:58:56,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:58:56,015 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:58:56,110 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:58:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 130 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:58:56,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:59:08,867 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:59:08,867 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 49 treesize of output 41 [2022-10-04 00:59:08,876 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:59:08,876 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 76 treesize of output 78 [2022-10-04 00:59:08,882 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 63 treesize of output 55 [2022-10-04 00:59:08,891 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:59:08,939 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:59:08,940 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 54 treesize of output 54 [2022-10-04 00:59:44,446 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:00:14,451 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-10-04 01:00:14,453 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 2 case distinctions, treesize of input 37 treesize of output 40 [2022-10-04 01:00:14,464 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:00:14,464 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 47 treesize of output 50 [2022-10-04 01:00:14,468 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 22 treesize of output 18 [2022-10-04 01:00:14,535 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-10-04 01:00:14,535 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 2 case distinctions, treesize of input 38 treesize of output 31 [2022-10-04 01:00:14,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:00:14,543 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 20 treesize of output 10 [2022-10-04 01:00:15,479 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 52 treesize of output 50 [2022-10-04 01:00:15,755 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:00:15,756 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 58 [2022-10-04 01:00:16,017 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 130 proven. 49 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:16,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230337092] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 01:00:16,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 01:00:16,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 54, 53] total 115 [2022-10-04 01:00:16,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302954118] [2022-10-04 01:00:16,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 01:00:16,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2022-10-04 01:00:16,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:00:16,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2022-10-04 01:00:16,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=679, Invalid=12305, Unknown=126, NotChecked=0, Total=13110 [2022-10-04 01:00:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:16,024 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:00:16,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 115 states have (on average 8.869565217391305) internal successors, (1020), 115 states have internal predecessors, (1020), 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 01:00:16,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:16,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:00:16,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-10-04 01:00:16,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-10-04 01:00:16,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:21,722 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse1 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (.cse3 (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|))))) (.cse2 (and (<= .cse6 4) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)))) (.cse0 (+ |c_ULTIMATE.start_init_~q#1.offset| 3204)) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse7)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) .cse0) 0) (or (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) .cse1) (forall ((v_ArrVal_374 Int) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int)) (or (< (select (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_374) |c_~#queue~0.base|) (+ 3212 |c_~#queue~0.offset|)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)))))) (or .cse2 (and .cse3 (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse4) 0))) (not (= .cse5 800)) (not (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse5) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= 6 |c_~#stored_elements~0.base|) (or (< .cse6 (+ 3212 |c_~#queue~0.offset|)) (and .cse1 (forall ((v_ArrVal_377 Int) (v_ArrVal_379 (Array Int Int))) (not (= (select (select (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_377)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_379) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799))) (forall ((v_ArrVal_377 Int) (v_ArrVal_379 (Array Int Int))) (< (* (select (select (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_377)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_379) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) 3200)))) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_389 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| Int)) (or (not (= 800 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| v_ArrVal_389) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52|)))) (<= 7 |c_~#queue~0.base|) (or (and .cse3 (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse4) 0)) .cse2) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= 0 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|) .cse0)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= 3212 .cse6) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse7)) (= .cse7 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse5) (<= 3212 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (<= 3212 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (not (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (<= (+ |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1| 4 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|)) (<= (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|)) (<= 3204 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (not (= |c_t1Thread1of1ForFork1_read~int_#value#1| 800)) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse4) 0) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4)))) is different from false [2022-10-04 01:00:22,547 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_~#queue~0.base|))) (and (or (and (<= .cse0 4) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (and (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|)))) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 0))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= 6 |c_~#stored_elements~0.base|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_389 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| Int)) (or (not (= 800 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| v_ArrVal_389) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52|)))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= 3212 .cse0) (<= 3212 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-10-04 01:00:25,064 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 6 |c_~#stored_elements~0.base|) (or (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_57| Int) (v_ArrVal_382 Int)) (or (< (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 3200) (< (+ (* (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_57|))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (v_ArrVal_382 Int)) (or (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (< (+ (* (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_57|))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (< .cse0 (+ 3212 |c_~#queue~0.offset|))) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (<= 3212 .cse0) (= .cse1 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= 3212 .cse2) (or (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (<= .cse2 4)) (and (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|)))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) 1))) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 01:00:25,697 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (and (or (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_57| Int) (v_ArrVal_382 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (v_ArrVal_382 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|) (< (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 3200)))) (< .cse0 (+ 3212 |c_~#queue~0.offset|))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 6 |c_~#stored_elements~0.base|) (= |c_~#queue~0.offset| 0) (<= 3212 .cse0) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse1) (<= 3212 .cse2) (or (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (<= .cse2 4)) (and (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 1))) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 01:00:26,356 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (.cse1 (select |c_#length| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse0) (= 6 |c_~#stored_elements~0.base|) (= |c_~#queue~0.offset| 0) (<= 3212 .cse1) (<= 3212 .cse2) (or (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (<= .cse2 4)) (and (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|)))) (= .cse0 1))) (or (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int)) (or (forall ((v_ArrVal_382 Int)) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int)) (or (forall ((v_ArrVal_382 Int)) (< (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 3200)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))))) (< .cse1 (+ 3212 |c_~#queue~0.offset|))) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 01:00:26,992 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (.cse1 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 6 |c_~#stored_elements~0.base|) (or (and (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|)))) (= .cse0 1)) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (<= .cse1 4))) (= |c_~#queue~0.offset| 0) (<= 3212 .cse2) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse0) (<= 3212 .cse1) (or (< .cse2 (+ 3212 |c_~#queue~0.offset|)) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int)) (or (forall ((v_ArrVal_382 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_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 3200)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int)) (or (forall ((v_ArrVal_382 Int)) (not (= (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))))) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 01:00:28,250 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse5)) (.cse0 (< .cse6 (+ 3212 |c_~#queue~0.offset|))) (.cse1 (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 6 |c_~#stored_elements~0.base|) (or .cse0 (and .cse1 (not (= .cse2 799)) .cse3 .cse4 (< (* .cse2 4) 3200))) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse5) 1) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= 3212 .cse6) (<= 3212 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= .cse2 1) (or .cse0 (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_56| Int)) (or (forall ((v_ArrVal_382 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_56| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 3200)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_56|)))) .cse1 .cse3 .cse4 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_56| Int)) (or (forall ((v_ArrVal_382 Int)) (not (= (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_56| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_56|)))))) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-10-04 01:00:28,832 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 6 |c_~#stored_elements~0.base|) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 1) (= |c_~#queue~0.offset| 0) (<= 3212 .cse0) (<= 3212 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (or (< .cse0 (+ 3212 |c_~#queue~0.offset|)) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_56| Int)) (or (forall ((v_ArrVal_382 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_56| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 3200)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_56|)))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_56| Int)) (or (forall ((v_ArrVal_382 Int)) (not (= (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_56| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_56|)))))) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 01:00:29,725 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse5)) (.cse0 (< .cse6 (+ 3212 |c_~#queue~0.offset|))) (.cse1 (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 6 |c_~#stored_elements~0.base|) (or .cse0 (and .cse1 (not (= .cse2 799)) .cse3 .cse4 (< (* .cse2 4) 3200))) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse5) 1) (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 3212 .cse6) (<= 3212 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= .cse2 1) (or .cse0 (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_56| Int)) (or (forall ((v_ArrVal_382 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_56| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 3200)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_56|)))) .cse1 .cse3 .cse4 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_56| Int)) (or (forall ((v_ArrVal_382 Int)) (not (= (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_56| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_56|)))))) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-10-04 01:00:30,679 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse1 (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (.cse4 (< .cse6 (+ 3212 |c_~#queue~0.offset|))) (.cse0 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (= 3204 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (or (< .cse0 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (or (< (+ (* (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_53|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 6 |c_~#stored_elements~0.base|) (<= 7 |c_~#queue~0.base|) (or (and .cse1 .cse2 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (v_ArrVal_382 Int)) (or (< (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 3200) (< (+ (* (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_57|))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (v_ArrVal_382 Int)) (or (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (< (+ (* (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_57|))) .cse3) .cse4) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (or (let ((.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (and (not (= .cse5 799)) .cse1 .cse2 .cse3 (< (* .cse5 4) 3200))) .cse4) (<= 3212 .cse6) (<= 3212 .cse0) (= (select .cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 1) (= (select .cse7 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (<= (+ |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1| 4 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|)) (<= 3204 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-10-04 01:00:31,612 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse1 (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (.cse4 (< .cse6 (+ 3212 |c_~#queue~0.offset|))) (.cse0 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (= 3204 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (or (< .cse0 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (or (< (+ (* (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_53|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 6 |c_~#stored_elements~0.base|) (<= 7 |c_~#queue~0.base|) (or (and .cse1 .cse2 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (v_ArrVal_382 Int)) (or (< (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 3200) (< (+ (* (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_57|))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (v_ArrVal_382 Int)) (or (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)) (< (+ (* (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_57|))) .cse3) .cse4) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (or (let ((.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (and (not (= .cse5 799)) .cse1 .cse2 .cse3 (< (* .cse5 4) 3200))) .cse4) (<= 3212 .cse6) (<= 3212 .cse0) (= (select .cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 1) (= (select .cse7 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-10-04 01:00:32,815 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse1 (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (.cse4 (< .cse5 (+ 3212 |c_~#queue~0.offset|))) (.cse0 (< .cse6 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (and (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)) (or .cse0 (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))))) (or (and .cse1 .cse2 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (v_ArrVal_382 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)))) .cse3 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (v_ArrVal_382 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|) (< (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 3200)))) .cse4) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 6 |c_~#stored_elements~0.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (or (and .cse1 (not (= |c_t1Thread1of1ForFork1_read~int_#value#1| 799)) .cse2 .cse3 (< (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) 3200)) .cse4) (<= 3212 .cse5) (<= 3212 .cse6) (or .cse0 (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ (* (select .cse7 .cse8) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store .cse7 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse8) 800)))))) (= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 1)))) is different from false [2022-10-04 01:00:33,921 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse1 (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (.cse4 (< .cse5 (+ 3212 |c_~#queue~0.offset|))) (.cse0 (< .cse6 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (and (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)) (or .cse0 (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))))) (or (and .cse1 .cse2 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (v_ArrVal_382 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)))) .cse3 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (v_ArrVal_382 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|) (< (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 3200)))) .cse4) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 6 |c_~#stored_elements~0.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (or (and .cse1 (not (= |c_t1Thread1of1ForFork1_read~int_#value#1| 799)) .cse2 .cse3 (< (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) 3200)) .cse4) (<= 3212 .cse5) (<= 3212 .cse6) (or .cse0 (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ (* (select .cse7 .cse8) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store .cse7 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse8) 800)))))) (= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-10-04 01:00:34,409 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (not (= .cse0 800)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 6 |c_~#stored_elements~0.base|) (or (< .cse1 (+ 3212 |c_~#queue~0.offset|)) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= .cse0 799)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (< (* .cse0 4) 3200))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= 3212 .cse1) (<= 3212 .cse2) (or (< .cse2 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ (* (select .cse3 .cse4) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse4) 800)))))) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 1))) is different from false [2022-10-04 01:00:34,862 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (not (= .cse0 800)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (or (< .cse1 (+ 3212 |c_~#queue~0.offset|)) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= .cse0 799)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (< (* .cse0 4) 3200))) (< 0 (+ 3208 |c_~#queue~0.offset|)) (= |c_~#queue~0.offset| 0) (<= 3212 .cse1) (<= 3212 .cse2) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (or (< .cse2 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ (* (select .cse3 .cse4) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse4) 800)))))))) is different from false [2022-10-04 01:00:35,365 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| 0) (<= 3212 .cse0) (or (< .cse0 (+ 3212 |c_~#queue~0.offset|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| Int) (v_ArrVal_387 Int) (v_ArrVal_386 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse1 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_386) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| |c_~#stored_elements~0.base|)) (not (= 800 (select (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse2))))))))) is different from false [2022-10-04 01:00:35,374 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| 0) (<= 3212 .cse0) (or (< .cse0 (+ 3212 |c_~#queue~0.offset|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| Int) (v_ArrVal_387 Int) (v_ArrVal_386 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse1 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_386) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse2))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|))))))) is different from false [2022-10-04 01:00:35,378 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| 0) (<= 3212 .cse0) (or (< .cse0 (+ 3212 |c_~#queue~0.offset|)) (forall ((v_ArrVal_387 Int) (v_ArrVal_386 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse1 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_386) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse2) 800)) (< (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|))))))) is different from false [2022-10-04 01:00:35,800 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (or (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse1) 800))))) (< .cse2 (+ 3212 |c_~#queue~0.offset|))) (= |c_~#queue~0.offset| 0) (<= 3212 .cse2))) is different from false [2022-10-04 01:00:36,219 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (and (= |c_~#queue~0.offset| 0) (or (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (or (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse1))) (< (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|)))) (< .cse2 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (<= 3212 .cse2))) is different from false [2022-10-04 01:00:36,644 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (<= 3212 .cse0) (or (< .cse0 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ (* (select .cse1 .cse2) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse2) 800)))))))) is different from false [2022-10-04 01:00:37,063 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (or (< .cse0 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (or (< (+ (* (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_53|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (<= 3212 .cse0))) is different from false [2022-10-04 01:00:44,271 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)) (or (< .cse0 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (<= 3212 .cse0))) is different from false [2022-10-04 01:00:44,945 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse0 (< .cse1 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (and (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)) (or .cse0 (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))))) (or .cse0 (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (or (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (<= 3212 .cse1)))) is different from false [2022-10-04 01:00:52,070 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse0 (< .cse1 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (and (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)) (or .cse0 (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (or (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (or .cse0 (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (or (not (= 800 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))))) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (<= 3212 .cse1)))) is different from false [2022-10-04 01:00:52,477 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)) (or (< .cse0 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (or (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (<= 3212 .cse0))) is different from false [2022-10-04 01:01:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:01:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:01:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-10-04 01:01:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-10-04 01:01:31,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-10-04 01:01:31,986 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 01:01:32,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:01:32,173 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:01:32,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:01:32,173 INFO L85 PathProgramCache]: Analyzing trace with hash 717595319, now seen corresponding path program 2 times [2022-10-04 01:01:32,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:01:32,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152292867] [2022-10-04 01:01:32,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:01:32,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:01:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:01:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-10-04 01:01:32,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:01:32,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152292867] [2022-10-04 01:01:32,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152292867] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 01:01:32,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570193884] [2022-10-04 01:01:32,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 01:01:32,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:01:32,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:01:32,575 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 01:01:32,577 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 01:01:32,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-04 01:01:32,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 01:01:32,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 29 conjunts are in the unsatisfiable core [2022-10-04 01:01:32,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 01:01:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2022-10-04 01:01:32,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-04 01:01:32,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570193884] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 01:01:32,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-04 01:01:32,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2022-10-04 01:01:32,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556112101] [2022-10-04 01:01:32,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 01:01:32,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-04 01:01:32,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:01:32,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-04 01:01:32,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-10-04 01:01:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:01:32,962 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:01:32,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 42.125) internal successors, (337), 9 states have internal predecessors, (337), 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 01:01:32,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:01:32,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:01:32,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-10-04 01:01:32,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-10-04 01:01:32,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-10-04 01:01:32,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:01:48,820 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (= 3204 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (or (< .cse0 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (or (< (+ (* (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_53|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 6 |c_~#stored_elements~0.base|) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) 1) (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (<= 3212 .cse0) (= (select .cse2 .cse1) 1) (= (select .cse2 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (<= (+ |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1| 4 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|)) (<= 3204 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 01:01:49,238 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (= 3204 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (or (< .cse0 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (or (< (+ (* (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_53|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 6 |c_~#stored_elements~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (<= 3212 .cse0) (= (select .cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 1) (= (select .cse1 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 01:01:54,498 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (= 3204 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (or (< .cse0 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (or (< (+ (* (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_53|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 6 |c_~#stored_elements~0.base|) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) 1) (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (<= 3212 .cse0) (= (select .cse2 .cse1) 1) (= (select .cse2 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (<= (+ |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1| 4 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|)) (<= 3204 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 01:01:55,373 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse3 (select |c_#length| |c_~#queue~0.base|))) (and (= 6 |c_~#stored_elements~0.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (or (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (or (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse1))) (< (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|)))) (< .cse2 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (<= 3212 .cse3) (or (let ((.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)))) (and (< (* .cse4 4) 3200) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= .cse4 799)))) (< .cse3 (+ 3212 |c_~#queue~0.offset|))) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (<= 3212 .cse2) (or (and (<= .cse3 4) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (and (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|)))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1))))) is different from false [2022-10-04 01:01:58,343 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (.cse2 (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (.cse3 (< .cse0 (+ 3212 |c_~#queue~0.offset|))) (.cse6 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (or (and (<= .cse0 4) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (and (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|)))) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 0))) (not (= .cse1 800)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) .cse2 (= 6 |c_~#stored_elements~0.base|) (or .cse3 (and .cse2 (not (= .cse1 799)) .cse4 .cse5 (< (* .cse1 4) 3200))) .cse4 (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (or (and .cse2 .cse4 (forall ((v_ArrVal_382 Int)) (not (= (select (select (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_382)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799))) .cse5 (forall ((v_ArrVal_382 Int)) (< (* (select (select (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_382)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 3200))) .cse3) (<= 3212 .cse0) (<= 3212 .cse6) (or (< .cse6 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ (* (select .cse7 .cse8) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store .cse7 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse8) 800)))))) (forall ((v_ArrVal_389 Int)) (not (= 800 (select (select (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_389)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))))))) is different from false [2022-10-04 01:01:58,810 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (.cse2 (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (.cse1 (< .cse6 (+ 3212 |c_~#queue~0.offset|))) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|)) (.cse7 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (not (= .cse0 800)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (or .cse1 (and .cse2 (not (= .cse0 799)) .cse3 .cse4 (< (* .cse0 4) 3200))) (< 0 (+ 3208 |c_~#queue~0.offset|)) (= |c_~#queue~0.offset| 0) (or (and (not (= .cse5 799)) .cse2 .cse3 .cse4 (< (* .cse5 4) 3200)) .cse1) (<= 3212 .cse6) (<= 3212 .cse7) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (not (= 800 .cse5)) (<= (+ |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1| 4 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|)) (or (< .cse7 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ (* (select .cse8 .cse9) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store .cse8 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse9) 800)))))) (<= 3204 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|)))) is different from false [2022-10-04 01:01:59,308 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (not (= .cse0 800)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (or (< .cse1 (+ 3212 |c_~#queue~0.offset|)) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= .cse0 799)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (< (* .cse0 4) 3200))) (< 0 (+ 3208 |c_~#queue~0.offset|)) (= |c_~#queue~0.offset| 0) (<= 3212 .cse1) (<= 3212 .cse2) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (not (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (or (< .cse2 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ (* (select .cse3 .cse4) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse4) 800)))))))) is different from false [2022-10-04 01:01:59,771 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (not (= .cse0 800)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 800)) (or (< .cse1 (+ 3212 |c_~#queue~0.offset|)) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= .cse0 799)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (< (* .cse0 4) 3200))) (< 0 (+ 3208 |c_~#queue~0.offset|)) (= |c_~#queue~0.offset| 0) (<= 3212 .cse1) (<= 3212 .cse2) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (or (< .cse2 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ (* (select .cse3 .cse4) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse4) 800)))))) (not (= |c_t1Thread1of1ForFork1_read~int_#value#1| 800)))) is different from false [2022-10-04 01:02:00,175 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (not (= .cse0 800)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (or (< .cse1 (+ 3212 |c_~#queue~0.offset|)) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= .cse0 799)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (< (* .cse0 4) 3200))) (< 0 (+ 3208 |c_~#queue~0.offset|)) (= |c_~#queue~0.offset| 0) (<= 3212 .cse1) (<= 3212 .cse2) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (or (< .cse2 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ (* (select .cse3 .cse4) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse4) 800)))))) (not (= |c_t1Thread1of1ForFork1_read~int_#value#1| 800)))) is different from false [2022-10-04 01:02:00,665 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (not (= .cse0 800)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 800)) (or (< .cse1 (+ 3212 |c_~#queue~0.offset|)) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= .cse0 799)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (< (* .cse0 4) 3200))) (< 0 (+ 3208 |c_~#queue~0.offset|)) (= |c_~#queue~0.offset| 0) (<= 3212 .cse1) (<= 3212 .cse2) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (or (< .cse2 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ (* (select .cse3 .cse4) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) .cse4) 800)))))))) is different from false [2022-10-04 01:02:12,345 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse1 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (.cse0 (+ |c_ULTIMATE.start_init_~q#1.offset| 3204)) (.cse4 (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (.cse7 (< .cse9 (+ 3212 |c_~#queue~0.offset|))) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_~#queue~0.offset| 3204))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) .cse0) 0) (or (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) .cse1) (forall ((v_ArrVal_374 Int) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int)) (or (< (select (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_374) |c_~#queue~0.base|) (+ 3212 |c_~#queue~0.offset|)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)))))) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2) 800)) (not (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (or (< .cse3 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_387 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_53| v_ArrVal_387) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))))) (or (and .cse4 .cse5 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (v_ArrVal_382 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 799)))) .cse6 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (v_ArrVal_382 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|) (< (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_382) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 3200)))) .cse7) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= |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) .cse4 (= 6 |c_~#stored_elements~0.base|) (or .cse7 (and .cse1 (forall ((v_ArrVal_377 Int) (v_ArrVal_379 (Array Int Int))) (not (= (select (select (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_377)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_379) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799))) (forall ((v_ArrVal_377 Int) (v_ArrVal_379 (Array Int Int))) (< (* (select (select (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_377)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_379) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) 3200)))) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) .cse5 (<= 7 |c_~#queue~0.base|) (or (and (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|)))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse8) 0)) (and (<= .cse9 4) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)))) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= 0 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|) .cse0)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (or (and .cse4 (not (= |c_t1Thread1of1ForFork1_read~int_#value#1| 799)) .cse5 .cse6 (< (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) 3200)) .cse7) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= 3212 .cse9) (= .cse2 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= 3212 .cse3) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (<= 3212 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (not (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (<= (+ |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1| 4 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|)) (<= (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|)) (<= 3204 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (not (= |c_t1Thread1of1ForFork1_read~int_#value#1| 800)) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse8) 0) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4)))) is different from false [2022-10-04 01:04:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:04:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:04:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-10-04 01:04:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-10-04 01:04:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2022-10-04 01:04:31,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-04 01:04:31,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 01:04:31,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-04 01:04:31,903 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,SelfDestructingSolverStorable5 [2022-10-04 01:04:31,905 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-10-04 01:04:31,905 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (4/4) [2022-10-04 01:04:31,908 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-04 01:04:31,908 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-04 01:04:31,911 INFO L202 PluginConnector]: Adding new model queue_ok_longest.line352.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 01:04:31 BasicIcfg [2022-10-04 01:04:31,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-04 01:04:31,912 INFO L158 Benchmark]: Toolchain (without parser) took 394411.32ms. Allocated memory was 170.9MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 128.7MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-10-04 01:04:31,912 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 170.9MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-04 01:04:31,912 INFO L158 Benchmark]: Boogie Preprocessor took 101.82ms. Allocated memory is still 170.9MB. Free memory was 128.7MB in the beginning and 125.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-04 01:04:31,912 INFO L158 Benchmark]: RCFGBuilder took 822.28ms. Allocated memory is still 170.9MB. Free memory was 125.2MB in the beginning and 125.3MB in the end (delta: -122.0kB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2022-10-04 01:04:31,913 INFO L158 Benchmark]: TraceAbstraction took 393466.75ms. Allocated memory was 170.9MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 124.8MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-10-04 01:04:31,913 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.21ms. Allocated memory is still 170.9MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 101.82ms. Allocated memory is still 170.9MB. Free memory was 128.7MB in the beginning and 125.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 822.28ms. Allocated memory is still 170.9MB. Free memory was 125.2MB in the beginning and 125.3MB in the end (delta: -122.0kB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. * TraceAbstraction took 393466.75ms. Allocated memory was 170.9MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 124.8MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, 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: 2, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1767, positive: 1673, positive conditional: 1673, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1767, positive: 1673, positive conditional: 1673, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1687, positive: 1673, positive conditional: 0, positive unconditional: 1673, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1651, positive: 1637, positive conditional: 0, positive unconditional: 1637, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1687, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1651, unknown conditional: 0, unknown unconditional: 1651] , Statistics on independence cache: Total cache size (in pairs): 1651, Positive cache size: 1637, Positive conditional cache size: 0, Positive unconditional cache size: 1637, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Independence queries for same thread: 80, 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: 55984, positive: 54545, positive conditional: 54545, positive unconditional: 0, negative: 1439, negative conditional: 1439, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7479841, positive: 7323478, positive conditional: 7323478, positive unconditional: 0, negative: 156363, negative conditional: 156363, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7346597, positive: 7323478, positive conditional: 0, positive unconditional: 7323478, negative: 23119, negative conditional: 0, negative unconditional: 23119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 29423, positive: 29268, positive conditional: 0, positive unconditional: 29268, negative: 155, negative conditional: 0, negative unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7346597, positive: 7294210, positive conditional: 0, positive unconditional: 7294210, negative: 22964, negative conditional: 0, negative unconditional: 22964, unknown: 29423, unknown conditional: 0, unknown unconditional: 29423] , Statistics on independence cache: Total cache size (in pairs): 5785, Positive cache size: 5772, Positive conditional cache size: 0, Positive unconditional cache size: 5772, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Independence queries for same thread: 1384, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 55653, positive: 54222, positive conditional: 54222, positive unconditional: 0, negative: 1431, negative conditional: 1431, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7479841, positive: 7323478, positive conditional: 7323478, positive unconditional: 0, negative: 156363, negative conditional: 156363, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7346597, positive: 7323478, positive conditional: 0, positive unconditional: 7323478, negative: 23119, negative conditional: 0, negative unconditional: 23119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 29423, positive: 29268, positive conditional: 0, positive unconditional: 29268, negative: 155, negative conditional: 0, negative unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7346597, positive: 7294210, positive conditional: 0, positive unconditional: 7294210, negative: 22964, negative conditional: 0, negative unconditional: 22964, unknown: 29423, unknown conditional: 0, unknown unconditional: 29423] , Statistics on independence cache: Total cache size (in pairs): 5785, Positive cache size: 5772, Positive conditional cache size: 0, Positive unconditional cache size: 5772, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Independence queries for same thread: 2760, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3702, positive: 3689, positive conditional: 3689, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7479841, positive: 7323478, positive conditional: 7323478, positive unconditional: 0, negative: 156363, negative conditional: 156363, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7346597, positive: 7323478, positive conditional: 0, positive unconditional: 7323478, negative: 23119, negative conditional: 0, negative unconditional: 23119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 29423, positive: 29268, positive conditional: 0, positive unconditional: 29268, negative: 155, negative conditional: 0, negative unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7346597, positive: 7294210, positive conditional: 0, positive unconditional: 7294210, negative: 22964, negative conditional: 0, negative unconditional: 22964, unknown: 29423, unknown conditional: 0, unknown unconditional: 29423] , Statistics on independence cache: Total cache size (in pairs): 6111, Positive cache size: 6097, Positive conditional cache size: 0, Positive unconditional cache size: 6097, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Independence queries for same thread: 2767, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 76687, positive: 76586, positive conditional: 76586, positive unconditional: 0, negative: 101, negative conditional: 101, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7479841, positive: 7323478, positive conditional: 7323478, positive unconditional: 0, negative: 156363, negative conditional: 156363, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7346597, positive: 7323478, positive conditional: 0, positive unconditional: 7323478, negative: 23119, negative conditional: 0, negative unconditional: 23119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 29423, positive: 29268, positive conditional: 0, positive unconditional: 29268, negative: 155, negative conditional: 0, negative unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7346597, positive: 7294210, positive conditional: 0, positive unconditional: 7294210, negative: 22964, negative conditional: 0, negative unconditional: 22964, unknown: 29423, unknown conditional: 0, unknown unconditional: 29423] , Statistics on independence cache: Total cache size (in pairs): 9066, Positive cache size: 9028, Positive conditional cache size: 0, Positive unconditional cache size: 9028, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Independence queries for same thread: 2796, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 76973, positive: 76857, positive conditional: 76857, positive unconditional: 0, negative: 116, negative conditional: 116, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7479841, positive: 7323478, positive conditional: 7323478, positive unconditional: 0, negative: 156363, negative conditional: 156363, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7346597, positive: 7323478, positive conditional: 0, positive unconditional: 7323478, negative: 23119, negative conditional: 0, negative unconditional: 23119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 29423, positive: 29268, positive conditional: 0, positive unconditional: 29268, negative: 155, negative conditional: 0, negative unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7346597, positive: 7294210, positive conditional: 0, positive unconditional: 7294210, negative: 22964, negative conditional: 0, negative unconditional: 22964, unknown: 29423, unknown conditional: 0, unknown unconditional: 29423] , Statistics on independence cache: Total cache size (in pairs): 9937, Positive cache size: 9889, Positive conditional cache size: 0, Positive unconditional cache size: 9889, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Independence queries for same thread: 2831, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 261096, positive: 260768, positive conditional: 260768, positive unconditional: 0, negative: 328, negative conditional: 328, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7479841, positive: 7323478, positive conditional: 7323478, positive unconditional: 0, negative: 156363, negative conditional: 156363, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7346597, positive: 7323478, positive conditional: 0, positive unconditional: 7323478, negative: 23119, negative conditional: 0, negative unconditional: 23119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 29423, positive: 29268, positive conditional: 0, positive unconditional: 29268, negative: 155, negative conditional: 0, negative unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7346597, positive: 7294210, positive conditional: 0, positive unconditional: 7294210, negative: 22964, negative conditional: 0, negative unconditional: 22964, unknown: 29423, unknown conditional: 0, unknown unconditional: 29423] , Statistics on independence cache: Total cache size (in pairs): 10123, Positive cache size: 10075, Positive conditional cache size: 0, Positive unconditional cache size: 10075, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Independence queries for same thread: 2920, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6949746, positive: 6796811, positive conditional: 6796811, positive unconditional: 0, negative: 152935, negative conditional: 152935, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7479841, positive: 7323478, positive conditional: 7323478, positive unconditional: 0, negative: 156363, negative conditional: 156363, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7346597, positive: 7323478, positive conditional: 0, positive unconditional: 7323478, negative: 23119, negative conditional: 0, negative unconditional: 23119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 29423, positive: 29268, positive conditional: 0, positive unconditional: 29268, negative: 155, negative conditional: 0, negative unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7346597, positive: 7294210, positive conditional: 0, positive unconditional: 7294210, negative: 22964, negative conditional: 0, negative unconditional: 22964, unknown: 29423, unknown conditional: 0, unknown unconditional: 29423] , Statistics on independence cache: Total cache size (in pairs): 29423, Positive cache size: 29268, Positive conditional cache size: 0, Positive unconditional cache size: 29268, Negative cache size: 155, Negative conditional cache size: 0, Negative unconditional cache size: 155, Independence queries for same thread: 133244, Statistics for Abstraction: - PositiveResult [Line: 352]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.1s, 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, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.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: 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, 810 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, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 392.6s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 268.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: 361, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 121.5s InterpolantComputationTime, 5008 NumberOfCodeBlocks, 4739 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 5945 ConstructedInterpolants, 336 QuantifiedInterpolants, 47633 SizeOfPredicates, 232 NumberOfNonLiveVariables, 3416 ConjunctsInSsa, 362 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 3424/4094 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-10-04 01:04:31,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2022-10-04 01:04:32,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2022-10-04 01:04:32,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2022-10-04 01:04:32,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2022-10-04 01:04:32,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...