/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_longer.line555.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 00:39:48,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 00:39:48,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 00:39:48,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 00:39:48,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 00:39:48,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 00:39:48,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 00:39:48,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 00:39:48,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 00:39:48,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 00:39:48,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 00:39:48,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 00:39:48,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 00:39:48,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 00:39:48,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 00:39:48,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 00:39:48,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 00:39:48,637 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 00:39:48,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 00:39:48,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 00:39:48,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 00:39:48,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 00:39:48,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 00:39:48,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 00:39:48,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 00:39:48,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 00:39:48,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 00:39:48,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 00:39:48,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 00:39:48,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 00:39:48,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 00:39:48,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 00:39:48,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 00:39:48,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 00:39:48,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 00:39:48,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 00:39:48,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 00:39:48,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 00:39:48,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 00:39:48,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 00:39:48,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 00:39:48,668 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:39:48,687 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 00:39:48,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 00:39:48,688 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 00:39:48,688 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 00:39:48,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 00:39:48,689 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 00:39:48,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 00:39:48,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 00:39:48,689 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 00:39:48,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 00:39:48,690 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 00:39:48,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 00:39:48,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 00:39:48,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 00:39:48,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 00:39:48,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 00:39:48,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 00:39:48,690 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 00:39:48,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 00:39:48,691 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 00:39:48,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 00:39:48,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 00:39:48,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 00:39:48,691 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 00:39:48,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 00:39:48,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:39:48,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 00:39:48,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 00:39:48,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 00:39:48,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 00:39:48,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 00:39:48,692 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 00:39:48,692 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 00:39:48,692 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 00:39:48,693 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 00:39:48,693 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 00:39:48,693 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 00:39:48,693 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 00:39:48,693 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:39:48,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 00:39:48,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 00:39:48,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 00:39:48,913 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 00:39:48,920 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 00:39:48,921 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_longer.line555.bpl [2022-10-04 00:39:48,921 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_longer.line555.bpl' [2022-10-04 00:39:48,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 00:39:48,999 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 00:39:49,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 00:39:49,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 00:39:49,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 00:39:49,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_longer.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:39:48" (1/1) ... [2022-10-04 00:39:49,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_longer.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:39:48" (1/1) ... [2022-10-04 00:39:49,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_longer.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:39:48" (1/1) ... [2022-10-04 00:39:49,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_longer.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:39:48" (1/1) ... [2022-10-04 00:39:49,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_longer.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:39:48" (1/1) ... [2022-10-04 00:39:49,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_longer.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:39:48" (1/1) ... [2022-10-04 00:39:49,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_longer.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:39:48" (1/1) ... [2022-10-04 00:39:49,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 00:39:49,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 00:39:49,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 00:39:49,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 00:39:49,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_longer.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:39:48" (1/1) ... [2022-10-04 00:39:49,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:39:49,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:39:49,153 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:39:49,172 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:39:49,209 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-10-04 00:39:49,209 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-10-04 00:39:49,209 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-10-04 00:39:49,210 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-10-04 00:39:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 00:39:49,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 00:39:49,211 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:39:49,414 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 00:39:49,416 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 00:39:50,122 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 00:39:50,139 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 00:39:50,140 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-04 00:39:50,142 INFO L202 PluginConnector]: Adding new model queue_longer.line555.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:39:50 BoogieIcfgContainer [2022-10-04 00:39:50,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 00:39:50,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 00:39:50,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 00:39:50,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 00:39:50,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_longer.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:39:48" (1/2) ... [2022-10-04 00:39:50,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a3e5ba and model type queue_longer.line555.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:39:50, skipping insertion in model container [2022-10-04 00:39:50,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_longer.line555.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:39:50" (2/2) ... [2022-10-04 00:39:50,154 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.line555.bpl [2022-10-04 00:39:50,161 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 00:39:50,168 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 00:39:50,168 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 00:39:50,168 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 00:39:50,299 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 00:39:50,350 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:39:50,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:39:50,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:39:50,359 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:39:50,368 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:39:50,418 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:39:50,425 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:39:50,433 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;@3feb45b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:39:50,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:39:50,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:39:50,518 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:39:50,520 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 00:39:50,531 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:39:50,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:39:50,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:39:50,543 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:39:50,551 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:39:50,551 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:39:50,552 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;@3feb45b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:39:50,553 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:39:50,578 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:39:51,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:39:51,073 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:39:51,074 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 00:39:51,082 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:39:51,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:39:51,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:39:51,116 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:39:51,117 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:39:51,121 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:39:51,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:39:51,122 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;@3feb45b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:39:51,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:39:51,123 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 00:39:51,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:39:51,124 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:39:51,124 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 00:39:51,129 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:39:51,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:39:51,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:39:51,133 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:39:51,135 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:39:51,140 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:39:51,141 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:39:51,142 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;@3feb45b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:39:51,142 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:39:51,718 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:39:51,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:39:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1625405332, now seen corresponding path program 1 times [2022-10-04 00:39:51,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:39:51,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452366785] [2022-10-04 00:39:51,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:39:51,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:39:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:39:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1827 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1827 trivial. 0 not checked. [2022-10-04 00:39:52,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:39:52,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452366785] [2022-10-04 00:39:52,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452366785] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:39:52,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:39:52,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-04 00:39:52,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013433602] [2022-10-04 00:39:52,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:39:52,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-04 00:39:52,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:39:52,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-04 00:39:52,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-04 00:39:52,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:39:52,573 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:39:52,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 257.0) internal successors, (514), 2 states have internal predecessors, (514), 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:39:52,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:39:52,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:39:52,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 00:39:52,907 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:39:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:39:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1003813813, now seen corresponding path program 1 times [2022-10-04 00:39:52,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:39:52,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269697606] [2022-10-04 00:39:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:39:52,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:39:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:39:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1827 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1827 trivial. 0 not checked. [2022-10-04 00:39:53,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:39:53,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269697606] [2022-10-04 00:39:53,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269697606] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:39:53,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:39:53,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-04 00:39:53,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308918806] [2022-10-04 00:39:53,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:39:53,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-04 00:39:53,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:39:53,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-04 00:39:53,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-04 00:39:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:39:53,421 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:39:53,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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:39:53,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:39:53,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:39:54,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:39:54,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:39:54,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 00:39:54,219 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:39:54,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:39:54,220 INFO L85 PathProgramCache]: Analyzing trace with hash 61927141, now seen corresponding path program 1 times [2022-10-04 00:39:54,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:39:54,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330167913] [2022-10-04 00:39:54,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:39:54,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:39:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:39:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1827 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2022-10-04 00:39:54,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:39:54,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330167913] [2022-10-04 00:39:54,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330167913] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:39:54,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:39:54,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 00:39:54,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235975751] [2022-10-04 00:39:54,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:39:54,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 00:39:54,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:39:54,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 00:39:54,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-04 00:39:54,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:39:54,706 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:39:54,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.33333333333333) internal successors, (602), 6 states have internal predecessors, (602), 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:39:54,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:39:54,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:39:54,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:39:55,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:39:55,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:39:55,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:39:55,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-04 00:39:55,097 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:39:55,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:39:55,098 INFO L85 PathProgramCache]: Analyzing trace with hash -768038846, now seen corresponding path program 1 times [2022-10-04 00:39:55,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:39:55,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418910776] [2022-10-04 00:39:55,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:39:55,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:39:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:39:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-04 00:39:55,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:39:55,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418910776] [2022-10-04 00:39:55,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418910776] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:39:55,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818960717] [2022-10-04 00:39:55,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:39:55,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:39:55,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:39:55,383 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:39:55,409 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:39:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:39:55,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 104 conjunts are in the unsatisfiable core [2022-10-04 00:39:55,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:39:55,902 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:39:55,955 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:39:56,079 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:39:56,079 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:39:56,138 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:39:56,611 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:39:56,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:39:56,863 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:39:57,581 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:39:57,582 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:39:57,594 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:39:58,148 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:39:58,148 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:39:58,541 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:39:58,541 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 34 treesize of output 27 [2022-10-04 00:39:58,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:39:58,861 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:39:58,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-04 00:39:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-10-04 00:39:59,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-04 00:39:59,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818960717] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:39:59,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-04 00:39:59,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [9] total 46 [2022-10-04 00:39:59,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921800456] [2022-10-04 00:39:59,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:39:59,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-04 00:39:59,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:39:59,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-04 00:39:59,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1883, Unknown=0, NotChecked=0, Total=2070 [2022-10-04 00:39:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:39:59,132 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:39:59,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 11.552631578947368) internal successors, (439), 38 states have internal predecessors, (439), 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:39:59,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:39:59,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:39:59,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:39:59,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:40:04,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:40:04,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:40:04,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:40:04,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-10-04 00:40:04,551 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:40:04,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:40:04,733 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:40:04,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:40:04,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1423681173, now seen corresponding path program 1 times [2022-10-04 00:40:04,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:40:04,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660073572] [2022-10-04 00:40:04,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:40:04,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:40:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:40:05,042 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-04 00:40:05,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:40:05,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660073572] [2022-10-04 00:40:05,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660073572] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:40:05,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176339028] [2022-10-04 00:40:05,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:40:05,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:40:05,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:40:05,048 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:40:05,049 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:40:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:40:05,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 161 conjunts are in the unsatisfiable core [2022-10-04 00:40:05,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:40:05,743 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:40:05,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:40:05,887 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:40:06,312 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:40:06,315 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 16 treesize of output 22 [2022-10-04 00:40:06,326 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:40:06,797 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:40:06,798 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 25 treesize of output 30 [2022-10-04 00:40:07,132 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 11 treesize of output 7 [2022-10-04 00:40:07,768 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 0 case distinctions, treesize of input 21 treesize of output 11 [2022-10-04 00:40:07,900 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 6 treesize of output 5 [2022-10-04 00:40:08,574 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:40:08,574 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 25 treesize of output 30 [2022-10-04 00:40:08,760 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 11 treesize of output 7 [2022-10-04 00:40:08,842 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:40:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:40:09,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:40:33,493 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1)))))) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false [2022-10-04 00:40:33,530 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1)))))) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false [2022-10-04 00:40:33,555 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1)))))) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false [2022-10-04 00:40:33,677 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| |c_t1Thread1of1ForFork1_write~int_#value#1|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)))) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false [2022-10-04 00:40:33,731 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1)))))) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false [2022-10-04 00:40:33,759 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|))))) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false [2022-10-04 00:40:33,776 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (< (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)))) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false [2022-10-04 00:40:33,804 WARN L833 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_read~int_#value#1| 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:40:33,825 WARN L833 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))))))) is different from false [2022-10-04 00:40:33,877 WARN L833 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))))))) is different from false [2022-10-04 00:40:34,080 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store (let ((.cse2 (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_554)))) (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1) 400)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)))) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false [2022-10-04 00:40:34,148 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int)) (let ((.cse0 (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1)))))) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false [2022-10-04 00:40:34,189 WARN L833 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))))))) is different from false [2022-10-04 00:40:34,306 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-04 00:40:34,307 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 12 treesize of output 11 [2022-10-04 00:40:34,323 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1)))))) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_~#queue~0.base|)) is different from false [2022-10-04 00:40:34,344 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))))))) is different from false [2022-10-04 00:40:34,416 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_553 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int)) (let ((.cse0 (select (store (let ((.cse2 (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_553)))) (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (store (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1) 400)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) is different from false [2022-10-04 00:40:34,504 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_553 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int)) (let ((.cse0 (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_553) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))))))) is different from false [2022-10-04 00:40:34,556 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_553 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_553) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|))))) is different from false [2022-10-04 00:40:34,609 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_553 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_553) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|) (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|))))) is different from false [2022-10-04 00:40:34,640 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_553 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_553) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) is different from false [2022-10-04 00:40:34,742 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_553 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse4 (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_553) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (< (+ (* (select .cse2 .cse3) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|) (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|))))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) is different from false [2022-10-04 00:40:34,820 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_553 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_553) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (< (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|) (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= 400 (select (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse3)))))))) is different from false [2022-10-04 00:40:34,907 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:40:34,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176339028] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:40:34,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:40:34,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 48, 40] total 91 [2022-10-04 00:40:34,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942746347] [2022-10-04 00:40:34,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:40:34,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-10-04 00:40:34,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:40:34,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-10-04 00:40:34,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=769, Invalid=4068, Unknown=81, NotChecked=3454, Total=8372 [2022-10-04 00:40:34,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:40:34,915 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:40:34,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 91 states have (on average 13.505494505494505) internal successors, (1229), 92 states have internal predecessors, (1229), 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:40:34,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:40:34,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:40:34,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:40:34,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-10-04 00:40:34,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:41:44,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:41:44,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:41:44,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:41:44,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-10-04 00:41:44,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-10-04 00:41:44,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:41:44,127 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:41:44,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:41:44,311 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-10-04 00:41:44,311 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (4/4) [2022-10-04 00:41:44,314 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-04 00:41:44,314 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-04 00:41:44,318 INFO L202 PluginConnector]: Adding new model queue_longer.line555.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:41:44 BasicIcfg [2022-10-04 00:41:44,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-04 00:41:44,318 INFO L158 Benchmark]: Toolchain (without parser) took 115319.64ms. Allocated memory was 192.9MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 141.4MB in the beginning and 6.7GB in the end (delta: -6.5GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-10-04 00:41:44,319 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 192.9MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-04 00:41:44,319 INFO L158 Benchmark]: Boogie Preprocessor took 87.06ms. Allocated memory is still 192.9MB. Free memory was 141.4MB in the beginning and 137.7MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-04 00:41:44,319 INFO L158 Benchmark]: RCFGBuilder took 1054.16ms. Allocated memory was 192.9MB in the beginning and 294.6MB in the end (delta: 101.7MB). Free memory was 137.7MB in the beginning and 240.3MB in the end (delta: -102.7MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. [2022-10-04 00:41:44,320 INFO L158 Benchmark]: TraceAbstraction took 114173.57ms. Allocated memory was 294.6MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 239.3MB in the beginning and 6.7GB in the end (delta: -6.4GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-10-04 00:41:44,321 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17ms. Allocated memory is still 192.9MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 87.06ms. Allocated memory is still 192.9MB. Free memory was 141.4MB in the beginning and 137.7MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1054.16ms. Allocated memory was 192.9MB in the beginning and 294.6MB in the end (delta: 101.7MB). Free memory was 137.7MB in the beginning and 240.3MB in the end (delta: -102.7MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. * TraceAbstraction took 114173.57ms. Allocated memory was 294.6MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 239.3MB in the beginning and 6.7GB in the end (delta: -6.4GB). Peak memory consumption was 1.4GB. 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: 3823, positive: 3661, positive conditional: 3661, positive unconditional: 0, negative: 162, negative conditional: 162, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3823, positive: 3661, positive conditional: 3661, positive unconditional: 0, negative: 162, negative conditional: 162, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3691, positive: 3661, positive conditional: 0, positive unconditional: 3661, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3614, positive: 3584, positive conditional: 0, positive unconditional: 3584, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3691, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3614, unknown conditional: 0, unknown unconditional: 3614] , Statistics on independence cache: Total cache size (in pairs): 3614, Positive cache size: 3584, Positive conditional cache size: 0, Positive unconditional cache size: 3584, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Independence queries for same thread: 132, 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: 12038, positive: 11666, positive conditional: 11666, positive unconditional: 0, negative: 372, negative conditional: 372, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2648416, positive: 2574191, positive conditional: 2574191, positive unconditional: 0, negative: 74225, negative conditional: 74225, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2585584, positive: 2574191, positive conditional: 0, positive unconditional: 2574191, negative: 11393, negative conditional: 0, negative unconditional: 11393, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 46278, positive: 46002, positive conditional: 0, positive unconditional: 46002, negative: 276, negative conditional: 0, negative unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2585584, positive: 2528189, positive conditional: 0, positive unconditional: 2528189, negative: 11117, negative conditional: 0, negative unconditional: 11117, unknown: 46278, unknown conditional: 0, unknown unconditional: 46278] , Statistics on independence cache: Total cache size (in pairs): 4973, Positive cache size: 4957, Positive conditional cache size: 0, Positive unconditional cache size: 4957, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Independence queries for same thread: 350, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 11926, positive: 11568, positive conditional: 11568, positive unconditional: 0, negative: 358, negative conditional: 358, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2648416, positive: 2574191, positive conditional: 2574191, positive unconditional: 0, negative: 74225, negative conditional: 74225, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2585584, positive: 2574191, positive conditional: 0, positive unconditional: 2574191, negative: 11393, negative conditional: 0, negative unconditional: 11393, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 46278, positive: 46002, positive conditional: 0, positive unconditional: 46002, negative: 276, negative conditional: 0, negative unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2585584, positive: 2528189, positive conditional: 0, positive unconditional: 2528189, negative: 11117, negative conditional: 0, negative unconditional: 11117, unknown: 46278, unknown conditional: 0, unknown unconditional: 46278] , Statistics on independence cache: Total cache size (in pairs): 4973, Positive cache size: 4957, Positive conditional cache size: 0, Positive unconditional cache size: 4957, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Independence queries for same thread: 686, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 35933, positive: 35023, positive conditional: 35023, positive unconditional: 0, negative: 910, negative conditional: 910, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2648416, positive: 2574191, positive conditional: 2574191, positive unconditional: 0, negative: 74225, negative conditional: 74225, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2585584, positive: 2574191, positive conditional: 0, positive unconditional: 2574191, negative: 11393, negative conditional: 0, negative unconditional: 11393, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 46278, positive: 46002, positive conditional: 0, positive unconditional: 46002, negative: 276, negative conditional: 0, negative unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2585584, positive: 2528189, positive conditional: 0, positive unconditional: 2528189, negative: 11117, negative conditional: 0, negative unconditional: 11117, unknown: 46278, unknown conditional: 0, unknown unconditional: 46278] , Statistics on independence cache: Total cache size (in pairs): 6341, Positive cache size: 6325, Positive conditional cache size: 0, Positive unconditional cache size: 6325, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Independence queries for same thread: 1550, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 11927, positive: 11441, positive conditional: 11441, positive unconditional: 0, negative: 486, negative conditional: 486, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2648416, positive: 2574191, positive conditional: 2574191, positive unconditional: 0, negative: 74225, negative conditional: 74225, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2585584, positive: 2574191, positive conditional: 0, positive unconditional: 2574191, negative: 11393, negative conditional: 0, negative unconditional: 11393, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 46278, positive: 46002, positive conditional: 0, positive unconditional: 46002, negative: 276, negative conditional: 0, negative unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2585584, positive: 2528189, positive conditional: 0, positive unconditional: 2528189, negative: 11117, negative conditional: 0, negative unconditional: 11117, unknown: 46278, unknown conditional: 0, unknown unconditional: 46278] , Statistics on independence cache: Total cache size (in pairs): 6679, Positive cache size: 6662, Positive conditional cache size: 0, Positive unconditional cache size: 6662, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Independence queries for same thread: 2026, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 11934, positive: 11450, positive conditional: 11450, positive unconditional: 0, negative: 484, negative conditional: 484, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2648416, positive: 2574191, positive conditional: 2574191, positive unconditional: 0, negative: 74225, negative conditional: 74225, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2585584, positive: 2574191, positive conditional: 0, positive unconditional: 2574191, negative: 11393, negative conditional: 0, negative unconditional: 11393, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 46278, positive: 46002, positive conditional: 0, positive unconditional: 46002, negative: 276, negative conditional: 0, negative unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2585584, positive: 2528189, positive conditional: 0, positive unconditional: 2528189, negative: 11117, negative conditional: 0, negative unconditional: 11117, unknown: 46278, unknown conditional: 0, unknown unconditional: 46278] , Statistics on independence cache: Total cache size (in pairs): 7889, Positive cache size: 7869, Positive conditional cache size: 0, Positive unconditional cache size: 7869, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Independence queries for same thread: 2500, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2564658, positive: 2493043, positive conditional: 2493043, positive unconditional: 0, negative: 71615, negative conditional: 71615, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2648416, positive: 2574191, positive conditional: 2574191, positive unconditional: 0, negative: 74225, negative conditional: 74225, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2585584, positive: 2574191, positive conditional: 0, positive unconditional: 2574191, negative: 11393, negative conditional: 0, negative unconditional: 11393, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 46278, positive: 46002, positive conditional: 0, positive unconditional: 46002, negative: 276, negative conditional: 0, negative unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2585584, positive: 2528189, positive conditional: 0, positive unconditional: 2528189, negative: 11117, negative conditional: 0, negative unconditional: 11117, unknown: 46278, unknown conditional: 0, unknown unconditional: 46278] , Statistics on independence cache: Total cache size (in pairs): 46278, Positive cache size: 46002, Positive conditional cache size: 0, Positive unconditional cache size: 46002, Negative cache size: 276, Negative conditional cache size: 0, Negative unconditional cache size: 276, Independence queries for same thread: 62832, Statistics for Abstraction: - PositiveResult [Line: 555]: 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, 1034 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, 1034 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 5 procedures, 1034 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONASSERT with 2 thread instances CFG has 5 procedures, 1034 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 113.2s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 76.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 212, 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, 0.6s SatisfiabilityAnalysisTime, 34.6s InterpolantComputationTime, 5202 NumberOfCodeBlocks, 5202 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 5710 ConstructedInterpolants, 158 QuantifiedInterpolants, 30323 SizeOfPredicates, 156 NumberOfNonLiveVariables, 2222 ConjunctsInSsa, 265 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 5602/5816 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 00:41:44,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2022-10-04 00:41:44,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2022-10-04 00:41:44,755 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 00:41:44,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-10-04 00:41:45,157 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...