/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.line1383.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:29:46,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:29:46,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:29:46,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:29:46,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:29:46,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:29:46,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:29:46,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:29:46,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:29:46,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:29:46,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:29:46,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:29:46,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:29:46,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:29:46,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:29:46,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:29:46,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:29:46,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:29:46,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:29:46,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:29:46,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:29:46,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:29:46,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:29:46,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:29:46,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:29:46,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:29:46,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:29:46,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:29:46,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:29:46,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:29:46,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:29:46,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:29:46,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:29:46,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:29:46,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:29:46,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:29:46,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:29:46,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:29:46,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:29:46,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:29:46,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:29:46,739 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:29:46,766 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:29:46,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:29:46,766 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:29:46,766 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:29:46,766 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:29:46,767 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:29:46,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:29:46,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:29:46,767 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:29:46,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:29:46,767 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:29:46,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:29:46,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:29:46,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:29:46,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:29:46,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:29:46,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:29:46,768 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:29:46,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:29:46,769 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:29:46,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:29:46,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:29:46,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:29:46,769 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:29:46,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:29:46,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:29:46,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:29:46,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:29:46,770 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:29:46,770 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:29:46,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:29:46,770 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:29:46,770 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:29:46,771 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:29:46,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:29:46,771 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:29:46,771 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:29:46,771 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:29:46,771 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:29:46,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:29:46,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:29:46,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:29:46,986 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:29:46,987 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:29:46,988 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.line1383.bpl [2022-10-03 15:29:46,988 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1383.bpl' [2022-10-03 15:29:47,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:29:47,082 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:29:47,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:29:47,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:29:47,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:29:47,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1383.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:29:47" (1/1) ... [2022-10-03 15:29:47,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1383.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:29:47" (1/1) ... [2022-10-03 15:29:47,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1383.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:29:47" (1/1) ... [2022-10-03 15:29:47,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1383.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:29:47" (1/1) ... [2022-10-03 15:29:47,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1383.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:29:47" (1/1) ... [2022-10-03 15:29:47,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1383.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:29:47" (1/1) ... [2022-10-03 15:29:47,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1383.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:29:47" (1/1) ... [2022-10-03 15:29:47,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:29:47,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:29:47,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:29:47,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:29:47,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1383.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:29:47" (1/1) ... [2022-10-03 15:29:47,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:29:47,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:29:47,277 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:29:47,294 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:29:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:29:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:29:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:29:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:29:47,330 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:29:47,543 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:29:47,544 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:29:48,669 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:29:48,699 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:29:48,700 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:29:48,707 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1383.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:29:48 BoogieIcfgContainer [2022-10-03 15:29:48,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:29:48,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:29:48,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:29:48,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:29:48,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1383.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:29:47" (1/2) ... [2022-10-03 15:29:48,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a3841f and model type divinefifo_1w1r.line1383.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:29:48, skipping insertion in model container [2022-10-03 15:29:48,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1383.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:29:48" (2/2) ... [2022-10-03 15:29:48,721 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1383.bpl [2022-10-03 15:29:48,729 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:29:48,740 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:29:48,740 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:29:48,740 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:29:48,873 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:29:48,931 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:29:48,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:29:48,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:29:48,934 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:29:48,941 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:29:48,969 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:29:48,975 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:29:48,981 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;@1f7c0a63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:29:48,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:29:49,348 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:29:49,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:29:49,352 INFO L85 PathProgramCache]: Analyzing trace with hash 767277211, now seen corresponding path program 1 times [2022-10-03 15:29:49,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:29:49,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875242528] [2022-10-03 15:29:49,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:29:49,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:29:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:29:49,977 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:29:49,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:29:49,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875242528] [2022-10-03 15:29:49,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875242528] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:29:49,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:29:49,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:29:49,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144181853] [2022-10-03 15:29:49,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:29:49,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:29:49,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:29:50,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:29:50,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:29:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:29:50,015 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:29:50,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 286.5) internal successors, (573), 2 states have internal predecessors, (573), 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:29:50,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:29:50,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:29:50,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:29:50,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:29:50,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:29:50,295 INFO L85 PathProgramCache]: Analyzing trace with hash -821636818, now seen corresponding path program 1 times [2022-10-03 15:29:50,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:29:50,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770131467] [2022-10-03 15:29:50,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:29:50,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:29:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:29:51,374 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:29:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:29:51,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770131467] [2022-10-03 15:29:51,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770131467] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:29:51,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:29:51,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-10-03 15:29:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858139946] [2022-10-03 15:29:51,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:29:51,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-03 15:29:51,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:29:51,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-03 15:29:51,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-10-03 15:29:51,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:29:51,380 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:29:51,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 45.642857142857146) internal successors, (639), 15 states have internal predecessors, (639), 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:29:51,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:29:51,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:29:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:29:53,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-03 15:29:53,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:29:53,109 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:29:53,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:29:53,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2014426212, now seen corresponding path program 1 times [2022-10-03 15:29:53,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:29:53,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551927469] [2022-10-03 15:29:53,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:29:53,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:29:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:29:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 124 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 15:29:53,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:29:53,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551927469] [2022-10-03 15:29:53,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551927469] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:29:53,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018827236] [2022-10-03 15:29:53,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:29:53,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:29:53,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:29:53,918 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:29:53,928 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:29:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:29:54,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 2403 conjuncts, 193 conjunts are in the unsatisfiable core [2022-10-03 15:29:54,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:29:54,574 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:29:54,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:29:54,799 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:29:55,330 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 15:29:55,330 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:30:01,399 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:30:01,400 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 49 treesize of output 46 [2022-10-03 15:30:01,414 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 15:30:01,414 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 46 treesize of output 42 [2022-10-03 15:30:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:30:02,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:30:02,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018827236] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:30:02,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:30:02,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [12] total 68 [2022-10-03 15:30:02,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622694824] [2022-10-03 15:30:02,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:30:02,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-10-03 15:30:02,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:30:02,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-10-03 15:30:02,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=4320, Unknown=0, NotChecked=0, Total=4556 [2022-10-03 15:30:02,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:02,830 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:30:02,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 16.982456140350877) internal successors, (968), 57 states have internal predecessors, (968), 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:30:02,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:02,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-10-03 15:30:02,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-03 15:30:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-10-03 15:30:08,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-03 15:30:09,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-10-03 15:30:09,019 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:30:09,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:30:09,019 INFO L85 PathProgramCache]: Analyzing trace with hash -497242214, now seen corresponding path program 1 times [2022-10-03 15:30:09,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:30:09,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985359022] [2022-10-03 15:30:09,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:30:09,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:30:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:30:09,797 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-10-03 15:30:09,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:30:09,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985359022] [2022-10-03 15:30:09,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985359022] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:30:09,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:30:09,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-10-03 15:30:09,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295508566] [2022-10-03 15:30:09,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:30:09,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-03 15:30:09,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:30:09,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-03 15:30:09,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-10-03 15:30:09,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:09,802 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:30:09,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 48.142857142857146) internal successors, (1011), 21 states have internal predecessors, (1011), 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:30:09,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:09,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-10-03 15:30:09,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-10-03 15:30:09,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-03 15:30:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-10-03 15:30:13,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-03 15:30:13,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 15:30:13,058 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:30:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:30:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash 517275575, now seen corresponding path program 1 times [2022-10-03 15:30:13,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:30:13,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803849194] [2022-10-03 15:30:13,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:30:13,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:30:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:30:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 124 proven. 297 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2022-10-03 15:30:13,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:30:13,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803849194] [2022-10-03 15:30:13,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803849194] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:30:13,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710501769] [2022-10-03 15:30:13,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:30:13,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:30:13,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:30:13,952 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:30:13,954 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:30:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:30:14,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 3487 conjuncts, 198 conjunts are in the unsatisfiable core [2022-10-03 15:30:14,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:30:14,758 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:30:14,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:30:14,934 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:30:15,451 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:30:15,456 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:30:15,496 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:30:19,877 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-10-03 15:30:19,878 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 21 treesize of output 21 [2022-10-03 15:30:20,502 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:30:20,503 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 42 treesize of output 39 [2022-10-03 15:30:20,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-10-03 15:30:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 279 proven. 144 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-10-03 15:30:21,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:30:21,772 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_533) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_534) |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)))))) is different from false [2022-10-03 15:30:21,806 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_534) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_533) |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|))))) is different from false [2022-10-03 15:30:21,823 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_533) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_534) |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|))))) is different from false [2022-10-03 15:30:21,865 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_533) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_534) |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|))))) is different from false [2022-10-03 15:30:21,873 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse0 (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_533) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_534) |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|))))) is different from false [2022-10-03 15:30:21,892 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse0 (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_533) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_534) |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)))))) is different from false [2022-10-03 15:30:23,866 INFO L356 Elim1Store]: treesize reduction 13, result has 86.6 percent of original size [2022-10-03 15:30:23,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 98 treesize of output 141 [2022-10-03 15:30:23,965 INFO L356 Elim1Store]: treesize reduction 13, result has 86.6 percent of original size [2022-10-03 15:30:23,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 88 treesize of output 143 [2022-10-03 15:30:23,981 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 45 treesize of output 39 [2022-10-03 15:30:23,991 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 39 treesize of output 33 [2022-10-03 15:30:27,036 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 15:30:27,037 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 13 treesize of output 12 [2022-10-03 15:30:29,615 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_532 Int) (v_ArrVal_531 Int) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int)) (or (= |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_fifo_init_~self#1.base|) (< (select (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_531) |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_532) |c_ULTIMATE.start_main_~#q~1#1.base|) 16))))) is different from false [2022-10-03 15:31:20,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:31:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 279 proven. 103 refuted. 0 times theorem prover too weak. 276 trivial. 41 not checked. [2022-10-03 15:31:20,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710501769] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 15:31:20,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 15:31:20,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 60, 50] total 119 [2022-10-03 15:31:20,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418973917] [2022-10-03 15:31:20,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 15:31:20,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 119 states [2022-10-03 15:31:20,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:31:20,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2022-10-03 15:31:20,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=686, Invalid=11756, Unknown=18, NotChecked=1582, Total=14042 [2022-10-03 15:31:20,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:20,862 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:31:20,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 119 states, 119 states have (on average 25.352941176470587) internal successors, (3017), 119 states have internal predecessors, (3017), 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:31:20,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:20,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-10-03 15:31:20,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-10-03 15:31:20,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-10-03 15:31:20,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:30,393 WARN L233 SmtUtils]: Spent 9.03s on a formula simplification. DAG size of input: 41 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:32:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-03 15:32:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-10-03 15:32:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-03 15:32:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-10-03 15:32:00,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-03 15:32:00,661 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:32:00,661 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:32:00,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:32:00,662 INFO L85 PathProgramCache]: Analyzing trace with hash -132848383, now seen corresponding path program 1 times [2022-10-03 15:32:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:32:00,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462500988] [2022-10-03 15:32:00,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:32:00,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:32:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:32:02,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1319 backedges. 288 proven. 465 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2022-10-03 15:32:02,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:32:02,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462500988] [2022-10-03 15:32:02,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462500988] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:32:02,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144090885] [2022-10-03 15:32:02,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:32:02,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:32:02,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:32:02,258 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:32:02,259 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:32:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:32:03,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 4661 conjuncts, 189 conjunts are in the unsatisfiable core [2022-10-03 15:32:03,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:32:03,186 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:32:03,189 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:32:04,291 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-10-03 15:32:04,292 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:32:04,305 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-03 15:32:04,305 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:32:04,313 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:32:05,552 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:32:05,553 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 14 treesize of output 4 [2022-10-03 15:32:05,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:32:05,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 13 [2022-10-03 15:32:05,691 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:32:05,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1319 backedges. 870 proven. 0 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2022-10-03 15:32:05,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:32:05,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144090885] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:32:05,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:32:05,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [11] total 60 [2022-10-03 15:32:05,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521155226] [2022-10-03 15:32:05,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:32:05,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-10-03 15:32:05,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:32:05,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-10-03 15:32:05,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3318, Unknown=0, NotChecked=0, Total=3540 [2022-10-03 15:32:05,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:05,783 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:32:05,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 28.46) internal successors, (1423), 50 states have internal predecessors, (1423), 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:32:05,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:05,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-10-03 15:32:05,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-10-03 15:32:05,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-10-03 15:32:05,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 143 states. [2022-10-03 15:32:05,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:23,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-03 15:32:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-10-03 15:32:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-03 15:32:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-10-03 15:32:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2022-10-03 15:32:23,373 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:32:23,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:32:23,552 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:32:23,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:32:23,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1580981879, now seen corresponding path program 2 times [2022-10-03 15:32:23,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:32:23,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44627789] [2022-10-03 15:32:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:32:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:32:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:32:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2383 backedges. 551 proven. 633 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2022-10-03 15:32:25,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:32:25,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44627789] [2022-10-03 15:32:25,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44627789] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:32:25,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747966007] [2022-10-03 15:32:25,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 15:32:25,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:32:25,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:32:25,664 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:32:25,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-03 15:32:27,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-03 15:32:27,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 15:32:27,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 1995 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-03 15:32:27,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:32:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2383 backedges. 551 proven. 633 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2022-10-03 15:32:31,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:32:31,889 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:32:31,890 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 16 treesize of output 20 [2022-10-03 15:32:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2383 backedges. 679 proven. 0 refuted. 0 times theorem prover too weak. 1704 trivial. 0 not checked. [2022-10-03 15:32:32,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747966007] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-03 15:32:32,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-03 15:32:32,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 16] total 26 [2022-10-03 15:32:32,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386173714] [2022-10-03 15:32:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:32:32,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-03 15:32:32,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:32:32,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-03 15:32:32,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2022-10-03 15:32:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:32,739 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:32:32,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 154.5) internal successors, (1236), 9 states have internal predecessors, (1236), 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:32:32,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:32,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-10-03 15:32:32,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-10-03 15:32:32,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-10-03 15:32:32,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 143 states. [2022-10-03 15:32:32,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 154 states. [2022-10-03 15:32:32,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:35,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-03 15:32:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-10-03 15:32:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-03 15:32:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2022-10-03 15:32:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-10-03 15:32:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:32:35,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-03 15:32:35,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:32:35,972 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:32:35,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:32:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1375843913, now seen corresponding path program 3 times [2022-10-03 15:32:35,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:32:35,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102732035] [2022-10-03 15:32:35,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:32:35,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:32:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:32:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5907 backedges. 878 proven. 801 refuted. 0 times theorem prover too weak. 4228 trivial. 0 not checked. [2022-10-03 15:32:39,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:32:39,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102732035] [2022-10-03 15:32:39,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102732035] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:32:39,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929820974] [2022-10-03 15:32:39,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-03 15:32:39,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:32:39,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:32:39,232 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:32:39,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-03 15:32:41,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-10-03 15:32:41,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 15:32:41,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 4004 conjuncts, 184 conjunts are in the unsatisfiable core [2022-10-03 15:32:41,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:32:41,854 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-10-03 15:32:41,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-10-03 15:32:42,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:32:42,140 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 24 treesize of output 23 [2022-10-03 15:32:42,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:32:42,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-03 15:32:42,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:32:42,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-10-03 15:32:42,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:32:42,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:32:42,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:32:42,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-10-03 15:32:42,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:32:42,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-03 15:32:43,552 INFO L356 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2022-10-03 15:32:43,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 57 [2022-10-03 15:32:43,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:32:43,559 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 32 treesize of output 18 [2022-10-03 15:32:43,578 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-03 15:32:43,586 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 1 case distinctions, treesize of input 32 treesize of output 25 [2022-10-03 15:32:43,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-10-03 15:32:44,033 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 17 treesize of output 19 [2022-10-03 15:32:44,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:32:44,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 8 [2022-10-03 15:32:44,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-03 15:32:44,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:32:44,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-10-03 15:32:45,014 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 49 treesize of output 31 [2022-10-03 15:32:45,398 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2022-10-03 15:32:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5907 backedges. 1126 proven. 29 refuted. 0 times theorem prover too weak. 4752 trivial. 0 not checked. [2022-10-03 15:32:45,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:32:46,068 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 122 treesize of output 116 [2022-10-03 15:33:24,296 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_2119 (Array Int Int)) (v_arrayElimCell_66 Int)) (let ((.cse4 (let ((.cse6 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2119))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_66) .cse5) .cse5)))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) (forall ((v_ArrVal_2119 (Array Int Int)) (v_arrayElimCell_66 Int)) (let ((.cse1 (let ((.cse3 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2119))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse2 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2) (< (select (select .cse1 v_arrayElimCell_66) .cse2) .cse2))))) (or .cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) is different from false [2022-10-03 15:33:24,350 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((v_ArrVal_2119 (Array Int Int)) (v_arrayElimCell_66 Int)) (let ((.cse4 (let ((.cse6 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2119))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_66) .cse5) .cse5)))))) (and (forall ((v_ArrVal_2119 (Array Int Int)) (v_arrayElimCell_66 Int)) (let ((.cse0 (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2119))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse1 (+ (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse0 v_arrayElimCell_66) .cse1) .cse1) (< (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse1) .cse1))))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3) (or .cse3 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) is different from false [2022-10-03 15:33:24,390 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_2119 (Array Int Int)) (v_arrayElimCell_66 Int)) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2119))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_66) .cse5) .cse5)))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse0) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) (forall ((v_ArrVal_2119 (Array Int Int)) (v_arrayElimCell_66 Int)) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2119))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse2 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2) (< (select (select .cse1 v_arrayElimCell_66) .cse2) .cse2))))))) is different from false [2022-10-03 15:33:24,430 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_2119 (Array Int Int)) (v_arrayElimCell_66 Int)) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_2119))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_66) .cse5) .cse5)))))) (and (or .cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) (forall ((v_ArrVal_2119 (Array Int Int)) (v_arrayElimCell_66 Int)) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_2119))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse2 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2) (< (select (select .cse1 v_arrayElimCell_66) .cse2) .cse2))))))) is different from false [2022-10-03 15:33:24,454 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((v_ArrVal_2119 (Array Int Int)) (v_arrayElimCell_66 Int)) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_2119))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_66) .cse5) .cse5)))))) (and (forall ((v_ArrVal_2119 (Array Int Int)) (v_arrayElimCell_66 Int)) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_2119))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse1 (+ (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse0 v_arrayElimCell_66) .cse1) .cse1) (< (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse1) .cse1))))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse3) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) is different from false [2022-10-03 15:33:24,520 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (forall ((v_ArrVal_2119 (Array Int Int)) (v_arrayElimCell_66 Int)) (let ((.cse5 (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_2119))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse6 (+ (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse5 v_arrayElimCell_66) .cse6) .cse6)))))) (and (forall ((v_ArrVal_2119 (Array Int Int)) (v_arrayElimCell_66 Int)) (let ((.cse0 (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3) v_ArrVal_2119))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse1 (+ (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse1) .cse1) (< (select (select .cse0 v_arrayElimCell_66) .cse1) .cse1))))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse4))) is different from false [2022-10-03 15:33:24,752 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:33:24,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 702 treesize of output 519 [2022-10-03 15:33:24,902 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:33:24,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 9623 treesize of output 9189 [2022-10-03 15:33:25,115 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:33:25,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 10342 treesize of output 9207 [2022-10-03 15:33:25,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:33:25,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 9050 treesize of output 8881 [2022-10-03 15:33:26,137 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:33:26,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 9308 treesize of output 8887 [2022-10-03 15:33:26,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 Received shutdown request... [2022-10-03 15:43:06,005 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 15:43:06,019 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:43:06,019 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:43:06,019 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:43:06,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-03 15:43:06,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:43:06,220 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 3230 with TraceHistMax 7,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-10-03 15:43:06,225 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-10-03 15:43:06,226 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-10-03 15:43:06,228 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 15:43:06,228 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 15:43:06,230 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1383.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:43:06 BasicIcfg [2022-10-03 15:43:06,230 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 15:43:06,230 INFO L158 Benchmark]: Toolchain (without parser) took 799148.35ms. Allocated memory was 195.0MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 143.6MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-10-03 15:43:06,230 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 195.0MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 15:43:06,231 INFO L158 Benchmark]: Boogie Preprocessor took 155.34ms. Allocated memory is still 195.0MB. Free memory was 143.5MB in the beginning and 164.7MB in the end (delta: -21.3MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. [2022-10-03 15:43:06,231 INFO L158 Benchmark]: RCFGBuilder took 1467.91ms. Allocated memory was 195.0MB in the beginning and 312.5MB in the end (delta: 117.4MB). Free memory was 164.4MB in the beginning and 260.5MB in the end (delta: -96.1MB). Peak memory consumption was 63.3MB. Max. memory is 8.0GB. [2022-10-03 15:43:06,231 INFO L158 Benchmark]: TraceAbstraction took 797519.78ms. Allocated memory was 312.5MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 260.0MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-10-03 15:43:06,232 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.13ms. Allocated memory is still 195.0MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 155.34ms. Allocated memory is still 195.0MB. Free memory was 143.5MB in the beginning and 164.7MB in the end (delta: -21.3MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1467.91ms. Allocated memory was 195.0MB in the beginning and 312.5MB in the end (delta: 117.4MB). Free memory was 164.4MB in the beginning and 260.5MB in the end (delta: -96.1MB). Peak memory consumption was 63.3MB. Max. memory is 8.0GB. * TraceAbstraction took 797519.78ms. Allocated memory was 312.5MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 260.0MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 365, positive: 353, positive conditional: 353, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 102523, positive: 99151, positive conditional: 99151, positive unconditional: 0, negative: 3372, negative conditional: 3372, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99600, positive: 99151, positive conditional: 0, positive unconditional: 99151, negative: 449, negative conditional: 0, negative unconditional: 449, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 17891, positive: 17803, positive conditional: 0, positive unconditional: 17803, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 99600, positive: 81348, positive conditional: 0, positive unconditional: 81348, negative: 361, negative conditional: 0, negative unconditional: 361, unknown: 17891, unknown conditional: 0, unknown unconditional: 17891] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 353, Positive conditional cache size: 0, Positive unconditional cache size: 353, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 12, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1180, positive: 1145, positive conditional: 1145, positive unconditional: 0, negative: 35, negative conditional: 35, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 102523, positive: 99151, positive conditional: 99151, positive unconditional: 0, negative: 3372, negative conditional: 3372, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99600, positive: 99151, positive conditional: 0, positive unconditional: 99151, negative: 449, negative conditional: 0, negative unconditional: 449, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 17891, positive: 17803, positive conditional: 0, positive unconditional: 17803, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 99600, positive: 81348, positive conditional: 0, positive unconditional: 81348, negative: 361, negative conditional: 0, negative unconditional: 361, unknown: 17891, unknown conditional: 0, unknown unconditional: 17891] , Statistics on independence cache: Total cache size (in pairs): 1147, Positive cache size: 1147, Positive conditional cache size: 0, Positive unconditional cache size: 1147, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 47, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4703, positive: 4555, positive conditional: 4555, positive unconditional: 0, negative: 148, negative conditional: 148, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 102523, positive: 99151, positive conditional: 99151, positive unconditional: 0, negative: 3372, negative conditional: 3372, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99600, positive: 99151, positive conditional: 0, positive unconditional: 99151, negative: 449, negative conditional: 0, negative unconditional: 449, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 17891, positive: 17803, positive conditional: 0, positive unconditional: 17803, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 99600, positive: 81348, positive conditional: 0, positive unconditional: 81348, negative: 361, negative conditional: 0, negative unconditional: 361, unknown: 17891, unknown conditional: 0, unknown unconditional: 17891] , Statistics on independence cache: Total cache size (in pairs): 3153, Positive cache size: 3152, Positive conditional cache size: 0, Positive unconditional cache size: 3152, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 194, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3644, positive: 3529, positive conditional: 3529, positive unconditional: 0, negative: 115, negative conditional: 115, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 102523, positive: 99151, positive conditional: 99151, positive unconditional: 0, negative: 3372, negative conditional: 3372, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99600, positive: 99151, positive conditional: 0, positive unconditional: 99151, negative: 449, negative conditional: 0, negative unconditional: 449, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 17891, positive: 17803, positive conditional: 0, positive unconditional: 17803, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 99600, positive: 81348, positive conditional: 0, positive unconditional: 81348, negative: 361, negative conditional: 0, negative unconditional: 361, unknown: 17891, unknown conditional: 0, unknown unconditional: 17891] , Statistics on independence cache: Total cache size (in pairs): 4471, Positive cache size: 4469, Positive conditional cache size: 0, Positive unconditional cache size: 4469, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Independence queries for same thread: 308, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6231, positive: 6030, positive conditional: 6030, positive unconditional: 0, negative: 201, negative conditional: 201, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 102523, positive: 99151, positive conditional: 99151, positive unconditional: 0, negative: 3372, negative conditional: 3372, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99600, positive: 99151, positive conditional: 0, positive unconditional: 99151, negative: 449, negative conditional: 0, negative unconditional: 449, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 17891, positive: 17803, positive conditional: 0, positive unconditional: 17803, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 99600, positive: 81348, positive conditional: 0, positive unconditional: 81348, negative: 361, negative conditional: 0, negative unconditional: 361, unknown: 17891, unknown conditional: 0, unknown unconditional: 17891] , Statistics on independence cache: Total cache size (in pairs): 5021, Positive cache size: 5019, Positive conditional cache size: 0, Positive unconditional cache size: 5019, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Independence queries for same thread: 508, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7942, positive: 7695, positive conditional: 7695, positive unconditional: 0, negative: 247, negative conditional: 247, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 102523, positive: 99151, positive conditional: 99151, positive unconditional: 0, negative: 3372, negative conditional: 3372, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99600, positive: 99151, positive conditional: 0, positive unconditional: 99151, negative: 449, negative conditional: 0, negative unconditional: 449, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 17891, positive: 17803, positive conditional: 0, positive unconditional: 17803, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 99600, positive: 81348, positive conditional: 0, positive unconditional: 81348, negative: 361, negative conditional: 0, negative unconditional: 361, unknown: 17891, unknown conditional: 0, unknown unconditional: 17891] , Statistics on independence cache: Total cache size (in pairs): 6768, Positive cache size: 6761, Positive conditional cache size: 0, Positive unconditional cache size: 6761, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Independence queries for same thread: 748, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 32385, positive: 31299, positive conditional: 31299, positive unconditional: 0, negative: 1086, negative conditional: 1086, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 102523, positive: 99151, positive conditional: 99151, positive unconditional: 0, negative: 3372, negative conditional: 3372, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99600, positive: 99151, positive conditional: 0, positive unconditional: 99151, negative: 449, negative conditional: 0, negative unconditional: 449, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 17891, positive: 17803, positive conditional: 0, positive unconditional: 17803, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 99600, positive: 81348, positive conditional: 0, positive unconditional: 81348, negative: 361, negative conditional: 0, negative unconditional: 361, unknown: 17891, unknown conditional: 0, unknown unconditional: 17891] , Statistics on independence cache: Total cache size (in pairs): 15641, Positive cache size: 15558, Positive conditional cache size: 0, Positive unconditional cache size: 15558, Negative cache size: 83, Negative conditional cache size: 0, Negative unconditional cache size: 83, Independence queries for same thread: 1655, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 46073, positive: 44545, positive conditional: 44545, positive unconditional: 0, negative: 1528, negative conditional: 1528, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 102523, positive: 99151, positive conditional: 99151, positive unconditional: 0, negative: 3372, negative conditional: 3372, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99600, positive: 99151, positive conditional: 0, positive unconditional: 99151, negative: 449, negative conditional: 0, negative unconditional: 449, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 17891, positive: 17803, positive conditional: 0, positive unconditional: 17803, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 99600, positive: 81348, positive conditional: 0, positive unconditional: 81348, negative: 361, negative conditional: 0, negative unconditional: 361, unknown: 17891, unknown conditional: 0, unknown unconditional: 17891] , Statistics on independence cache: Total cache size (in pairs): 17891, Positive cache size: 17803, Positive conditional cache size: 0, Positive unconditional cache size: 17803, Negative cache size: 88, Negative conditional cache size: 0, Negative unconditional cache size: 88, Independence queries for same thread: 2923, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1383]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 3230 with TraceHistMax 7,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-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: 797.3s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 71.8s, 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: 449, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 87.8s InterpolantComputationTime, 15547 NumberOfCodeBlocks, 14014 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 19268 ConstructedInterpolants, 672 QuantifiedInterpolants, 102787 SizeOfPredicates, 311 NumberOfNonLiveVariables, 12546 ConjunctsInSsa, 633 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 10302/12619 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