/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/divinefifo_1w1r.line471.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:56:13,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:56:13,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:56:13,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:56:13,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:56:13,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:56:13,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:56:13,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:56:13,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:56:13,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:56:13,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:56:13,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:56:13,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:56:13,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:56:13,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:56:13,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:56:13,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:56:13,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:56:13,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:56:13,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:56:13,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:56:13,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:56:13,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:56:13,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:56:13,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:56:13,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:56:13,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:56:13,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:56:13,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:56:13,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:56:13,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:56:13,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:56:13,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:56:13,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:56:13,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:56:13,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:56:13,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:56:13,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:56:13,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:56:13,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:56:13,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:56:13,757 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 15:56:13,774 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:56:13,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:56:13,775 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:56:13,775 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:56:13,776 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:56:13,776 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:56:13,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:56:13,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:56:13,777 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:56:13,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:56:13,777 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:56:13,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:56:13,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:56:13,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:56:13,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:56:13,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:56:13,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:56:13,778 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:56:13,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:56:13,778 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:56:13,778 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:56:13,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:56:13,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:56:13,779 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:56:13,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:56:13,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:56:13,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:56:13,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:56:13,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:56:13,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:56:13,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:56:13,780 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:56:13,780 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:56:13,780 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:56:13,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:56:13,780 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:56:13,781 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:56:13,781 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:56:13,781 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-03 15:56:13,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:56:13,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:56:13,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:56:13,981 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:56:13,984 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:56:13,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line471.bpl [2022-10-03 15:56:13,985 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line471.bpl' [2022-10-03 15:56:14,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:56:14,056 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:56:14,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:56:14,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:56:14,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:56:14,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:56:14" (1/1) ... [2022-10-03 15:56:14,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:56:14" (1/1) ... [2022-10-03 15:56:14,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:56:14" (1/1) ... [2022-10-03 15:56:14,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:56:14" (1/1) ... [2022-10-03 15:56:14,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:56:14" (1/1) ... [2022-10-03 15:56:14,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:56:14" (1/1) ... [2022-10-03 15:56:14,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:56:14" (1/1) ... [2022-10-03 15:56:14,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:56:14,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:56:14,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:56:14,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:56:14,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:56:14" (1/1) ... [2022-10-03 15:56:14,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:56:14,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:56:14,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-03 15:56:14,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-03 15:56:14,262 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:56:14,262 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:56:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:56:14,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:56:14,264 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 15:56:14,400 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:56:14,401 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:56:15,242 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:56:15,266 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:56:15,266 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:56:15,272 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:56:15 BoogieIcfgContainer [2022-10-03 15:56:15,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:56:15,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:56:15,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:56:15,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:56:15,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:56:14" (1/2) ... [2022-10-03 15:56:15,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f75aeb9 and model type divinefifo_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:56:15, skipping insertion in model container [2022-10-03 15:56:15,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:56:15" (2/2) ... [2022-10-03 15:56:15,284 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line471.bpl [2022-10-03 15:56:15,292 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:56:15,300 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:56:15,301 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:56:15,301 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:56:15,424 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:56:15,478 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:56:15,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:56:15,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:56:15,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 15:56:15,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-03 15:56:15,529 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:56:15,540 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == pusherErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:56:15,546 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;@402d612c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:56:15,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:56:15,549 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-03 15:56:15,551 INFO L805 garLoopResultBuilder]: Registering result SAFE for location pusherErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 15:56:15,561 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-03 15:56:15,564 INFO L307 ceAbstractionStarter]: Result for error location pusherErr0ASSERT_VIOLATIONASSERT was SAFE (1/3) [2022-10-03 15:56:15,578 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:56:15,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:56:15,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:56:15,581 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 15:56:15,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-10-03 15:56:15,585 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:56:15,586 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-03 15:56:15,586 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;@402d612c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:56:15,586 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:56:15,658 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-03 15:56:15,660 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-03 15:56:15,663 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/3) [2022-10-03 15:56:15,685 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:56:15,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:56:15,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:56:15,720 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 15:56:15,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-10-03 15:56:15,724 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:56:15,724 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == pusherErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:56:15,725 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;@402d612c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:56:15,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:56:15,889 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:56:15,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:56:15,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1113536118, now seen corresponding path program 1 times [2022-10-03 15:56:15,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:56:15,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882688092] [2022-10-03 15:56:15,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:56:15,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:56:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:56:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:56:16,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:56:16,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882688092] [2022-10-03 15:56:16,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882688092] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:56:16,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:56:16,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:56:16,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518438986] [2022-10-03 15:56:16,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:56:16,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:56:16,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:56:16,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:56:16,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:56:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:56:16,249 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:56:16,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 192.5) internal successors, (385), 2 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:56:16,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:56:16,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:56:16,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:56:16,297 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:56:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:56:16,297 INFO L85 PathProgramCache]: Analyzing trace with hash -902290630, now seen corresponding path program 1 times [2022-10-03 15:56:16,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:56:16,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012793798] [2022-10-03 15:56:16,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:56:16,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:56:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:56:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:56:16,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:56:16,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012793798] [2022-10-03 15:56:16,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012793798] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:56:16,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:56:16,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-03 15:56:16,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024451729] [2022-10-03 15:56:16,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:56:16,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-03 15:56:16,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:56:16,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-03 15:56:16,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-03 15:56:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:56:16,548 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:56:16,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 76.8) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:56:16,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:56:16,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:56:20,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:56:20,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 15:56:20,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:56:20,063 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:56:20,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:56:20,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1490259691, now seen corresponding path program 1 times [2022-10-03 15:56:20,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:56:20,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241945613] [2022-10-03 15:56:20,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:56:20,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:56:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:56:24,094 INFO L134 CoverageAnalysis]: Checked inductivity of 15029 backedges. 0 proven. 7579 refuted. 0 times theorem prover too weak. 7450 trivial. 0 not checked. [2022-10-03 15:56:24,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:56:24,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241945613] [2022-10-03 15:56:24,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241945613] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:56:24,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822522870] [2022-10-03 15:56:24,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:56:24,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:56:24,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:56:24,098 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:56:24,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-03 15:56:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:56:25,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 9978 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-03 15:56:25,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:56:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 15029 backedges. 11164 proven. 0 refuted. 0 times theorem prover too weak. 3865 trivial. 0 not checked. [2022-10-03 15:56:27,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:56:27,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822522870] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:56:27,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:56:27,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2022-10-03 15:56:27,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395917515] [2022-10-03 15:56:27,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:56:27,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-03 15:56:27,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:56:27,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-03 15:56:27,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2022-10-03 15:56:27,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:56:27,396 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:56:27,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 233.4) internal successors, (2334), 10 states have internal predecessors, (2334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:56:27,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:56:27,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-03 15:56:27,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:56:28,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:56:28,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 15:56:28,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:56:28,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-10-03 15:56:28,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:56:28,541 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:56:28,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:56:28,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1335978007, now seen corresponding path program 1 times [2022-10-03 15:56:28,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:56:28,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762738607] [2022-10-03 15:56:28,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:56:28,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:56:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:57:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3285 backedges. 1348 proven. 1409 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2022-10-03 15:57:01,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:57:01,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762738607] [2022-10-03 15:57:01,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762738607] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:57:01,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197391373] [2022-10-03 15:57:01,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:57:01,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:57:01,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:57:01,135 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:57:01,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-03 15:57:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:57:02,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 4386 conjuncts, 352 conjunts are in the unsatisfiable core [2022-10-03 15:57:02,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:57:05,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:57:05,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:57:07,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:57:08,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:57:08,991 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 25 treesize of output 24 [2022-10-03 15:57:09,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:57:10,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:57:10,018 INFO L356 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2022-10-03 15:57:10,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-10-03 15:57:10,034 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-03 15:57:10,035 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 21 treesize of output 20 [2022-10-03 15:57:10,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:57:11,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:57:11,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:57:11,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-10-03 15:57:11,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:57:11,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-03 15:57:13,668 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-10-03 15:57:13,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 39 [2022-10-03 15:57:13,674 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 27 treesize of output 15 [2022-10-03 15:57:13,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:57:13,686 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-03 15:57:13,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2022-10-03 15:57:15,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:57:15,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:57:15,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2022-10-03 15:57:17,270 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 20 treesize of output 8 [2022-10-03 15:57:18,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:57:18,349 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 15:57:18,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 36 [2022-10-03 15:57:18,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-03 15:57:19,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:57:19,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:57:19,144 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 31 treesize of output 30 [2022-10-03 15:57:20,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:57:20,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2022-10-03 15:57:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3285 backedges. 1777 proven. 82 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2022-10-03 15:57:22,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:57:24,657 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 124 treesize of output 118 [2022-10-03 15:57:50,270 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2242 (Array Int Int))) (not (let ((.cse1 (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2242))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse0 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse0 (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse0)))))) (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_ArrVal_2242 (Array Int Int)) (v_arrayElimCell_21 Int)) (not (let ((.cse4 (let ((.cse5 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2242))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse3 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse3 (select (select .cse4 v_arrayElimCell_21) .cse3)))))))) is different from false [2022-10-03 15:57:50,315 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_ArrVal_2242 (Array Int Int)) (v_arrayElimCell_21 Int)) (not (let ((.cse1 (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2242))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse0 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse0 (select (select .cse1 v_arrayElimCell_21) .cse0))))))) (forall ((v_ArrVal_2242 (Array Int Int))) (not (let ((.cse4 (let ((.cse5 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2242))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse3 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse3 (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse3))))))) is different from false [2022-10-03 15:57:50,336 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_ArrVal_2242 (Array Int Int)) (v_arrayElimCell_21 Int)) (not (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2242))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse0 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse0 (select (select .cse1 v_arrayElimCell_21) .cse0))))))) (forall ((v_ArrVal_2242 (Array Int Int))) (not (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2242))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse3 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse3 (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse3))))))) is different from false [2022-10-03 15:57:50,358 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2242 (Array Int Int))) (not (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_2242))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse0 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse0 (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse0)))))) (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_ArrVal_2242 (Array Int Int)) (v_arrayElimCell_21 Int)) (not (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_2242))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse3 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse3 (select (select .cse4 v_arrayElimCell_21) .cse3)))))))) is different from false [2022-10-03 15:57:50,374 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2242 (Array Int Int))) (not (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_2242))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse0 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse0 (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse0)))))) (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_ArrVal_2242 (Array Int Int)) (v_arrayElimCell_21 Int)) (not (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_2242))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse3 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse3 (select (select .cse4 v_arrayElimCell_21) .cse3)))))))) is different from false [2022-10-03 15:57:50,415 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_ArrVal_2242 (Array Int Int)) (v_arrayElimCell_21 Int)) (not (let ((.cse1 (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3) v_ArrVal_2242))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse0 (+ 12 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (<= .cse0 (select (select .cse1 v_arrayElimCell_21) .cse0))))))) (forall ((v_ArrVal_2242 (Array Int Int))) (not (let ((.cse5 (let ((.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_2242))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse4 (+ 12 (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (<= .cse4 (select (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse4))))))) is different from false [2022-10-03 15:57:50,850 WARN L833 $PredicateComparison]: unable to prove that (or (and (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_ArrVal_2242 (Array Int Int)) (v_arrayElimCell_21 Int)) (not (let ((.cse1 (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3) v_ArrVal_2242))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse0 (+ 12 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (<= .cse0 (select (select .cse1 v_arrayElimCell_21) .cse0))))))) (forall ((v_ArrVal_2242 (Array Int Int))) (not (let ((.cse5 (let ((.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_2242))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse4 (+ 12 (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (<= .cse4 (select (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse4))))))) (and (= |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base|))) is different from false [2022-10-03 15:59:17,509 WARN L233 SmtUtils]: Spent 25.82s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 16:00:30,930 WARN L233 SmtUtils]: Spent 27.67s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 16:02:25,573 WARN L233 SmtUtils]: Spent 6.35s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 16:02:52,753 WARN L233 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 16:03:27,005 WARN L233 SmtUtils]: Spent 7.16s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 16:04:03,149 WARN L233 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 16:05:00,360 WARN L233 SmtUtils]: Spent 7.42s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 16:05:44,632 WARN L233 SmtUtils]: Spent 10.85s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 16:08:07,854 WARN L233 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-10-03 16:10:31,951 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 16:10:31,951 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 16:10:31,951 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 16:10:31,951 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 16:10:31,951 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 16:10:32,124 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location pusherErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 16:10:32,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-03 16:10:32,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 16:10:32,325 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1581 with TraceHistMax 7,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 324 known predicates. [2022-10-03 16:10:32,326 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-10-03 16:10:32,327 INFO L307 ceAbstractionStarter]: Result for error location pusherErr0ASSERT_VIOLATIONASSERT was TIMEOUT (3/3) [2022-10-03 16:10:32,329 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 16:10:32,329 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 16:10:32,331 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 04:10:32 BasicIcfg [2022-10-03 16:10:32,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 16:10:32,332 INFO L158 Benchmark]: Toolchain (without parser) took 858275.53ms. Allocated memory was 225.4MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 176.7MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-10-03 16:10:32,332 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 225.4MB. Free memory is still 182.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 16:10:32,332 INFO L158 Benchmark]: Boogie Preprocessor took 116.72ms. Allocated memory is still 225.4MB. Free memory was 176.7MB in the beginning and 169.8MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 16:10:32,333 INFO L158 Benchmark]: RCFGBuilder took 1089.10ms. Allocated memory was 225.4MB in the beginning and 298.8MB in the end (delta: 73.4MB). Free memory was 169.8MB in the beginning and 244.8MB in the end (delta: -74.9MB). Peak memory consumption was 36.5MB. Max. memory is 8.0GB. [2022-10-03 16:10:32,333 INFO L158 Benchmark]: TraceAbstraction took 857056.59ms. Allocated memory was 298.8MB in the beginning and 4.1GB in the end (delta: 3.8GB). Free memory was 244.2MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-10-03 16:10:32,333 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.12ms. Allocated memory is still 225.4MB. Free memory is still 182.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 116.72ms. Allocated memory is still 225.4MB. Free memory was 176.7MB in the beginning and 169.8MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1089.10ms. Allocated memory was 225.4MB in the beginning and 298.8MB in the end (delta: 73.4MB). Free memory was 169.8MB in the beginning and 244.8MB in the end (delta: -74.9MB). Peak memory consumption was 36.5MB. Max. memory is 8.0GB. * TraceAbstraction took 857056.59ms. Allocated memory was 298.8MB in the beginning and 4.1GB in the end (delta: 3.8GB). Free memory was 244.2MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 163, positive: 156, positive conditional: 156, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 95268, positive: 92380, positive conditional: 92380, positive unconditional: 0, negative: 2888, negative conditional: 2888, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92703, positive: 92380, positive conditional: 0, positive unconditional: 92380, negative: 323, negative conditional: 0, negative unconditional: 323, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 42095, positive: 41933, positive conditional: 0, positive unconditional: 41933, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 92703, positive: 50447, positive conditional: 0, positive unconditional: 50447, negative: 161, negative conditional: 0, negative unconditional: 161, unknown: 42095, unknown conditional: 0, unknown unconditional: 42095] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 7, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 161, positive: 156, positive conditional: 156, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 95268, positive: 92380, positive conditional: 92380, positive unconditional: 0, negative: 2888, negative conditional: 2888, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92703, positive: 92380, positive conditional: 0, positive unconditional: 92380, negative: 323, negative conditional: 0, negative unconditional: 323, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 42095, positive: 41933, positive conditional: 0, positive unconditional: 41933, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 92703, positive: 50447, positive conditional: 0, positive unconditional: 50447, negative: 161, negative conditional: 0, negative unconditional: 161, unknown: 42095, unknown conditional: 0, unknown unconditional: 42095] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 12, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 66739, positive: 64733, positive conditional: 64733, positive unconditional: 0, negative: 2006, negative conditional: 2006, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 95268, positive: 92380, positive conditional: 92380, positive unconditional: 0, negative: 2888, negative conditional: 2888, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92703, positive: 92380, positive conditional: 0, positive unconditional: 92380, negative: 323, negative conditional: 0, negative unconditional: 323, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 42095, positive: 41933, positive conditional: 0, positive unconditional: 41933, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 92703, positive: 50447, positive conditional: 0, positive unconditional: 50447, negative: 161, negative conditional: 0, negative unconditional: 161, unknown: 42095, unknown conditional: 0, unknown unconditional: 42095] , Statistics on independence cache: Total cache size (in pairs): 33965, Positive cache size: 33860, Positive conditional cache size: 0, Positive unconditional cache size: 33860, Negative cache size: 105, Negative conditional cache size: 0, Negative unconditional cache size: 105, Independence queries for same thread: 1889, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 28205, positive: 27335, positive conditional: 27335, positive unconditional: 0, negative: 870, negative conditional: 870, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 95268, positive: 92380, positive conditional: 92380, positive unconditional: 0, negative: 2888, negative conditional: 2888, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92703, positive: 92380, positive conditional: 0, positive unconditional: 92380, negative: 323, negative conditional: 0, negative unconditional: 323, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 42095, positive: 41933, positive conditional: 0, positive unconditional: 41933, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 92703, positive: 50447, positive conditional: 0, positive unconditional: 50447, negative: 161, negative conditional: 0, negative unconditional: 161, unknown: 42095, unknown conditional: 0, unknown unconditional: 42095] , Statistics on independence cache: Total cache size (in pairs): 42095, Positive cache size: 41933, Positive conditional cache size: 0, Positive unconditional cache size: 41933, Negative cache size: 162, Negative conditional cache size: 0, Negative unconditional cache size: 162, Independence queries for same thread: 2565, Statistics for Abstraction: - TimeoutResultAtElement [Line: 471]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 1581 with TraceHistMax 7,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 324 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: pusherErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1440 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, 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: pusherErr0ASSERT_VIOLATIONASSERT with 2 thread instances CFG has 3 procedures, 1440 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 856.6s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 4.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 21, 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.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 8111 NumberOfCodeBlocks, 8111 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 8107 ConstructedInterpolants, 0 QuantifiedInterpolants, 18601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 9978 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 22479/30058 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 3 procedures, 1440 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown