/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longer.line364.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 00:53:42,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 00:53:42,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 00:53:42,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 00:53:42,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 00:53:42,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 00:53:42,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 00:53:42,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 00:53:42,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 00:53:42,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 00:53:42,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 00:53:42,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 00:53:42,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 00:53:42,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 00:53:42,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 00:53:42,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 00:53:42,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 00:53:42,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 00:53:42,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 00:53:42,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 00:53:42,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 00:53:42,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 00:53:42,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 00:53:42,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 00:53:42,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 00:53:42,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 00:53:42,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 00:53:42,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 00:53:42,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 00:53:42,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 00:53:42,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 00:53:42,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 00:53:42,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 00:53:42,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 00:53:42,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 00:53:42,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 00:53:42,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 00:53:42,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 00:53:42,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 00:53:42,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 00:53:42,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 00:53:42,688 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:53:42,702 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 00:53:42,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 00:53:42,702 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 00:53:42,702 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 00:53:42,703 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 00:53:42,703 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 00:53:42,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 00:53:42,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 00:53:42,704 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 00:53:42,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 00:53:42,704 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 00:53:42,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 00:53:42,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 00:53:42,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 00:53:42,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 00:53:42,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 00:53:42,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 00:53:42,705 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 00:53:42,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 00:53:42,705 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 00:53:42,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 00:53:42,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 00:53:42,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 00:53:42,706 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 00:53:42,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 00:53:42,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:53:42,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 00:53:42,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 00:53:42,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 00:53:42,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 00:53:42,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 00:53:42,707 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 00:53:42,707 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 00:53:42,707 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 00:53:42,707 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 00:53:42,707 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 00:53:42,707 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 00:53:42,708 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 00:53:42,708 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:53:42,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 00:53:42,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 00:53:42,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 00:53:42,915 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 00:53:42,916 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 00:53:42,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longer.line364.bpl [2022-10-04 00:53:42,917 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longer.line364.bpl' [2022-10-04 00:53:42,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 00:53:42,966 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 00:53:42,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 00:53:42,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 00:53:42,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 00:53:42,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_ok_longer.line364.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:42" (1/1) ... [2022-10-04 00:53:42,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_ok_longer.line364.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:42" (1/1) ... [2022-10-04 00:53:43,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_ok_longer.line364.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:42" (1/1) ... [2022-10-04 00:53:43,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_ok_longer.line364.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:42" (1/1) ... [2022-10-04 00:53:43,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_ok_longer.line364.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:42" (1/1) ... [2022-10-04 00:53:43,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_ok_longer.line364.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:42" (1/1) ... [2022-10-04 00:53:43,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_ok_longer.line364.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:42" (1/1) ... [2022-10-04 00:53:43,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 00:53:43,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 00:53:43,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 00:53:43,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 00:53:43,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_ok_longer.line364.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:42" (1/1) ... [2022-10-04 00:53:43,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:53:43,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:43,078 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:53:43,082 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:53:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-10-04 00:53:43,110 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-10-04 00:53:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-10-04 00:53:43,110 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-10-04 00:53:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 00:53:43,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 00:53:43,111 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:53:43,251 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 00:53:43,252 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 00:53:43,688 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 00:53:43,712 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 00:53:43,712 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-04 00:53:43,715 INFO L202 PluginConnector]: Adding new model queue_ok_longer.line364.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:43 BoogieIcfgContainer [2022-10-04 00:53:43,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 00:53:43,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 00:53:43,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 00:53:43,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 00:53:43,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longer.line364.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:42" (1/2) ... [2022-10-04 00:53:43,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c3b604 and model type queue_ok_longer.line364.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:53:43, skipping insertion in model container [2022-10-04 00:53:43,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longer.line364.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:43" (2/2) ... [2022-10-04 00:53:43,724 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.line364.bpl [2022-10-04 00:53:43,730 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 00:53:43,736 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 00:53:43,736 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 00:53:43,737 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 00:53:43,843 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 00:53:43,894 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:53:43,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:53:43,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:43,896 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:53:43,919 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:53:43,931 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:53:43,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:53:43,946 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;@5d1d9a8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:53:43,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:53:44,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:53:44,031 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:53:44,033 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 00:53:44,045 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:53:44,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:53:44,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:44,047 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:53:44,048 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:53:44,051 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:53:44,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:53:44,052 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;@5d1d9a8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:53:44,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:53:44,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:53:44,307 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:53:44,310 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 00:53:44,316 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:53:44,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:53:44,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:44,352 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:53:44,353 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:53:44,356 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:53:44,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:53:44,357 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;@5d1d9a8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:53:44,357 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:53:44,357 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 00:53:44,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:53:44,357 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:53:44,358 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 00:53:44,362 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:53:44,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:53:44,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:44,368 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:53:44,371 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:53:44,374 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:53:44,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:53:44,375 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;@5d1d9a8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:53:44,375 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:53:45,674 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:53:45,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:53:45,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1286302324, now seen corresponding path program 1 times [2022-10-04 00:53:45,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:53:45,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386561266] [2022-10-04 00:53:45,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:45,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2022-10-04 00:53:46,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:53:46,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386561266] [2022-10-04 00:53:46,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386561266] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:53:46,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:53:46,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-04 00:53:46,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529689172] [2022-10-04 00:53:46,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:53:46,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-04 00:53:46,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:53:46,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-04 00:53:46,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-04 00:53:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:46,207 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:53:46,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 201.0) internal successors, (402), 2 states have internal predecessors, (402), 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:53:46,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:46,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:46,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 00:53:46,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:53:46,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:53:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1332150104, now seen corresponding path program 1 times [2022-10-04 00:53:46,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:53:46,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848248136] [2022-10-04 00:53:46,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:46,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2022-10-04 00:53:47,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:53:47,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848248136] [2022-10-04 00:53:47,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848248136] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:53:47,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:53:47,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 00:53:47,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900678724] [2022-10-04 00:53:47,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:53:47,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 00:53:47,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:53:47,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 00:53:47,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-04 00:53:47,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:47,268 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:53:47,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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:53:47,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:47,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:47,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:47,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:53:47,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 00:53:47,391 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:53:47,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:53:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash 764550170, now seen corresponding path program 1 times [2022-10-04 00:53:47,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:53:47,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412951592] [2022-10-04 00:53:47,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:47,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:47,880 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-10-04 00:53:47,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:53:47,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412951592] [2022-10-04 00:53:47,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412951592] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:53:47,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692109408] [2022-10-04 00:53:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:47,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:53:47,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:47,884 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:53:47,885 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:53:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:48,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 79 conjunts are in the unsatisfiable core [2022-10-04 00:53:48,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:53:49,455 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:53:49,811 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 23 treesize of output 13 [2022-10-04 00:53:49,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:53:49,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-04 00:53:50,301 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:53:50,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2022-10-04 00:53:50,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:53:50,441 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:53:50,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-04 00:53:50,547 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 281 proven. 118 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-04 00:53:50,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:54:24,746 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_224 Int) (v_ArrVal_220 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_220) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_224) .cse1))) (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)))) is different from false [2022-10-04 00:54:24,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| Int)) (or (forall ((v_ArrVal_224 Int) (v_ArrVal_220 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| v_ArrVal_220) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_224) .cse1)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:54:24,809 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_224 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| Int) (v_ArrVal_220 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| v_ArrVal_220) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_224) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)))) is different from false [2022-10-04 00:54:24,887 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_224 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| Int) (v_ArrVal_220 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| 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_54| v_ArrVal_220) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_224) .cse1))) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:54:24,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_224 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| Int) (v_ArrVal_220 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| 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) 1)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| v_ArrVal_220) |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_43|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_224) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:54:24,948 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_224 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| Int) (v_ArrVal_220 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| 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) 1)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| v_ArrVal_220) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_224) .cse1))) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:54:26,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:54:26,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5832 treesize of output 5710 [2022-10-04 00:54:26,375 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:54:26,376 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 6582 treesize of output 6330 [2022-10-04 00:54:26,417 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 7260 treesize of output 6748 [2022-10-04 00:54:27,287 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 38 treesize of output 30 [2022-10-04 00:54:27,301 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 38 treesize of output 30 [2022-10-04 00:54:27,409 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:54:27,409 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 349 treesize of output 329 [2022-10-04 00:54:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 264 proven. 114 refuted. 0 times theorem prover too weak. 6 trivial. 21 not checked. [2022-10-04 00:54:27,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692109408] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:54:27,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:54:27,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 29, 29] total 65 [2022-10-04 00:54:27,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968050342] [2022-10-04 00:54:27,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:54:27,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-10-04 00:54:27,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:54:27,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-10-04 00:54:27,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=3056, Unknown=96, NotChecked=714, Total=4160 [2022-10-04 00:54:27,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:27,974 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:54:27,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 17.96923076923077) internal successors, (1168), 65 states have internal predecessors, (1168), 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:54:27,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:27,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:54:27,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:29,826 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (<= (+ 4 |c_t1Thread1of1ForFork1_write~int_#sizeOfWrittenType#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= 400 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1)) (forall ((v_ArrVal_224 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| Int) (v_ArrVal_220 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse2 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| v_ArrVal_220) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_224) .cse3))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)))) (<= 1604 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (<= 1612 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= .cse1 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= 1612 (select |c_#length| |c_~#queue~0.base|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) 1) (= 400 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= 1612 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:54:29,871 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_224 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| Int) (v_ArrVal_220 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| v_ArrVal_220) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_224) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)))) (<= 1612 (select |c_#length| |c_~#queue~0.base|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:54:29,897 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| Int)) (or (forall ((v_ArrVal_224 Int) (v_ArrVal_220 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| v_ArrVal_220) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_224) .cse1)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| |c_~#stored_elements~0.base|)))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= 1612 (select |c_#length| |c_~#queue~0.base|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:54:30,199 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= |c_~#queue~0.offset| 0) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= 1612 (select |c_#length| |c_~#queue~0.base|)) (forall ((v_ArrVal_224 Int) (v_ArrVal_220 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_220) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_224) .cse1))) (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:54:32,977 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (+ 4 |c_t1Thread1of1ForFork1_write~int_#sizeOfWrittenType#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= 400 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1)) (forall ((v_ArrVal_224 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| Int) (v_ArrVal_220 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse2 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| v_ArrVal_220) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_224) .cse3))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)))) (<= 1604 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (<= 1612 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= .cse1 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= 1612 (select |c_#length| |c_~#queue~0.base|)) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) 1) (= 400 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|)) (<= 1612 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:54:33,381 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= |c_~#queue~0.offset| 0) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= 1612 (select |c_#length| |c_~#queue~0.base|)) (forall ((v_ArrVal_224 Int) (v_ArrVal_220 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_220) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_224) .cse1))) (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|))))) is different from false [2022-10-04 00:54:37,648 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((v_ArrVal_224 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (or (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (= 400 (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_224) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))))) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (<= 1612 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (<= 1612 (select |c_#length| |c_~#queue~0.base|)) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (or (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (forall ((v_ArrVal_224 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| Int) (v_ArrVal_220 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse1 (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) 1)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| v_ArrVal_220) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_224) .cse2))) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_54| |c_~#stored_elements~0.base|)))))) (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= 1612 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:54:46,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:46,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:54:46,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-10-04 00:54:46,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-04 00:54:46,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:54:46,864 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:54:46,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:54:46,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1305669419, now seen corresponding path program 1 times [2022-10-04 00:54:46,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:54:46,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655293195] [2022-10-04 00:54:46,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:54:46,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:54:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:54:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 44373 backedges. 6663 proven. 0 refuted. 0 times theorem prover too weak. 37710 trivial. 0 not checked. [2022-10-04 00:54:49,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:54:49,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655293195] [2022-10-04 00:54:49,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655293195] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:54:49,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:54:49,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-04 00:54:49,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445522656] [2022-10-04 00:54:49,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:54:49,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-04 00:54:49,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:54:49,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-04 00:54:49,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-04 00:54:49,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:49,972 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:54:49,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 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:54:49,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:49,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:54:49,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 144 states. [2022-10-04 00:54:49,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:54,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:54:54,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-10-04 00:54:54,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:54:54,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:54:54,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-04 00:54:54,210 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-10-04 00:54:54,210 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (4/4) [2022-10-04 00:54:54,212 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-04 00:54:54,212 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-04 00:54:54,215 INFO L202 PluginConnector]: Adding new model queue_ok_longer.line364.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:54:54 BasicIcfg [2022-10-04 00:54:54,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-04 00:54:54,216 INFO L158 Benchmark]: Toolchain (without parser) took 71250.22ms. Allocated memory was 201.3MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 152.7MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-10-04 00:54:54,216 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 156.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-04 00:54:54,216 INFO L158 Benchmark]: Boogie Preprocessor took 81.09ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 149.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-04 00:54:54,216 INFO L158 Benchmark]: RCFGBuilder took 664.06ms. Allocated memory is still 201.3MB. Free memory was 149.2MB in the beginning and 145.8MB in the end (delta: 3.4MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-10-04 00:54:54,216 INFO L158 Benchmark]: TraceAbstraction took 70498.18ms. Allocated memory was 201.3MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 145.0MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-10-04 00:54:54,217 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.31ms. Allocated memory is still 201.3MB. Free memory is still 156.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 81.09ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 149.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 664.06ms. Allocated memory is still 201.3MB. Free memory was 149.2MB in the beginning and 145.8MB in the end (delta: 3.4MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * TraceAbstraction took 70498.18ms. Allocated memory was 201.3MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 145.0MB in the beginning and 3.2GB in the end (delta: -3.1GB). 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: 1767, positive: 1673, positive conditional: 1673, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1767, positive: 1673, positive conditional: 1673, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1687, positive: 1673, positive conditional: 0, positive unconditional: 1673, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1651, positive: 1637, positive conditional: 0, positive unconditional: 1637, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1687, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1651, unknown conditional: 0, unknown unconditional: 1651] , Statistics on independence cache: Total cache size (in pairs): 1651, Positive cache size: 1637, Positive conditional cache size: 0, Positive unconditional cache size: 1637, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Independence queries for same thread: 80, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 55994, positive: 54555, positive conditional: 54555, positive unconditional: 0, negative: 1439, negative conditional: 1439, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 730350, positive: 716509, positive conditional: 716509, positive unconditional: 0, negative: 13841, negative conditional: 13841, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 717130, positive: 716509, positive conditional: 0, positive unconditional: 716509, negative: 621, negative conditional: 0, negative unconditional: 621, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 24143, positive: 24028, positive conditional: 0, positive unconditional: 24028, negative: 115, negative conditional: 0, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 717130, positive: 692481, positive conditional: 0, positive unconditional: 692481, negative: 506, negative conditional: 0, negative unconditional: 506, unknown: 24143, unknown conditional: 0, unknown unconditional: 24143] , Statistics on independence cache: Total cache size (in pairs): 5795, Positive cache size: 5782, Positive conditional cache size: 0, Positive unconditional cache size: 5782, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Independence queries for same thread: 1384, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 55663, positive: 54232, positive conditional: 54232, positive unconditional: 0, negative: 1431, negative conditional: 1431, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 730350, positive: 716509, positive conditional: 716509, positive unconditional: 0, negative: 13841, negative conditional: 13841, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 717130, positive: 716509, positive conditional: 0, positive unconditional: 716509, negative: 621, negative conditional: 0, negative unconditional: 621, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 24143, positive: 24028, positive conditional: 0, positive unconditional: 24028, negative: 115, negative conditional: 0, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 717130, positive: 692481, positive conditional: 0, positive unconditional: 692481, negative: 506, negative conditional: 0, negative unconditional: 506, unknown: 24143, unknown conditional: 0, unknown unconditional: 24143] , Statistics on independence cache: Total cache size (in pairs): 5795, Positive cache size: 5782, Positive conditional cache size: 0, Positive unconditional cache size: 5782, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Independence queries for same thread: 2760, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3732, positive: 3719, positive conditional: 3719, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 730350, positive: 716509, positive conditional: 716509, positive unconditional: 0, negative: 13841, negative conditional: 13841, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 717130, positive: 716509, positive conditional: 0, positive unconditional: 716509, negative: 621, negative conditional: 0, negative unconditional: 621, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 24143, positive: 24028, positive conditional: 0, positive unconditional: 24028, negative: 115, negative conditional: 0, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 717130, positive: 692481, positive conditional: 0, positive unconditional: 692481, negative: 506, negative conditional: 0, negative unconditional: 506, unknown: 24143, unknown conditional: 0, unknown unconditional: 24143] , Statistics on independence cache: Total cache size (in pairs): 6141, Positive cache size: 6127, Positive conditional cache size: 0, Positive unconditional cache size: 6127, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Independence queries for same thread: 2767, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 193794, positive: 192241, positive conditional: 192241, positive unconditional: 0, negative: 1553, negative conditional: 1553, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 730350, positive: 716509, positive conditional: 716509, positive unconditional: 0, negative: 13841, negative conditional: 13841, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 717130, positive: 716509, positive conditional: 0, positive unconditional: 716509, negative: 621, negative conditional: 0, negative unconditional: 621, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 24143, positive: 24028, positive conditional: 0, positive unconditional: 24028, negative: 115, negative conditional: 0, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 717130, positive: 692481, positive conditional: 0, positive unconditional: 692481, negative: 506, negative conditional: 0, negative unconditional: 506, unknown: 24143, unknown conditional: 0, unknown unconditional: 24143] , Statistics on independence cache: Total cache size (in pairs): 22954, Positive cache size: 22843, Positive conditional cache size: 0, Positive unconditional cache size: 22843, Negative cache size: 111, Negative conditional cache size: 0, Negative unconditional cache size: 111, Independence queries for same thread: 4060, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 421167, positive: 411762, positive conditional: 411762, positive unconditional: 0, negative: 9405, negative conditional: 9405, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 730350, positive: 716509, positive conditional: 716509, positive unconditional: 0, negative: 13841, negative conditional: 13841, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 717130, positive: 716509, positive conditional: 0, positive unconditional: 716509, negative: 621, negative conditional: 0, negative unconditional: 621, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 24143, positive: 24028, positive conditional: 0, positive unconditional: 24028, negative: 115, negative conditional: 0, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 717130, positive: 692481, positive conditional: 0, positive unconditional: 692481, negative: 506, negative conditional: 0, negative unconditional: 506, unknown: 24143, unknown conditional: 0, unknown unconditional: 24143] , Statistics on independence cache: Total cache size (in pairs): 24143, Positive cache size: 24028, Positive conditional cache size: 0, Positive unconditional cache size: 24028, Negative cache size: 115, Negative conditional cache size: 0, Negative unconditional cache size: 115, Independence queries for same thread: 13220, Statistics for Abstraction: - PositiveResult [Line: 364]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONASSERT with 2 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 69.8s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 25.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: 156, 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.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 42.5s InterpolantComputationTime, 6221 NumberOfCodeBlocks, 6221 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 6739 ConstructedInterpolants, 69 QuantifiedInterpolants, 20377 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1155 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 46588/46988 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:54:54,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2022-10-04 00:54:54,452 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:54:54,655 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:54:54,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2022-10-04 00:54:55,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...