/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.line384.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-09-30 06:13:50,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-30 06:13:50,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-30 06:13:50,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-30 06:13:50,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-30 06:13:50,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-30 06:13:50,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-30 06:13:50,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-30 06:13:50,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-30 06:13:50,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-30 06:13:50,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-30 06:13:50,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-30 06:13:50,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-30 06:13:50,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-30 06:13:50,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-30 06:13:50,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-30 06:13:50,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-30 06:13:50,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-30 06:13:50,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-30 06:13:50,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-30 06:13:50,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-30 06:13:50,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-30 06:13:50,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-30 06:13:50,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-30 06:13:50,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-30 06:13:50,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-30 06:13:50,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-30 06:13:50,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-30 06:13:50,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-30 06:13:50,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-30 06:13:50,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-30 06:13:50,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-30 06:13:50,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-30 06:13:50,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-30 06:13:50,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-30 06:13:50,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-30 06:13:50,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-30 06:13:50,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-30 06:13:50,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-30 06:13:50,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-30 06:13:50,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-30 06:13:50,715 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-30 06:13:50,738 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-30 06:13:50,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-30 06:13:50,739 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-30 06:13:50,739 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-30 06:13:50,740 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-30 06:13:50,740 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-30 06:13:50,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-30 06:13:50,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-30 06:13:50,741 INFO L138 SettingsManager]: * Use SBE=true [2022-09-30 06:13:50,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-30 06:13:50,741 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-30 06:13:50,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-30 06:13:50,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-30 06:13:50,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-30 06:13:50,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-30 06:13:50,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-30 06:13:50,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-30 06:13:50,742 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-30 06:13:50,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-30 06:13:50,743 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-30 06:13:50,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-30 06:13:50,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-30 06:13:50,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-30 06:13:50,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-30 06:13:50,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-30 06:13:50,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 06:13:50,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-30 06:13:50,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-30 06:13:50,745 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-30 06:13:50,745 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-30 06:13:50,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-30 06:13:50,745 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-30 06:13:50,745 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-30 06:13:50,745 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-30 06:13:50,745 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-30 06:13:50,745 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-30 06:13:50,746 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-30 06:13:50,746 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-30 06:13:50,746 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-09-30 06:13:50,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-30 06:13:51,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-30 06:13:51,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-30 06:13:51,019 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-30 06:13:51,020 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-30 06:13:51,021 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.line384.bpl [2022-09-30 06:13:51,022 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok.line384.bpl' [2022-09-30 06:13:51,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-30 06:13:51,078 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-30 06:13:51,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-30 06:13:51,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-30 06:13:51,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-30 06:13:51,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_ok.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:13:51" (1/1) ... [2022-09-30 06:13:51,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_ok.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:13:51" (1/1) ... [2022-09-30 06:13:51,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_ok.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:13:51" (1/1) ... [2022-09-30 06:13:51,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_ok.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:13:51" (1/1) ... [2022-09-30 06:13:51,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_ok.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:13:51" (1/1) ... [2022-09-30 06:13:51,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_ok.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:13:51" (1/1) ... [2022-09-30 06:13:51,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_ok.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:13:51" (1/1) ... [2022-09-30 06:13:51,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-30 06:13:51,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-30 06:13:51,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-30 06:13:51,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-30 06:13:51,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_ok.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:13:51" (1/1) ... [2022-09-30 06:13:51,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 06:13:51,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:13:51,227 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-09-30 06:13:51,229 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-09-30 06:13:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-09-30 06:13:51,258 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-09-30 06:13:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-09-30 06:13:51,258 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-09-30 06:13:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-30 06:13:51,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-30 06:13:51,260 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-30 06:13:51,403 INFO L234 CfgBuilder]: Building ICFG [2022-09-30 06:13:51,405 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-30 06:13:52,069 INFO L275 CfgBuilder]: Performing block encoding [2022-09-30 06:13:52,096 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-30 06:13:52,097 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-30 06:13:52,100 INFO L202 PluginConnector]: Adding new model queue_ok.line384.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 06:13:52 BoogieIcfgContainer [2022-09-30 06:13:52,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-30 06:13:52,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-30 06:13:52,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-30 06:13:52,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-30 06:13:52,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:13:51" (1/2) ... [2022-09-30 06:13:52,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178fd6a8 and model type queue_ok.line384.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 06:13:52, skipping insertion in model container [2022-09-30 06:13:52,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok.line384.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 06:13:52" (2/2) ... [2022-09-30 06:13:52,115 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.line384.bpl [2022-09-30 06:13:52,122 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-30 06:13:52,132 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-30 06:13:52,132 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-30 06:13:52,132 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-30 06:13:52,278 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-30 06:13:52,329 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:13:52,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:13:52,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:13:52,332 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-09-30 06:13:52,363 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-09-30 06:13:52,376 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:13:52,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-30 06:13:52,396 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;@38eaaac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:13:52,396 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:13:52,835 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-30 06:13:52,842 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:13:52,843 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-09-30 06:13:52,864 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:13:52,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:13:52,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:13:52,867 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-09-30 06:13:52,868 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-09-30 06:13:52,874 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:13:52,874 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-30 06:13:52,875 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;@38eaaac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:13:52,875 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:13:52,898 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-30 06:13:52,899 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:13:52,900 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-09-30 06:13:52,905 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:13:52,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:13:52,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:13:52,941 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-09-30 06:13:52,944 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-09-30 06:13:52,950 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:13:52,951 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-09-30 06:13:52,951 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;@38eaaac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:13:52,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:13:52,952 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-09-30 06:13:52,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-30 06:13:52,953 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:13:52,953 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-09-30 06:13:52,957 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:13:52,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:13:52,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:13:52,960 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-09-30 06:13:52,962 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-09-30 06:13:52,966 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:13:52,966 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-09-30 06:13:52,967 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;@38eaaac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:13:52,967 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:13:53,062 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:13:53,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:13:53,067 INFO L85 PathProgramCache]: Analyzing trace with hash 812657596, now seen corresponding path program 1 times [2022-09-30 06:13:53,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:13:53,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409037844] [2022-09-30 06:13:53,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:13:53,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:13:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:13:53,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:13:53,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:13:53,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409037844] [2022-09-30 06:13:53,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409037844] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:13:53,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:13:53,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-30 06:13:53,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267422655] [2022-09-30 06:13:53,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:13:53,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-30 06:13:53,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:13:53,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-30 06:13:53,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-30 06:13:53,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:13:53,542 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:13:53,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 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-09-30 06:13:53,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:13:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:13:53,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-30 06:13:53,581 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:13:53,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:13:53,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1025703088, now seen corresponding path program 1 times [2022-09-30 06:13:53,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:13:53,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183010905] [2022-09-30 06:13:53,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:13:53,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:13:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:13:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:13:55,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:13:55,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183010905] [2022-09-30 06:13:55,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183010905] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:13:55,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:13:55,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-09-30 06:13:55,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804802583] [2022-09-30 06:13:55,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:13:55,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-09-30 06:13:55,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:13:55,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-09-30 06:13:55,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2022-09-30 06:13:55,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:13:55,031 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:13:55,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.612903225806452) internal successors, (267), 31 states have internal predecessors, (267), 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-09-30 06:13:55,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:13:55,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:13:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:13:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:13:57,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-30 06:13:57,887 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:13:57,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:13:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2105235900, now seen corresponding path program 1 times [2022-09-30 06:13:57,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:13:57,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236901204] [2022-09-30 06:13:57,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:13:57,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:13:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:13:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:13:58,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:13:58,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236901204] [2022-09-30 06:13:58,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236901204] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:13:58,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:13:58,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-09-30 06:13:58,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541190039] [2022-09-30 06:13:58,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:13:58,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-09-30 06:13:58,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:13:58,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-09-30 06:13:58,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-09-30 06:13:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:13:58,362 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:13:58,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 18.533333333333335) internal successors, (278), 16 states have internal predecessors, (278), 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-09-30 06:13:58,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:13:58,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:13:58,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:13:59,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:13:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:13:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:13:59,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-30 06:13:59,034 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:13:59,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:13:59,035 INFO L85 PathProgramCache]: Analyzing trace with hash -427880057, now seen corresponding path program 1 times [2022-09-30 06:13:59,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:13:59,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498336460] [2022-09-30 06:13:59,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:13:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:13:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:14:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:14:15,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:14:15,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498336460] [2022-09-30 06:14:15,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498336460] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:14:15,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567784880] [2022-09-30 06:14:15,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:14:15,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:14:15,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:14:15,701 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-09-30 06:14:15,704 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-09-30 06:14:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:14:15,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 158 conjunts are in the unsatisfiable core [2022-09-30 06:14:15,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:14:16,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-30 06:14:16,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-30 06:14:16,766 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 06:14:16,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-30 06:14:16,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-09-30 06:14:17,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-30 06:14:17,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:14:17,918 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-09-30 06:14:18,932 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 06:14:18,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-09-30 06:14:18,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-09-30 06:14:20,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:14:20,839 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-30 06:14:20,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-09-30 06:14:21,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:14:21,439 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 33 treesize of output 32 [2022-09-30 06:14:23,214 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 53 treesize of output 31 [2022-09-30 06:14:23,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:14:23,748 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 38 treesize of output 38 [2022-09-30 06:14:24,956 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-30 06:14:24,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 43 [2022-09-30 06:14:25,222 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 06:14:25,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 27 [2022-09-30 06:14:25,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:14:25,517 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-09-30 06:14:25,620 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-09-30 06:14:25,751 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:14:25,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:14:51,375 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-09-30 06:14:51,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 112 [2022-09-30 06:14:51,395 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:14:51,396 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 160 treesize of output 160 [2022-09-30 06:14:51,407 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 70 treesize of output 62 [2022-09-30 06:14:51,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:14:51,418 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 85 treesize of output 73 [2022-09-30 06:14:51,463 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 5 treesize of output 3 [2022-09-30 06:14:51,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:14:51,578 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:14:51,579 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 116 treesize of output 112 [2022-09-30 06:14:53,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-09-30 06:14:53,952 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:14:53,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 58 [2022-09-30 06:14:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:14:54,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567784880] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:14:54,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:14:54,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 59, 60] total 178 [2022-09-30 06:14:54,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529899630] [2022-09-30 06:14:54,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:14:54,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 178 states [2022-09-30 06:14:54,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:14:54,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2022-09-30 06:14:54,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=29844, Unknown=473, NotChecked=0, Total=31506 [2022-09-30 06:14:54,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:14:54,292 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:14:54,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 178 states, 178 states have (on average 5.095505617977528) internal successors, (907), 178 states have internal predecessors, (907), 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-09-30 06:14:54,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:14:54,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:14:54,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:14:54,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:16:24,681 WARN L233 SmtUtils]: Spent 5.45s on a formula simplification. DAG size of input: 338 DAG size of output: 146 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:16:36,714 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 296 DAG size of output: 153 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:16:56,778 WARN L233 SmtUtils]: Spent 7.29s on a formula simplification. DAG size of input: 314 DAG size of output: 164 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:17:07,201 WARN L233 SmtUtils]: Spent 7.37s on a formula simplification. DAG size of input: 293 DAG size of output: 171 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:17:28,002 WARN L233 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 276 DAG size of output: 169 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:17:40,518 WARN L233 SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 201 DAG size of output: 169 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:18:06,078 WARN L233 SmtUtils]: Spent 15.58s on a formula simplification. DAG size of input: 226 DAG size of output: 181 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:18:45,978 WARN L233 SmtUtils]: Spent 20.39s on a formula simplification. DAG size of input: 286 DAG size of output: 176 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:19:18,548 WARN L233 SmtUtils]: Spent 22.52s on a formula simplification. DAG size of input: 304 DAG size of output: 180 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:19:59,962 WARN L233 SmtUtils]: Spent 25.54s on a formula simplification. DAG size of input: 314 DAG size of output: 183 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:20:30,999 WARN L233 SmtUtils]: Spent 26.39s on a formula simplification. DAG size of input: 319 DAG size of output: 185 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:20:57,218 WARN L233 SmtUtils]: Spent 20.27s on a formula simplification. DAG size of input: 243 DAG size of output: 182 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:20:59,354 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse14 (@diff .cse13 .cse0))) (let ((.cse54 (store .cse13 .cse14 0)) (.cse16 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|))) (let ((.cse37 (@diff .cse4 .cse0)) (.cse15 (@diff .cse16 .cse0)) (.cse28 (@diff .cse54 .cse0))) (let ((.cse53 (store .cse54 .cse28 0)) (.cse44 (store .cse16 .cse15 0)) (.cse52 (store .cse4 .cse37 0)) (.cse34 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (let ((.cse45 (@diff .cse34 .cse0)) (.cse42 (@diff .cse52 .cse0)) (.cse43 (@diff .cse44 .cse0)) (.cse20 (@diff .cse53 .cse0))) (let ((.cse51 (store .cse53 .cse20 0)) (.cse27 (store .cse44 .cse43 0)) (.cse50 (store .cse52 .cse42 0)) (.cse48 (store .cse34 .cse45 0))) (let ((.cse49 (@diff .cse48 .cse0)) (.cse3 (@diff .cse50 .cse0)) (.cse26 (@diff .cse27 .cse0)) (.cse18 (select |c_#memory_int| 7)) (.cse17 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse32 (@diff .cse51 .cse0))) (let ((.cse47 (store .cse51 .cse32 0)) (.cse46 (select .cse18 .cse17)) (.cse38 (store .cse27 .cse26 0)) (.cse29 (store .cse50 .cse3 0)) (.cse40 (select |c_#length| |c_~#queue~0.base|)) (.cse1 (store .cse48 .cse49 0)) (.cse35 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse35)) (.cse2 (@diff .cse1 .cse0)) (.cse12 (< .cse40 (+ 92 |c_~#queue~0.offset|))) (.cse33 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|)) (.cse30 (@diff .cse29 .cse0)) (.cse5 (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse19 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse31 (+ |c_ULTIMATE.start_init_~q#1.offset| 84)) (.cse39 (@diff .cse38 .cse0)) (.cse36 (<= .cse46 1)) (.cse41 (@diff .cse47 .cse0)) (.cse6 (<= .cse40 4)) (.cse8 (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)))) (and (not (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 0) (= .cse0 (store .cse1 .cse2 0)) (or (<= 88 .cse3) (<= .cse3 80) (<= (select .cse4 .cse3) 0)) (<= .cse5 4) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (= 84 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (or .cse6 (and (<= .cse7 0) .cse8)) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (or (forall ((v_ArrVal_147 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_145 Int) (v_ArrVal_151 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| Int)) (let ((.cse10 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| v_ArrVal_145) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse11 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (select .cse10 .cse11))) (or (= 20 .cse9) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse10 .cse11 (+ .cse9 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)))))) .cse12) (not (= .cse7 21)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (or (<= (select .cse13 .cse14) 0) (<= .cse14 80) (<= 88 .cse14)) (or (<= .cse15 80) (= .cse0 .cse16) (and (<= .cse15 .cse17) (<= (select .cse16 .cse15) 0)) (<= 88 .cse15)) (<= (select .cse18 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (or (<= .cse19 .cse20) (<= (select .cse13 .cse20) 0) (<= .cse20 80)) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (or .cse6 (and (<= .cse7 1) .cse8)) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (or (forall ((v_ArrVal_147 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int) (v_ArrVal_151 (Array Int Int)) (v_ArrVal_144 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| Int)) (let ((.cse22 (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_142)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_144))) (let ((.cse25 (select .cse22 |c_~#queue~0.base|))) (let ((.cse23 (store (store .cse25 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| v_ArrVal_145) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse24 (+ 84 |c_~#queue~0.offset|))) (let ((.cse21 (select .cse23 .cse24))) (or (= .cse21 20) (< (select (select (store (store .cse22 |c_~#queue~0.base| (store .cse23 .cse24 (+ .cse21 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) .cse24) 20) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)) (< (+ (* (select .cse25 .cse24) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)))))))) .cse12) (or (and (<= (select .cse16 .cse26) 0) (<= .cse26 .cse17)) (<= 88 .cse26) (= .cse0 .cse27) (<= .cse26 80)) (or (<= (select .cse13 .cse28) 0) (<= 88 .cse28) (<= .cse28 80)) (= .cse0 (store .cse29 .cse30 0)) (or (<= 88 .cse2) (= .cse0 .cse1) (<= .cse2 80)) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) .cse31) 0) (or (<= (select .cse13 .cse32) 0) (<= 88 .cse32) (<= .cse32 80)) (<= .cse33 1) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_151 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_read~int_#value#1| 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)))) .cse12) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse34 .cse35) 0) (or (and .cse8 .cse36) (<= (select |c_#length| 7) 4)) (or (forall ((v_ArrVal_152 Int)) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_152) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20)) (< (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 92 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (= (select .cse13 84) 20)) (= 7 |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) (<= .cse33 0) (<= .cse19 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (or (<= .cse30 80) (<= 88 .cse30) (<= (select .cse4 .cse30) 0)) (or (<= .cse37 80) (<= 88 .cse37) (<= (select .cse4 .cse37) 0)) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (not (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= 7 |c_~#queue~0.base|) (<= (select |c_#length| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 4) (= .cse0 (store .cse38 .cse39 0)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (or (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_139 Int)) (or (< (select (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_139) |c_~#queue~0.base|) (+ 92 |c_~#queue~0.offset|)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)))))) (not (= .cse40 .cse5)) (or (<= .cse19 .cse41) (<= .cse41 80) (<= (select .cse13 .cse41) 0)) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (or (<= 88 .cse42) (<= .cse42 80) (<= (select .cse4 .cse42) 0)) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|) .cse31) 0) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| .cse17) (or (<= .cse43 80) (<= 88 .cse43) (and (<= (select .cse16 .cse43) 0) (<= .cse43 .cse17)) (= .cse0 .cse44)) (or (and (<= (select .cse16 .cse39) 0) (<= .cse39 .cse17)) (= .cse0 .cse38) (<= 88 .cse39) (<= .cse39 80)) (or (<= 88 .cse45) (= .cse0 .cse34) (<= .cse45 80)) (not (= .cse46 21)) .cse36 (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (= .cse0 (store .cse47 .cse41 0)) (not (= (select .cse13 .cse17) 20)) (or (= .cse0 .cse48) (<= 88 .cse49) (<= .cse49 80)) (<= |c_~#stored_elements~0.base| 6) (or .cse6 (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse35) 0) .cse8)) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| 7) .cse17) 1)))))))))))) is different from true [2022-09-30 06:21:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:21:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:21:14,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:21:14,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-09-30 06:21:14,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-09-30 06:21:14,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:21:14,436 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:21:14,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:21:14,437 INFO L85 PathProgramCache]: Analyzing trace with hash -105076603, now seen corresponding path program 1 times [2022-09-30 06:21:14,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:21:14,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375720304] [2022-09-30 06:21:14,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:21:14,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:21:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:21:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:21:14,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:21:14,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375720304] [2022-09-30 06:21:14,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375720304] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:21:14,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701162602] [2022-09-30 06:21:14,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:21:14,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:21:14,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:21:14,982 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:21:14,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-09-30 06:21:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:21:15,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 53 conjunts are in the unsatisfiable core [2022-09-30 06:21:15,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:21:15,764 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-30 06:21:15,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-09-30 06:21:15,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-09-30 06:21:16,083 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 06:21:16,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-30 06:21:16,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-09-30 06:21:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:21:19,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:21:27,070 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:21:27,070 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 48 treesize of output 52 [2022-09-30 06:21:27,216 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:21:27,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 118 [2022-09-30 06:21:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:21:27,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701162602] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:21:27,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:21:27,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24, 14] total 51 [2022-09-30 06:21:27,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090795182] [2022-09-30 06:21:27,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:21:27,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-09-30 06:21:27,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:21:27,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-09-30 06:21:27,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2370, Unknown=0, NotChecked=0, Total=2652 [2022-09-30 06:21:27,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:21:27,442 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:21:27,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 19.45098039215686) internal successors, (992), 52 states have internal predecessors, (992), 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-09-30 06:21:27,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:21:27,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:21:27,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:21:27,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 89 states. [2022-09-30 06:21:27,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:21:30,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:21:30,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:21:30,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:21:30,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-09-30 06:21:30,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-30 06:21:30,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-09-30 06:21:30,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:21:30,400 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:21:30,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:21:30,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1802644901, now seen corresponding path program 2 times [2022-09-30 06:21:30,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:21:30,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907309019] [2022-09-30 06:21:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:21:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:21:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:21:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 216 proven. 183 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-09-30 06:21:31,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:21:31,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907309019] [2022-09-30 06:21:31,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907309019] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:21:31,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529562193] [2022-09-30 06:21:31,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-30 06:21:31,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:21:31,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:21:31,223 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:21:31,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-09-30 06:21:31,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-30 06:21:31,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-30 06:21:31,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 56 conjunts are in the unsatisfiable core [2022-09-30 06:21:31,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:21:32,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-30 06:21:32,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:21:32,850 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-09-30 06:21:33,189 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-30 06:21:33,190 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-09-30 06:21:33,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:21:33,319 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-09-30 06:21:33,374 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-09-30 06:21:33,430 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 150 proven. 183 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-09-30 06:21:33,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:21:58,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| Int) (v_ArrVal_325 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_58|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| v_ArrVal_325) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20))) is different from false [2022-09-30 06:22:03,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_321) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-09-30 06:22:03,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| Int)) (or (forall ((v_ArrVal_321 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| v_ArrVal_321) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 06:22:03,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| v_ArrVal_321) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 06:22:03,564 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:22:03,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-09-30 06:22:03,574 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:22:03,575 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 34 treesize of output 37 [2022-09-30 06:22:03,580 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 11 treesize of output 7 [2022-09-30 06:22:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 134 proven. 161 refuted. 0 times theorem prover too weak. 104 trivial. 38 not checked. [2022-09-30 06:22:04,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529562193] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:22:04,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:22:04,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 22] total 64 [2022-09-30 06:22:04,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708205537] [2022-09-30 06:22:04,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:22:04,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-09-30 06:22:04,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:22:04,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-09-30 06:22:04,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=3295, Unknown=38, NotChecked=476, Total=4032 [2022-09-30 06:22:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:04,424 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:22:04,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 18.78125) internal successors, (1202), 64 states have internal predecessors, (1202), 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-09-30 06:22:04,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:04,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:22:04,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:22:04,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-09-30 06:22:04,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-30 06:22:04,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:05,214 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (<= (select .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) 1) (= (select .cse0 84) 1) (= 84 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (forall ((v_ArrVal_321 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| v_ArrVal_321) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| |c_~#stored_elements~0.base|)))) (= (select .cse1 84) 1) (<= (select .cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 1) (= .cse3 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select .cse1 .cse3) 1) (= (select .cse2 84) 1) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-09-30 06:22:05,219 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_321 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| v_ArrVal_321) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| |c_~#stored_elements~0.base|)))) (= (select .cse0 84) 1) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 06:22:05,225 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| Int)) (or (forall ((v_ArrVal_321 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| v_ArrVal_321) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| |c_~#stored_elements~0.base|)))) (= (select .cse0 84) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 06:22:05,976 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (<= (select .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) 1) (= (select .cse0 84) 1) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= (select .cse1 .cse2) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| Int) (v_ArrVal_325 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_58|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| v_ArrVal_325) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20))) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (= (select .cse3 84) 1) (<= (select .cse4 .cse5) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (<= (select .cse3 .cse2) 1) (not (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|)) (= (select .cse1 84) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| .cse5) (= (select .cse4 84) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-09-30 06:22:06,386 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| Int) (v_ArrVal_325 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_58|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| v_ArrVal_325) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20))) (<= (select .cse0 .cse1) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| .cse1) (= (select .cse0 84) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-09-30 06:22:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:22:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:22:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-09-30 06:22:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-30 06:22:07,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-30 06:22:07,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-09-30 06:22:07,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:22:07,578 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:22:07,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:22:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1137798567, now seen corresponding path program 3 times [2022-09-30 06:22:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:22:07,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551451843] [2022-09-30 06:22:07,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:22:07,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:22:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:22:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 257 proven. 202 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-09-30 06:22:10,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:22:10,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551451843] [2022-09-30 06:22:10,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551451843] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:22:10,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363016876] [2022-09-30 06:22:10,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-30 06:22:10,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:22:10,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:22:10,933 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:22:10,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-09-30 06:22:11,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-09-30 06:22:11,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-30 06:22:11,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 33 conjunts are in the unsatisfiable core [2022-09-30 06:22:11,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:22:11,559 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-30 06:22:11,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-09-30 06:22:11,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-09-30 06:22:11,822 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-09-30 06:22:11,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-09-30 06:22:11,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-09-30 06:22:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 247 proven. 3 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-09-30 06:22:14,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:22:16,323 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:22:16,323 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 58 treesize of output 62 [2022-09-30 06:22:16,597 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:22:16,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 64 treesize of output 218 [2022-09-30 06:22:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-09-30 06:22:17,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363016876] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:22:17,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:22:17,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 18, 18] total 106 [2022-09-30 06:22:17,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592380366] [2022-09-30 06:22:17,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:22:17,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2022-09-30 06:22:17,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:22:17,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2022-09-30 06:22:17,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=10587, Unknown=0, NotChecked=0, Total=11130 [2022-09-30 06:22:17,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:17,362 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:22:17,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 11.31132075471698) internal successors, (1199), 106 states have internal predecessors, (1199), 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-09-30 06:22:17,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:17,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:22:17,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:22:17,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-09-30 06:22:17,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-30 06:22:17,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-30 06:22:17,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Received shutdown request... [2022-09-30 06:26:05,132 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:26:05,132 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:26:05,132 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:26:05,132 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:26:05,138 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:26:05,139 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:26:05,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-09-30 06:26:05,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-09-30 06:26:05,332 WARN L619 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2022-09-30 06:26:05,333 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-30 06:26:05,334 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-09-30 06:26:05,334 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was TIMEOUT (4/4) [2022-09-30 06:26:05,337 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-30 06:26:05,337 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-30 06:26:05,340 INFO L202 PluginConnector]: Adding new model queue_ok.line384.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 06:26:05 BasicIcfg [2022-09-30 06:26:05,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-30 06:26:05,341 INFO L158 Benchmark]: Toolchain (without parser) took 734263.57ms. Allocated memory was 175.1MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 134.3MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-09-30 06:26:05,341 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 175.1MB. Free memory was 137.8MB in the beginning and 137.7MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-30 06:26:05,342 INFO L158 Benchmark]: Boogie Preprocessor took 108.78ms. Allocated memory is still 175.1MB. Free memory was 134.2MB in the beginning and 130.8MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-30 06:26:05,342 INFO L158 Benchmark]: RCFGBuilder took 909.83ms. Allocated memory is still 175.1MB. Free memory was 130.7MB in the beginning and 135.9MB in the end (delta: -5.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-09-30 06:26:05,342 INFO L158 Benchmark]: TraceAbstraction took 733235.53ms. Allocated memory was 175.1MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 135.1MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-09-30 06:26:05,346 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.19ms. Allocated memory is still 175.1MB. Free memory was 137.8MB in the beginning and 137.7MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 108.78ms. Allocated memory is still 175.1MB. Free memory was 134.2MB in the beginning and 130.8MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 909.83ms. Allocated memory is still 175.1MB. Free memory was 130.7MB in the beginning and 135.9MB in the end (delta: -5.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 733235.53ms. Allocated memory was 175.1MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 135.1MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1768, positive: 1674, positive conditional: 1674, 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: 1768, positive: 1674, positive conditional: 1674, 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: 1688, positive: 1674, positive conditional: 0, positive unconditional: 1674, 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: 1688, positive: 37, positive conditional: 0, positive unconditional: 37, 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: 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: 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: 97, positive: 91, positive conditional: 91, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5905819, positive: 5750139, positive conditional: 5750139, positive unconditional: 0, negative: 155680, negative conditional: 155680, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5772203, positive: 5750139, positive conditional: 0, positive unconditional: 5750139, negative: 22064, negative conditional: 0, negative unconditional: 22064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21615, positive: 21486, positive conditional: 0, positive unconditional: 21486, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5772203, positive: 5728653, positive conditional: 0, positive unconditional: 5728653, negative: 21935, negative conditional: 0, negative unconditional: 21935, unknown: 21615, unknown conditional: 0, unknown unconditional: 21615] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 6, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 95, positive: 91, positive conditional: 91, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5905819, positive: 5750139, positive conditional: 5750139, positive unconditional: 0, negative: 155680, negative conditional: 155680, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5772203, positive: 5750139, positive conditional: 0, positive unconditional: 5750139, negative: 22064, negative conditional: 0, negative unconditional: 22064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21615, positive: 21486, positive conditional: 0, positive unconditional: 21486, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5772203, positive: 5728653, positive conditional: 0, positive unconditional: 5728653, negative: 21935, negative conditional: 0, negative unconditional: 21935, unknown: 21615, unknown conditional: 0, unknown unconditional: 21615] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 10, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 106, positive: 102, positive conditional: 102, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5905819, positive: 5750139, positive conditional: 5750139, positive unconditional: 0, negative: 155680, negative conditional: 155680, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5772203, positive: 5750139, positive conditional: 0, positive unconditional: 5750139, negative: 22064, negative conditional: 0, negative unconditional: 22064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21615, positive: 21486, positive conditional: 0, positive unconditional: 21486, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5772203, positive: 5728653, positive conditional: 0, positive unconditional: 5728653, negative: 21935, negative conditional: 0, negative unconditional: 21935, unknown: 21615, unknown conditional: 0, unknown unconditional: 21615] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 14, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 191, positive: 185, positive conditional: 185, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5905819, positive: 5750139, positive conditional: 5750139, positive unconditional: 0, negative: 155680, negative conditional: 155680, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5772203, positive: 5750139, positive conditional: 0, positive unconditional: 5750139, negative: 22064, negative conditional: 0, negative unconditional: 22064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21615, positive: 21486, positive conditional: 0, positive unconditional: 21486, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5772203, positive: 5728653, positive conditional: 0, positive unconditional: 5728653, negative: 21935, negative conditional: 0, negative unconditional: 21935, unknown: 21615, unknown conditional: 0, unknown unconditional: 21615] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 20, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 202, positive: 196, positive conditional: 196, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5905819, positive: 5750139, positive conditional: 5750139, positive unconditional: 0, negative: 155680, negative conditional: 155680, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5772203, positive: 5750139, positive conditional: 0, positive unconditional: 5750139, negative: 22064, negative conditional: 0, negative unconditional: 22064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21615, positive: 21486, positive conditional: 0, positive unconditional: 21486, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5772203, positive: 5728653, positive conditional: 0, positive unconditional: 5728653, negative: 21935, negative conditional: 0, negative unconditional: 21935, unknown: 21615, unknown conditional: 0, unknown unconditional: 21615] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 210, Positive conditional cache size: 0, Positive unconditional cache size: 210, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 26, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 372, positive: 362, positive conditional: 362, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5905819, positive: 5750139, positive conditional: 5750139, positive unconditional: 0, negative: 155680, negative conditional: 155680, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5772203, positive: 5750139, positive conditional: 0, positive unconditional: 5750139, negative: 22064, negative conditional: 0, negative unconditional: 22064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21615, positive: 21486, positive conditional: 0, positive unconditional: 21486, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5772203, positive: 5728653, positive conditional: 0, positive unconditional: 5728653, negative: 21935, negative conditional: 0, negative unconditional: 21935, unknown: 21615, unknown conditional: 0, unknown unconditional: 21615] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 215, Positive conditional cache size: 0, Positive unconditional cache size: 215, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 36, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 383, positive: 373, positive conditional: 373, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5905819, positive: 5750139, positive conditional: 5750139, positive unconditional: 0, negative: 155680, negative conditional: 155680, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5772203, positive: 5750139, positive conditional: 0, positive unconditional: 5750139, negative: 22064, negative conditional: 0, negative unconditional: 22064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21615, positive: 21486, positive conditional: 0, positive unconditional: 21486, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5772203, positive: 5728653, positive conditional: 0, positive unconditional: 5728653, negative: 21935, negative conditional: 0, negative unconditional: 21935, unknown: 21615, unknown conditional: 0, unknown unconditional: 21615] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 215, Positive conditional cache size: 0, Positive unconditional cache size: 215, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 46, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5904373, positive: 5748739, positive conditional: 5748739, positive unconditional: 0, negative: 155634, negative conditional: 155634, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5905819, positive: 5750139, positive conditional: 5750139, positive unconditional: 0, negative: 155680, negative conditional: 155680, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5772203, positive: 5750139, positive conditional: 0, positive unconditional: 5750139, negative: 22064, negative conditional: 0, negative unconditional: 22064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21615, positive: 21486, positive conditional: 0, positive unconditional: 21486, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5772203, positive: 5728653, positive conditional: 0, positive unconditional: 5728653, negative: 21935, negative conditional: 0, negative unconditional: 21935, unknown: 21615, unknown conditional: 0, unknown unconditional: 21615] , Statistics on independence cache: Total cache size (in pairs): 21615, Positive cache size: 21486, Positive conditional cache size: 0, Positive unconditional cache size: 21486, Negative cache size: 129, Negative conditional cache size: 0, Negative unconditional cache size: 129, Independence queries for same thread: 133616, Statistics for Abstraction: - TimeoutResultAtElement [Line: 384]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing DepthFirstTraversal. - 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.5s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.4s, 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.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 5 procedures, 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: 732.4s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 617.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: 512, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 112.2s InterpolantComputationTime, 4422 NumberOfCodeBlocks, 4238 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 6211 ConstructedInterpolants, 455 QuantifiedInterpolants, 132334 SizeOfPredicates, 216 NumberOfNonLiveVariables, 3546 ConjunctsInSsa, 300 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 1722/3159 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown