/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-bug_1w1r.line359.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:03:17,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:03:17,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:03:18,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:03:18,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:03:18,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:03:18,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:03:18,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:03:18,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:03:18,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:03:18,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:03:18,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:03:18,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:03:18,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:03:18,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:03:18,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:03:18,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:03:18,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:03:18,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:03:18,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:03:18,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:03:18,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:03:18,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:03:18,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:03:18,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:03:18,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:03:18,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:03:18,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:03:18,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:03:18,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:03:18,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:03:18,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:03:18,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:03:18,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:03:18,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:03:18,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:03:18,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:03:18,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:03:18,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:03:18,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:03:18,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:03:18,045 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:03:18,075 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:03:18,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:03:18,076 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:03:18,076 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:03:18,076 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:03:18,077 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:03:18,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:03:18,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:03:18,077 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:03:18,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:03:18,078 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:03:18,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:03:18,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:03:18,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:03:18,079 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:03:18,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:03:18,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:03:18,079 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:03:18,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:03:18,079 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:03:18,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:03:18,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:03:18,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:03:18,081 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:03:18,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:03:18,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:03:18,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:03:18,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:03:18,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:03:18,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:03:18,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:03:18,082 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:03:18,082 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:03:18,082 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:03:18,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:03:18,082 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:03:18,082 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:03:18,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:03:18,083 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:03:18,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:03:18,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:03:18,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:03:18,355 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:03:18,356 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:03:18,358 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-bug_1w1r.line359.bpl [2022-10-03 15:03:18,359 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line359.bpl' [2022-10-03 15:03:18,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:03:18,442 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:03:18,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:03:18,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:03:18,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:03:18,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:03:18" (1/1) ... [2022-10-03 15:03:18,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:03:18" (1/1) ... [2022-10-03 15:03:18,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:03:18" (1/1) ... [2022-10-03 15:03:18,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:03:18" (1/1) ... [2022-10-03 15:03:18,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:03:18" (1/1) ... [2022-10-03 15:03:18,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:03:18" (1/1) ... [2022-10-03 15:03:18,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:03:18" (1/1) ... [2022-10-03 15:03:18,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:03:18,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:03:18,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:03:18,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:03:18,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:03:18" (1/1) ... [2022-10-03 15:03:18,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:03:18,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:03:18,684 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:03:18,689 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:03:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:03:18,725 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:03:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:03:18,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:03:18,727 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:03:18,881 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:03:18,882 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:03:19,857 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:03:19,875 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:03:19,875 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:03:19,879 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:03:19 BoogieIcfgContainer [2022-10-03 15:03:19,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:03:19,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:03:19,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:03:19,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:03:19,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:03:18" (1/2) ... [2022-10-03 15:03:19,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737f8a0c and model type divinefifo-bug_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:03:19, skipping insertion in model container [2022-10-03 15:03:19,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:03:19" (2/2) ... [2022-10-03 15:03:19,894 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line359.bpl [2022-10-03 15:03:19,902 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:03:19,913 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:03:19,913 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:03:19,913 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:03:20,102 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:03:20,184 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:03:20,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:03:20,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:03:20,187 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:03:20,188 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:03:20,223 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:03:20,237 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == pusherErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:03:20,244 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;@2bd455c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:03:20,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:03:20,248 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-03 15:03:20,252 INFO L805 garLoopResultBuilder]: Registering result SAFE for location pusherErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 15:03:20,265 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-03 15:03:20,268 INFO L307 ceAbstractionStarter]: Result for error location pusherErr0ASSERT_VIOLATIONASSERT was SAFE (1/3) [2022-10-03 15:03:20,285 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:03:20,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:03:20,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:03:20,327 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:03:20,334 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:03:20,334 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-03 15:03:20,335 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;@2bd455c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:03:20,335 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:03:20,342 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:03:20,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-03 15:03:20,433 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-03 15:03:20,436 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/3) [2022-10-03 15:03:20,450 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:03:20,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:03:20,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:03:20,535 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:03:20,567 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:03:20,570 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:03:20,571 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == pusherErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:03:20,571 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;@2bd455c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:03:20,571 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:03:20,757 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:03:20,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:03:20,762 INFO L85 PathProgramCache]: Analyzing trace with hash -174820981, now seen corresponding path program 1 times [2022-10-03 15:03:20,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:03:20,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953223293] [2022-10-03 15:03:20,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:03:20,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:03:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:03:21,220 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:03:21,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:03:21,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953223293] [2022-10-03 15:03:21,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953223293] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:03:21,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:03:21,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:03:21,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978622494] [2022-10-03 15:03:21,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:03:21,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:03:21,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:03:21,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:03:21,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:03:21,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:03:21,251 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:03:21,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 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:03:21,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:03:21,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:03:21,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:03:21,280 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:03:21,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:03:21,280 INFO L85 PathProgramCache]: Analyzing trace with hash 410038803, now seen corresponding path program 1 times [2022-10-03 15:03:21,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:03:21,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136870391] [2022-10-03 15:03:21,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:03:21,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:03:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:03:21,596 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:03:21,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:03:21,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136870391] [2022-10-03 15:03:21,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136870391] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:03:21,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:03:21,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-03 15:03:21,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385297361] [2022-10-03 15:03:21,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:03:21,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-03 15:03:21,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:03:21,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-03 15:03:21,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-03 15:03:21,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:03:21,600 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:03:21,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 61.4) internal successors, (307), 6 states have internal predecessors, (307), 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:03:21,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:03:21,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:03:28,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:03:28,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-03 15:03:28,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:03:28,958 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:03:28,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:03:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1882979142, now seen corresponding path program 1 times [2022-10-03 15:03:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:03:28,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271119429] [2022-10-03 15:03:28,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:03:28,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:03:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:03:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 141118 backedges. 134789 proven. 6329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:03:51,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:03:51,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271119429] [2022-10-03 15:03:51,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271119429] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:03:51,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501258331] [2022-10-03 15:03:51,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:03:51,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:03:51,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:03:51,131 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:03:51,152 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:03:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:03:56,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 25487 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-03 15:03:56,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:03:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 141118 backedges. 40422 proven. 0 refuted. 0 times theorem prover too weak. 100696 trivial. 0 not checked. [2022-10-03 15:03:57,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:03:57,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501258331] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:03:57,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:03:57,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [48] total 49 [2022-10-03 15:03:57,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978929836] [2022-10-03 15:03:57,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:03:57,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-03 15:03:57,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:03:57,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-03 15:03:57,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2022-10-03 15:03:57,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:03:57,766 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:03:57,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 250.1) internal successors, (2501), 10 states have internal predecessors, (2501), 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:03:57,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:03:57,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-03 15:03:57,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:04:03,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:04:03,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-03 15:04:03,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:04:03,285 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:04:03,459 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:04:03,460 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:04:03,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:04:03,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1555487639, now seen corresponding path program 1 times [2022-10-03 15:04:03,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:04:03,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212062051] [2022-10-03 15:04:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:04:03,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:04:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:04:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2823 backedges. 645 proven. 1212 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2022-10-03 15:04:14,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:04:14,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212062051] [2022-10-03 15:04:14,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212062051] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:04:14,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496694617] [2022-10-03 15:04:14,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:04:14,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:04:14,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:04:14,605 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:04:14,606 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:04:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:04:15,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 4151 conjuncts, 311 conjunts are in the unsatisfiable core [2022-10-03 15:04:15,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:04:27,813 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:04:27,821 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:04:30,094 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-10-03 15:04:30,094 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 17 treesize of output 17 [2022-10-03 15:04:31,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:04:31,105 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 15:04:31,105 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 75 [2022-10-03 15:04:31,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:04:31,128 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-10-03 15:04:31,129 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 72 treesize of output 71 [2022-10-03 15:04:31,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:04:31,368 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 15:04:31,368 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 75 [2022-10-03 15:04:31,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:04:31,387 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-10-03 15:04:31,387 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 72 treesize of output 71 [2022-10-03 15:04:39,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:04:39,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:04:39,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:04:39,890 INFO L356 Elim1Store]: treesize reduction 111, result has 12.6 percent of original size [2022-10-03 15:04:39,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 164 treesize of output 102 [2022-10-03 15:04:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2823 backedges. 804 proven. 414 refuted. 0 times theorem prover too weak. 1605 trivial. 0 not checked. [2022-10-03 15:04:40,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:04:48,630 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse9 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse8 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4601))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4602)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse7 (select .cse8 .cse2)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (select .cse7 .cse5)) (.cse6 (+ 12 .cse5))) (or (not (= (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (not (= .cse3 .cse2)) (< (select (select .cse4 .cse2) .cse5) .cse6) (= .cse3 (select .cse7 .cse6))))))))) (not (= (select .cse9 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0)))))) (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse19 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse10 (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse10)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse13 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4601))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse18 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4602)) (.cse12 (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse17 (select .cse18 .cse12)) (.cse14 (select (select .cse18 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse16 (+ 12 .cse14)) (.cse15 (select .cse17 .cse14))) (or (not (= (select .cse11 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse12)) (not (= (select (select .cse13 .cse12) .cse14) .cse12)) (< .cse15 .cse16) (< (select .cse17 .cse16) (+ .cse15 1))))))))) (not (= (select .cse19 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse10))))))) is different from false [2022-10-03 15:04:48,742 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse1 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse0)) (not (= (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4601))) (let ((.cse8 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse9 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse5 (select .cse9 .cse3)) (.cse4 (select (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse7 (select .cse5 .cse4)) (.cse6 (+ 12 .cse4))) (or (not (= (select (select .cse2 .cse3) .cse4) .cse3)) (< (select .cse5 .cse6) (+ .cse7 1)) (< .cse7 .cse6) (not (= (select .cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))))))))) (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse11 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse10)) (not (= (select .cse11 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse10)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse19 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4601))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse16 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602)) (.cse15 (select .cse18 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse13 (select .cse19 .cse15)) (.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse12 (select .cse13 .cse17)) (.cse14 (+ 12 .cse17))) (or (= .cse12 (select .cse13 .cse14)) (not (= .cse12 .cse15)) (< (select (select .cse16 .cse15) .cse17) .cse14) (not (= (select .cse18 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse15)))))))))))))) is different from false [2022-10-03 15:04:48,801 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4601))) (let ((.cse6 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select .cse7 .cse4)) (.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse2 (select .cse0 .cse5)) (.cse1 (+ 12 .cse5))) (or (< (select .cse0 .cse1) (+ .cse2 1)) (not (= (select (select .cse3 .cse4) .cse5) .cse4)) (< .cse2 .cse1) (not (= (select .cse6 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4))))))))) (not (<= 0 .cse8)) (not (= .cse8 (select .cse9 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse10 (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse10)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4601))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602)) (.cse12 (select .cse16 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse17 (select .cse18 .cse12)) (.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse15 (+ 12 .cse14)) (.cse11 (select .cse17 .cse14))) (or (not (= .cse11 .cse12)) (< (select (select .cse13 .cse12) .cse14) .cse15) (not (= (select .cse16 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse12)) (= (select .cse17 .cse15) .cse11)))))))) (not (= .cse10 (select .cse19 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) is different from false [2022-10-03 15:04:48,867 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4599 (Array Int Int)) (v_ArrVal_4600 (Array Int Int)) (v_ArrVal_4602 (Array Int Int))) (let ((.cse1 (select (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4599) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (not (<= 0 .cse0)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse9 (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4600) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4601))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse6 (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4599) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse4 (select .cse9 .cse3)) (.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse2 (select .cse4 .cse7)) (.cse5 (+ .cse7 12))) (or (not (= .cse2 .cse3)) (= .cse2 (select .cse4 .cse5)) (< (select (select .cse6 .cse3) .cse7) .cse5) (not (= (select .cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))))))))) (forall ((v_ArrVal_4599 (Array Int Int)) (v_ArrVal_4600 (Array Int Int)) (v_ArrVal_4602 (Array Int Int))) (let ((.cse11 (select (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4599) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse10 (select .cse11 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (not (<= 0 .cse10)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse12 (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4600) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4601))) (let ((.cse18 (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse19 (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4599) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602)) (.cse13 (select .cse18 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse15 (select .cse19 .cse13)) (.cse14 (select (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse17 (select .cse15 .cse14)) (.cse16 (+ .cse14 12))) (or (not (= (select (select .cse12 .cse13) .cse14) .cse13)) (< (select .cse15 .cse16) (+ .cse17 1)) (< .cse17 .cse16) (not (= (select .cse18 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse13)))))))))))))) is different from false [2022-10-03 15:04:49,079 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (not (<= 0 .cse1)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| v_ArrVal_4601))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| v_ArrVal_4602)) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse2 (select .cse9 .cse6)) (.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse4 (select .cse2 .cse8)) (.cse3 (+ .cse8 12))) (or (< (select .cse2 .cse3) (+ .cse4 1)) (< .cse4 .cse3) (not (= (select .cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse6)) (not (= .cse6 (select (select .cse7 .cse6) .cse8)))))))))))))) (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse10 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse11)) (not (<= 0 .cse11)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| v_ArrVal_4601))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| v_ArrVal_4602)) (.cse13 (select .cse18 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse16 (select .cse19 .cse13)) (.cse14 (select (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse15 (+ .cse14 12)) (.cse17 (select .cse16 .cse14))) (or (< (select (select .cse12 .cse13) .cse14) .cse15) (= (select .cse16 .cse15) .cse17) (not (= (select .cse18 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse13)) (not (= .cse13 .cse17)))))))))))))) is different from false [2022-10-03 15:04:49,167 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (not (<= 0 .cse1)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| v_ArrVal_4601))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| v_ArrVal_4602)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse5 (select .cse9 .cse2)) (.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse6 (+ 12 .cse8)) (.cse4 (select .cse5 .cse8))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse4 (select .cse5 .cse6)) (< (select (select .cse7 .cse2) .cse8) .cse6) (not (= .cse4 .cse2))))))))))))) (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse10 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse11)) (not (<= 0 .cse11)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| v_ArrVal_4601))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| v_ArrVal_4602)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse12 (select .cse19 .cse15)) (.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse14 (select .cse12 .cse18)) (.cse13 (+ 12 .cse18))) (or (< (select .cse12 .cse13) (+ .cse14 1)) (not (= .cse15 (select .cse16 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (< .cse14 .cse13) (not (= (select (select .cse17 .cse15) .cse18) .cse15)))))))))))))) is different from false [2022-10-03 15:04:49,256 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4601))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select .cse7 .cse4)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse1 (+ 12 .cse6)) (.cse2 (select .cse0 .cse6))) (or (= (select .cse0 .cse1) .cse2) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4)) (< (select (select .cse5 .cse4) .cse6) .cse1) (not (= .cse4 .cse2))))))))) (not (= (select .cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse9)) (not (<= 0 .cse9)))))) (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse10 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse11)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4601))) (let ((.cse12 (select .cse16 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602)) (.cse13 (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse18 (select .cse19 .cse13)) (.cse17 (select (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse15 (+ 12 .cse17)) (.cse14 (select .cse18 .cse17))) (or (not (= (select .cse12 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse13)) (< .cse14 .cse15) (not (= .cse13 (select (select .cse16 .cse13) .cse17))) (< (select .cse18 .cse15) (+ .cse14 1))))))))) (not (<= 0 .cse11))))))) is different from false [2022-10-03 15:04:49,319 WARN L833 $PredicateComparison]: unable to prove that (or (not (< |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4601))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select .cse7 .cse4)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse1 (+ 12 .cse6)) (.cse2 (select .cse0 .cse6))) (or (= (select .cse0 .cse1) .cse2) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4)) (< (select (select .cse5 .cse4) .cse6) .cse1) (not (= .cse4 .cse2))))))))) (not (= (select .cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse9)) (not (<= 0 .cse9)))))) (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse10 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse11)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4601))) (let ((.cse12 (select .cse16 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602)) (.cse13 (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse18 (select .cse19 .cse13)) (.cse17 (select (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse15 (+ 12 .cse17)) (.cse14 (select .cse18 .cse17))) (or (not (= (select .cse12 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse13)) (< .cse14 .cse15) (not (= .cse13 (select (select .cse16 .cse13) .cse17))) (< (select .cse18 .cse15) (+ .cse14 1))))))))) (not (<= 0 .cse11)))))))) is different from false [2022-10-03 15:05:00,697 INFO L356 Elim1Store]: treesize reduction 113, result has 63.1 percent of original size [2022-10-03 15:05:00,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 981 treesize of output 957 [2022-10-03 15:05:00,947 INFO L356 Elim1Store]: treesize reduction 123, result has 60.6 percent of original size [2022-10-03 15:05:00,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 1247 treesize of output 1137 [2022-10-03 15:05:03,165 INFO L356 Elim1Store]: treesize reduction 164, result has 89.4 percent of original size [2022-10-03 15:05:03,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 15 new quantified variables, introduced 91 case distinctions, treesize of input 967 treesize of output 2124 [2022-10-03 15:05:09,658 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 629 DAG size of output: 518 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-10-03 15:05:09,659 INFO L356 Elim1Store]: treesize reduction 524, result has 77.0 percent of original size [2022-10-03 15:05:09,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 1 disjoint index pairs (out of 171 index pairs), introduced 21 new quantified variables, introduced 170 case distinctions, treesize of input 3102 treesize of output 4364 [2022-10-03 15:05:11,574 INFO L356 Elim1Store]: treesize reduction 8, result has 93.3 percent of original size [2022-10-03 15:05:11,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 2240 treesize of output 2156 [2022-10-03 15:05:12,841 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:05:12,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1757 treesize of output 1655 [2022-10-03 15:05:13,605 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:05:13,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 1719 treesize of output 1705 [2022-10-03 15:05:14,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:05:14,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 2245 treesize of output 2121 Received shutdown request... [2022-10-03 15:17:24,525 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-10-03 15:17:24,528 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location pusherErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 15:17:24,529 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 15:17:24,529 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 15:17:24,529 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 15:17:24,529 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 15:17:24,535 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 15:17:24,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-03 15:17:24,747 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 15:17:24,748 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1504 with TraceHistMax 7,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 36ms.. [2022-10-03 15:17:24,751 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-10-03 15:17:24,752 INFO L307 ceAbstractionStarter]: Result for error location pusherErr0ASSERT_VIOLATIONASSERT was TIMEOUT (3/3) [2022-10-03 15:17:24,763 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 15:17:24,763 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 15:17:24,767 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:17:24 BasicIcfg [2022-10-03 15:17:24,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 15:17:24,779 INFO L158 Benchmark]: Toolchain (without parser) took 846326.31ms. Allocated memory was 210.8MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 161.0MB in the beginning and 6.8GB in the end (delta: -6.6GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-10-03 15:17:24,780 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 210.8MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 15:17:24,780 INFO L158 Benchmark]: Boogie Preprocessor took 165.02ms. Allocated memory is still 210.8MB. Free memory was 161.0MB in the beginning and 179.4MB in the end (delta: -18.4MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2022-10-03 15:17:24,780 INFO L158 Benchmark]: RCFGBuilder took 1268.06ms. Allocated memory is still 210.8MB. Free memory was 179.4MB in the beginning and 143.8MB in the end (delta: 35.7MB). Peak memory consumption was 44.9MB. Max. memory is 8.0GB. [2022-10-03 15:17:24,780 INFO L158 Benchmark]: TraceAbstraction took 844885.66ms. Allocated memory was 210.8MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 143.3MB in the beginning and 6.8GB in the end (delta: -6.6GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-10-03 15:17:24,781 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.25ms. Allocated memory is still 210.8MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 165.02ms. Allocated memory is still 210.8MB. Free memory was 161.0MB in the beginning and 179.4MB in the end (delta: -18.4MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. * RCFGBuilder took 1268.06ms. Allocated memory is still 210.8MB. Free memory was 179.4MB in the beginning and 143.8MB in the end (delta: 35.7MB). Peak memory consumption was 44.9MB. Max. memory is 8.0GB. * TraceAbstraction took 844885.66ms. Allocated memory was 210.8MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 143.3MB in the beginning and 6.8GB in the end (delta: -6.6GB). Peak memory consumption was 2.5GB. 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: 84, positive: 78, positive conditional: 78, 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: 290876, positive: 281198, positive conditional: 281198, positive unconditional: 0, negative: 9678, negative conditional: 9678, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 282375, positive: 281198, positive conditional: 0, positive unconditional: 281198, negative: 1177, negative conditional: 0, negative unconditional: 1177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 79317, positive: 78897, positive conditional: 0, positive unconditional: 78897, negative: 420, negative conditional: 0, negative unconditional: 420, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 282375, positive: 202301, positive conditional: 0, positive unconditional: 202301, negative: 757, negative conditional: 0, negative unconditional: 757, unknown: 79317, unknown conditional: 0, unknown unconditional: 79317] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, 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: 82, positive: 78, positive conditional: 78, 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: 290876, positive: 281198, positive conditional: 281198, positive unconditional: 0, negative: 9678, negative conditional: 9678, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 282375, positive: 281198, positive conditional: 0, positive unconditional: 281198, negative: 1177, negative conditional: 0, negative unconditional: 1177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 79317, positive: 78897, positive conditional: 0, positive unconditional: 78897, negative: 420, negative conditional: 0, negative unconditional: 420, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 282375, positive: 202301, positive conditional: 0, positive unconditional: 202301, negative: 757, negative conditional: 0, negative unconditional: 757, unknown: 79317, unknown conditional: 0, unknown unconditional: 79317] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, 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: 105964, positive: 102584, positive conditional: 102584, positive unconditional: 0, negative: 3380, negative conditional: 3380, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 290876, positive: 281198, positive conditional: 281198, positive unconditional: 0, negative: 9678, negative conditional: 9678, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 282375, positive: 281198, positive conditional: 0, positive unconditional: 281198, negative: 1177, negative conditional: 0, negative unconditional: 1177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 79317, positive: 78897, positive conditional: 0, positive unconditional: 78897, negative: 420, negative conditional: 0, negative unconditional: 420, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 282375, positive: 202301, positive conditional: 0, positive unconditional: 202301, negative: 757, negative conditional: 0, negative unconditional: 757, unknown: 79317, unknown conditional: 0, unknown unconditional: 79317] , Statistics on independence cache: Total cache size (in pairs): 45063, Positive cache size: 44917, Positive conditional cache size: 0, Positive unconditional cache size: 44917, Negative cache size: 146, Negative conditional cache size: 0, Negative unconditional cache size: 146, Independence queries for same thread: 3179, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 184746, positive: 178458, positive conditional: 178458, positive unconditional: 0, negative: 6288, negative conditional: 6288, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 290876, positive: 281198, positive conditional: 281198, positive unconditional: 0, negative: 9678, negative conditional: 9678, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 282375, positive: 281198, positive conditional: 0, positive unconditional: 281198, negative: 1177, negative conditional: 0, negative unconditional: 1177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 79317, positive: 78897, positive conditional: 0, positive unconditional: 78897, negative: 420, negative conditional: 0, negative unconditional: 420, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 282375, positive: 202301, positive conditional: 0, positive unconditional: 202301, negative: 757, negative conditional: 0, negative unconditional: 757, unknown: 79317, unknown conditional: 0, unknown unconditional: 79317] , Statistics on independence cache: Total cache size (in pairs): 79317, Positive cache size: 78897, Positive conditional cache size: 0, Positive unconditional cache size: 78897, Negative cache size: 420, Negative conditional cache size: 0, Negative unconditional cache size: 420, Independence queries for same thread: 8501, Statistics for Abstraction: - TimeoutResultAtElement [Line: 359]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 1504 with TraceHistMax 7,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 36ms.. - StatisticsResult: Ultimate Automizer benchmark data for error location: pusherErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1465 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, 1465 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 844.2s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 13.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: 19, 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: 1.2s SsaConstructionTime, 7.9s SatisfiabilityAnalysisTime, 19.1s InterpolantComputationTime, 19081 NumberOfCodeBlocks, 19081 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 19077 ConstructedInterpolants, 0 QuantifiedInterpolants, 39843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 25487 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 275907/282236 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, 1465 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