java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:34:28,176 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:34:28,177 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:34:28,189 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:34:28,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:34:28,191 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:34:28,192 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:34:28,194 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:34:28,195 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:34:28,196 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:34:28,197 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:34:28,197 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:34:28,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:34:28,199 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:34:28,203 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:34:28,204 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:34:28,204 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:34:28,206 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:34:28,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:34:28,222 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:34:28,224 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:34:28,225 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:34:28,230 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:34:28,230 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:34:28,230 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:34:28,231 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:34:28,234 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:34:28,238 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:34:28,239 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:34:28,240 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:34:28,240 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:34:28,241 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:34:28,241 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:34:28,241 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:34:28,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:34:28,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:34:28,246 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 20:34:28,275 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:34:28,275 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:34:28,276 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:34:28,276 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:34:28,277 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:34:28,277 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:34:28,277 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:34:28,278 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:34:28,279 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:34:28,279 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:34:28,279 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:34:28,279 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:34:28,279 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:34:28,280 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:34:28,280 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:34:28,280 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:34:28,280 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:34:28,280 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:34:28,282 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:34:28,282 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:34:28,282 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:34:28,282 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:34:28,282 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:34:28,283 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:34:28,283 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:34:28,283 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:34:28,283 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:34:28,283 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:34:28,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:34:28,284 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:34:28,284 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:34:28,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:34:28,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:34:28,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:34:28,382 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:34:28,383 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:34:28,383 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl [2018-09-30 20:34:28,384 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl' [2018-09-30 20:34:28,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:34:28,465 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:34:28,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:28,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:34:28,467 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:34:28,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:28" (1/1) ... [2018-09-30 20:34:28,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:28" (1/1) ... [2018-09-30 20:34:28,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:28,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:34:28,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:34:28,513 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:34:28,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:28" (1/1) ... [2018-09-30 20:34:28,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:28" (1/1) ... [2018-09-30 20:34:28,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:28" (1/1) ... [2018-09-30 20:34:28,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:28" (1/1) ... [2018-09-30 20:34:28,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:28" (1/1) ... [2018-09-30 20:34:28,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:28" (1/1) ... [2018-09-30 20:34:28,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:28" (1/1) ... [2018-09-30 20:34:28,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:34:28,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:34:28,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:34:28,556 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:34:28,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:34:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure l1l0 [2018-09-30 20:34:28,640 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l0 [2018-09-30 20:34:28,640 INFO L130 BoogieDeclarations]: Found specification of procedure l0l1 [2018-09-30 20:34:28,640 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l1 [2018-09-30 20:34:28,641 INFO L130 BoogieDeclarations]: Found specification of procedure l0l0 [2018-09-30 20:34:28,641 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l0 [2018-09-30 20:34:28,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:34:28,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:34:28,642 INFO L130 BoogieDeclarations]: Found specification of procedure l1l1 [2018-09-30 20:34:28,642 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l1 [2018-09-30 20:34:29,182 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:34:29,183 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:29 BoogieIcfgContainer [2018-09-30 20:34:29,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:34:29,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:34:29,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:34:29,188 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:34:29,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:28" (1/2) ... [2018-09-30 20:34:29,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40630f59 and model type threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:34:29, skipping insertion in model container [2018-09-30 20:34:29,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:29" (2/2) ... [2018-09-30 20:34:29,191 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithProcedures.bpl [2018-09-30 20:34:29,202 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:34:29,210 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-09-30 20:34:29,266 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:34:29,267 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:34:29,267 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:34:29,267 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:34:29,267 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:34:29,268 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:34:29,268 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:34:29,268 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:34:29,268 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:34:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-09-30 20:34:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:34:29,299 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:29,300 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:29,301 INFO L423 AbstractCegarLoop]: === Iteration 1 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:29,312 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:29,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1282157605, now seen corresponding path program 1 times [2018-09-30 20:34:29,314 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:29,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:29,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:29,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:29,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:29,584 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:29,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:34:29,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:34:29,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:34:29,600 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:29,602 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-09-30 20:34:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:31,656 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2018-09-30 20:34:31,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:34:31,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 20:34:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:31,671 INFO L225 Difference]: With dead ends: 72 [2018-09-30 20:34:31,671 INFO L226 Difference]: Without dead ends: 70 [2018-09-30 20:34:31,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-30 20:34:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2018-09-30 20:34:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-30 20:34:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2018-09-30 20:34:31,730 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 7 [2018-09-30 20:34:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:31,730 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2018-09-30 20:34:31,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:34:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2018-09-30 20:34:31,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:34:31,732 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:31,732 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:31,732 INFO L423 AbstractCegarLoop]: === Iteration 2 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:31,733 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:31,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1272619553, now seen corresponding path program 1 times [2018-09-30 20:34:31,733 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:31,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:31,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:31,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:31,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:31,841 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:31,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:34:31,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:34:31,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:34:31,843 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:31,843 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2018-09-30 20:34:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:32,827 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2018-09-30 20:34:32,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:34:32,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 20:34:32,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:32,832 INFO L225 Difference]: With dead ends: 81 [2018-09-30 20:34:32,832 INFO L226 Difference]: Without dead ends: 79 [2018-09-30 20:34:32,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:32,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-30 20:34:32,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2018-09-30 20:34:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-30 20:34:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2018-09-30 20:34:32,847 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 7 [2018-09-30 20:34:32,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:32,847 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2018-09-30 20:34:32,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:34:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2018-09-30 20:34:32,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:34:32,849 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:32,849 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:32,850 INFO L423 AbstractCegarLoop]: === Iteration 3 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:32,850 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:32,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1601446133, now seen corresponding path program 1 times [2018-09-30 20:34:32,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:32,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:32,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:32,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:32,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:33,006 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:33,006 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:34:33,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:33,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:33,007 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:33,007 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand 7 states. [2018-09-30 20:34:35,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:35,096 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2018-09-30 20:34:35,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:34:35,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-09-30 20:34:35,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:35,106 INFO L225 Difference]: With dead ends: 122 [2018-09-30 20:34:35,106 INFO L226 Difference]: Without dead ends: 120 [2018-09-30 20:34:35,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-30 20:34:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 73. [2018-09-30 20:34:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 20:34:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2018-09-30 20:34:35,123 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 10 [2018-09-30 20:34:35,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:35,124 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2018-09-30 20:34:35,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2018-09-30 20:34:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:34:35,125 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:35,126 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:35,126 INFO L423 AbstractCegarLoop]: === Iteration 4 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:35,126 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:35,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1152651256, now seen corresponding path program 1 times [2018-09-30 20:34:35,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:35,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:35,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:35,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:35,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:35,257 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:35,257 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:35,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:35,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:35,428 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:34:35,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-09-30 20:34:35,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:34:35,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:34:35,429 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:35,429 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand 9 states. [2018-09-30 20:34:37,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:37,603 INFO L93 Difference]: Finished difference Result 168 states and 243 transitions. [2018-09-30 20:34:37,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:34:37,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-09-30 20:34:37,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:37,605 INFO L225 Difference]: With dead ends: 168 [2018-09-30 20:34:37,606 INFO L226 Difference]: Without dead ends: 121 [2018-09-30 20:34:37,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:34:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-30 20:34:37,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2018-09-30 20:34:37,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-30 20:34:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2018-09-30 20:34:37,626 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 10 [2018-09-30 20:34:37,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:37,626 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2018-09-30 20:34:37,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:34:37,627 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2018-09-30 20:34:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:34:37,628 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:37,628 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:37,629 INFO L423 AbstractCegarLoop]: === Iteration 5 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:37,629 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:37,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1536370777, now seen corresponding path program 1 times [2018-09-30 20:34:37,629 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:37,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:37,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:37,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:37,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:37,730 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:37,730 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:37,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:37,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:37,896 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:37,897 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-30 20:34:37,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:34:37,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:34:37,898 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:37,898 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand 10 states. [2018-09-30 20:34:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:39,798 INFO L93 Difference]: Finished difference Result 164 states and 232 transitions. [2018-09-30 20:34:39,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:34:39,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 20:34:39,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:39,800 INFO L225 Difference]: With dead ends: 164 [2018-09-30 20:34:39,801 INFO L226 Difference]: Without dead ends: 162 [2018-09-30 20:34:39,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:39,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-30 20:34:39,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 109. [2018-09-30 20:34:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 20:34:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2018-09-30 20:34:39,822 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 11 [2018-09-30 20:34:39,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:39,822 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2018-09-30 20:34:39,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:34:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2018-09-30 20:34:39,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:34:39,824 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:39,824 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:39,824 INFO L423 AbstractCegarLoop]: === Iteration 6 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:39,825 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:39,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1150793287, now seen corresponding path program 1 times [2018-09-30 20:34:39,825 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:39,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:39,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:39,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:39,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:39,921 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:39,921 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:39,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:39,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:40,080 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:40,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-30 20:34:40,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:34:40,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:34:40,081 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:40,081 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand 10 states. [2018-09-30 20:34:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:42,377 INFO L93 Difference]: Finished difference Result 181 states and 254 transitions. [2018-09-30 20:34:42,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:34:42,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 20:34:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:42,380 INFO L225 Difference]: With dead ends: 181 [2018-09-30 20:34:42,380 INFO L226 Difference]: Without dead ends: 179 [2018-09-30 20:34:42,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-30 20:34:42,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2018-09-30 20:34:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-30 20:34:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 164 transitions. [2018-09-30 20:34:42,403 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 164 transitions. Word has length 11 [2018-09-30 20:34:42,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:42,403 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 164 transitions. [2018-09-30 20:34:42,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:34:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 164 transitions. [2018-09-30 20:34:42,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:34:42,405 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:42,406 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:42,406 INFO L423 AbstractCegarLoop]: === Iteration 7 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:42,406 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:42,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1829652612, now seen corresponding path program 1 times [2018-09-30 20:34:42,406 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:42,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:42,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:42,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:42,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:42,600 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:42,601 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:42,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:42,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:42,715 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:34:42,715 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-09-30 20:34:42,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:34:42,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:34:42,716 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:42,716 INFO L87 Difference]: Start difference. First operand 117 states and 164 transitions. Second operand 9 states. [2018-09-30 20:34:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:44,521 INFO L93 Difference]: Finished difference Result 217 states and 304 transitions. [2018-09-30 20:34:44,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:34:44,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-30 20:34:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:44,523 INFO L225 Difference]: With dead ends: 217 [2018-09-30 20:34:44,524 INFO L226 Difference]: Without dead ends: 133 [2018-09-30 20:34:44,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:34:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-30 20:34:44,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2018-09-30 20:34:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-30 20:34:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 160 transitions. [2018-09-30 20:34:44,549 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 160 transitions. Word has length 13 [2018-09-30 20:34:44,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:44,549 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 160 transitions. [2018-09-30 20:34:44,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:34:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 160 transitions. [2018-09-30 20:34:44,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 20:34:44,551 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:44,551 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:44,551 INFO L423 AbstractCegarLoop]: === Iteration 8 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:44,552 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:44,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1433054771, now seen corresponding path program 1 times [2018-09-30 20:34:44,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:44,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:44,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:44,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:44,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:44,674 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:44,674 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:44,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:44,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:44,892 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:44,892 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-09-30 20:34:44,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:34:44,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:34:44,893 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:44,893 INFO L87 Difference]: Start difference. First operand 119 states and 160 transitions. Second operand 13 states. [2018-09-30 20:34:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:48,978 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2018-09-30 20:34:48,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:34:48,985 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-09-30 20:34:48,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:48,986 INFO L225 Difference]: With dead ends: 194 [2018-09-30 20:34:48,986 INFO L226 Difference]: Without dead ends: 192 [2018-09-30 20:34:48,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-09-30 20:34:48,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-09-30 20:34:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 181. [2018-09-30 20:34:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-30 20:34:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 257 transitions. [2018-09-30 20:34:49,026 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 257 transitions. Word has length 14 [2018-09-30 20:34:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:49,027 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 257 transitions. [2018-09-30 20:34:49,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:34:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 257 transitions. [2018-09-30 20:34:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 20:34:49,034 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:49,035 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:49,035 INFO L423 AbstractCegarLoop]: === Iteration 9 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:49,035 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:49,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1436992942, now seen corresponding path program 1 times [2018-09-30 20:34:49,036 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:49,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:49,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:49,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:49,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:49,152 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:49,152 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:49,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:49,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:49,710 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:49,710 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-09-30 20:34:49,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:34:49,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:34:49,711 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:49,711 INFO L87 Difference]: Start difference. First operand 181 states and 257 transitions. Second operand 14 states. [2018-09-30 20:34:53,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:53,654 INFO L93 Difference]: Finished difference Result 242 states and 345 transitions. [2018-09-30 20:34:53,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:34:53,660 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-30 20:34:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:53,662 INFO L225 Difference]: With dead ends: 242 [2018-09-30 20:34:53,662 INFO L226 Difference]: Without dead ends: 241 [2018-09-30 20:34:53,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-09-30 20:34:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-09-30 20:34:53,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 195. [2018-09-30 20:34:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-30 20:34:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 278 transitions. [2018-09-30 20:34:53,694 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 278 transitions. Word has length 14 [2018-09-30 20:34:53,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:53,694 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 278 transitions. [2018-09-30 20:34:53,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:34:53,695 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 278 transitions. [2018-09-30 20:34:53,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 20:34:53,695 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:53,695 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:53,696 INFO L423 AbstractCegarLoop]: === Iteration 10 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:53,696 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:53,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1436993326, now seen corresponding path program 1 times [2018-09-30 20:34:53,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:53,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:53,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:53,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:53,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:53,832 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:53,832 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:53,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:53,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:54,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:54,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:54,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-09-30 20:34:54,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:34:54,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:34:54,264 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:54,264 INFO L87 Difference]: Start difference. First operand 195 states and 278 transitions. Second operand 14 states. [2018-09-30 20:34:58,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:58,984 INFO L93 Difference]: Finished difference Result 290 states and 410 transitions. [2018-09-30 20:34:58,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 20:34:58,987 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-30 20:34:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:58,989 INFO L225 Difference]: With dead ends: 290 [2018-09-30 20:34:58,990 INFO L226 Difference]: Without dead ends: 288 [2018-09-30 20:34:58,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-09-30 20:34:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-09-30 20:34:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 223. [2018-09-30 20:34:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-09-30 20:34:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 319 transitions. [2018-09-30 20:34:59,021 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 319 transitions. Word has length 14 [2018-09-30 20:34:59,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:59,021 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 319 transitions. [2018-09-30 20:34:59,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:34:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 319 transitions. [2018-09-30 20:34:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 20:34:59,022 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:59,023 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:59,023 INFO L423 AbstractCegarLoop]: === Iteration 11 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:59,023 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:59,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1791986342, now seen corresponding path program 1 times [2018-09-30 20:34:59,023 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:59,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:59,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:59,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:59,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:59,132 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:59,132 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:59,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:59,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:59,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:59,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-09-30 20:34:59,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:34:59,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:34:59,297 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:59,297 INFO L87 Difference]: Start difference. First operand 223 states and 319 transitions. Second operand 14 states. [2018-09-30 20:35:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:04,466 INFO L93 Difference]: Finished difference Result 316 states and 447 transitions. [2018-09-30 20:35:04,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:35:04,475 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-30 20:35:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:04,477 INFO L225 Difference]: With dead ends: 316 [2018-09-30 20:35:04,477 INFO L226 Difference]: Without dead ends: 314 [2018-09-30 20:35:04,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-09-30 20:35:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-09-30 20:35:04,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-09-30 20:35:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-30 20:35:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 353 transitions. [2018-09-30 20:35:04,513 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 353 transitions. Word has length 14 [2018-09-30 20:35:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:04,513 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 353 transitions. [2018-09-30 20:35:04,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:35:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 353 transitions. [2018-09-30 20:35:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 20:35:04,514 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:04,514 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:04,515 INFO L423 AbstractCegarLoop]: === Iteration 12 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:04,515 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:04,515 INFO L82 PathProgramCache]: Analyzing trace with hash 844488035, now seen corresponding path program 1 times [2018-09-30 20:35:04,515 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:04,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:04,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:04,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:04,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:04,591 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:04,591 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:04,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:04,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:04,754 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:04,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-09-30 20:35:04,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:35:04,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:35:04,755 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:04,756 INFO L87 Difference]: Start difference. First operand 245 states and 353 transitions. Second operand 13 states. [2018-09-30 20:35:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:07,404 INFO L93 Difference]: Finished difference Result 323 states and 464 transitions. [2018-09-30 20:35:07,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:35:07,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-09-30 20:35:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:07,413 INFO L225 Difference]: With dead ends: 323 [2018-09-30 20:35:07,413 INFO L226 Difference]: Without dead ends: 321 [2018-09-30 20:35:07,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:35:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-09-30 20:35:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 303. [2018-09-30 20:35:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-09-30 20:35:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 446 transitions. [2018-09-30 20:35:07,472 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 446 transitions. Word has length 14 [2018-09-30 20:35:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:07,472 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 446 transitions. [2018-09-30 20:35:07,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:35:07,472 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 446 transitions. [2018-09-30 20:35:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 20:35:07,473 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:07,473 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:07,474 INFO L423 AbstractCegarLoop]: === Iteration 13 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:07,474 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:07,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1052420626, now seen corresponding path program 1 times [2018-09-30 20:35:07,474 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:07,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:07,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:07,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:07,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:07,603 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:07,603 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:07,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:07,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:07,841 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:07,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-09-30 20:35:07,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:35:07,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:35:07,842 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:07,842 INFO L87 Difference]: Start difference. First operand 303 states and 446 transitions. Second operand 14 states. [2018-09-30 20:35:11,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:11,661 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2018-09-30 20:35:11,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:35:11,662 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-30 20:35:11,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:11,664 INFO L225 Difference]: With dead ends: 379 [2018-09-30 20:35:11,664 INFO L226 Difference]: Without dead ends: 377 [2018-09-30 20:35:11,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:35:11,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-09-30 20:35:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 302. [2018-09-30 20:35:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-09-30 20:35:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 445 transitions. [2018-09-30 20:35:11,714 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 445 transitions. Word has length 14 [2018-09-30 20:35:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:11,714 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 445 transitions. [2018-09-30 20:35:11,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:35:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 445 transitions. [2018-09-30 20:35:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 20:35:11,715 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:11,715 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:11,715 INFO L423 AbstractCegarLoop]: === Iteration 14 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:11,716 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:11,716 INFO L82 PathProgramCache]: Analyzing trace with hash 697427610, now seen corresponding path program 1 times [2018-09-30 20:35:11,716 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:11,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:11,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:11,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:11,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:11,811 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:11,812 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:11,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:11,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:12,064 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:12,065 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 15 [2018-09-30 20:35:12,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:35:12,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:35:12,065 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:12,065 INFO L87 Difference]: Start difference. First operand 302 states and 445 transitions. Second operand 16 states. [2018-09-30 20:35:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:15,320 INFO L93 Difference]: Finished difference Result 356 states and 514 transitions. [2018-09-30 20:35:15,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 20:35:15,320 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2018-09-30 20:35:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:15,323 INFO L225 Difference]: With dead ends: 356 [2018-09-30 20:35:15,324 INFO L226 Difference]: Without dead ends: 354 [2018-09-30 20:35:15,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-09-30 20:35:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-09-30 20:35:15,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 312. [2018-09-30 20:35:15,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-09-30 20:35:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 460 transitions. [2018-09-30 20:35:15,372 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 460 transitions. Word has length 14 [2018-09-30 20:35:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:15,372 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 460 transitions. [2018-09-30 20:35:15,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:35:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 460 transitions. [2018-09-30 20:35:15,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 20:35:15,373 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:15,373 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:15,374 INFO L423 AbstractCegarLoop]: === Iteration 15 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:15,374 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:15,374 INFO L82 PathProgramCache]: Analyzing trace with hash 697427226, now seen corresponding path program 1 times [2018-09-30 20:35:15,374 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:15,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:15,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:15,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:15,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:15,501 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:15,501 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:15,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:15,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:15,688 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:15,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 13 [2018-09-30 20:35:15,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:35:15,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:35:15,689 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:15,689 INFO L87 Difference]: Start difference. First operand 312 states and 460 transitions. Second operand 15 states. [2018-09-30 20:35:20,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:20,042 INFO L93 Difference]: Finished difference Result 365 states and 536 transitions. [2018-09-30 20:35:20,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:35:20,043 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-09-30 20:35:20,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:20,045 INFO L225 Difference]: With dead ends: 365 [2018-09-30 20:35:20,045 INFO L226 Difference]: Without dead ends: 363 [2018-09-30 20:35:20,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-09-30 20:35:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-09-30 20:35:20,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 328. [2018-09-30 20:35:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-09-30 20:35:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 483 transitions. [2018-09-30 20:35:20,112 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 483 transitions. Word has length 14 [2018-09-30 20:35:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:20,113 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 483 transitions. [2018-09-30 20:35:20,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:35:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 483 transitions. [2018-09-30 20:35:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 20:35:20,114 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:20,114 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:20,114 INFO L423 AbstractCegarLoop]: === Iteration 16 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:20,114 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash 406900684, now seen corresponding path program 1 times [2018-09-30 20:35:20,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:20,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:20,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:20,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:20,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:20,562 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:20,562 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:20,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:20,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:20,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:20,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-30 20:35:20,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:35:20,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:35:20,785 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:20,785 INFO L87 Difference]: Start difference. First operand 328 states and 483 transitions. Second operand 16 states. [2018-09-30 20:35:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:24,750 INFO L93 Difference]: Finished difference Result 429 states and 619 transitions. [2018-09-30 20:35:24,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 20:35:24,751 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-09-30 20:35:24,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:24,753 INFO L225 Difference]: With dead ends: 429 [2018-09-30 20:35:24,753 INFO L226 Difference]: Without dead ends: 427 [2018-09-30 20:35:24,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-09-30 20:35:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-09-30 20:35:24,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 241. [2018-09-30 20:35:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-30 20:35:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 350 transitions. [2018-09-30 20:35:24,816 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 350 transitions. Word has length 17 [2018-09-30 20:35:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:24,817 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 350 transitions. [2018-09-30 20:35:24,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:35:24,817 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 350 transitions. [2018-09-30 20:35:24,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 20:35:24,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:24,818 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:24,818 INFO L423 AbstractCegarLoop]: === Iteration 17 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:24,818 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:24,818 INFO L82 PathProgramCache]: Analyzing trace with hash 2143481530, now seen corresponding path program 1 times [2018-09-30 20:35:24,819 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:24,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:24,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:24,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:24,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:25,094 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:25,094 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:25,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:25,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:25,273 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:25,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-30 20:35:25,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:35:25,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:35:25,274 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:25,274 INFO L87 Difference]: Start difference. First operand 241 states and 350 transitions. Second operand 16 states. [2018-09-30 20:35:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:29,014 INFO L93 Difference]: Finished difference Result 329 states and 465 transitions. [2018-09-30 20:35:29,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 20:35:29,014 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-09-30 20:35:29,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:29,016 INFO L225 Difference]: With dead ends: 329 [2018-09-30 20:35:29,016 INFO L226 Difference]: Without dead ends: 327 [2018-09-30 20:35:29,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-09-30 20:35:29,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-09-30 20:35:29,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 157. [2018-09-30 20:35:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-30 20:35:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions. [2018-09-30 20:35:29,071 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 17 [2018-09-30 20:35:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:29,072 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 225 transitions. [2018-09-30 20:35:29,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:35:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2018-09-30 20:35:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:35:29,073 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:29,073 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:29,073 INFO L423 AbstractCegarLoop]: === Iteration 18 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:29,073 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:29,073 INFO L82 PathProgramCache]: Analyzing trace with hash -653821292, now seen corresponding path program 1 times [2018-09-30 20:35:29,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:29,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:29,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:29,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:29,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:29,856 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:29,856 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:29,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:29,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:29,997 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:29,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-09-30 20:35:29,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:35:29,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:35:29,998 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:29,998 INFO L87 Difference]: Start difference. First operand 157 states and 225 transitions. Second operand 13 states. [2018-09-30 20:35:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:31,966 INFO L93 Difference]: Finished difference Result 228 states and 322 transitions. [2018-09-30 20:35:31,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:35:31,967 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-09-30 20:35:31,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:31,968 INFO L225 Difference]: With dead ends: 228 [2018-09-30 20:35:31,968 INFO L226 Difference]: Without dead ends: 226 [2018-09-30 20:35:31,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-09-30 20:35:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-30 20:35:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 172. [2018-09-30 20:35:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-09-30 20:35:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 247 transitions. [2018-09-30 20:35:32,025 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 247 transitions. Word has length 18 [2018-09-30 20:35:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:32,026 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 247 transitions. [2018-09-30 20:35:32,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:35:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 247 transitions. [2018-09-30 20:35:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:35:32,027 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:32,027 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:32,027 INFO L423 AbstractCegarLoop]: === Iteration 19 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:32,027 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:32,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1014964826, now seen corresponding path program 1 times [2018-09-30 20:35:32,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:32,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:32,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:32,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:32,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:32,152 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:32,152 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:32,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:32,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:32,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:32,325 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:35:32,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-09-30 20:35:32,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:35:32,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:35:32,326 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:32,326 INFO L87 Difference]: Start difference. First operand 172 states and 247 transitions. Second operand 13 states. [2018-09-30 20:35:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:39,520 INFO L93 Difference]: Finished difference Result 793 states and 1126 transitions. [2018-09-30 20:35:39,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-30 20:35:39,521 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-09-30 20:35:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:39,523 INFO L225 Difference]: With dead ends: 793 [2018-09-30 20:35:39,523 INFO L226 Difference]: Without dead ends: 624 [2018-09-30 20:35:39,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-09-30 20:35:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-09-30 20:35:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 327. [2018-09-30 20:35:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-09-30 20:35:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 469 transitions. [2018-09-30 20:35:39,664 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 469 transitions. Word has length 18 [2018-09-30 20:35:39,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:39,665 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 469 transitions. [2018-09-30 20:35:39,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:35:39,665 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 469 transitions. [2018-09-30 20:35:39,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:35:39,666 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:39,666 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:39,666 INFO L423 AbstractCegarLoop]: === Iteration 20 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:39,666 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:39,667 INFO L82 PathProgramCache]: Analyzing trace with hash -155045024, now seen corresponding path program 1 times [2018-09-30 20:35:39,667 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:39,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:39,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:39,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:39,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:39,791 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:39,792 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:39,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:39,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:39,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:39,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-09-30 20:35:39,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:35:39,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:35:39,964 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:39,965 INFO L87 Difference]: Start difference. First operand 327 states and 469 transitions. Second operand 13 states. [2018-09-30 20:35:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:43,739 INFO L93 Difference]: Finished difference Result 776 states and 1111 transitions. [2018-09-30 20:35:43,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-30 20:35:43,739 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-09-30 20:35:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:43,742 INFO L225 Difference]: With dead ends: 776 [2018-09-30 20:35:43,742 INFO L226 Difference]: Without dead ends: 451 [2018-09-30 20:35:43,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-09-30 20:35:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-09-30 20:35:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 351. [2018-09-30 20:35:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-09-30 20:35:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 502 transitions. [2018-09-30 20:35:43,864 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 502 transitions. Word has length 18 [2018-09-30 20:35:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:43,865 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 502 transitions. [2018-09-30 20:35:43,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:35:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 502 transitions. [2018-09-30 20:35:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:35:43,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:43,866 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:43,866 INFO L423 AbstractCegarLoop]: === Iteration 21 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:43,866 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:43,866 INFO L82 PathProgramCache]: Analyzing trace with hash 393788879, now seen corresponding path program 1 times [2018-09-30 20:35:43,866 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:43,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:43,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:43,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:43,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:44,015 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:44,015 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:44,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:44,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:44,157 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:44,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 20:35:44,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:35:44,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:35:44,158 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:44,158 INFO L87 Difference]: Start difference. First operand 351 states and 502 transitions. Second operand 13 states. [2018-09-30 20:35:49,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:49,396 INFO L93 Difference]: Finished difference Result 1134 states and 1611 transitions. [2018-09-30 20:35:49,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 20:35:49,396 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-09-30 20:35:49,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:49,400 INFO L225 Difference]: With dead ends: 1134 [2018-09-30 20:35:49,400 INFO L226 Difference]: Without dead ends: 769 [2018-09-30 20:35:49,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-09-30 20:35:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-09-30 20:35:49,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 554. [2018-09-30 20:35:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-09-30 20:35:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 789 transitions. [2018-09-30 20:35:49,615 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 789 transitions. Word has length 18 [2018-09-30 20:35:49,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:49,616 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 789 transitions. [2018-09-30 20:35:49,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:35:49,616 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 789 transitions. [2018-09-30 20:35:49,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:35:49,617 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:49,617 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:49,618 INFO L423 AbstractCegarLoop]: === Iteration 22 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:49,618 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:49,618 INFO L82 PathProgramCache]: Analyzing trace with hash -216264799, now seen corresponding path program 1 times [2018-09-30 20:35:49,618 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:49,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:49,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:49,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:49,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:50,021 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:50,021 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:50,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:50,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:50,153 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:50,153 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-09-30 20:35:50,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:35:50,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:35:50,154 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:50,154 INFO L87 Difference]: Start difference. First operand 554 states and 789 transitions. Second operand 11 states. [2018-09-30 20:35:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:52,959 INFO L93 Difference]: Finished difference Result 776 states and 1098 transitions. [2018-09-30 20:35:52,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:35:52,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-30 20:35:52,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:52,965 INFO L225 Difference]: With dead ends: 776 [2018-09-30 20:35:52,965 INFO L226 Difference]: Without dead ends: 774 [2018-09-30 20:35:52,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:35:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2018-09-30 20:35:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 563. [2018-09-30 20:35:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-09-30 20:35:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 802 transitions. [2018-09-30 20:35:53,166 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 802 transitions. Word has length 18 [2018-09-30 20:35:53,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:53,166 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 802 transitions. [2018-09-30 20:35:53,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:35:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 802 transitions. [2018-09-30 20:35:53,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:35:53,167 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:53,167 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:53,168 INFO L423 AbstractCegarLoop]: === Iteration 23 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:53,168 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:53,168 INFO L82 PathProgramCache]: Analyzing trace with hash 983482113, now seen corresponding path program 1 times [2018-09-30 20:35:53,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:53,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:53,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:53,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:53,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:53,311 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:53,312 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:53,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:53,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:53,458 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:35:53,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2018-09-30 20:35:53,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:35:53,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:35:53,459 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:53,459 INFO L87 Difference]: Start difference. First operand 563 states and 802 transitions. Second operand 13 states. [2018-09-30 20:35:57,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:57,473 INFO L93 Difference]: Finished difference Result 1451 states and 2064 transitions. [2018-09-30 20:35:57,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 20:35:57,473 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-09-30 20:35:57,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:57,477 INFO L225 Difference]: With dead ends: 1451 [2018-09-30 20:35:57,477 INFO L226 Difference]: Without dead ends: 890 [2018-09-30 20:35:57,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:35:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-09-30 20:35:57,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 631. [2018-09-30 20:35:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-09-30 20:35:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 907 transitions. [2018-09-30 20:35:57,755 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 907 transitions. Word has length 18 [2018-09-30 20:35:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:57,756 INFO L480 AbstractCegarLoop]: Abstraction has 631 states and 907 transitions. [2018-09-30 20:35:57,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:35:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 907 transitions. [2018-09-30 20:35:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:35:57,757 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:57,757 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:57,757 INFO L423 AbstractCegarLoop]: === Iteration 24 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:57,757 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:57,758 INFO L82 PathProgramCache]: Analyzing trace with hash 801556786, now seen corresponding path program 1 times [2018-09-30 20:35:57,758 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:57,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:57,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:57,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:57,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:58,121 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:58,121 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:58,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:58,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:58,281 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:58,281 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-09-30 20:35:58,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:35:58,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:35:58,282 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:58,282 INFO L87 Difference]: Start difference. First operand 631 states and 907 transitions. Second operand 13 states. [2018-09-30 20:36:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:00,168 INFO L93 Difference]: Finished difference Result 759 states and 1092 transitions. [2018-09-30 20:36:00,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:36:00,168 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-09-30 20:36:00,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:00,171 INFO L225 Difference]: With dead ends: 759 [2018-09-30 20:36:00,171 INFO L226 Difference]: Without dead ends: 757 [2018-09-30 20:36:00,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-09-30 20:36:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-09-30 20:36:00,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 663. [2018-09-30 20:36:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-09-30 20:36:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 954 transitions. [2018-09-30 20:36:00,371 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 954 transitions. Word has length 18 [2018-09-30 20:36:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:00,371 INFO L480 AbstractCegarLoop]: Abstraction has 663 states and 954 transitions. [2018-09-30 20:36:00,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:36:00,371 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 954 transitions. [2018-09-30 20:36:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:36:00,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:00,372 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:00,373 INFO L423 AbstractCegarLoop]: === Iteration 25 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:00,373 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:00,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1593301430, now seen corresponding path program 1 times [2018-09-30 20:36:00,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:00,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:00,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:00,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:00,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:00,487 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:00,487 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:00,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:00,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:00,930 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:36:00,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-09-30 20:36:00,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:36:00,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:36:00,931 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:00,931 INFO L87 Difference]: Start difference. First operand 663 states and 954 transitions. Second operand 13 states. [2018-09-30 20:36:08,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:08,178 INFO L93 Difference]: Finished difference Result 2364 states and 3378 transitions. [2018-09-30 20:36:08,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-30 20:36:08,179 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-09-30 20:36:08,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:08,184 INFO L225 Difference]: With dead ends: 2364 [2018-09-30 20:36:08,184 INFO L226 Difference]: Without dead ends: 1543 [2018-09-30 20:36:08,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-09-30 20:36:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2018-09-30 20:36:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1109. [2018-09-30 20:36:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2018-09-30 20:36:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1585 transitions. [2018-09-30 20:36:08,536 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1585 transitions. Word has length 18 [2018-09-30 20:36:08,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:08,536 INFO L480 AbstractCegarLoop]: Abstraction has 1109 states and 1585 transitions. [2018-09-30 20:36:08,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:36:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1585 transitions. [2018-09-30 20:36:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:36:08,537 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:08,537 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:08,538 INFO L423 AbstractCegarLoop]: === Iteration 26 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:08,538 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:08,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1366841759, now seen corresponding path program 1 times [2018-09-30 20:36:08,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:08,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:08,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:08,906 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:08,906 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:08,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:08,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:09,060 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:09,061 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-09-30 20:36:09,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:36:09,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:36:09,061 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:09,061 INFO L87 Difference]: Start difference. First operand 1109 states and 1585 transitions. Second operand 11 states. [2018-09-30 20:36:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:11,951 INFO L93 Difference]: Finished difference Result 1491 states and 2122 transitions. [2018-09-30 20:36:11,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:36:11,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-30 20:36:11,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:11,957 INFO L225 Difference]: With dead ends: 1491 [2018-09-30 20:36:11,957 INFO L226 Difference]: Without dead ends: 1489 [2018-09-30 20:36:11,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:36:11,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2018-09-30 20:36:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1182. [2018-09-30 20:36:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2018-09-30 20:36:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1691 transitions. [2018-09-30 20:36:12,345 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1691 transitions. Word has length 18 [2018-09-30 20:36:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:12,346 INFO L480 AbstractCegarLoop]: Abstraction has 1182 states and 1691 transitions. [2018-09-30 20:36:12,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:36:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1691 transitions. [2018-09-30 20:36:12,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:36:12,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:12,347 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:12,347 INFO L423 AbstractCegarLoop]: === Iteration 27 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:12,347 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:12,347 INFO L82 PathProgramCache]: Analyzing trace with hash -817918193, now seen corresponding path program 1 times [2018-09-30 20:36:12,348 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:12,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:12,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:12,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:12,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:12,464 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:12,464 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:12,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:12,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:12,641 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:36:12,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2018-09-30 20:36:12,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:36:12,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:36:12,642 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:12,642 INFO L87 Difference]: Start difference. First operand 1182 states and 1691 transitions. Second operand 13 states. [2018-09-30 20:36:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:16,494 INFO L93 Difference]: Finished difference Result 2458 states and 3522 transitions. [2018-09-30 20:36:16,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 20:36:16,494 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-09-30 20:36:16,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:16,498 INFO L225 Difference]: With dead ends: 2458 [2018-09-30 20:36:16,499 INFO L226 Difference]: Without dead ends: 1214 [2018-09-30 20:36:16,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-09-30 20:36:16,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2018-09-30 20:36:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 899. [2018-09-30 20:36:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-09-30 20:36:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1284 transitions. [2018-09-30 20:36:16,811 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1284 transitions. Word has length 18 [2018-09-30 20:36:16,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:16,811 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1284 transitions. [2018-09-30 20:36:16,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:36:16,811 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1284 transitions. [2018-09-30 20:36:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:36:16,812 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:16,812 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:16,813 INFO L423 AbstractCegarLoop]: === Iteration 28 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:16,813 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:16,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1427971487, now seen corresponding path program 2 times [2018-09-30 20:36:16,813 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:16,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:16,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:16,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:16,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:16,933 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:16,933 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:16,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:36:17,011 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:36:17,012 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:36:17,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:17,178 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:17,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2018-09-30 20:36:17,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:36:17,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:36:17,179 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:17,179 INFO L87 Difference]: Start difference. First operand 899 states and 1284 transitions. Second operand 16 states. [2018-09-30 20:36:23,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:23,054 INFO L93 Difference]: Finished difference Result 1269 states and 1781 transitions. [2018-09-30 20:36:23,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 20:36:23,055 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-30 20:36:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:23,059 INFO L225 Difference]: With dead ends: 1269 [2018-09-30 20:36:23,059 INFO L226 Difference]: Without dead ends: 1267 [2018-09-30 20:36:23,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-09-30 20:36:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2018-09-30 20:36:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1020. [2018-09-30 20:36:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-09-30 20:36:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1448 transitions. [2018-09-30 20:36:23,418 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1448 transitions. Word has length 18 [2018-09-30 20:36:23,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:23,418 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 1448 transitions. [2018-09-30 20:36:23,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:36:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1448 transitions. [2018-09-30 20:36:23,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 20:36:23,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:23,419 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:23,420 INFO L423 AbstractCegarLoop]: === Iteration 29 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:23,420 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:23,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1122647006, now seen corresponding path program 1 times [2018-09-30 20:36:23,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:23,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:23,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:23,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:36:23,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:23,529 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:23,530 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:23,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:23,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:23,691 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:23,691 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-09-30 20:36:23,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 20:36:23,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 20:36:23,691 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:23,692 INFO L87 Difference]: Start difference. First operand 1020 states and 1448 transitions. Second operand 12 states. [2018-09-30 20:36:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:27,336 INFO L93 Difference]: Finished difference Result 1344 states and 1904 transitions. [2018-09-30 20:36:27,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 20:36:27,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-09-30 20:36:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:27,342 INFO L225 Difference]: With dead ends: 1344 [2018-09-30 20:36:27,343 INFO L226 Difference]: Without dead ends: 1342 [2018-09-30 20:36:27,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:36:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2018-09-30 20:36:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1177. [2018-09-30 20:36:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-09-30 20:36:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1680 transitions. [2018-09-30 20:36:27,752 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1680 transitions. Word has length 22 [2018-09-30 20:36:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:27,752 INFO L480 AbstractCegarLoop]: Abstraction has 1177 states and 1680 transitions. [2018-09-30 20:36:27,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 20:36:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1680 transitions. [2018-09-30 20:36:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 20:36:27,754 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:27,754 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:27,754 INFO L423 AbstractCegarLoop]: === Iteration 30 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:27,754 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:27,754 INFO L82 PathProgramCache]: Analyzing trace with hash 15880131, now seen corresponding path program 1 times [2018-09-30 20:36:27,754 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:27,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:27,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:27,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:27,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:27,876 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:27,876 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:27,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:27,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:28,019 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:28,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-09-30 20:36:28,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:36:28,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:36:28,020 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:28,020 INFO L87 Difference]: Start difference. First operand 1177 states and 1680 transitions. Second operand 10 states. [2018-09-30 20:36:32,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:32,180 INFO L93 Difference]: Finished difference Result 1529 states and 2165 transitions. [2018-09-30 20:36:32,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:36:32,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-09-30 20:36:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:32,186 INFO L225 Difference]: With dead ends: 1529 [2018-09-30 20:36:32,186 INFO L226 Difference]: Without dead ends: 1527 [2018-09-30 20:36:32,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:36:32,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2018-09-30 20:36:32,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1201. [2018-09-30 20:36:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1201 states. [2018-09-30 20:36:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1715 transitions. [2018-09-30 20:36:32,619 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1715 transitions. Word has length 22 [2018-09-30 20:36:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:32,619 INFO L480 AbstractCegarLoop]: Abstraction has 1201 states and 1715 transitions. [2018-09-30 20:36:32,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:36:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1715 transitions. [2018-09-30 20:36:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 20:36:32,621 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:32,621 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:32,622 INFO L423 AbstractCegarLoop]: === Iteration 31 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:32,622 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:32,622 INFO L82 PathProgramCache]: Analyzing trace with hash 627807824, now seen corresponding path program 1 times [2018-09-30 20:36:32,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:32,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:32,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:32,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:32,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:32,799 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:32,799 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:32,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:32,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:33,319 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:33,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-09-30 20:36:33,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:36:33,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:36:33,320 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:33,320 INFO L87 Difference]: Start difference. First operand 1201 states and 1715 transitions. Second operand 15 states. [2018-09-30 20:36:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:38,591 INFO L93 Difference]: Finished difference Result 1487 states and 2111 transitions. [2018-09-30 20:36:38,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:36:38,591 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-09-30 20:36:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:38,598 INFO L225 Difference]: With dead ends: 1487 [2018-09-30 20:36:38,598 INFO L226 Difference]: Without dead ends: 1485 [2018-09-30 20:36:38,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-09-30 20:36:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2018-09-30 20:36:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1001. [2018-09-30 20:36:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-09-30 20:36:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1416 transitions. [2018-09-30 20:36:38,962 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1416 transitions. Word has length 22 [2018-09-30 20:36:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:38,962 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1416 transitions. [2018-09-30 20:36:38,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:36:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1416 transitions. [2018-09-30 20:36:38,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 20:36:38,964 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:38,964 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:38,964 INFO L423 AbstractCegarLoop]: === Iteration 32 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:38,964 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:38,964 INFO L82 PathProgramCache]: Analyzing trace with hash 345073063, now seen corresponding path program 1 times [2018-09-30 20:36:38,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:38,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:38,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:38,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:38,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:39,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:39,088 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:39,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:39,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:39,277 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:39,277 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-09-30 20:36:39,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:36:39,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:36:39,277 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:39,278 INFO L87 Difference]: Start difference. First operand 1001 states and 1416 transitions. Second operand 10 states. [2018-09-30 20:36:42,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:42,587 INFO L93 Difference]: Finished difference Result 1224 states and 1719 transitions. [2018-09-30 20:36:42,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:36:42,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-09-30 20:36:42,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:42,591 INFO L225 Difference]: With dead ends: 1224 [2018-09-30 20:36:42,591 INFO L226 Difference]: Without dead ends: 1222 [2018-09-30 20:36:42,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:36:42,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2018-09-30 20:36:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1022. [2018-09-30 20:36:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2018-09-30 20:36:42,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1447 transitions. [2018-09-30 20:36:42,957 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1447 transitions. Word has length 22 [2018-09-30 20:36:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:42,958 INFO L480 AbstractCegarLoop]: Abstraction has 1022 states and 1447 transitions. [2018-09-30 20:36:42,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:36:42,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1447 transitions. [2018-09-30 20:36:42,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 20:36:42,959 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:42,959 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:42,959 INFO L423 AbstractCegarLoop]: === Iteration 33 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:42,959 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:42,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1613894486, now seen corresponding path program 1 times [2018-09-30 20:36:42,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:42,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:42,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:42,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:42,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:43,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:43,322 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:43,322 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:43,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:43,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:43,468 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:43,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-09-30 20:36:43,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:36:43,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:36:43,469 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:43,469 INFO L87 Difference]: Start difference. First operand 1022 states and 1447 transitions. Second operand 15 states. [2018-09-30 20:36:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:47,909 INFO L93 Difference]: Finished difference Result 1292 states and 1825 transitions. [2018-09-30 20:36:47,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:36:47,909 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-09-30 20:36:47,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:47,914 INFO L225 Difference]: With dead ends: 1292 [2018-09-30 20:36:47,914 INFO L226 Difference]: Without dead ends: 1290 [2018-09-30 20:36:47,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-09-30 20:36:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-09-30 20:36:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 979. [2018-09-30 20:36:48,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2018-09-30 20:36:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1377 transitions. [2018-09-30 20:36:48,245 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1377 transitions. Word has length 22 [2018-09-30 20:36:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:48,245 INFO L480 AbstractCegarLoop]: Abstraction has 979 states and 1377 transitions. [2018-09-30 20:36:48,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:36:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1377 transitions. [2018-09-30 20:36:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-30 20:36:48,247 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:48,247 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:48,247 INFO L423 AbstractCegarLoop]: === Iteration 34 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:48,248 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:48,248 INFO L82 PathProgramCache]: Analyzing trace with hash -488650854, now seen corresponding path program 1 times [2018-09-30 20:36:48,248 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:48,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:48,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:48,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:48,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:48,541 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:48,542 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:48,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:48,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:36:48,725 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:48,725 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-09-30 20:36:48,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:36:48,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:36:48,725 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:48,726 INFO L87 Difference]: Start difference. First operand 979 states and 1377 transitions. Second operand 15 states. [2018-09-30 20:36:55,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:55,342 INFO L93 Difference]: Finished difference Result 2253 states and 3115 transitions. [2018-09-30 20:36:55,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 20:36:55,342 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-09-30 20:36:55,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:55,348 INFO L225 Difference]: With dead ends: 2253 [2018-09-30 20:36:55,348 INFO L226 Difference]: Without dead ends: 1948 [2018-09-30 20:36:55,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-09-30 20:36:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2018-09-30 20:36:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1413. [2018-09-30 20:36:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2018-09-30 20:36:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1970 transitions. [2018-09-30 20:36:55,878 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1970 transitions. Word has length 25 [2018-09-30 20:36:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:55,878 INFO L480 AbstractCegarLoop]: Abstraction has 1413 states and 1970 transitions. [2018-09-30 20:36:55,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:36:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1970 transitions. [2018-09-30 20:36:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-30 20:36:55,880 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:55,880 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:55,880 INFO L423 AbstractCegarLoop]: === Iteration 35 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:55,881 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:55,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1608047085, now seen corresponding path program 1 times [2018-09-30 20:36:55,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:55,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:55,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:55,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:56,019 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:56,019 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:56,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:56,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:36:56,198 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:56,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-09-30 20:36:56,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:36:56,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:36:56,199 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:56,199 INFO L87 Difference]: Start difference. First operand 1413 states and 1970 transitions. Second operand 15 states. [2018-09-30 20:37:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:02,491 INFO L93 Difference]: Finished difference Result 3247 states and 4518 transitions. [2018-09-30 20:37:02,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 20:37:02,491 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-09-30 20:37:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:02,498 INFO L225 Difference]: With dead ends: 3247 [2018-09-30 20:37:02,498 INFO L226 Difference]: Without dead ends: 1981 [2018-09-30 20:37:02,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-09-30 20:37:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2018-09-30 20:37:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1486. [2018-09-30 20:37:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-09-30 20:37:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2080 transitions. [2018-09-30 20:37:03,040 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2080 transitions. Word has length 25 [2018-09-30 20:37:03,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:03,040 INFO L480 AbstractCegarLoop]: Abstraction has 1486 states and 2080 transitions. [2018-09-30 20:37:03,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:37:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2080 transitions. [2018-09-30 20:37:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-30 20:37:03,042 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:03,042 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:03,043 INFO L423 AbstractCegarLoop]: === Iteration 36 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:03,043 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:03,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1101622072, now seen corresponding path program 1 times [2018-09-30 20:37:03,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:03,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:03,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:03,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:03,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:03,188 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:37:03,189 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:37:03,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:03,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:37:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:37:03,346 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:37:03,346 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-09-30 20:37:03,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:37:03,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:37:03,347 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:03,347 INFO L87 Difference]: Start difference. First operand 1486 states and 2080 transitions. Second operand 15 states. [2018-09-30 20:37:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:10,448 INFO L93 Difference]: Finished difference Result 2670 states and 3684 transitions. [2018-09-30 20:37:10,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 20:37:10,449 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-09-30 20:37:10,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:10,459 INFO L225 Difference]: With dead ends: 2670 [2018-09-30 20:37:10,459 INFO L226 Difference]: Without dead ends: 2297 [2018-09-30 20:37:10,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-09-30 20:37:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2018-09-30 20:37:11,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 1939. [2018-09-30 20:37:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2018-09-30 20:37:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2704 transitions. [2018-09-30 20:37:11,209 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2704 transitions. Word has length 25 [2018-09-30 20:37:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:11,210 INFO L480 AbstractCegarLoop]: Abstraction has 1939 states and 2704 transitions. [2018-09-30 20:37:11,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:37:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2704 transitions. [2018-09-30 20:37:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-30 20:37:11,211 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:11,211 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:11,211 INFO L423 AbstractCegarLoop]: === Iteration 37 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:11,212 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:11,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1649781575, now seen corresponding path program 1 times [2018-09-30 20:37:11,212 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:11,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:11,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:11,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:11,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:11,524 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:37:11,524 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:37:11,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:11,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:37:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:37:11,677 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:37:11,677 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-09-30 20:37:11,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:37:11,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:37:11,677 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:11,677 INFO L87 Difference]: Start difference. First operand 1939 states and 2704 transitions. Second operand 15 states. [2018-09-30 20:37:18,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:18,819 INFO L93 Difference]: Finished difference Result 4093 states and 5719 transitions. [2018-09-30 20:37:18,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 20:37:18,820 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-09-30 20:37:18,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:18,829 INFO L225 Difference]: With dead ends: 4093 [2018-09-30 20:37:18,829 INFO L226 Difference]: Without dead ends: 2544 [2018-09-30 20:37:18,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-09-30 20:37:18,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2018-09-30 20:37:19,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2097. [2018-09-30 20:37:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2097 states. [2018-09-30 20:37:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 2937 transitions. [2018-09-30 20:37:19,668 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 2937 transitions. Word has length 25 [2018-09-30 20:37:19,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:19,669 INFO L480 AbstractCegarLoop]: Abstraction has 2097 states and 2937 transitions. [2018-09-30 20:37:19,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:37:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2937 transitions. [2018-09-30 20:37:19,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-30 20:37:19,671 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:19,671 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:19,671 INFO L423 AbstractCegarLoop]: === Iteration 38 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:19,671 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:19,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1262493869, now seen corresponding path program 1 times [2018-09-30 20:37:19,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:19,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:19,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:19,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:19,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:20,190 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:37:20,190 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:37:20,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:20,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:37:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:37:20,332 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:37:20,332 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-09-30 20:37:20,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:37:20,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:37:20,332 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:20,333 INFO L87 Difference]: Start difference. First operand 2097 states and 2937 transitions. Second operand 14 states. [2018-09-30 20:37:25,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:25,463 INFO L93 Difference]: Finished difference Result 3961 states and 5560 transitions. [2018-09-30 20:37:25,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-30 20:37:25,463 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-09-30 20:37:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:25,472 INFO L225 Difference]: With dead ends: 3961 [2018-09-30 20:37:25,472 INFO L226 Difference]: Without dead ends: 2233 [2018-09-30 20:37:25,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-09-30 20:37:25,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2018-09-30 20:37:26,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2029. [2018-09-30 20:37:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-09-30 20:37:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 2843 transitions. [2018-09-30 20:37:26,409 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 2843 transitions. Word has length 25 [2018-09-30 20:37:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:26,409 INFO L480 AbstractCegarLoop]: Abstraction has 2029 states and 2843 transitions. [2018-09-30 20:37:26,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:37:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2843 transitions. [2018-09-30 20:37:26,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-30 20:37:26,411 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:26,411 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:26,411 INFO L423 AbstractCegarLoop]: === Iteration 39 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:26,411 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:26,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1593213145, now seen corresponding path program 2 times [2018-09-30 20:37:26,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:26,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:26,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:26,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:26,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:26,667 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:37:26,667 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:37:26,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:37:26,715 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:37:26,716 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:37:26,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:37:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:37:26,867 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:37:26,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 16 [2018-09-30 20:37:26,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:37:26,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:37:26,868 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:26,868 INFO L87 Difference]: Start difference. First operand 2029 states and 2843 transitions. Second operand 16 states. [2018-09-30 20:37:34,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:34,736 INFO L93 Difference]: Finished difference Result 4322 states and 6081 transitions. [2018-09-30 20:37:34,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-30 20:37:34,736 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-09-30 20:37:34,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:34,742 INFO L225 Difference]: With dead ends: 4322 [2018-09-30 20:37:34,742 INFO L226 Difference]: Without dead ends: 2366 [2018-09-30 20:37:34,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-09-30 20:37:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2018-09-30 20:37:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 1739. [2018-09-30 20:37:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2018-09-30 20:37:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2453 transitions. [2018-09-30 20:37:35,493 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2453 transitions. Word has length 25 [2018-09-30 20:37:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:35,493 INFO L480 AbstractCegarLoop]: Abstraction has 1739 states and 2453 transitions. [2018-09-30 20:37:35,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:37:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2453 transitions. [2018-09-30 20:37:35,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-30 20:37:35,495 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:35,495 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:35,495 INFO L423 AbstractCegarLoop]: === Iteration 40 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:35,495 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:35,496 INFO L82 PathProgramCache]: Analyzing trace with hash -664447164, now seen corresponding path program 2 times [2018-09-30 20:37:35,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:35,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:35,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:35,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:37:35,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:35,635 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:37:35,636 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:37:35,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:37:35,693 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:37:35,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:37:35,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:37:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:35,987 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:37:35,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-30 20:37:35,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 20:37:35,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 20:37:35,988 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:35,988 INFO L87 Difference]: Start difference. First operand 1739 states and 2453 transitions. Second operand 20 states. [2018-09-30 20:37:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:51,027 INFO L93 Difference]: Finished difference Result 2868 states and 4094 transitions. [2018-09-30 20:37:51,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-30 20:37:51,028 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-09-30 20:37:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:51,035 INFO L225 Difference]: With dead ends: 2868 [2018-09-30 20:37:51,035 INFO L226 Difference]: Without dead ends: 2866 [2018-09-30 20:37:51,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time [2018-09-30 20:37:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2018-09-30 20:37:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 1983. [2018-09-30 20:37:51,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2018-09-30 20:37:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2810 transitions. [2018-09-30 20:37:51,765 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2810 transitions. Word has length 29 [2018-09-30 20:37:51,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:51,766 INFO L480 AbstractCegarLoop]: Abstraction has 1983 states and 2810 transitions. [2018-09-30 20:37:51,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 20:37:51,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2810 transitions. [2018-09-30 20:37:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-30 20:37:51,768 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:51,768 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:51,768 INFO L423 AbstractCegarLoop]: === Iteration 41 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:51,768 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:51,768 INFO L82 PathProgramCache]: Analyzing trace with hash 969112824, now seen corresponding path program 3 times [2018-09-30 20:37:51,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:51,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:51,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:51,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:37:51,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:51,948 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:37:51,948 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:37:51,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:37:52,007 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-30 20:37:52,007 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:37:52,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:37:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:52,521 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:37:52,521 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-09-30 20:37:52,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-30 20:37:52,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-30 20:37:52,522 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:52,522 INFO L87 Difference]: Start difference. First operand 1983 states and 2810 transitions. Second operand 21 states. [2018-09-30 20:38:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:10,775 INFO L93 Difference]: Finished difference Result 3415 states and 4897 transitions. [2018-09-30 20:38:10,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-30 20:38:10,775 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-09-30 20:38:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:10,782 INFO L225 Difference]: With dead ends: 3415 [2018-09-30 20:38:10,782 INFO L226 Difference]: Without dead ends: 3413 [2018-09-30 20:38:10,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 26 SyntacticMatches, 13 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s Time [2018-09-30 20:38:10,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2018-09-30 20:38:11,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 2673. [2018-09-30 20:38:11,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2673 states. [2018-09-30 20:38:11,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 3808 transitions. [2018-09-30 20:38:11,975 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 3808 transitions. Word has length 29 [2018-09-30 20:38:11,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:11,975 INFO L480 AbstractCegarLoop]: Abstraction has 2673 states and 3808 transitions. [2018-09-30 20:38:11,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-30 20:38:11,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 3808 transitions. [2018-09-30 20:38:11,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-30 20:38:11,978 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:11,978 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:38:11,978 INFO L423 AbstractCegarLoop]: === Iteration 42 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:11,978 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:11,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1174012687, now seen corresponding path program 2 times [2018-09-30 20:38:11,978 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:11,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:11,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:11,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:38:11,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-30 20:38:12,764 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:38:12,764 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:38:12,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:38:12,831 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:38:12,831 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:38:12,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:38:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:38:12,977 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:38:12,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 20:38:12,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:38:12,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:38:12,977 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:38:12,977 INFO L87 Difference]: Start difference. First operand 2673 states and 3808 transitions. Second operand 16 states. [2018-09-30 20:38:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:24,266 INFO L93 Difference]: Finished difference Result 8537 states and 12033 transitions. [2018-09-30 20:38:24,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-30 20:38:24,266 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-09-30 20:38:24,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:24,278 INFO L225 Difference]: With dead ends: 8537 [2018-09-30 20:38:24,278 INFO L226 Difference]: Without dead ends: 5842 [2018-09-30 20:38:24,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s Time [2018-09-30 20:38:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5842 states. [2018-09-30 20:38:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5842 to 4418. [2018-09-30 20:38:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4418 states. [2018-09-30 20:38:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 6219 transitions. [2018-09-30 20:38:25,969 INFO L78 Accepts]: Start accepts. Automaton has 4418 states and 6219 transitions. Word has length 33 [2018-09-30 20:38:25,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:25,970 INFO L480 AbstractCegarLoop]: Abstraction has 4418 states and 6219 transitions. [2018-09-30 20:38:25,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:38:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 4418 states and 6219 transitions. [2018-09-30 20:38:25,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-30 20:38:25,973 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:25,973 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:38:25,973 INFO L423 AbstractCegarLoop]: === Iteration 43 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:25,973 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:25,973 INFO L82 PathProgramCache]: Analyzing trace with hash -2110003385, now seen corresponding path program 1 times [2018-09-30 20:38:25,973 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:25,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:25,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:25,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:38:25,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:38:26,390 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:38:26,391 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:38:26,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:26,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:38:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 20:38:27,574 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:38:27,575 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-09-30 20:38:27,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 20:38:27,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 20:38:27,575 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:38:27,575 INFO L87 Difference]: Start difference. First operand 4418 states and 6219 transitions. Second operand 18 states. Received shutdown request... [2018-09-30 20:38:34,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 20:38:34,261 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 20:38:34,268 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 20:38:34,268 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:38:34 BoogieIcfgContainer [2018-09-30 20:38:34,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:38:34,269 INFO L168 Benchmark]: Toolchain (without parser) took 245806.98 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 843.1 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -729.4 MB). Peak memory consumption was 113.7 MB. Max. memory is 7.1 GB. [2018-09-30 20:38:34,271 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:38:34,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:38:34,272 INFO L168 Benchmark]: Boogie Preprocessor took 43.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:38:34,273 INFO L168 Benchmark]: RCFGBuilder took 627.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 20:38:34,274 INFO L168 Benchmark]: TraceAbstraction took 245084.24 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 843.1 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -750.5 MB). Peak memory consumption was 92.6 MB. Max. memory is 7.1 GB. [2018-09-30 20:38:34,277 INFO L336 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 627.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 245084.24 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 843.1 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -750.5 MB). Peak memory consumption was 92.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 66). Cancelled while BasicCegarLoop was constructing difference of abstraction (4418states) and FLOYD_HOARE automaton (currently 45 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (304 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 99). Cancelled while BasicCegarLoop was constructing difference of abstraction (4418states) and FLOYD_HOARE automaton (currently 45 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (304 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 121). Cancelled while BasicCegarLoop was constructing difference of abstraction (4418states) and FLOYD_HOARE automaton (currently 45 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (304 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 112). Cancelled while BasicCegarLoop was constructing difference of abstraction (4418states) and FLOYD_HOARE automaton (currently 45 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (304 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 4 error locations. TIMEOUT Result, 245.0s OverallTime, 43 OverallIterations, 3 TraceHistogramMax, 212.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2942 SDtfs, 6767 SDslu, 5803 SDs, 0 SdLazy, 33309 SolverSat, 8481 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2634 GetRequests, 724 SyntacticMatches, 18 SemanticMatches, 1892 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4418occurred in iteration=42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 13.0s AutomataMinimizationTime, 42 MinimizatonAttempts, 10693 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 1570 NumberOfCodeBlocks, 1570 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 1487 ConstructedInterpolants, 31 QuantifiedInterpolants, 132774 SizeOfPredicates, 597 NumberOfNonLiveVariables, 10665 ConjunctsInSsa, 1108 ConjunctsInUnsatCore, 83 InterpolantComputations, 9 PerfectInterpolantSequences, 120/434 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithProcedures.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-38-34-289.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithProcedures.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-38-34-289.csv Completed graceful shutdown