/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1583.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:43:09,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:43:09,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:43:09,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:43:09,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:43:09,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:43:09,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:43:09,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:43:09,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:43:09,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:43:09,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:43:09,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:43:09,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:43:09,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:43:09,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:43:09,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:43:09,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:43:09,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:43:09,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:43:09,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:43:09,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:43:09,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:43:09,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:43:09,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:43:09,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:43:09,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:43:09,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:43:09,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:43:09,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:43:09,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:43:09,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:43:09,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:43:09,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:43:09,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:43:09,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:43:09,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:43:09,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:43:09,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:43:09,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:43:09,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:43:09,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:43:09,787 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 15:43:09,821 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:43:09,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:43:09,821 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:43:09,822 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:43:09,822 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:43:09,822 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:43:09,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:43:09,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:43:09,828 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:43:09,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:43:09,829 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:43:09,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:43:09,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:43:09,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:43:09,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:43:09,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:43:09,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:43:09,830 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:43:09,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:43:09,830 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:43:09,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:43:09,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:43:09,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:43:09,832 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:43:09,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:43:09,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:43:09,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:43:09,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:43:09,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:43:09,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:43:09,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:43:09,833 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:43:09,833 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:43:09,833 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:43:09,833 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:43:09,834 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:43:09,834 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:43:09,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:43:09,834 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-03 15:43:10,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:43:10,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:43:10,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:43:10,081 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:43:10,082 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:43:10,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1583.bpl [2022-10-03 15:43:10,084 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1583.bpl' [2022-10-03 15:43:10,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:43:10,174 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:43:10,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:43:10,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:43:10,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:43:10,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:43:10" (1/1) ... [2022-10-03 15:43:10,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:43:10" (1/1) ... [2022-10-03 15:43:10,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:43:10" (1/1) ... [2022-10-03 15:43:10,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:43:10" (1/1) ... [2022-10-03 15:43:10,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:43:10" (1/1) ... [2022-10-03 15:43:10,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:43:10" (1/1) ... [2022-10-03 15:43:10,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:43:10" (1/1) ... [2022-10-03 15:43:10,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:43:10,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:43:10,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:43:10,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:43:10,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:43:10" (1/1) ... [2022-10-03 15:43:10,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:43:10,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:43:10,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-03 15:43:10,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-03 15:43:10,397 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:43:10,397 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:43:10,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:43:10,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:43:10,399 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 15:43:10,618 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:43:10,619 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:43:11,545 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:43:11,568 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:43:11,569 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:43:11,572 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:43:11 BoogieIcfgContainer [2022-10-03 15:43:11,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:43:11,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:43:11,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:43:11,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:43:11,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:43:10" (1/2) ... [2022-10-03 15:43:11,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca04956 and model type divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:43:11, skipping insertion in model container [2022-10-03 15:43:11,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:43:11" (2/2) ... [2022-10-03 15:43:11,585 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1583.bpl [2022-10-03 15:43:11,591 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:43:11,597 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:43:11,598 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:43:11,598 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:43:11,741 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:43:11,817 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:43:11,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:43:11,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:43:11,821 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 15:43:11,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-03 15:43:11,864 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:43:11,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:43:11,885 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;@57ca1f6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:43:11,885 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:43:12,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:43:12,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:43:12,390 INFO L85 PathProgramCache]: Analyzing trace with hash -441839634, now seen corresponding path program 1 times [2022-10-03 15:43:12,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:43:12,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685824758] [2022-10-03 15:43:12,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:43:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:43:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:43:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:43:13,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:43:13,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685824758] [2022-10-03 15:43:13,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685824758] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:43:13,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:43:13,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:43:13,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134646329] [2022-10-03 15:43:13,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:43:13,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:43:13,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:43:13,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:43:13,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:43:13,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:13,065 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:43:13,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 363.5) internal successors, (727), 2 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:43:13,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:13,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:13,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:43:13,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:43:13,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:43:13,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1403365058, now seen corresponding path program 1 times [2022-10-03 15:43:13,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:43:13,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372136925] [2022-10-03 15:43:13,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:43:13,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:43:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:43:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:43:13,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:43:13,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372136925] [2022-10-03 15:43:13,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372136925] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:43:13,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:43:13,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-10-03 15:43:13,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690371854] [2022-10-03 15:43:13,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:43:13,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-03 15:43:13,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:43:13,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-03 15:43:13,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-10-03 15:43:13,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:13,927 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:43:13,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 60.84615384615385) internal successors, (791), 14 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:43:13,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:13,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:15,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:15,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:43:15,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:43:15,990 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:43:15,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:43:15,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1750863210, now seen corresponding path program 1 times [2022-10-03 15:43:15,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:43:15,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361365165] [2022-10-03 15:43:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:43:15,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:43:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:43:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2022-10-03 15:43:20,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:43:20,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361365165] [2022-10-03 15:43:20,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361365165] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:43:20,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:43:20,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-10-03 15:43:20,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756626365] [2022-10-03 15:43:20,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:43:20,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-10-03 15:43:20,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:43:20,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-10-03 15:43:21,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=5018, Unknown=0, NotChecked=0, Total=5256 [2022-10-03 15:43:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:21,007 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:43:21,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 13.150684931506849) internal successors, (960), 73 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:43:21,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:21,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:43:21,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:46,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:43:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-10-03 15:43:46,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 15:43:46,732 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:43:46,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:43:46,733 INFO L85 PathProgramCache]: Analyzing trace with hash -228053806, now seen corresponding path program 2 times [2022-10-03 15:43:46,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:43:46,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299433774] [2022-10-03 15:43:46,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:43:46,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:43:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:43:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 15700 backedges. 3757 proven. 3075 refuted. 0 times theorem prover too weak. 8868 trivial. 0 not checked. [2022-10-03 15:43:55,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:43:55,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299433774] [2022-10-03 15:43:55,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299433774] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:43:55,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098419212] [2022-10-03 15:43:55,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 15:43:55,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:43:55,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:43:55,763 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-10-03 15:43:55,764 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-10-03 15:43:56,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-03 15:43:56,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 15:43:56,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 2006 conjuncts, 141 conjunts are in the unsatisfiable core [2022-10-03 15:43:56,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:43:58,690 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-10-03 15:43:58,690 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 40 [2022-10-03 15:43:58,704 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-03 15:43:58,705 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 24 treesize of output 32 [2022-10-03 15:43:58,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-10-03 15:43:59,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2022-10-03 15:43:59,906 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:43:59,906 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 28 treesize of output 10 [2022-10-03 15:43:59,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:43:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 15700 backedges. 2800 proven. 0 refuted. 0 times theorem prover too weak. 12900 trivial. 0 not checked. [2022-10-03 15:43:59,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:43:59,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098419212] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:43:59,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:43:59,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [64] total 95 [2022-10-03 15:43:59,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654225417] [2022-10-03 15:43:59,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:43:59,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-10-03 15:43:59,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:43:59,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-10-03 15:43:59,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=8624, Unknown=0, NotChecked=0, Total=8930 [2022-10-03 15:43:59,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:59,990 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:43:59,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 32.48717948717949) internal successors, (1267), 39 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:43:59,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:59,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:43:59,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2022-10-03 15:43:59,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:44:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:44:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:44:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-10-03 15:44:12,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-10-03 15:44:12,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-03 15:44:12,664 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,SelfDestructingSolverStorable3 [2022-10-03 15:44:12,665 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:44:12,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:44:12,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1048677916, now seen corresponding path program 1 times [2022-10-03 15:44:12,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:44:12,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507969826] [2022-10-03 15:44:12,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:44:12,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:44:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:44:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11187 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 11139 trivial. 0 not checked. [2022-10-03 15:44:21,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:44:21,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507969826] [2022-10-03 15:44:21,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507969826] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:44:21,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942099774] [2022-10-03 15:44:21,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:44:21,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:44:21,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:44:21,220 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-10-03 15:44:21,221 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-10-03 15:44:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:44:22,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 9506 conjuncts, 143 conjunts are in the unsatisfiable core [2022-10-03 15:44:22,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:44:23,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:44:24,599 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:44:24,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 15:44:24,944 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 20 treesize of output 20 [2022-10-03 15:44:27,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:44:27,449 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-10-03 15:44:27,765 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 12 treesize of output 11 [2022-10-03 15:44:28,326 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 21 treesize of output 9 [2022-10-03 15:44:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11187 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 11115 trivial. 0 not checked. [2022-10-03 15:44:28,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:44:28,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942099774] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:44:28,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:44:28,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [72] total 118 [2022-10-03 15:44:28,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117321462] [2022-10-03 15:44:28,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:44:28,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-10-03 15:44:28,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:44:28,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-10-03 15:44:28,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=13423, Unknown=0, NotChecked=0, Total=13806 [2022-10-03 15:44:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:44:28,626 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:44:28,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 20.666666666666668) internal successors, (992), 48 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:44:28,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:44:28,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:44:28,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2022-10-03 15:44:28,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-10-03 15:44:28,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:44:44,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:44:44,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:44:44,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:44:44,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-10-03 15:44:44,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-10-03 15:44:44,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-03 15:44:44,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:44:44,508 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:44:44,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:44:44,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1069246006, now seen corresponding path program 2 times [2022-10-03 15:44:44,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:44:44,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141201037] [2022-10-03 15:44:44,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:44:44,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:44:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:44:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 11808 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 11331 trivial. 0 not checked. [2022-10-03 15:44:54,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:44:54,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141201037] [2022-10-03 15:44:54,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141201037] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:44:54,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:44:54,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2022-10-03 15:44:54,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646055345] [2022-10-03 15:44:54,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:44:54,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-10-03 15:44:54,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:44:54,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-10-03 15:44:54,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=6382, Unknown=0, NotChecked=0, Total=6642 [2022-10-03 15:44:54,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:44:54,159 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:44:54,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 13.365853658536585) internal successors, (1096), 82 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:44:54,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:44:54,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:44:54,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:44:54,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-10-03 15:44:54,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2022-10-03 15:44:54,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:45:28,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:45:28,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:45:28,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:45:28,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-10-03 15:45:28,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-10-03 15:45:28,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-10-03 15:45:28,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-03 15:45:28,563 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:45:28,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:45:28,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1253943348, now seen corresponding path program 3 times [2022-10-03 15:45:28,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:45:28,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001305065] [2022-10-03 15:45:28,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:45:28,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:45:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:45:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 11187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11187 trivial. 0 not checked. [2022-10-03 15:45:34,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:45:34,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001305065] [2022-10-03 15:45:34,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001305065] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:45:34,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:45:34,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-10-03 15:45:34,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630656028] [2022-10-03 15:45:34,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:45:34,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-10-03 15:45:34,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:45:34,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-10-03 15:45:34,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3828, Unknown=0, NotChecked=0, Total=4032 [2022-10-03 15:45:34,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:45:34,436 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:45:34,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 15.21875) internal successors, (974), 64 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:45:34,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:45:34,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:45:34,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:45:34,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-10-03 15:45:34,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2022-10-03 15:45:34,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2022-10-03 15:45:34,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:45:53,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:45:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:45:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-10-03 15:45:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-10-03 15:45:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-10-03 15:45:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-10-03 15:45:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:45:53,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-03 15:45:53,438 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:45:53,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:45:53,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1561638935, now seen corresponding path program 1 times [2022-10-03 15:45:53,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:45:53,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337710017] [2022-10-03 15:45:53,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:45:53,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:45:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:45:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10724 backedges. 968 proven. 0 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2022-10-03 15:45:59,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:45:59,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337710017] [2022-10-03 15:45:59,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337710017] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:45:59,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:45:59,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-10-03 15:45:59,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373779460] [2022-10-03 15:45:59,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:45:59,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-10-03 15:45:59,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:45:59,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-10-03 15:45:59,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5033, Unknown=0, NotChecked=0, Total=5256 [2022-10-03 15:45:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:45:59,019 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:45:59,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 14.219178082191782) internal successors, (1038), 73 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:45:59,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:45:59,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:45:59,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2022-10-03 15:45:59,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-10-03 15:45:59,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-10-03 15:45:59,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-10-03 15:45:59,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:45:59,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:46:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:46:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:46:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-10-03 15:46:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-10-03 15:46:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-10-03 15:46:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-10-03 15:46:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:46:22,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-10-03 15:46:22,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-03 15:46:22,154 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:46:22,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:46:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash -769675163, now seen corresponding path program 1 times [2022-10-03 15:46:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:46:22,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298513652] [2022-10-03 15:46:22,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:46:22,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:46:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:46:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12580 backedges. 1314 proven. 0 refuted. 0 times theorem prover too weak. 11266 trivial. 0 not checked. [2022-10-03 15:46:29,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:46:29,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298513652] [2022-10-03 15:46:29,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298513652] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:46:29,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:46:29,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2022-10-03 15:46:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837601398] [2022-10-03 15:46:29,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:46:29,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-10-03 15:46:29,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:46:29,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-10-03 15:46:29,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=6064, Unknown=0, NotChecked=0, Total=6320 [2022-10-03 15:46:29,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:46:29,062 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:46:29,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 13.325) internal successors, (1066), 80 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:46:29,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:46:29,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:46:29,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2022-10-03 15:46:29,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-10-03 15:46:29,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-10-03 15:46:29,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-10-03 15:46:29,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:46:29,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-10-03 15:46:29,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:47:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:47:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:47:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-10-03 15:47:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-10-03 15:47:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-10-03 15:47:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:47:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-10-03 15:47:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:47:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-10-03 15:47:00,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-03 15:47:00,678 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:47:00,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:47:00,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1898429688, now seen corresponding path program 1 times [2022-10-03 15:47:00,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:47:00,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133037049] [2022-10-03 15:47:00,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:47:00,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:47:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:47:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2022-10-03 15:47:01,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:47:01,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133037049] [2022-10-03 15:47:01,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133037049] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:47:01,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:47:01,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-03 15:47:01,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076903400] [2022-10-03 15:47:01,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:47:01,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-03 15:47:01,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:47:01,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-03 15:47:01,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-10-03 15:47:01,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:47:01,372 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:47:01,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 92.9090909090909) internal successors, (1022), 12 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:47:01,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:47:01,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:47:01,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2022-10-03 15:47:01,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2022-10-03 15:47:01,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2022-10-03 15:47:01,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:47:01,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-10-03 15:47:01,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:47:01,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 139 states. [2022-10-03 15:47:01,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:47:05,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:47:05,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:47:05,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-10-03 15:47:05,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-10-03 15:47:05,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-10-03 15:47:05,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:47:05,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-10-03 15:47:05,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:47:05,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-10-03 15:47:05,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-03 15:47:05,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-03 15:47:05,138 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:47:05,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:47:05,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1480334368, now seen corresponding path program 1 times [2022-10-03 15:47:05,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:47:05,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182838728] [2022-10-03 15:47:05,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:47:05,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:47:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:47:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 16053 backedges. 1496 proven. 182 refuted. 0 times theorem prover too weak. 14375 trivial. 0 not checked. [2022-10-03 15:47:16,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:47:16,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182838728] [2022-10-03 15:47:16,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182838728] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:47:16,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062694768] [2022-10-03 15:47:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:47:16,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:47:16,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:47:16,260 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:47:16,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-03 15:47:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:47:18,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 11560 conjuncts, 382 conjunts are in the unsatisfiable core [2022-10-03 15:47:19,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:47:19,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:47:19,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:47:19,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 15:47:20,592 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 15:47:20,592 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 18 [2022-10-03 15:47:41,535 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:47:41,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 15:47:41,753 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-10-03 15:47:41,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 31 [2022-10-03 15:47:43,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:47:43,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-10-03 15:47:51,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:47:51,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-10-03 15:49:25,585 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 11 treesize of output 7 [2022-10-03 15:49:25,666 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 11 treesize of output 7 [2022-10-03 15:49:33,224 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-10-03 15:49:33,224 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 28 treesize of output 26 [2022-10-03 15:49:36,372 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:49:36,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2022-10-03 15:49:36,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:49:36,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 42 [2022-10-03 15:49:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 16053 backedges. 2506 proven. 11591 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked. [2022-10-03 15:49:41,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:49:41,101 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:49:41,102 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 1 case distinctions, treesize of input 12 treesize of output 8 [2022-10-03 15:49:41,106 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:49:41,106 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 1 case distinctions, treesize of input 12 treesize of output 8 [2022-10-03 15:49:43,533 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4282 (Array Int Int))) (not (= (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|))) (forall ((v_ArrVal_4281 Int)) (let ((.cse0 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_4281)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= |c_ULTIMATE.start_write~$Pointer$_#value#1.offset| v_ArrVal_4281)) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse0 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2) (< .cse2 0))))))) (or (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse3 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_4282))) (or (not (= (select (select .cse3 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((v_ArrVal_4281 Int)) (let ((.cse5 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_4281)))) (or (not (<= |c_ULTIMATE.start_write~$Pointer$_#value#1.offset| v_ArrVal_4281)) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse5 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< (select (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0)))))) is different from false [2022-10-03 15:49:43,656 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4281 Int)) (let ((.cse0 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (or (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse0 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< (select (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0) (< v_ArrVal_4281 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4))))) (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse2 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282))) (or (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (not (= (select (select .cse2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))))) (or (forall ((v_ArrVal_4282 (Array Int Int))) (not (= (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|))) (forall ((v_ArrVal_4281 Int)) (let ((.cse3 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse3 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< .cse4 0) (< v_ArrVal_4281 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4)) (= .cse4 (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))))))) is different from false [2022-10-03 15:49:43,713 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4281 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1) (< .cse1 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< v_ArrVal_4281 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4))))))) (forall ((v_ArrVal_4282 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (or (forall ((v_ArrVal_4281 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (or (< (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse3 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< v_ArrVal_4281 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4))))) (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282))) (or (not (= (select (select .cse4 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))))) is different from false [2022-10-03 15:49:43,799 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (forall ((v_ArrVal_4281 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (or (< (select (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< v_ArrVal_4281 (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4)))))) (or (forall ((v_ArrVal_4281 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse4) (< .cse4 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse5 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< v_ArrVal_4281 (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4))))))) (forall ((v_ArrVal_4282 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|))))) is different from false [2022-10-03 15:49:44,473 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4281 Int)) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< v_ArrVal_4281 (+ (select .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) 4)) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2) (< .cse2 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse3 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))))))))) (forall ((v_ArrVal_4282 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (or (forall ((v_ArrVal_4281 Int)) (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store .cse4 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (or (< v_ArrVal_4281 (+ (select .cse4 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) 4)) (< (select (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse5 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))))))) (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282))) (or (not (= (select (select .cse6 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse7 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))))) is different from false [2022-10-03 15:49:44,545 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4281 Int)) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (store .cse3 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| v_ArrVal_4281)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse0 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2) (< .cse2 0) (< v_ArrVal_4281 (+ (select .cse3 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 4)))))))) (forall ((v_ArrVal_4282 (Array Int Int))) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))))) (or (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_4282))) (or (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base| (select (select .cse4 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (forall ((v_ArrVal_4281 Int)) (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (store .cse7 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| v_ArrVal_4281)))) (or (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse6 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< (select (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0) (< v_ArrVal_4281 (+ (select .cse7 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 4)))))))) is different from false [2022-10-03 15:49:44,599 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_4282))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((v_ArrVal_4281 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse3 .cse4 v_ArrVal_4281)))) (or (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< (select (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0) (< v_ArrVal_4281 (+ (select .cse3 .cse4) 4)))))))) (or (forall ((v_ArrVal_4281 Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| .cse11)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse11 (store .cse9 .cse10 v_ArrVal_4281)))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse6 (select .cse7 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse8 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< .cse6 0) (< v_ArrVal_4281 (+ (select .cse9 .cse10) 4))))))))) (forall ((v_ArrVal_4282 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|))))) is different from false [2022-10-03 15:49:44,727 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4282 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|))) (forall ((v_ArrVal_4281 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse0 .cse1 v_ArrVal_4281)))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< v_ArrVal_4281 (+ (select .cse0 .cse1) 4)) (< .cse2 0) (= (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse4 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))))))))))) (or (forall ((v_ArrVal_4281 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse9)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse9 (store .cse6 .cse7 v_ArrVal_4281)))) (or (< v_ArrVal_4281 (+ (select .cse6 .cse7) 4)) (< (select (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse8 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|)))))))) (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_4282))) (or (let ((.cse10 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse10 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (not (= (select (select .cse11 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|))))))) is different from false [2022-10-03 15:49:55,970 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-10-03 15:49:55,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 961 treesize of output 865 [2022-10-03 15:49:56,430 INFO L356 Elim1Store]: treesize reduction 30, result has 88.4 percent of original size [2022-10-03 15:49:56,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 6402 treesize of output 5762 [2022-10-03 15:49:56,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:49:56,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 5165 treesize of output 4754 [2022-10-03 15:49:56,964 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:49:56,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 4465 treesize of output 4468 [2022-10-03 15:49:57,034 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 4449 treesize of output 4445 Received shutdown request... [2022-10-03 15:55:45,707 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-10-03 15:55:45,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 15:55:45,743 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:55:45,744 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:55:45,745 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:55:45,770 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-10-03 15:55:45,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:55:45,940 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 4539 with TraceHistMax 11,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. [2022-10-03 15:55:45,945 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2022-10-03 15:55:45,947 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-10-03 15:55:45,948 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 15:55:45,949 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 15:55:45,951 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:55:45 BasicIcfg [2022-10-03 15:55:45,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 15:55:45,952 INFO L158 Benchmark]: Toolchain (without parser) took 755777.56ms. Allocated memory was 170.9MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 124.0MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2022-10-03 15:55:45,952 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.34ms. Allocated memory is still 170.9MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 15:55:45,952 INFO L158 Benchmark]: Boogie Preprocessor took 143.88ms. Allocated memory is still 170.9MB. Free memory was 123.9MB in the beginning and 117.5MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 15:55:45,952 INFO L158 Benchmark]: RCFGBuilder took 1250.98ms. Allocated memory is still 170.9MB. Free memory was 117.5MB in the beginning and 126.2MB in the end (delta: -8.7MB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. [2022-10-03 15:55:45,953 INFO L158 Benchmark]: TraceAbstraction took 754376.06ms. Allocated memory was 170.9MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 125.7MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2022-10-03 15:55:45,954 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.34ms. Allocated memory is still 170.9MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 143.88ms. Allocated memory is still 170.9MB. Free memory was 123.9MB in the beginning and 117.5MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1250.98ms. Allocated memory is still 170.9MB. Free memory was 117.5MB in the beginning and 126.2MB in the end (delta: -8.7MB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. * TraceAbstraction took 754376.06ms. Allocated memory was 170.9MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 125.7MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 527, positive: 511, positive conditional: 511, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 511, Positive cache size: 511, Positive conditional cache size: 0, Positive unconditional cache size: 511, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 16, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1712, positive: 1663, positive conditional: 1663, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 1665, Positive cache size: 1665, Positive conditional cache size: 0, Positive unconditional cache size: 1665, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 65, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4352, positive: 4228, positive conditional: 4228, positive unconditional: 0, negative: 124, negative conditional: 124, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 4121, Positive cache size: 4117, Positive conditional cache size: 0, Positive unconditional cache size: 4117, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Independence queries for same thread: 185, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 45895, positive: 44441, positive conditional: 44441, positive unconditional: 0, negative: 1454, negative conditional: 1454, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 39595, Positive cache size: 39492, Positive conditional cache size: 0, Positive unconditional cache size: 39492, Negative cache size: 103, Negative conditional cache size: 0, Negative unconditional cache size: 103, Independence queries for same thread: 1528, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 24674, positive: 23837, positive conditional: 23837, positive unconditional: 0, negative: 837, negative conditional: 837, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 41884, Positive cache size: 41718, Positive conditional cache size: 0, Positive unconditional cache size: 41718, Negative cache size: 166, Negative conditional cache size: 0, Negative unconditional cache size: 166, Independence queries for same thread: 2205, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 25498, positive: 24621, positive conditional: 24621, positive unconditional: 0, negative: 877, negative conditional: 877, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 45929, Positive cache size: 45746, Positive conditional cache size: 0, Positive unconditional cache size: 45746, Negative cache size: 183, Negative conditional cache size: 0, Negative unconditional cache size: 183, Independence queries for same thread: 2921, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 26202, positive: 25317, positive conditional: 25317, positive unconditional: 0, negative: 885, negative conditional: 885, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 46465, Positive cache size: 46279, Positive conditional cache size: 0, Positive unconditional cache size: 46279, Negative cache size: 186, Negative conditional cache size: 0, Negative unconditional cache size: 186, Independence queries for same thread: 3641, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 24881, positive: 24036, positive conditional: 24036, positive unconditional: 0, negative: 845, negative conditional: 845, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 46716, Positive cache size: 46530, Positive conditional cache size: 0, Positive unconditional cache size: 46530, Negative cache size: 186, Negative conditional cache size: 0, Negative unconditional cache size: 186, Independence queries for same thread: 4327, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 25109, positive: 24258, positive conditional: 24258, positive unconditional: 0, negative: 851, negative conditional: 851, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 46927, Positive cache size: 46741, Positive conditional cache size: 0, Positive unconditional cache size: 46741, Negative cache size: 186, Negative conditional cache size: 0, Negative unconditional cache size: 186, Independence queries for same thread: 5019, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5798, positive: 5613, positive conditional: 5613, positive unconditional: 0, negative: 185, negative conditional: 185, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 47454, Positive cache size: 47267, Positive conditional cache size: 0, Positive unconditional cache size: 47267, Negative cache size: 187, Negative conditional cache size: 0, Negative unconditional cache size: 187, Independence queries for same thread: 5201, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 44153, positive: 42621, positive conditional: 42621, positive unconditional: 0, negative: 1532, negative conditional: 1532, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 48251, Positive cache size: 48064, Positive conditional cache size: 0, Positive unconditional cache size: 48064, Negative cache size: 187, Negative conditional cache size: 0, Negative unconditional cache size: 187, Independence queries for same thread: 6418, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1583]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 4539 with TraceHistMax 11,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1438 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 754.1s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 168.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 844, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 9.7s SatisfiabilityAnalysisTime, 52.1s InterpolantComputationTime, 34834 NumberOfCodeBlocks, 31786 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 34822 ConstructedInterpolants, 0 QuantifiedInterpolants, 167399 SizeOfPredicates, 139 NumberOfNonLiveVariables, 11512 ConjunctsInSsa, 284 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 98902/101984 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