/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/ring_2w1r-2.line861.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-09-30 07:48:23,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-30 07:48:23,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-30 07:48:23,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-30 07:48:23,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-30 07:48:23,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-30 07:48:23,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-30 07:48:23,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-30 07:48:23,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-30 07:48:23,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-30 07:48:23,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-30 07:48:23,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-30 07:48:23,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-30 07:48:23,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-30 07:48:23,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-30 07:48:23,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-30 07:48:23,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-30 07:48:23,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-30 07:48:23,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-30 07:48:23,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-30 07:48:23,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-30 07:48:23,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-30 07:48:23,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-30 07:48:23,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-30 07:48:23,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-30 07:48:23,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-30 07:48:23,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-30 07:48:23,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-30 07:48:23,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-30 07:48:23,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-30 07:48:23,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-30 07:48:23,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-30 07:48:23,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-30 07:48:23,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-30 07:48:23,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-30 07:48:23,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-30 07:48:23,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-30 07:48:23,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-30 07:48:23,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-30 07:48:23,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-30 07:48:23,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-30 07:48:23,604 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-30 07:48:23,633 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-30 07:48:23,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-30 07:48:23,633 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-30 07:48:23,633 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-30 07:48:23,634 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-30 07:48:23,634 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-30 07:48:23,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-30 07:48:23,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-30 07:48:23,634 INFO L138 SettingsManager]: * Use SBE=true [2022-09-30 07:48:23,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-30 07:48:23,635 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-30 07:48:23,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-30 07:48:23,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-30 07:48:23,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-30 07:48:23,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-30 07:48:23,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-30 07:48:23,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-30 07:48:23,635 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-30 07:48:23,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-30 07:48:23,635 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-30 07:48:23,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-30 07:48:23,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-30 07:48:23,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-30 07:48:23,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-30 07:48:23,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-30 07:48:23,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 07:48:23,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-30 07:48:23,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-30 07:48:23,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-30 07:48:23,636 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-30 07:48:23,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-30 07:48:23,637 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-30 07:48:23,637 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-30 07:48:23,637 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-30 07:48:23,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-30 07:48:23,637 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-30 07:48:23,637 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-30 07:48:23,637 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-30 07:48:23,637 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-09-30 07:48:23,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-30 07:48:23,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-30 07:48:23,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-30 07:48:23,852 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-30 07:48:23,852 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-30 07:48:23,853 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/ring_2w1r-2.line861.bpl [2022-09-30 07:48:23,854 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/ring_2w1r-2.line861.bpl' [2022-09-30 07:48:23,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-30 07:48:23,905 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-30 07:48:23,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-30 07:48:23,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-30 07:48:23,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-30 07:48:23,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 07:48:23" (1/1) ... [2022-09-30 07:48:23,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 07:48:23" (1/1) ... [2022-09-30 07:48:23,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 07:48:23" (1/1) ... [2022-09-30 07:48:23,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 07:48:23" (1/1) ... [2022-09-30 07:48:23,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 07:48:23" (1/1) ... [2022-09-30 07:48:23,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 07:48:23" (1/1) ... [2022-09-30 07:48:23,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 07:48:23" (1/1) ... [2022-09-30 07:48:23,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-30 07:48:24,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-30 07:48:24,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-30 07:48:24,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-30 07:48:24,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 07:48:23" (1/1) ... [2022-09-30 07:48:24,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 07:48:24,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 07:48:24,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-30 07:48:24,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-30 07:48:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-09-30 07:48:24,082 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-09-30 07:48:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-09-30 07:48:24,082 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-09-30 07:48:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-30 07:48:24,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-30 07:48:24,083 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-30 07:48:24,200 INFO L234 CfgBuilder]: Building ICFG [2022-09-30 07:48:24,201 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-30 07:48:24,651 INFO L275 CfgBuilder]: Performing block encoding [2022-09-30 07:48:24,662 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-30 07:48:24,662 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-09-30 07:48:24,664 INFO L202 PluginConnector]: Adding new model ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 07:48:24 BoogieIcfgContainer [2022-09-30 07:48:24,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-30 07:48:24,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-30 07:48:24,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-30 07:48:24,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-30 07:48:24,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 07:48:23" (1/2) ... [2022-09-30 07:48:24,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e416ad and model type ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 07:48:24, skipping insertion in model container [2022-09-30 07:48:24,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 07:48:24" (2/2) ... [2022-09-30 07:48:24,672 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.line861.bpl [2022-09-30 07:48:24,677 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-30 07:48:24,686 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-30 07:48:24,686 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-30 07:48:24,686 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-30 07:48:24,788 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-30 07:48:24,843 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 07:48:24,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 07:48:24,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 07:48:24,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 07:48:24,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-09-30 07:48:24,896 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 07:48:24,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-09-30 07:48:24,916 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;@441429d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 07:48:24,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 07:48:25,118 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-30 07:48:25,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 07:48:25,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1737142182, now seen corresponding path program 1 times [2022-09-30 07:48:25,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 07:48:25,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788801581] [2022-09-30 07:48:25,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 07:48:25,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 07:48:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 07:48:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 07:48:25,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 07:48:25,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788801581] [2022-09-30 07:48:25,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788801581] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 07:48:25,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 07:48:25,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-30 07:48:25,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323279132] [2022-09-30 07:48:25,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 07:48:25,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-30 07:48:25,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 07:48:25,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-30 07:48:25,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-30 07:48:25,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:48:25,530 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 07:48:25,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-30 07:48:25,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:48:25,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:48:25,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-30 07:48:25,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-30 07:48:25,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 07:48:25,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1700267521, now seen corresponding path program 1 times [2022-09-30 07:48:25,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 07:48:25,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123318861] [2022-09-30 07:48:25,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 07:48:25,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 07:48:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 07:48:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 07:48:26,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 07:48:26,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123318861] [2022-09-30 07:48:26,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123318861] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 07:48:26,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 07:48:26,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-09-30 07:48:26,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295438727] [2022-09-30 07:48:26,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 07:48:26,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-09-30 07:48:26,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 07:48:26,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-09-30 07:48:26,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2022-09-30 07:48:26,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:48:26,977 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 07:48:26,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 4.717948717948718) internal successors, (184), 40 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-30 07:48:26,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:48:26,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:48:31,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:48:31,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-09-30 07:48:31,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-30 07:48:31,297 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-30 07:48:31,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 07:48:31,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1395366295, now seen corresponding path program 1 times [2022-09-30 07:48:31,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 07:48:31,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391585010] [2022-09-30 07:48:31,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 07:48:31,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 07:48:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 07:48:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 07:48:32,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 07:48:32,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391585010] [2022-09-30 07:48:32,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391585010] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 07:48:32,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971347074] [2022-09-30 07:48:32,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 07:48:32,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 07:48:32,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 07:48:32,869 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 07:48:32,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-09-30 07:48:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 07:48:33,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 133 conjunts are in the unsatisfiable core [2022-09-30 07:48:33,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 07:48:33,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-30 07:48:33,173 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-30 07:48:33,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-09-30 07:48:33,214 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-09-30 07:48:33,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-09-30 07:48:33,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-30 07:48:33,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 07:48:33,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-09-30 07:48:34,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-09-30 07:48:34,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-09-30 07:48:35,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 07:48:35,242 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-09-30 07:48:35,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 40 [2022-09-30 07:48:35,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 07:48:35,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 07:48:35,629 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 07:48:35,630 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 45 [2022-09-30 07:48:35,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-30 07:48:36,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 07:48:36,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-09-30 07:48:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 07:48:36,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 07:48:36,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2022-09-30 07:48:36,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 07:48:36,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 07:49:03,169 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-09-30 07:49:03,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 73 [2022-09-30 07:49:03,186 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 07:49:03,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 344 treesize of output 356 [2022-09-30 07:49:03,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 187 [2022-09-30 07:49:03,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 438 treesize of output 406 [2022-09-30 07:49:03,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-09-30 07:49:03,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-09-30 07:49:03,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 07:49:03,308 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 23 treesize of output 27 [2022-09-30 07:49:03,346 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 07:49:03,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 508 treesize of output 514 [2022-09-30 07:49:03,917 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 07:49:03,918 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 107 treesize of output 111 [2022-09-30 07:49:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 07:49:05,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971347074] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 07:49:05,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 07:49:05,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 45, 45] total 125 [2022-09-30 07:49:05,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082945716] [2022-09-30 07:49:05,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 07:49:05,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2022-09-30 07:49:05,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 07:49:05,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2022-09-30 07:49:05,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=15085, Unknown=60, NotChecked=0, Total=15750 [2022-09-30 07:49:05,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:49:05,046 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 07:49:05,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 125 states have (on average 4.784) internal successors, (598), 126 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-30 07:49:05,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:49:05,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-09-30 07:49:05,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:49:16,030 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 20))) (and (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4)) (<= (+ (* .cse0 4) 12) .cse1) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= 24 (select |c_#length| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (< .cse2 4) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 19) .cse1) (or (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) (forall ((|ULTIMATE.start_write~int_#ptr#1.offset| Int) (v_ArrVal_74 Int)) (or (let ((.cse3 (select (store (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) |ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_74) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))) (< (* 16 (div (+ (- 2) (* (- 1) .cse3)) 4)) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse3 4) 9))) (< v_ArrVal_74 1)))) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (<= 24 .cse1) (< |c_ULTIMATE.start_read~int_#value#1| 4) (< |c_ULTIMATE.start_write~int_#value#1| 4) (<= (+ |c_ULTIMATE.start_write~int_#sizeOfWrittenType#1| |c_ULTIMATE.start_write~int_#ptr#1.offset|) (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (<= 0 .cse2) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) (<= 0 .cse0) (= |c_ULTIMATE.start_write~int_#ptr#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0))) is different from false [2022-09-30 07:49:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:49:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-09-30 07:49:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-09-30 07:49:16,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-09-30 07:49:16,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-09-30 07:49:16,867 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-30 07:49:16,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 07:49:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1458078419, now seen corresponding path program 2 times [2022-09-30 07:49:16,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 07:49:16,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359147066] [2022-09-30 07:49:16,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 07:49:16,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 07:49:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 07:49:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 54 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 07:49:18,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 07:49:18,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359147066] [2022-09-30 07:49:18,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359147066] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 07:49:18,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266105251] [2022-09-30 07:49:18,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-30 07:49:18,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 07:49:18,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 07:49:18,077 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 07:49:18,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-09-30 07:49:18,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-30 07:49:18,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-30 07:49:18,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 107 conjunts are in the unsatisfiable core [2022-09-30 07:49:18,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 07:49:19,679 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-30 07:49:19,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 31 [2022-09-30 07:49:21,073 INFO L356 Elim1Store]: treesize reduction 14, result has 63.2 percent of original size [2022-09-30 07:49:21,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 52 [2022-09-30 07:49:21,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 07:49:21,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-09-30 07:49:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 3 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 07:49:21,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 07:49:48,768 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| 1))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|)) (< .cse0 0) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 7 (* 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) (mod .cse0 4))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))) (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))))) (forall ((|aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int) (|aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int)) (let ((.cse1 (+ (* |aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|))) (or (= |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (<= 4 |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|) (< |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (not (< .cse1 0)) (< .cse1 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 1)) (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) (+ (mod |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) (- 4)))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) 4))))) (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) 0)) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4))) is different from false [2022-09-30 07:50:07,459 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 07:50:07,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 545 treesize of output 555 [2022-09-30 07:50:07,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-09-30 07:50:13,783 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 07:50:13,784 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 25 treesize of output 29 [2022-09-30 07:50:13,820 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 07:50:13,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 207 [2022-09-30 07:50:14,751 INFO L356 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-09-30 07:50:14,752 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 97 treesize of output 92 [2022-09-30 07:50:14,856 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 07:50:14,856 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 171 treesize of output 163 [2022-09-30 07:50:14,990 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-09-30 07:50:15,010 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-09-30 07:50:15,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-09-30 07:50:15,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-09-30 07:50:15,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-09-30 07:50:15,098 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-09-30 07:50:15,098 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 109 treesize of output 1 [2022-09-30 07:50:15,102 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-09-30 07:50:15,108 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-09-30 07:50:15,116 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-09-30 07:50:15,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 07:50:15,131 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-09-30 07:50:15,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 201 treesize of output 1 [2022-09-30 07:50:15,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 07:50:15,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2022-09-30 07:50:15,163 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-09-30 07:50:15,196 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 07:50:15,196 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 76 treesize of output 74 [2022-09-30 07:50:15,275 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-09-30 07:50:15,276 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 109 treesize of output 97 [2022-09-30 07:50:15,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-09-30 07:50:15,337 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-09-30 07:50:15,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 07:50:15,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 07:50:15,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 201 treesize of output 189 [2022-09-30 07:50:15,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 07:50:15,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2022-09-30 07:50:15,588 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-09-30 07:50:17,900 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 07:50:17,900 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 22 treesize of output 26 [2022-09-30 07:50:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 3 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-09-30 07:50:18,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266105251] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 07:50:18,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 07:50:18,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36, 34] total 102 [2022-09-30 07:50:18,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827957954] [2022-09-30 07:50:18,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 07:50:18,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-09-30 07:50:18,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 07:50:18,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-09-30 07:50:18,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=9831, Unknown=14, NotChecked=200, Total=10506 [2022-09-30 07:50:18,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:50:18,470 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 07:50:18,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 102 states have (on average 7.147058823529412) internal successors, (729), 103 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-30 07:50:18,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:50:18,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-09-30 07:50:18,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-09-30 07:50:18,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:52:15,894 WARN L233 SmtUtils]: Spent 10.31s on a formula simplification. DAG size of input: 164 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 07:53:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:53:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-30 07:53:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-09-30 07:53:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-09-30 07:53:46,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-09-30 07:53:47,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 07:53:47,093 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-30 07:53:47,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 07:53:47,093 INFO L85 PathProgramCache]: Analyzing trace with hash -859850218, now seen corresponding path program 1 times [2022-09-30 07:53:47,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 07:53:47,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944774989] [2022-09-30 07:53:47,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 07:53:47,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 07:53:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 07:53:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-09-30 07:53:47,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 07:53:47,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944774989] [2022-09-30 07:53:47,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944774989] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 07:53:47,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 07:53:47,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-30 07:53:47,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576796699] [2022-09-30 07:53:47,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 07:53:47,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-30 07:53:47,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 07:53:47,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-30 07:53:47,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-30 07:53:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:53:47,183 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 07:53:47,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-30 07:53:47,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:53:47,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-30 07:53:47,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-09-30 07:53:47,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-09-30 07:53:47,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:53:50,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:53:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-30 07:53:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-09-30 07:53:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-09-30 07:53:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 07:53:50,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-30 07:53:50,149 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-30 07:53:50,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 07:53:50,150 INFO L85 PathProgramCache]: Analyzing trace with hash 257229229, now seen corresponding path program 1 times [2022-09-30 07:53:50,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 07:53:50,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792937026] [2022-09-30 07:53:50,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 07:53:50,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 07:53:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 07:53:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 3 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 07:53:53,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 07:53:53,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792937026] [2022-09-30 07:53:53,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792937026] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 07:53:53,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708942048] [2022-09-30 07:53:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 07:53:53,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 07:53:53,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 07:53:53,535 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-09-30 07:53:53,536 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-09-30 07:53:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 07:53:53,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 107 conjunts are in the unsatisfiable core [2022-09-30 07:53:53,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 07:53:54,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-30 07:53:59,416 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-30 07:53:59,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 31 [2022-09-30 07:54:01,609 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 07:54:01,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2022-09-30 07:54:02,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-30 07:54:02,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 07:54:02,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-09-30 07:54:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 70 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 07:54:03,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 07:54:03,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2022-09-30 07:54:03,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 07:54:03,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 07:54:04,634 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 07:54:04,635 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 53 treesize of output 57 [2022-09-30 07:54:30,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2022-09-30 07:54:30,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-09-30 07:54:30,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 91 [2022-09-30 07:54:30,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2022-09-30 07:54:30,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2022-09-30 07:54:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 58 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 07:54:32,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708942048] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 07:54:32,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 07:54:32,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 34, 32] total 125 [2022-09-30 07:54:32,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905663175] [2022-09-30 07:54:32,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 07:54:32,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2022-09-30 07:54:32,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 07:54:32,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2022-09-30 07:54:32,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=15126, Unknown=5, NotChecked=0, Total=15750 [2022-09-30 07:54:32,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:54:32,853 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 07:54:32,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 125 states have (on average 10.424) internal successors, (1303), 126 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-30 07:54:32,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:54:32,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-30 07:54:32,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-09-30 07:54:32,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-09-30 07:54:32,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-30 07:54:32,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 07:54:45,895 WARN L233 SmtUtils]: Spent 10.92s on a formula simplification. DAG size of input: 95 DAG size of output: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 07:54:56,594 WARN L233 SmtUtils]: Spent 9.52s on a formula simplification. DAG size of input: 55 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 07:55:10,467 WARN L233 SmtUtils]: Spent 10.89s on a formula simplification. DAG size of input: 55 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 07:55:21,358 WARN L233 SmtUtils]: Spent 10.75s on a formula simplification. DAG size of input: 58 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 07:55:28,054 WARN L233 SmtUtils]: Spent 6.57s on a formula simplification. DAG size of input: 55 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 07:55:38,964 WARN L233 SmtUtils]: Spent 10.01s on a formula simplification. DAG size of input: 56 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 07:55:50,394 WARN L233 SmtUtils]: Spent 9.06s on a formula simplification. DAG size of input: 56 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 07:56:38,889 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4)) (.cse7 (* |c_ULTIMATE.start_read~int_#value#1| 4))) (let ((.cse2 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (.cse15 (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 20)) (.cse14 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse7 4)) (.cse13 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse11 4))) (let ((.cse5 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse8 (select |c_#length| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse10 (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse4 (< .cse13 0)) (.cse12 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (.cse6 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse9 (< .cse14 0)) (.cse1 (not .cse15)) (.cse3 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 20) 4) 4)) (.cse0 (and .cse2 (<= 2 |c_ULTIMATE.start_write~int_#value#1|) .cse15))) (and (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* 4 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) 4)) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4) 4)) (or .cse0 (and .cse1 .cse2 (<= |c_ULTIMATE.start_write~int_#ptr#1.offset| .cse3))) (= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (or .cse4 .cse5) .cse6 (<= 2 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse7) .cse8) .cse5 (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 19) (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (or .cse5 .cse9) (or .cse10 (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse7))) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse11) .cse8) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) .cse12 (or .cse10 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_39| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (<= (+ |c_ULTIMATE.start_write~int_#sizeOfWrittenType#1| |c_ULTIMATE.start_write~int_#ptr#1.offset|) (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= 20 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (or .cse10 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (or .cse4 .cse12) (<= 0 .cse13) (or .cse4 .cse6) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset| 0) (<= 0 .cse14) (or .cse12 .cse9) (= |c_ULTIMATE.start_write~int_#ptr#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or .cse6 .cse9) (or (and .cse1 .cse2 (<= 0 .cse3)) .cse0) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0))))) is different from false [2022-09-30 07:56:40,401 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4)) (.cse10 (* |c_ULTIMATE.start_read~int_#value#1| 4))) (let ((.cse3 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (.cse17 (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 20)) (.cse16 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse10 4)) (.cse15 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse13 4))) (let ((.cse0 (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4)) (.cse8 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse6 (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16)))) (.cse11 (select |c_#length| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse5 (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse7 (< .cse15 0)) (.cse14 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (.cse9 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse12 (< .cse16 0)) (.cse2 (not .cse17)) (.cse4 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 20) 4) 4)) (.cse1 (and .cse3 (<= 2 |c_ULTIMATE.start_write~int_#value#1|) .cse17))) (and (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* 4 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) 4)) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse0 4)) (or .cse1 (and .cse2 .cse3 (<= |c_ULTIMATE.start_write~int_#ptr#1.offset| .cse4))) (= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (or .cse5 (< .cse6 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse0))) (or .cse7 .cse8) .cse9 (<= 2 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse10) .cse11) .cse8 (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 19) (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (or .cse8 .cse12) (or .cse5 (< .cse6 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse10))) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse13) .cse11) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) .cse14 (or .cse5 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_39| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (<= (+ |c_ULTIMATE.start_write~int_#sizeOfWrittenType#1| |c_ULTIMATE.start_write~int_#ptr#1.offset|) (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= 20 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (or .cse5 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (or .cse7 .cse14) (<= 0 .cse15) (or .cse7 .cse9) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset| 0) (<= 0 .cse16) (or .cse14 .cse12) (= |c_ULTIMATE.start_write~int_#ptr#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or .cse9 .cse12) (or (and .cse2 .cse3 (<= 0 .cse4)) .cse1) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0))))) is different from false [2022-09-30 07:57:39,309 WARN L233 SmtUtils]: Spent 6.70s on a formula simplification. DAG size of input: 173 DAG size of output: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 07:58:30,159 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse26 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse20 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (.cse11 (* |c_ULTIMATE.start_read~int_#value#1| 4))) (let ((.cse24 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse11 4)) (.cse8 (select .cse26 .cse20)) (.cse27 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (.cse6 (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 20)) (.cse25 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (let ((.cse3 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 20)) (.cse2 (select .cse25 20)) (.cse15 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse7 (not .cse6)) (.cse0 (* 4 (select .cse27 (+ 20 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|)))) (.cse14 (select .cse27 20)) (.cse5 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (.cse10 (select .cse26 20)) (.cse18 (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse19 (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4)) (.cse13 (* .cse8 4)) (.cse1 (* (select (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (.cse16 (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse22 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (.cse9 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse17 (< .cse24 0)) (.cse21 (select .cse25 .cse20)) (.cse4 (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4)) (.cse12 (select |c_#length| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (<= 3 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (<= 0 (+ .cse0 4 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|)) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse1 4)) (<= 0 .cse2) (<= 0 .cse3) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse4 4)) (or (and .cse5 (<= 2 |c_ULTIMATE.start_write~int_#value#1|) .cse6) (and .cse7 .cse5 (<= |c_ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* .cse3 4) 4)))) (<= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse8) (= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse2) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) .cse9 (= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse10) (<= 2 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse11) .cse12) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 .cse13)) (<= 0 .cse14) .cse15 (<= .cse4 12) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 19) .cse16) (or .cse15 .cse17) (<= 3 |c_ULTIMATE.start_write~int_#value#1|) (= |c_reader_twoThread1of1ForFork1_~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or .cse18 (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse11))) (<= 2 |c_ULTIMATE.start_writer_fn_~i~1#1|) .cse7 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse19) .cse12) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (<= .cse19 12) (< (+ 7 .cse0 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (select |c_#length| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (<= (* .cse14 4) 12) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse20 |c_ULTIMATE.start_read~int_#ptr#1.offset|) .cse5 (<= |c_ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* 4 .cse21) 4)) .cse22 (<= (* 4 .cse10) 12) (or (exists ((|ULTIMATE.start_write~int_#ptr#1.offset| Int)) (let ((.cse23 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (<= 3 (select .cse23 |ULTIMATE.start_write~int_#ptr#1.offset|)) (<= 0 |ULTIMATE.start_write~int_#ptr#1.offset|) (<= |ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse23 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4)))))) (<= 3 .cse8)) (<= (+ |c_ULTIMATE.start_write~int_#sizeOfWrittenType#1| |c_ULTIMATE.start_write~int_#ptr#1.offset|) (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 .cse10) (= 20 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (= |c_reader_twoThread1of1ForFork1_~arg#1.offset| 0) (or .cse18 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse19 4)) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset| 0) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse13) .cse12) (<= 0 .cse24) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 7 .cse1) .cse16) (or .cse22 .cse17) (<= 3 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or .cse9 .cse17) (<= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse21) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse4) .cse12))))) is different from false [2022-09-30 07:58:31,050 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse21 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (.cse13 (* |c_ULTIMATE.start_read~int_#value#1| 4))) (let ((.cse25 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse13 4)) (.cse8 (select .cse27 .cse21)) (.cse28 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (.cse6 (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 20)) (.cse26 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (let ((.cse3 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 20)) (.cse2 (select .cse26 20)) (.cse17 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse10 (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16)))) (.cse7 (not .cse6)) (.cse0 (* 4 (select .cse28 (+ 20 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|)))) (.cse16 (select .cse28 20)) (.cse5 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (.cse12 (select .cse27 20)) (.cse9 (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse20 (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4)) (.cse15 (* .cse8 4)) (.cse1 (* (select (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (.cse18 (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse23 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (.cse11 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse19 (< .cse25 0)) (.cse22 (select .cse26 .cse21)) (.cse4 (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4)) (.cse14 (select |c_#length| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (<= 3 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (<= 0 (+ .cse0 4 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|)) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse1 4)) (<= 0 .cse2) (<= 0 .cse3) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse4 4)) (or (and .cse5 (<= 2 |c_ULTIMATE.start_write~int_#value#1|) .cse6) (and .cse7 .cse5 (<= |c_ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* .cse3 4) 4)))) (<= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse8) (= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse2) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (or .cse9 (< .cse10 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse4))) .cse11 (= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse12) (<= 2 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse13) .cse14) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 .cse15)) (<= 0 .cse16) .cse17 (<= .cse4 12) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 19) .cse18) (or .cse17 .cse19) (<= 3 |c_ULTIMATE.start_write~int_#value#1|) (or .cse9 (< .cse10 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse13))) (<= 2 |c_ULTIMATE.start_writer_fn_~i~1#1|) .cse7 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse20) .cse14) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (<= .cse20 12) (< (+ 7 .cse0 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (select |c_#length| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (<= (* .cse16 4) 12) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse21 |c_ULTIMATE.start_read~int_#ptr#1.offset|) .cse5 (<= |c_ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* 4 .cse22) 4)) .cse23 (<= (* 4 .cse12) 12) (or (exists ((|ULTIMATE.start_write~int_#ptr#1.offset| Int)) (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (<= 3 (select .cse24 |ULTIMATE.start_write~int_#ptr#1.offset|)) (<= 0 |ULTIMATE.start_write~int_#ptr#1.offset|) (<= |ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse24 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4)))))) (<= 3 .cse8)) (<= (+ |c_ULTIMATE.start_write~int_#sizeOfWrittenType#1| |c_ULTIMATE.start_write~int_#ptr#1.offset|) (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 .cse12) (= 20 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (or .cse9 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse20 4)) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset| 0) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse15) .cse14) (<= 0 .cse25) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 7 .cse1) .cse18) (or .cse23 .cse19) (<= 3 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or .cse11 .cse19) (<= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse22) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse4) .cse14))))) is different from false [2022-09-30 07:59:48,508 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse18 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse21 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4)) (.cse8 (select .cse23 .cse18)) (.cse24 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (.cse6 (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 20)) (.cse22 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (let ((.cse3 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 20)) (.cse2 (select .cse22 20)) (.cse11 (div (+ (* (- 1) |c_ULTIMATE.start_write~int_#ptr#1.offset|) 4) (- 4))) (.cse15 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse7 (not .cse6)) (.cse0 (* 4 (select .cse24 (+ 20 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|)))) (.cse13 (select .cse24 20)) (.cse5 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (.cse10 (select .cse23 20)) (.cse12 (* .cse8 4)) (.cse1 (* (select (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (.cse17 (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse9 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse16 (< .cse21 0)) (.cse19 (select .cse22 .cse18)) (.cse4 (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4)) (.cse14 (select |c_#length| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (<= 3 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (<= 0 (+ .cse0 4 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|)) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse1 4)) (<= 0 .cse2) (<= 0 .cse3) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse4 4)) (or (and .cse5 (<= 2 |c_ULTIMATE.start_write~int_#value#1|) .cse6) (and .cse7 .cse5 (<= |c_ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* .cse3 4) 4)))) (<= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse8) (= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse2) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) .cse9 (= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse10) (<= 2 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (< .cse11 4) (<= 0 |c_ULTIMATE.start_ring_enqueue_#t~mem6#1|) (<= |c_ULTIMATE.start_write~int_#sizeOfWrittenType#1| 4) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 .cse12)) (<= 0 .cse11) (<= 0 .cse13) (<= 24 .cse14) .cse15 (<= .cse4 12) (or .cse15 .cse16) (<= 3 |c_ULTIMATE.start_write~int_#value#1|) (= |c_reader_twoThread1of1ForFork1_~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 2 |c_ULTIMATE.start_writer_fn_~i~1#1|) .cse7 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (<= (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 12) (< (+ 7 .cse0 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (select |c_#length| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (<= (* .cse13 4) 12) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (<= 24 .cse17) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse18 |c_ULTIMATE.start_read~int_#ptr#1.offset|) .cse5 (<= |c_ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* 4 .cse19) 4)) (<= (* 4 .cse10) 12) (< |c_ULTIMATE.start_read~int_#value#1| 4) (= 0 (mod (* 3 |c_ULTIMATE.start_write~int_#ptr#1.offset|) 4)) (or (exists ((|ULTIMATE.start_write~int_#ptr#1.offset| Int)) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (<= 3 (select .cse20 |ULTIMATE.start_write~int_#ptr#1.offset|)) (<= 0 |ULTIMATE.start_write~int_#ptr#1.offset|) (<= |ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse20 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4)))))) (<= 3 .cse8)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 .cse10) (= 20 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (<= 24 (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= |c_reader_twoThread1of1ForFork1_~arg#1.offset| 0) (or (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (< |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset| 0) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse12) .cse14) (<= 0 .cse21) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 7 .cse1) .cse17) (or (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5)) .cse16) (<= 3 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or .cse9 .cse16) (<= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse19) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse4) .cse14))))) is different from false [2022-09-30 08:00:18,606 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4)) (.cse3 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|) 20)) (.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (.cse1 (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse2 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) 0)) (.cse7 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (.cse4 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse6 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) 0))) (and (<= 3 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse0 4)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (or .cse1 (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse0))) (or .cse2 .cse3) .cse4 (<= 2 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 19) (+ |c_ULTIMATE.start_read~int_#sizeOfReadType#1| |c_ULTIMATE.start_read~int_#ptr#1.offset|)) (<= 0 .cse5) .cse3 (<= .cse0 12) (or .cse3 .cse6) (<= 2 |c_ULTIMATE.start_writer_fn_~i~1#1|) (or .cse1 (forall ((v_ArrVal_212 Int)) (or (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_212)) |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_212))))) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (<= (* .cse5 4) 12) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) |c_ULTIMATE.start_read~int_#ptr#1.offset|) .cse7 (<= (* 4 .cse8) 12) (or .cse1 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_39| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 .cse8) (= 20 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (or .cse1 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (or .cse2 .cse7) (= |c_ULTIMATE.start_read~int_#ptr#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or .cse2 .cse4) (<= (+ (* 4 |c_ULTIMATE.start_write~int_#value#1|) 8) |c_ULTIMATE.start_write~int_#ptr#1.offset|) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset| 0) (or .cse7 .cse6) (<= 3 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 20) (or .cse4 .cse6) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0))) is different from false [2022-09-30 08:00:20,498 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (.cse3 (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse0 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) 0)) (.cse4 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4) 4) 0)) (.cse7 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (.cse2 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse5 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) 0))) (and (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (or .cse0 .cse1) .cse2 (or .cse3 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)))) (or .cse2 .cse4) .cse1 (or .cse1 .cse5) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (<= (* 4 .cse6) 12) (or .cse3 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_39| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or .cse4 .cse1) (<= 0 .cse6) (or .cse3 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (or .cse0 .cse7) (or .cse0 .cse2) (or .cse4 .cse7) (or .cse7 .cse5) (<= 3 |c_ULTIMATE.start_ring_enqueue_~x#1|) (or .cse2 .cse5) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0))) is different from false [2022-09-30 08:00:21,899 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4)) (.cse2 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (.cse6 (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse1 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) 0)) (.cse7 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (.cse3 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse4 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) 0))) (and (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse0 4)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (or .cse1 .cse2) .cse3 .cse2 (<= .cse0 12) (or .cse2 .cse4) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) |c_ULTIMATE.start_read~int_#ptr#1.offset|) (<= (* 4 .cse5) 12) (or .cse6 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_39| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 .cse5) (= 20 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (or .cse6 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (or .cse1 .cse7) (or .cse1 .cse3) (or .cse7 .cse4) (<= 3 |c_ULTIMATE.start_ring_enqueue_~x#1|) (or .cse3 .cse4) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0))) is different from false [2022-09-30 08:00:27,220 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (let ((.cse3 (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse1 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse6 (select .cse5 20)) (.cse0 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) 0)) (.cse2 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse4 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4) 4) 0)) (.cse7 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (.cse8 (* |c_ULTIMATE.start_read~int_#value#1| 4))) (and (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (or .cse0 .cse1) .cse2 (or .cse3 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)))) (or .cse2 .cse4) .cse1 (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (<= |c_ULTIMATE.start_read~int_#value#1| (select .cse5 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (<= (* 4 .cse6) 12) (or .cse3 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_39| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= |c_ULTIMATE.start_read~int_#value#1| .cse6) (or .cse4 .cse1) (<= 0 .cse6) (or .cse0 .cse7) (or .cse0 .cse2) (or .cse4 .cse7) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse8 4)) (<= 3 |c_ULTIMATE.start_ring_enqueue_~x#1|) (<= .cse8 12) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0)))) is different from false [2022-09-30 08:00:33,414 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse13 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (.cse3 (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 20)) (.cse12 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (let ((.cse1 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 20)) (.cse0 (select .cse12 20)) (.cse6 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse4 (not .cse3)) (.cse2 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (.cse5 (select .cse14 .cse13)) (.cse9 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse7 (select .cse14 20)) (.cse8 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4) 4) 0)) (.cse10 (select .cse12 .cse13)) (.cse11 (* |c_ULTIMATE.start_read~int_#value#1| 4))) (and (<= 0 .cse0) (<= 0 .cse1) (or (and .cse2 (<= 2 |c_ULTIMATE.start_write~int_#value#1|) .cse3) (and .cse4 .cse2 (<= |c_ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* .cse1 4) 4)))) (<= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse5) (= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse0) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) .cse6 (or (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)))) (= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse7) (or .cse6 .cse8) .cse9 (<= 3 |c_ULTIMATE.start_write~int_#value#1|) .cse4 (<= (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 12) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) .cse2 (<= |c_ULTIMATE.start_read~int_#value#1| .cse5) (<= |c_ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* 4 .cse10) 4)) (<= (* 4 .cse7) 12) (<= (+ |c_ULTIMATE.start_write~int_#sizeOfWrittenType#1| |c_ULTIMATE.start_write~int_#ptr#1.offset|) (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= |c_ULTIMATE.start_read~int_#value#1| .cse7) (or .cse8 .cse9) (<= 0 .cse7) (or .cse8 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse11 4)) (<= 3 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse10) (<= .cse11 12) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0)))) is different from false [2022-09-30 08:00:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 08:00:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-30 08:00:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-09-30 08:00:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-09-30 08:00:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 08:00:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-09-30 08:00:42,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-30 08:00:42,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 08:00:42,656 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-30 08:00:42,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 08:00:42,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2011562193, now seen corresponding path program 2 times [2022-09-30 08:00:42,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 08:00:42,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211779269] [2022-09-30 08:00:42,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 08:00:42,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 08:00:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 08:00:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 289 proven. 173 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-09-30 08:00:44,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 08:00:44,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211779269] [2022-09-30 08:00:44,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211779269] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 08:00:44,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672712240] [2022-09-30 08:00:44,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-30 08:00:44,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 08:00:44,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 08:00:44,835 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 08:00:44,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-30 08:00:45,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-30 08:00:45,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-30 08:00:45,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 344 conjunts are in the unsatisfiable core [2022-09-30 08:00:45,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 08:00:45,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-30 08:00:45,248 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-30 08:00:45,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-09-30 08:00:45,424 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-09-30 08:00:45,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-09-30 08:00:45,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-30 08:00:46,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 08:00:46,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-09-30 08:00:46,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-09-30 08:00:46,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-09-30 08:00:48,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 08:00:48,573 INFO L356 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-09-30 08:00:48,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2022-09-30 08:00:49,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 08:00:49,409 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 08:00:49,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2022-09-30 08:00:51,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 08:00:51,342 INFO L356 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-09-30 08:00:51,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2022-09-30 08:00:52,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 08:00:52,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 08:00:52,365 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 08:00:52,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2022-09-30 08:00:54,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 08:00:54,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 08:00:54,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 08:00:54,768 INFO L356 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2022-09-30 08:00:54,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 50 [2022-09-30 08:00:55,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 08:00:55,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 08:00:55,774 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 08:00:55,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2022-09-30 08:00:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 257 proven. 261 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-09-30 08:00:57,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 08:00:58,316 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 08:00:58,316 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 36 treesize of output 40 [2022-09-30 08:00:59,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-09-30 08:00:59,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 08:00:59,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 08:01:11,069 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 08:01:23,642 WARN L233 SmtUtils]: Spent 10.28s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 08:01:35,797 WARN L233 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-09-30 08:02:38,461 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-30 08:02:38,489 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 08:02:38,489 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-09-30 08:02:38,489 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 08:02:38,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-09-30 08:02:38,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 08:02:38,662 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 561 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 174 known predicates. [2022-09-30 08:02:38,665 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2022-09-30 08:02:38,666 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/3) [2022-09-30 08:02:38,667 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-30 08:02:38,667 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-30 08:02:38,669 INFO L202 PluginConnector]: Adding new model ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:02:38 BasicIcfg [2022-09-30 08:02:38,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-30 08:02:38,669 INFO L158 Benchmark]: Toolchain (without parser) took 854763.97ms. Allocated memory was 186.6MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 142.9MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-09-30 08:02:38,669 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 186.6MB. Free memory was 146.6MB in the beginning and 146.5MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-30 08:02:38,669 INFO L158 Benchmark]: Boogie Preprocessor took 87.89ms. Allocated memory is still 186.6MB. Free memory was 142.9MB in the beginning and 139.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-09-30 08:02:38,670 INFO L158 Benchmark]: RCFGBuilder took 657.17ms. Allocated memory is still 186.6MB. Free memory was 139.4MB in the beginning and 143.1MB in the end (delta: -3.7MB). Peak memory consumption was 19.7MB. Max. memory is 8.0GB. [2022-09-30 08:02:38,670 INFO L158 Benchmark]: TraceAbstraction took 854003.01ms. Allocated memory was 186.6MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 142.4MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-09-30 08:02:38,670 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.13ms. Allocated memory is still 186.6MB. Free memory was 146.6MB in the beginning and 146.5MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 87.89ms. Allocated memory is still 186.6MB. Free memory was 142.9MB in the beginning and 139.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 657.17ms. Allocated memory is still 186.6MB. Free memory was 139.4MB in the beginning and 143.1MB in the end (delta: -3.7MB). Peak memory consumption was 19.7MB. Max. memory is 8.0GB. * TraceAbstraction took 854003.01ms. Allocated memory was 186.6MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 142.4MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 107, positive: 105, positive conditional: 105, 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: 604886, positive: 585275, positive conditional: 585275, positive unconditional: 0, negative: 19611, negative conditional: 19611, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 586750, positive: 585275, positive conditional: 0, positive unconditional: 585275, negative: 1475, negative conditional: 0, negative unconditional: 1475, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 20231, positive: 20146, positive conditional: 0, positive unconditional: 20146, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 586750, positive: 565129, positive conditional: 0, positive unconditional: 565129, negative: 1390, negative conditional: 0, negative unconditional: 1390, unknown: 20231, unknown conditional: 0, unknown unconditional: 20231] , 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: 2, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 160, positive: 157, positive conditional: 157, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 604886, positive: 585275, positive conditional: 585275, positive unconditional: 0, negative: 19611, negative conditional: 19611, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 586750, positive: 585275, positive conditional: 0, positive unconditional: 585275, negative: 1475, negative conditional: 0, negative unconditional: 1475, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 20231, positive: 20146, positive conditional: 0, positive unconditional: 20146, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 586750, positive: 565129, positive conditional: 0, positive unconditional: 565129, negative: 1390, negative conditional: 0, negative unconditional: 1390, unknown: 20231, unknown conditional: 0, unknown unconditional: 20231] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 116, Positive conditional cache size: 0, Positive unconditional cache size: 116, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 5, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 361, positive: 355, positive conditional: 355, 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: 604886, positive: 585275, positive conditional: 585275, positive unconditional: 0, negative: 19611, negative conditional: 19611, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 586750, positive: 585275, positive conditional: 0, positive unconditional: 585275, negative: 1475, negative conditional: 0, negative unconditional: 1475, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 20231, positive: 20146, positive conditional: 0, positive unconditional: 20146, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 586750, positive: 565129, positive conditional: 0, positive unconditional: 565129, negative: 1390, negative conditional: 0, negative unconditional: 1390, unknown: 20231, unknown conditional: 0, unknown unconditional: 20231] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 241, Positive conditional cache size: 0, Positive unconditional cache size: 241, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 11, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 562, positive: 553, positive conditional: 553, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 604886, positive: 585275, positive conditional: 585275, positive unconditional: 0, negative: 19611, negative conditional: 19611, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 586750, positive: 585275, positive conditional: 0, positive unconditional: 585275, negative: 1475, negative conditional: 0, negative unconditional: 1475, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 20231, positive: 20146, positive conditional: 0, positive unconditional: 20146, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 586750, positive: 565129, positive conditional: 0, positive unconditional: 565129, negative: 1390, negative conditional: 0, negative unconditional: 1390, unknown: 20231, unknown conditional: 0, unknown unconditional: 20231] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 265, Positive conditional cache size: 0, Positive unconditional cache size: 265, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 20, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 162975, positive: 157810, positive conditional: 157810, positive unconditional: 0, negative: 5165, negative conditional: 5165, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 604886, positive: 585275, positive conditional: 585275, positive unconditional: 0, negative: 19611, negative conditional: 19611, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 586750, positive: 585275, positive conditional: 0, positive unconditional: 585275, negative: 1475, negative conditional: 0, negative unconditional: 1475, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 20231, positive: 20146, positive conditional: 0, positive unconditional: 20146, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 586750, positive: 565129, positive conditional: 0, positive unconditional: 565129, negative: 1390, negative conditional: 0, negative unconditional: 1390, unknown: 20231, unknown conditional: 0, unknown unconditional: 20231] , Statistics on independence cache: Total cache size (in pairs): 16166, Positive cache size: 16098, Positive conditional cache size: 0, Positive unconditional cache size: 16098, Negative cache size: 68, Negative conditional cache size: 0, Negative unconditional cache size: 68, Independence queries for same thread: 4759, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 274100, positive: 265340, positive conditional: 265340, positive unconditional: 0, negative: 8760, negative conditional: 8760, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 604886, positive: 585275, positive conditional: 585275, positive unconditional: 0, negative: 19611, negative conditional: 19611, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 586750, positive: 585275, positive conditional: 0, positive unconditional: 585275, negative: 1475, negative conditional: 0, negative unconditional: 1475, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 20231, positive: 20146, positive conditional: 0, positive unconditional: 20146, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 586750, positive: 565129, positive conditional: 0, positive unconditional: 565129, negative: 1390, negative conditional: 0, negative unconditional: 1390, unknown: 20231, unknown conditional: 0, unknown unconditional: 20231] , Statistics on independence cache: Total cache size (in pairs): 16647, Positive cache size: 16579, Positive conditional cache size: 0, Positive unconditional cache size: 16579, Negative cache size: 68, Negative conditional cache size: 0, Negative unconditional cache size: 68, Independence queries for same thread: 12869, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 166621, positive: 160955, positive conditional: 160955, positive unconditional: 0, negative: 5666, negative conditional: 5666, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 604886, positive: 585275, positive conditional: 585275, positive unconditional: 0, negative: 19611, negative conditional: 19611, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 586750, positive: 585275, positive conditional: 0, positive unconditional: 585275, negative: 1475, negative conditional: 0, negative unconditional: 1475, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 20231, positive: 20146, positive conditional: 0, positive unconditional: 20146, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 586750, positive: 565129, positive conditional: 0, positive unconditional: 565129, negative: 1390, negative conditional: 0, negative unconditional: 1390, unknown: 20231, unknown conditional: 0, unknown unconditional: 20231] , Statistics on independence cache: Total cache size (in pairs): 20231, Positive cache size: 20146, Positive conditional cache size: 0, Positive unconditional cache size: 20146, Negative cache size: 85, Negative conditional cache size: 0, Negative unconditional cache size: 85, Independence queries for same thread: 18136, Statistics for Abstraction: - TimeoutResultAtElement [Line: 861]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 561 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 174 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 5 procedures, 788 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 853.8s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 597.2s, 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: 331, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 138.7s InterpolantComputationTime, 2940 NumberOfCodeBlocks, 2940 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 3984 ConstructedInterpolants, 316 QuantifiedInterpolants, 71633 SizeOfPredicates, 220 NumberOfNonLiveVariables, 2393 ConjunctsInSsa, 347 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 494/1737 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown