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/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:26:59,135 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:26:59,137 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:26:59,148 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:26:59,149 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:26:59,150 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:26:59,151 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:26:59,155 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:26:59,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:26:59,158 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:26:59,159 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:26:59,160 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:26:59,161 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:26:59,162 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:26:59,163 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:26:59,164 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:26:59,164 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:26:59,166 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:26:59,168 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:26:59,170 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:26:59,171 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:26:59,172 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:26:59,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:26:59,175 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:26:59,175 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:26:59,176 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:26:59,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:26:59,178 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:26:59,179 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:26:59,180 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:26:59,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:26:59,181 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:26:59,181 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:26:59,181 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:26:59,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:26:59,183 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:26:59,184 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-10-01 00:26:59,207 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:26:59,208 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:26:59,209 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:26:59,209 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:26:59,210 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:26:59,210 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:26:59,211 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:26:59,211 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:26:59,212 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:26:59,212 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:26:59,212 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:26:59,212 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:26:59,212 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:26:59,212 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:26:59,213 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:26:59,213 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:26:59,213 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:26:59,213 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:26:59,214 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:26:59,214 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:26:59,214 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:26:59,214 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:26:59,215 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:26:59,215 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:26:59,215 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:26:59,215 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:26:59,215 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:26:59,216 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:26:59,216 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:26:59,216 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:26:59,216 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:26:59,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:26:59,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:26:59,292 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:26:59,293 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:26:59,294 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:26:59,294 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-10-01 00:26:59,295 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl' [2018-10-01 00:26:59,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:26:59,348 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:26:59,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:26:59,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:26:59,349 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:26:59,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:26:59" (1/1) ... [2018-10-01 00:26:59,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:26:59" (1/1) ... [2018-10-01 00:26:59,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:26:59,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:26:59,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:26:59,390 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:26:59,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:26:59" (1/1) ... [2018-10-01 00:26:59,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:26:59" (1/1) ... [2018-10-01 00:26:59,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:26:59" (1/1) ... [2018-10-01 00:26:59,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:26:59" (1/1) ... [2018-10-01 00:26:59,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:26:59" (1/1) ... [2018-10-01 00:26:59,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:26:59" (1/1) ... [2018-10-01 00:26:59,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:26:59" (1/1) ... [2018-10-01 00:26:59,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:26:59,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:26:59,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:26:59,410 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:26:59,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:26:59" (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-10-01 00:26:59,479 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-01 00:26:59,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:26:59,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:26:59,799 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:26:59,800 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:26:59 BoogieIcfgContainer [2018-10-01 00:26:59,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:26:59,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:26:59,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:26:59,805 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:26:59,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:26:59" (1/2) ... [2018-10-01 00:26:59,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527a70bd and model type fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:26:59, skipping insertion in model container [2018-10-01 00:26:59,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:26:59" (2/2) ... [2018-10-01 00:26:59,808 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-10-01 00:26:59,817 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:26:59,825 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:26:59,871 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:26:59,872 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:26:59,873 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:26:59,873 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:26:59,873 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:26:59,873 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:26:59,873 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:26:59,874 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:26:59,874 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:26:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-10-01 00:26:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 00:26:59,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:59,896 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:59,897 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:59,903 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:59,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1807861163, now seen corresponding path program 1 times [2018-10-01 00:26:59,906 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:59,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:59,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:59,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:59,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:00,063 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:00,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:27:00,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:27:00,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:27:00,086 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:00,088 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-10-01 00:27:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:00,262 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-10-01 00:27:00,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:27:00,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-01 00:27:00,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:00,275 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:27:00,275 INFO L226 Difference]: Without dead ends: 10 [2018-10-01 00:27:00,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:27:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-01 00:27:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-01 00:27:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-01 00:27:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-10-01 00:27:00,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2018-10-01 00:27:00,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:00,315 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-10-01 00:27:00,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:27:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-10-01 00:27:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:27:00,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:00,316 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:00,316 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:00,317 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:00,317 INFO L82 PathProgramCache]: Analyzing trace with hash 89245487, now seen corresponding path program 1 times [2018-10-01 00:27:00,317 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:00,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:00,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:00,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:00,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:00,388 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:00,388 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-10-01 00:27:00,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:00,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:00,543 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:00,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-01 00:27:00,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:27:00,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:27:00,544 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:00,544 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 4 states. [2018-10-01 00:27:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:00,684 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-10-01 00:27:00,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:27:00,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-10-01 00:27:00,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:00,687 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:27:00,687 INFO L226 Difference]: Without dead ends: 12 [2018-10-01 00:27:00,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:27:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-01 00:27:00,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-01 00:27:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-01 00:27:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-10-01 00:27:00,693 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-10-01 00:27:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:00,694 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-10-01 00:27:00,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:27:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-10-01 00:27:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 00:27:00,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:00,695 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:00,695 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:00,695 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:00,696 INFO L82 PathProgramCache]: Analyzing trace with hash 2061989811, now seen corresponding path program 2 times [2018-10-01 00:27:00,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:00,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:00,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:00,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:00,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:00,800 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:00,800 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:27:00,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:27:00,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:27:00,801 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:00,801 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2018-10-01 00:27:01,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:01,322 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-10-01 00:27:01,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:27:01,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-10-01 00:27:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:01,324 INFO L225 Difference]: With dead ends: 32 [2018-10-01 00:27:01,324 INFO L226 Difference]: Without dead ends: 27 [2018-10-01 00:27:01,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:27:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-01 00:27:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-10-01 00:27:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-01 00:27:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-10-01 00:27:01,332 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2018-10-01 00:27:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:01,332 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-10-01 00:27:01,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:27:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-10-01 00:27:01,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 00:27:01,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:01,334 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:01,334 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:01,334 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:01,335 INFO L82 PathProgramCache]: Analyzing trace with hash 2062049393, now seen corresponding path program 1 times [2018-10-01 00:27:01,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:01,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:01,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:01,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:01,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-01 00:27:01,418 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:01,418 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:27:01,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:27:01,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:27:01,419 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:01,421 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 4 states. [2018-10-01 00:27:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:01,594 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-10-01 00:27:01,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:27:01,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-10-01 00:27:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:01,596 INFO L225 Difference]: With dead ends: 26 [2018-10-01 00:27:01,597 INFO L226 Difference]: Without dead ends: 24 [2018-10-01 00:27:01,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:27:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-01 00:27:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-10-01 00:27:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-01 00:27:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-10-01 00:27:01,604 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 11 [2018-10-01 00:27:01,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:01,604 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-10-01 00:27:01,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:27:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-10-01 00:27:01,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:27:01,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:01,606 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-10-01 00:27:01,606 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:01,606 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:01,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1980186676, now seen corresponding path program 1 times [2018-10-01 00:27:01,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:01,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:01,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:01,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:01,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:01,684 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:01,685 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:01,685 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-10-01 00:27:01,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:01,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:01,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:01,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-01 00:27:01,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:27:01,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:27:01,791 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:01,791 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-10-01 00:27:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:01,860 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-10-01 00:27:01,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:27:01,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-01 00:27:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:01,862 INFO L225 Difference]: With dead ends: 37 [2018-10-01 00:27:01,862 INFO L226 Difference]: Without dead ends: 23 [2018-10-01 00:27:01,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:27:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-01 00:27:01,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-01 00:27:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-01 00:27:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-10-01 00:27:01,868 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-10-01 00:27:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:01,869 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-10-01 00:27:01,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:27:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-10-01 00:27:01,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 00:27:01,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:01,870 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:01,870 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:01,871 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:01,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1317950664, now seen corresponding path program 2 times [2018-10-01 00:27:01,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:01,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:01,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:01,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:01,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:02,224 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:02,224 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-10-01 00:27:02,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:27:02,294 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:27:02,295 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:02,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:02,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:02,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-01 00:27:02,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:27:02,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:27:02,514 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:02,514 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2018-10-01 00:27:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:02,974 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-10-01 00:27:02,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:27:02,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-10-01 00:27:02,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:02,975 INFO L225 Difference]: With dead ends: 39 [2018-10-01 00:27:02,975 INFO L226 Difference]: Without dead ends: 25 [2018-10-01 00:27:02,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:27:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-01 00:27:02,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-01 00:27:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-01 00:27:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-01 00:27:02,981 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2018-10-01 00:27:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:02,982 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-01 00:27:02,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:27:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-01 00:27:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 00:27:02,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:02,983 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:02,983 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:02,983 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:02,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1142069956, now seen corresponding path program 3 times [2018-10-01 00:27:02,984 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:02,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:02,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:02,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:02,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:03,079 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:03,079 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-10-01 00:27:03,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:27:03,177 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-01 00:27:03,178 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:03,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:03,319 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:03,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-01 00:27:03,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:27:03,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:27:03,320 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:03,320 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 7 states. [2018-10-01 00:27:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:03,429 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-10-01 00:27:03,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:27:03,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-10-01 00:27:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:03,431 INFO L225 Difference]: With dead ends: 41 [2018-10-01 00:27:03,432 INFO L226 Difference]: Without dead ends: 27 [2018-10-01 00:27:03,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:27:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-01 00:27:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-01 00:27:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-01 00:27:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-10-01 00:27:03,438 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2018-10-01 00:27:03,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:03,438 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-10-01 00:27:03,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:27:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-10-01 00:27:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-01 00:27:03,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:03,440 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:03,440 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:03,440 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:03,441 INFO L82 PathProgramCache]: Analyzing trace with hash -375565888, now seen corresponding path program 4 times [2018-10-01 00:27:03,441 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:03,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:03,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:03,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:03,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:03,560 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:03,560 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-10-01 00:27:03,576 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:27:03,610 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:27:03,610 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:03,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:03,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:03,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:27:03,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:27:03,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:27:03,688 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:03,688 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 8 states. [2018-10-01 00:27:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:03,846 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-10-01 00:27:03,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:27:03,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-01 00:27:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:03,849 INFO L225 Difference]: With dead ends: 43 [2018-10-01 00:27:03,849 INFO L226 Difference]: Without dead ends: 29 [2018-10-01 00:27:03,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:27:03,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-01 00:27:03,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-01 00:27:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-01 00:27:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-01 00:27:03,855 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 26 [2018-10-01 00:27:03,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:03,856 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-01 00:27:03,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:27:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-01 00:27:03,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-01 00:27:03,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:03,857 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:03,857 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:03,857 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:03,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1465268668, now seen corresponding path program 5 times [2018-10-01 00:27:03,857 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:03,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:03,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:03,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:03,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:03,983 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:03,984 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-10-01 00:27:03,996 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:27:04,033 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-01 00:27:04,034 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:04,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:04,111 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:04,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:04,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-01 00:27:04,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:27:04,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:27:04,133 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:04,134 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 9 states. [2018-10-01 00:27:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:04,262 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-10-01 00:27:04,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:27:04,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-10-01 00:27:04,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:04,263 INFO L225 Difference]: With dead ends: 45 [2018-10-01 00:27:04,264 INFO L226 Difference]: Without dead ends: 31 [2018-10-01 00:27:04,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:27:04,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-01 00:27:04,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-01 00:27:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-01 00:27:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-10-01 00:27:04,269 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 28 [2018-10-01 00:27:04,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:04,270 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-10-01 00:27:04,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:27:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-10-01 00:27:04,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 00:27:04,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:04,271 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:04,272 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:04,272 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:04,272 INFO L82 PathProgramCache]: Analyzing trace with hash 980751032, now seen corresponding path program 6 times [2018-10-01 00:27:04,272 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:04,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:04,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:04,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:04,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:04,416 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:04,417 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-10-01 00:27:04,425 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:27:04,551 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-01 00:27:04,552 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:04,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:04,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:04,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-01 00:27:04,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:27:04,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:27:04,789 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:04,789 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 10 states. [2018-10-01 00:27:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:04,869 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-10-01 00:27:04,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:27:04,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-10-01 00:27:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:04,871 INFO L225 Difference]: With dead ends: 47 [2018-10-01 00:27:04,871 INFO L226 Difference]: Without dead ends: 33 [2018-10-01 00:27:04,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-01 00:27:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-01 00:27:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-01 00:27:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-10-01 00:27:04,877 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2018-10-01 00:27:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:04,878 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-10-01 00:27:04,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:27:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-10-01 00:27:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-01 00:27:04,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:04,879 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:04,879 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:04,880 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:04,880 INFO L82 PathProgramCache]: Analyzing trace with hash -784229196, now seen corresponding path program 7 times [2018-10-01 00:27:04,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:04,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:04,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:04,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:04,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:05,001 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:05,002 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:05,002 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-10-01 00:27:05,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:05,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:05,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:05,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-01 00:27:05,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:27:05,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:27:05,112 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:05,112 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 11 states. [2018-10-01 00:27:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:05,214 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-10-01 00:27:05,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:27:05,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-10-01 00:27:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:05,219 INFO L225 Difference]: With dead ends: 49 [2018-10-01 00:27:05,219 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:27:05,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:27:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:27:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-01 00:27:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 00:27:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-10-01 00:27:05,225 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 32 [2018-10-01 00:27:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:05,226 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-10-01 00:27:05,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:27:05,226 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-10-01 00:27:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:27:05,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:05,227 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:05,227 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:05,227 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:05,227 INFO L82 PathProgramCache]: Analyzing trace with hash -418146384, now seen corresponding path program 8 times [2018-10-01 00:27:05,228 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:05,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:05,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:05,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:05,340 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:05,340 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-10-01 00:27:05,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:27:05,386 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:27:05,387 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:05,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:05,476 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:05,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-01 00:27:05,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:27:05,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:27:05,477 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:05,477 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 12 states. [2018-10-01 00:27:05,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:05,585 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-10-01 00:27:05,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:27:05,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-10-01 00:27:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:05,586 INFO L225 Difference]: With dead ends: 51 [2018-10-01 00:27:05,586 INFO L226 Difference]: Without dead ends: 37 [2018-10-01 00:27:05,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:27:05,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-01 00:27:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-01 00:27:05,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-01 00:27:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-10-01 00:27:05,593 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2018-10-01 00:27:05,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:05,593 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-10-01 00:27:05,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:27:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-10-01 00:27:05,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-01 00:27:05,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:05,594 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:05,595 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:05,595 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:05,595 INFO L82 PathProgramCache]: Analyzing trace with hash -799882324, now seen corresponding path program 9 times [2018-10-01 00:27:05,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:05,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:05,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:05,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:05,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:05,761 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:05,761 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-10-01 00:27:05,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:27:05,819 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-10-01 00:27:05,819 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:05,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:06,013 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:06,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-01 00:27:06,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:27:06,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:27:06,014 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:06,014 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 13 states. [2018-10-01 00:27:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:06,332 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-10-01 00:27:06,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:27:06,339 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-10-01 00:27:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:06,339 INFO L225 Difference]: With dead ends: 53 [2018-10-01 00:27:06,340 INFO L226 Difference]: Without dead ends: 39 [2018-10-01 00:27:06,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:06,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-01 00:27:06,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-01 00:27:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-01 00:27:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-10-01 00:27:06,346 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 36 [2018-10-01 00:27:06,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:06,347 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-10-01 00:27:06,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:27:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-10-01 00:27:06,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-01 00:27:06,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:06,348 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:06,348 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:06,348 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:06,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1719066792, now seen corresponding path program 10 times [2018-10-01 00:27:06,349 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:06,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:06,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:06,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:06,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:06,538 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:06,538 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-10-01 00:27:06,567 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:27:06,591 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:27:06,591 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:06,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:06,781 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:06,781 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-01 00:27:06,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:27:06,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:27:06,782 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:06,782 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 14 states. [2018-10-01 00:27:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:06,901 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-10-01 00:27:06,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:27:06,902 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-10-01 00:27:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:06,903 INFO L225 Difference]: With dead ends: 55 [2018-10-01 00:27:06,903 INFO L226 Difference]: Without dead ends: 41 [2018-10-01 00:27:06,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:27:06,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-01 00:27:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-01 00:27:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-01 00:27:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-10-01 00:27:06,912 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 38 [2018-10-01 00:27:06,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:06,912 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-10-01 00:27:06,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:27:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-10-01 00:27:06,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-01 00:27:06,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:06,913 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:06,913 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:06,914 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:06,914 INFO L82 PathProgramCache]: Analyzing trace with hash 67612324, now seen corresponding path program 11 times [2018-10-01 00:27:06,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:06,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:06,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:06,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:06,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:07,270 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:07,270 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-10-01 00:27:07,280 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:27:07,367 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-01 00:27:07,368 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:07,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:07,509 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:07,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-01 00:27:07,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:27:07,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:27:07,510 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:07,510 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 15 states. [2018-10-01 00:27:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:07,603 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-10-01 00:27:07,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:27:07,607 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-10-01 00:27:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:07,607 INFO L225 Difference]: With dead ends: 57 [2018-10-01 00:27:07,608 INFO L226 Difference]: Without dead ends: 43 [2018-10-01 00:27:07,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:27:07,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-01 00:27:07,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-01 00:27:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-01 00:27:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-10-01 00:27:07,621 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 40 [2018-10-01 00:27:07,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:07,622 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-10-01 00:27:07,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:27:07,622 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-10-01 00:27:07,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-01 00:27:07,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:07,623 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:07,623 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:07,623 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:07,623 INFO L82 PathProgramCache]: Analyzing trace with hash -2137199200, now seen corresponding path program 12 times [2018-10-01 00:27:07,624 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:07,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:07,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:07,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:07,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:08,161 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:08,162 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:08,162 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-10-01 00:27:08,169 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:27:08,204 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-10-01 00:27:08,205 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:08,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:08,311 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:08,311 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-01 00:27:08,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:27:08,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:27:08,312 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:08,312 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 16 states. [2018-10-01 00:27:08,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:08,608 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-10-01 00:27:08,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:27:08,609 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-10-01 00:27:08,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:08,609 INFO L225 Difference]: With dead ends: 59 [2018-10-01 00:27:08,610 INFO L226 Difference]: Without dead ends: 45 [2018-10-01 00:27:08,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:27:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-01 00:27:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-01 00:27:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-01 00:27:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-10-01 00:27:08,615 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 42 [2018-10-01 00:27:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:08,615 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-10-01 00:27:08,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:27:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-10-01 00:27:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-01 00:27:08,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:08,616 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:08,617 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:08,617 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:08,617 INFO L82 PathProgramCache]: Analyzing trace with hash 752770460, now seen corresponding path program 13 times [2018-10-01 00:27:08,617 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:08,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:08,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:08,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:08,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:08,762 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:08,762 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-10-01 00:27:08,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:08,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:09,020 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:09,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-01 00:27:09,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:27:09,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:27:09,021 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:09,021 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 17 states. [2018-10-01 00:27:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:09,177 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-10-01 00:27:09,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:27:09,178 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-10-01 00:27:09,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:09,179 INFO L225 Difference]: With dead ends: 61 [2018-10-01 00:27:09,179 INFO L226 Difference]: Without dead ends: 47 [2018-10-01 00:27:09,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-01 00:27:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-01 00:27:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-01 00:27:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-10-01 00:27:09,186 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 44 [2018-10-01 00:27:09,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:09,187 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-10-01 00:27:09,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:27:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-10-01 00:27:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-01 00:27:09,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:09,188 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:09,188 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:09,188 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:09,188 INFO L82 PathProgramCache]: Analyzing trace with hash -830226792, now seen corresponding path program 14 times [2018-10-01 00:27:09,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:09,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:09,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:09,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:09,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:09,359 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:09,359 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-10-01 00:27:09,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:27:09,402 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:27:09,403 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:09,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:09,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:09,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-01 00:27:09,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:27:09,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:27:09,533 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:09,533 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 18 states. [2018-10-01 00:27:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:09,736 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-10-01 00:27:09,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:27:09,737 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-10-01 00:27:09,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:09,737 INFO L225 Difference]: With dead ends: 63 [2018-10-01 00:27:09,737 INFO L226 Difference]: Without dead ends: 49 [2018-10-01 00:27:09,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:09,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-01 00:27:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-01 00:27:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-01 00:27:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-10-01 00:27:09,744 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 46 [2018-10-01 00:27:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:09,744 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-10-01 00:27:09,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:27:09,744 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-10-01 00:27:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-01 00:27:09,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:09,745 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:09,746 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:09,746 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:09,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1672163180, now seen corresponding path program 15 times [2018-10-01 00:27:09,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:09,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:09,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:09,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:09,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:09,914 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:09,914 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-10-01 00:27:09,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:27:09,992 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-10-01 00:27:09,992 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:09,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:10,409 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:10,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-01 00:27:10,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:27:10,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:27:10,410 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:10,411 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 19 states. [2018-10-01 00:27:10,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:10,586 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-10-01 00:27:10,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:27:10,590 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-10-01 00:27:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:10,590 INFO L225 Difference]: With dead ends: 65 [2018-10-01 00:27:10,590 INFO L226 Difference]: Without dead ends: 51 [2018-10-01 00:27:10,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:27:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-01 00:27:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-01 00:27:10,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-01 00:27:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-10-01 00:27:10,596 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 48 [2018-10-01 00:27:10,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:10,596 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-10-01 00:27:10,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:27:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-10-01 00:27:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-01 00:27:10,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:10,597 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:10,597 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:10,597 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:10,598 INFO L82 PathProgramCache]: Analyzing trace with hash 975786896, now seen corresponding path program 16 times [2018-10-01 00:27:10,598 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:10,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:10,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:10,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:10,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:10,811 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:10,811 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:10,811 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-10-01 00:27:10,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:27:10,852 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:27:10,852 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:10,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:10,952 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:10,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-01 00:27:10,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:27:10,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:27:10,953 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:10,953 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 20 states. [2018-10-01 00:27:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:11,148 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-10-01 00:27:11,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:27:11,149 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2018-10-01 00:27:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:11,150 INFO L225 Difference]: With dead ends: 67 [2018-10-01 00:27:11,150 INFO L226 Difference]: Without dead ends: 53 [2018-10-01 00:27:11,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-01 00:27:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-01 00:27:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-01 00:27:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-10-01 00:27:11,157 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 50 [2018-10-01 00:27:11,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:11,158 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-10-01 00:27:11,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:27:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-10-01 00:27:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-01 00:27:11,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:11,159 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:11,159 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:11,159 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:11,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1259796596, now seen corresponding path program 17 times [2018-10-01 00:27:11,160 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:11,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:11,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:11,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:11,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:11,375 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:11,375 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-10-01 00:27:11,383 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:27:11,421 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-01 00:27:11,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:11,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:11,572 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:11,572 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-01 00:27:11,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-01 00:27:11,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-01 00:27:11,573 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:11,573 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 21 states. [2018-10-01 00:27:11,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:11,767 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-10-01 00:27:11,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:27:11,767 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-10-01 00:27:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:11,768 INFO L225 Difference]: With dead ends: 69 [2018-10-01 00:27:11,768 INFO L226 Difference]: Without dead ends: 55 [2018-10-01 00:27:11,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:11,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-01 00:27:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-01 00:27:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-01 00:27:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-10-01 00:27:11,774 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 52 [2018-10-01 00:27:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:11,774 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-10-01 00:27:11,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-01 00:27:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-10-01 00:27:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-01 00:27:11,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:11,775 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:11,776 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:11,776 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:11,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2123082888, now seen corresponding path program 18 times [2018-10-01 00:27:11,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:11,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:11,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:11,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:11,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:12,179 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:12,179 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-10-01 00:27:12,188 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:27:12,235 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-10-01 00:27:12,235 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:12,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:12,365 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:12,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-01 00:27:12,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:27:12,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:27:12,366 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:12,366 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 22 states. [2018-10-01 00:27:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:12,675 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-10-01 00:27:12,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:27:12,679 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-10-01 00:27:12,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:12,680 INFO L225 Difference]: With dead ends: 71 [2018-10-01 00:27:12,680 INFO L226 Difference]: Without dead ends: 57 [2018-10-01 00:27:12,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:27:12,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-01 00:27:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-01 00:27:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-01 00:27:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-10-01 00:27:12,685 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 54 [2018-10-01 00:27:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:12,685 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-10-01 00:27:12,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:27:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-10-01 00:27:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-01 00:27:12,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:12,686 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:12,687 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:12,687 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:12,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1780023940, now seen corresponding path program 19 times [2018-10-01 00:27:12,687 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:12,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:12,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:12,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:12,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:13,528 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:13,528 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-10-01 00:27:13,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:13,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:13,663 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:13,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-01 00:27:13,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-01 00:27:13,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-01 00:27:13,664 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:13,664 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 23 states. [2018-10-01 00:27:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:13,870 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-10-01 00:27:13,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:27:13,874 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-10-01 00:27:13,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:13,875 INFO L225 Difference]: With dead ends: 73 [2018-10-01 00:27:13,875 INFO L226 Difference]: Without dead ends: 59 [2018-10-01 00:27:13,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:27:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-01 00:27:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-01 00:27:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-01 00:27:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-10-01 00:27:13,879 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 56 [2018-10-01 00:27:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:13,880 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-10-01 00:27:13,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-01 00:27:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-10-01 00:27:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-01 00:27:13,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:13,881 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:13,881 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:13,881 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:13,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1482110592, now seen corresponding path program 20 times [2018-10-01 00:27:13,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:13,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:13,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:13,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:13,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:14,169 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:14,169 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-10-01 00:27:14,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:27:14,222 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:27:14,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:14,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:14,346 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:14,346 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-01 00:27:14,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-01 00:27:14,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-01 00:27:14,346 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:14,346 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 24 states. [2018-10-01 00:27:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:14,474 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-10-01 00:27:14,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:27:14,475 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-10-01 00:27:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:14,476 INFO L225 Difference]: With dead ends: 75 [2018-10-01 00:27:14,476 INFO L226 Difference]: Without dead ends: 61 [2018-10-01 00:27:14,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:27:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-01 00:27:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-01 00:27:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-01 00:27:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-10-01 00:27:14,480 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 58 [2018-10-01 00:27:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:14,481 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-10-01 00:27:14,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-01 00:27:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-10-01 00:27:14,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-01 00:27:14,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:14,482 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:14,482 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:14,482 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:14,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1067269764, now seen corresponding path program 21 times [2018-10-01 00:27:14,482 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:14,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:14,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:14,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:14,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:14,866 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:14,866 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-10-01 00:27:14,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:27:14,925 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-10-01 00:27:14,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:14,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:15,039 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:15,039 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-01 00:27:15,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-01 00:27:15,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-01 00:27:15,039 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:15,039 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 25 states. [2018-10-01 00:27:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:15,143 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-10-01 00:27:15,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:27:15,144 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-10-01 00:27:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:15,145 INFO L225 Difference]: With dead ends: 77 [2018-10-01 00:27:15,145 INFO L226 Difference]: Without dead ends: 63 [2018-10-01 00:27:15,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:27:15,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-01 00:27:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-01 00:27:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-01 00:27:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-10-01 00:27:15,148 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 60 [2018-10-01 00:27:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:15,149 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-10-01 00:27:15,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-01 00:27:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-10-01 00:27:15,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-01 00:27:15,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:15,150 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:15,150 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:15,150 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:15,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1837192584, now seen corresponding path program 22 times [2018-10-01 00:27:15,150 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:15,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:15,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:15,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:15,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:15,366 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:15,366 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-10-01 00:27:15,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:27:15,414 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:27:15,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:15,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:15,543 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:15,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-01 00:27:15,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-01 00:27:15,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-01 00:27:15,544 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:15,544 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 26 states. [2018-10-01 00:27:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:15,748 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-10-01 00:27:15,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-01 00:27:15,748 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-10-01 00:27:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:15,749 INFO L225 Difference]: With dead ends: 79 [2018-10-01 00:27:15,749 INFO L226 Difference]: Without dead ends: 65 [2018-10-01 00:27:15,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-01 00:27:15,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-01 00:27:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-01 00:27:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-10-01 00:27:15,754 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 62 [2018-10-01 00:27:15,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:15,754 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-10-01 00:27:15,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-01 00:27:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-10-01 00:27:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-01 00:27:15,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:15,754 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:15,755 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:15,755 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:15,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1296319604, now seen corresponding path program 23 times [2018-10-01 00:27:15,755 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:15,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:15,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:15,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:15,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:16,609 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:16,609 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-10-01 00:27:16,616 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:27:16,678 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-01 00:27:16,678 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:16,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:16,815 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:16,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-01 00:27:16,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-01 00:27:16,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-01 00:27:16,816 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:16,816 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 27 states. [2018-10-01 00:27:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:17,054 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-10-01 00:27:17,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:27:17,054 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-10-01 00:27:17,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:17,055 INFO L225 Difference]: With dead ends: 81 [2018-10-01 00:27:17,055 INFO L226 Difference]: Without dead ends: 67 [2018-10-01 00:27:17,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:27:17,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-01 00:27:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-01 00:27:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-01 00:27:17,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-10-01 00:27:17,060 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 64 [2018-10-01 00:27:17,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:17,060 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-10-01 00:27:17,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-01 00:27:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-10-01 00:27:17,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-01 00:27:17,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:17,061 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:17,061 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:17,061 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:17,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1829457776, now seen corresponding path program 24 times [2018-10-01 00:27:17,061 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:17,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:17,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:17,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:17,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:17,265 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:17,265 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-10-01 00:27:17,273 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:27:17,328 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-10-01 00:27:17,328 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:17,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:17,447 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:17,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-01 00:27:17,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-01 00:27:17,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-01 00:27:17,448 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:17,448 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 28 states. [2018-10-01 00:27:17,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:17,714 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-10-01 00:27:17,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:27:17,715 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 66 [2018-10-01 00:27:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:17,716 INFO L225 Difference]: With dead ends: 83 [2018-10-01 00:27:17,716 INFO L226 Difference]: Without dead ends: 69 [2018-10-01 00:27:17,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-01 00:27:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-01 00:27:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-01 00:27:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-10-01 00:27:17,721 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 66 [2018-10-01 00:27:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:17,722 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-10-01 00:27:17,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-01 00:27:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-10-01 00:27:17,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-01 00:27:17,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:17,722 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:17,723 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:17,723 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:17,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1220834452, now seen corresponding path program 25 times [2018-10-01 00:27:17,723 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:17,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:17,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:17,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:17,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:17,910 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:17,911 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-10-01 00:27:17,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:17,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:18,122 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:18,123 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-01 00:27:18,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-01 00:27:18,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-01 00:27:18,123 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:18,123 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 29 states. [2018-10-01 00:27:18,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:18,322 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-10-01 00:27:18,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:27:18,323 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 68 [2018-10-01 00:27:18,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:18,323 INFO L225 Difference]: With dead ends: 85 [2018-10-01 00:27:18,324 INFO L226 Difference]: Without dead ends: 71 [2018-10-01 00:27:18,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-01 00:27:18,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-01 00:27:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-01 00:27:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-10-01 00:27:18,345 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 68 [2018-10-01 00:27:18,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:18,345 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-10-01 00:27:18,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-01 00:27:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-10-01 00:27:18,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-01 00:27:18,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:18,346 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:18,346 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:18,347 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:18,347 INFO L82 PathProgramCache]: Analyzing trace with hash 910997608, now seen corresponding path program 26 times [2018-10-01 00:27:18,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:18,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:18,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:18,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:18,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:18,756 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:18,756 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-10-01 00:27:18,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:27:18,814 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:27:18,814 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:18,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:18,989 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:18,989 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-01 00:27:18,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-01 00:27:18,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-01 00:27:18,990 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:18,990 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 30 states. [2018-10-01 00:27:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:19,134 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-10-01 00:27:19,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:27:19,135 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 70 [2018-10-01 00:27:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:19,136 INFO L225 Difference]: With dead ends: 87 [2018-10-01 00:27:19,136 INFO L226 Difference]: Without dead ends: 73 [2018-10-01 00:27:19,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:27:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-01 00:27:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-01 00:27:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-01 00:27:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-10-01 00:27:19,141 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 70 [2018-10-01 00:27:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:19,141 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-10-01 00:27:19,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-01 00:27:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-10-01 00:27:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-01 00:27:19,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:19,142 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:19,143 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:19,143 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:19,143 INFO L82 PathProgramCache]: Analyzing trace with hash 902207076, now seen corresponding path program 27 times [2018-10-01 00:27:19,143 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:19,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:19,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:19,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:19,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:19,438 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:19,438 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-10-01 00:27:19,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:27:19,529 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-10-01 00:27:19,529 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:19,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:19,675 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:19,675 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-01 00:27:19,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-01 00:27:19,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-01 00:27:19,676 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:19,676 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 31 states. [2018-10-01 00:27:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:19,874 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-10-01 00:27:19,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:27:19,874 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 72 [2018-10-01 00:27:19,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:19,875 INFO L225 Difference]: With dead ends: 89 [2018-10-01 00:27:19,875 INFO L226 Difference]: Without dead ends: 75 [2018-10-01 00:27:19,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:27:19,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-01 00:27:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-01 00:27:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-01 00:27:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-10-01 00:27:19,880 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 72 [2018-10-01 00:27:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:19,881 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-10-01 00:27:19,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-01 00:27:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-10-01 00:27:19,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-01 00:27:19,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:19,881 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:19,882 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:19,882 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:19,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1044440416, now seen corresponding path program 28 times [2018-10-01 00:27:19,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:19,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:19,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:19,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:19,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:20,194 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:20,195 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:20,195 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-10-01 00:27:20,203 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:27:20,253 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:27:20,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:20,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:20,387 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:20,388 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-01 00:27:20,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-01 00:27:20,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-01 00:27:20,388 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:20,388 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 32 states. [2018-10-01 00:27:20,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:20,667 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-10-01 00:27:20,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:27:20,668 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 74 [2018-10-01 00:27:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:20,669 INFO L225 Difference]: With dead ends: 91 [2018-10-01 00:27:20,669 INFO L226 Difference]: Without dead ends: 77 [2018-10-01 00:27:20,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:27:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-01 00:27:20,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-01 00:27:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-01 00:27:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-10-01 00:27:20,673 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 74 [2018-10-01 00:27:20,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:20,674 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-10-01 00:27:20,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-01 00:27:20,674 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-10-01 00:27:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-01 00:27:20,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:20,674 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:20,675 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:20,675 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:20,675 INFO L82 PathProgramCache]: Analyzing trace with hash 291726684, now seen corresponding path program 29 times [2018-10-01 00:27:20,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:20,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:20,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:20,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:20,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:21,497 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:21,497 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-10-01 00:27:21,504 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:27:21,583 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-10-01 00:27:21,583 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:21,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:21,729 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:21,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-01 00:27:21,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-01 00:27:21,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-01 00:27:21,730 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:21,730 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 33 states. [2018-10-01 00:27:22,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:22,004 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-10-01 00:27:22,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-01 00:27:22,005 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 76 [2018-10-01 00:27:22,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:22,005 INFO L225 Difference]: With dead ends: 93 [2018-10-01 00:27:22,006 INFO L226 Difference]: Without dead ends: 79 [2018-10-01 00:27:22,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:27:22,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-01 00:27:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-01 00:27:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-01 00:27:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-10-01 00:27:22,012 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 76 [2018-10-01 00:27:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:22,012 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-10-01 00:27:22,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-01 00:27:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-10-01 00:27:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-01 00:27:22,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:22,013 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:22,013 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:22,013 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:22,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1511664040, now seen corresponding path program 30 times [2018-10-01 00:27:22,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:22,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:22,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:22,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:22,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:22,680 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:22,680 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-10-01 00:27:22,687 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:27:22,759 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-10-01 00:27:22,760 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:22,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:23,006 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:23,006 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-01 00:27:23,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-01 00:27:23,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-01 00:27:23,007 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:23,007 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 34 states. [2018-10-01 00:27:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:23,298 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-10-01 00:27:23,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 00:27:23,300 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 78 [2018-10-01 00:27:23,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:23,300 INFO L225 Difference]: With dead ends: 95 [2018-10-01 00:27:23,301 INFO L226 Difference]: Without dead ends: 81 [2018-10-01 00:27:23,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:27:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-01 00:27:23,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-01 00:27:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-01 00:27:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-10-01 00:27:23,306 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 78 [2018-10-01 00:27:23,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:23,306 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-10-01 00:27:23,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-01 00:27:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-10-01 00:27:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-01 00:27:23,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:23,307 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:23,307 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:23,307 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:23,307 INFO L82 PathProgramCache]: Analyzing trace with hash 596637780, now seen corresponding path program 31 times [2018-10-01 00:27:23,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:23,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:23,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:23,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:23,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:24,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:24,303 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:24,303 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-10-01 00:27:24,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:24,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:24,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:24,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-01 00:27:24,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-01 00:27:24,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-01 00:27:24,534 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:24,534 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 35 states. [2018-10-01 00:27:24,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:24,886 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-10-01 00:27:24,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-01 00:27:24,886 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 80 [2018-10-01 00:27:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:24,887 INFO L225 Difference]: With dead ends: 97 [2018-10-01 00:27:24,887 INFO L226 Difference]: Without dead ends: 83 [2018-10-01 00:27:24,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:27:24,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-01 00:27:24,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-01 00:27:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-01 00:27:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-10-01 00:27:24,892 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 80 [2018-10-01 00:27:24,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:24,892 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-10-01 00:27:24,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-01 00:27:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-10-01 00:27:24,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-01 00:27:24,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:24,893 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:24,893 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:24,893 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:24,893 INFO L82 PathProgramCache]: Analyzing trace with hash -549876912, now seen corresponding path program 32 times [2018-10-01 00:27:24,893 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:24,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:24,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:24,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:24,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:25,389 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:25,389 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-10-01 00:27:25,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:27:25,448 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:27:25,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:25,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:25,632 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:25,632 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-01 00:27:25,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-01 00:27:25,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-01 00:27:25,632 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:25,633 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 36 states. [2018-10-01 00:27:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:25,927 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-10-01 00:27:25,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-01 00:27:25,935 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 82 [2018-10-01 00:27:25,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:25,935 INFO L225 Difference]: With dead ends: 99 [2018-10-01 00:27:25,935 INFO L226 Difference]: Without dead ends: 85 [2018-10-01 00:27:25,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:27:25,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-01 00:27:25,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-01 00:27:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-01 00:27:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2018-10-01 00:27:25,940 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 82 [2018-10-01 00:27:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:25,941 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-10-01 00:27:25,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-01 00:27:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2018-10-01 00:27:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-01 00:27:25,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:25,941 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:25,942 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:25,942 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:25,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1456099148, now seen corresponding path program 33 times [2018-10-01 00:27:25,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:25,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:25,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:25,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:25,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:26,292 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:26,292 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-10-01 00:27:26,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:27:26,388 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-10-01 00:27:26,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:26,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:26,649 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:26,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-01 00:27:26,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-01 00:27:26,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-01 00:27:26,649 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:26,649 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 37 states. [2018-10-01 00:27:26,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:26,847 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-10-01 00:27:26,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-01 00:27:26,848 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 84 [2018-10-01 00:27:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:26,849 INFO L225 Difference]: With dead ends: 101 [2018-10-01 00:27:26,849 INFO L226 Difference]: Without dead ends: 87 [2018-10-01 00:27:26,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:27:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-01 00:27:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-01 00:27:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-01 00:27:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-10-01 00:27:26,858 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 84 [2018-10-01 00:27:26,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:26,859 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-10-01 00:27:26,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-01 00:27:26,859 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-10-01 00:27:26,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-01 00:27:26,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:26,859 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:26,861 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:26,861 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:26,861 INFO L82 PathProgramCache]: Analyzing trace with hash 758776904, now seen corresponding path program 34 times [2018-10-01 00:27:26,861 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:26,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:26,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:26,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:26,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:27,239 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:27,239 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-10-01 00:27:27,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:27:27,296 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:27:27,296 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:27,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:27,453 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:27,453 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-01 00:27:27,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-01 00:27:27,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-01 00:27:27,453 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:27,454 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 38 states. [2018-10-01 00:27:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:27,671 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-10-01 00:27:27,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-01 00:27:27,672 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2018-10-01 00:27:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:27,672 INFO L225 Difference]: With dead ends: 103 [2018-10-01 00:27:27,672 INFO L226 Difference]: Without dead ends: 89 [2018-10-01 00:27:27,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:27:27,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-01 00:27:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-10-01 00:27:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-01 00:27:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-10-01 00:27:27,676 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 86 [2018-10-01 00:27:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:27,677 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-10-01 00:27:27,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-01 00:27:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-10-01 00:27:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-01 00:27:27,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:27,678 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:27,678 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:27,678 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash 646998596, now seen corresponding path program 35 times [2018-10-01 00:27:27,678 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:27,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:27,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:27,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:27,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:28,002 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:28,002 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-10-01 00:27:28,009 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:27:28,099 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-10-01 00:27:28,099 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:28,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:29,303 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:29,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-01 00:27:29,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-01 00:27:29,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-01 00:27:29,304 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:29,304 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 39 states. [2018-10-01 00:27:29,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:29,636 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-10-01 00:27:29,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:27:29,636 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 88 [2018-10-01 00:27:29,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:29,637 INFO L225 Difference]: With dead ends: 105 [2018-10-01 00:27:29,638 INFO L226 Difference]: Without dead ends: 91 [2018-10-01 00:27:29,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:27:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-01 00:27:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-01 00:27:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-01 00:27:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-10-01 00:27:29,643 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 88 [2018-10-01 00:27:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:29,643 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-10-01 00:27:29,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-01 00:27:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-10-01 00:27:29,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-01 00:27:29,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:29,644 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:29,644 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:29,645 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:29,645 INFO L82 PathProgramCache]: Analyzing trace with hash 602227008, now seen corresponding path program 36 times [2018-10-01 00:27:29,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:29,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:29,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:29,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:29,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:29,961 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:29,961 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-10-01 00:27:29,969 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:27:30,052 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2018-10-01 00:27:30,052 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:30,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:30,230 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:30,230 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-01 00:27:30,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-01 00:27:30,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-01 00:27:30,231 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:30,231 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 40 states. [2018-10-01 00:27:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:30,514 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-10-01 00:27:30,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-01 00:27:30,520 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2018-10-01 00:27:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:30,520 INFO L225 Difference]: With dead ends: 107 [2018-10-01 00:27:30,521 INFO L226 Difference]: Without dead ends: 93 [2018-10-01 00:27:30,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:27:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-01 00:27:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-10-01 00:27:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-01 00:27:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2018-10-01 00:27:30,526 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 90 [2018-10-01 00:27:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:30,527 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-10-01 00:27:30,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-01 00:27:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-10-01 00:27:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-01 00:27:30,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:30,527 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:30,528 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:30,528 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:30,528 INFO L82 PathProgramCache]: Analyzing trace with hash 526403900, now seen corresponding path program 37 times [2018-10-01 00:27:30,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:30,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:30,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:30,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:30,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:31,004 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:31,004 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-10-01 00:27:31,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:31,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:31,260 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:31,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-01 00:27:31,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-01 00:27:31,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-01 00:27:31,261 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:31,261 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 41 states. [2018-10-01 00:27:31,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:31,581 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-10-01 00:27:31,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-01 00:27:31,582 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 92 [2018-10-01 00:27:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:31,582 INFO L225 Difference]: With dead ends: 109 [2018-10-01 00:27:31,582 INFO L226 Difference]: Without dead ends: 95 [2018-10-01 00:27:31,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:27:31,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-01 00:27:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-10-01 00:27:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-01 00:27:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-10-01 00:27:31,588 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 92 [2018-10-01 00:27:31,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:31,588 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-10-01 00:27:31,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-01 00:27:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-10-01 00:27:31,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-01 00:27:31,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:31,589 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:31,589 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:31,589 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:31,589 INFO L82 PathProgramCache]: Analyzing trace with hash 674841144, now seen corresponding path program 38 times [2018-10-01 00:27:31,589 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:31,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:31,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:31,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:31,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:32,522 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:32,522 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-10-01 00:27:32,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:27:32,595 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:27:32,595 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:32,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:32,802 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:32,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-01 00:27:32,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-01 00:27:32,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-01 00:27:32,803 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:32,803 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 42 states. [2018-10-01 00:27:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:33,247 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-10-01 00:27:33,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-01 00:27:33,248 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 94 [2018-10-01 00:27:33,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:33,249 INFO L225 Difference]: With dead ends: 111 [2018-10-01 00:27:33,249 INFO L226 Difference]: Without dead ends: 97 [2018-10-01 00:27:33,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:27:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-01 00:27:33,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-10-01 00:27:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-01 00:27:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-10-01 00:27:33,254 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 94 [2018-10-01 00:27:33,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:33,255 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-10-01 00:27:33,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-01 00:27:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-10-01 00:27:33,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-01 00:27:33,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:33,256 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:33,256 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:33,256 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:33,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1589111860, now seen corresponding path program 39 times [2018-10-01 00:27:33,256 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:33,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:33,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:33,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:33,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1658 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:34,180 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:34,180 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-10-01 00:27:34,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:27:34,294 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-10-01 00:27:34,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:34,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1658 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:34,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:34,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-01 00:27:34,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-01 00:27:34,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-01 00:27:34,509 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:34,509 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 43 states. [2018-10-01 00:27:34,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:34,846 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-10-01 00:27:34,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-01 00:27:34,847 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 96 [2018-10-01 00:27:34,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:34,848 INFO L225 Difference]: With dead ends: 113 [2018-10-01 00:27:34,848 INFO L226 Difference]: Without dead ends: 99 [2018-10-01 00:27:34,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:27:34,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-01 00:27:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-10-01 00:27:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-01 00:27:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-10-01 00:27:34,853 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 96 [2018-10-01 00:27:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:34,853 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-10-01 00:27:34,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-01 00:27:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-10-01 00:27:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-01 00:27:34,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:34,854 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:34,855 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:34,855 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:34,855 INFO L82 PathProgramCache]: Analyzing trace with hash -265025744, now seen corresponding path program 40 times [2018-10-01 00:27:34,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:34,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:34,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:35,211 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:35,211 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:35,219 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:27:35,283 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:27:35,284 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:35,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:36,851 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:36,851 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-01 00:27:36,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-01 00:27:36,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-01 00:27:36,852 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:36,852 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 44 states. [2018-10-01 00:27:38,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:38,216 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-10-01 00:27:38,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-01 00:27:38,217 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 98 [2018-10-01 00:27:38,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:38,217 INFO L225 Difference]: With dead ends: 115 [2018-10-01 00:27:38,218 INFO L226 Difference]: Without dead ends: 101 [2018-10-01 00:27:38,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:27:38,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-01 00:27:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-10-01 00:27:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-01 00:27:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-10-01 00:27:38,223 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 98 [2018-10-01 00:27:38,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:38,223 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-10-01 00:27:38,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-01 00:27:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-10-01 00:27:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-01 00:27:38,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:38,224 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:38,224 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:38,224 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:38,224 INFO L82 PathProgramCache]: Analyzing trace with hash 320164652, now seen corresponding path program 41 times [2018-10-01 00:27:38,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:38,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:38,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:38,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:38,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:39,384 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:39,384 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:39,392 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:27:39,483 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2018-10-01 00:27:39,483 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:39,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:39,694 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:39,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-01 00:27:39,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-01 00:27:39,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-01 00:27:39,695 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:39,695 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 45 states. [2018-10-01 00:27:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:40,073 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-10-01 00:27:40,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-01 00:27:40,074 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 100 [2018-10-01 00:27:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:40,075 INFO L225 Difference]: With dead ends: 117 [2018-10-01 00:27:40,075 INFO L226 Difference]: Without dead ends: 103 [2018-10-01 00:27:40,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:27:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-01 00:27:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-10-01 00:27:40,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-01 00:27:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-10-01 00:27:40,080 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 100 [2018-10-01 00:27:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:40,081 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-10-01 00:27:40,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-01 00:27:40,081 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-10-01 00:27:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-01 00:27:40,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:40,082 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:40,082 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:40,082 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:40,082 INFO L82 PathProgramCache]: Analyzing trace with hash 47419432, now seen corresponding path program 42 times [2018-10-01 00:27:40,082 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:40,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:40,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1910 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:40,600 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:40,600 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:40,609 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:27:40,717 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2018-10-01 00:27:40,717 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:40,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1910 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:40,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:40,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-01 00:27:40,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-01 00:27:40,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-01 00:27:40,935 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:40,935 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 46 states. [2018-10-01 00:27:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:41,221 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-10-01 00:27:41,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-01 00:27:41,221 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 102 [2018-10-01 00:27:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:41,223 INFO L225 Difference]: With dead ends: 119 [2018-10-01 00:27:41,223 INFO L226 Difference]: Without dead ends: 105 [2018-10-01 00:27:41,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:27:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-01 00:27:41,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-10-01 00:27:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-01 00:27:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-10-01 00:27:41,229 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 102 [2018-10-01 00:27:41,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:41,229 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-10-01 00:27:41,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-01 00:27:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-10-01 00:27:41,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-01 00:27:41,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:41,230 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:41,231 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:41,231 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:41,231 INFO L82 PathProgramCache]: Analyzing trace with hash -67731932, now seen corresponding path program 43 times [2018-10-01 00:27:41,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:41,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:41,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:41,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:41,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:41,581 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:41,581 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:41,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:41,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:42,036 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:42,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-01 00:27:42,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-01 00:27:42,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-01 00:27:42,037 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:42,037 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2018-10-01 00:27:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:42,261 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-10-01 00:27:42,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-01 00:27:42,262 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2018-10-01 00:27:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:42,263 INFO L225 Difference]: With dead ends: 121 [2018-10-01 00:27:42,263 INFO L226 Difference]: Without dead ends: 107 [2018-10-01 00:27:42,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:27:42,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-01 00:27:42,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-10-01 00:27:42,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-01 00:27:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-10-01 00:27:42,269 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 104 [2018-10-01 00:27:42,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:42,270 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-10-01 00:27:42,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-01 00:27:42,270 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-10-01 00:27:42,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-01 00:27:42,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:42,270 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:42,271 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:42,271 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:42,271 INFO L82 PathProgramCache]: Analyzing trace with hash 940956960, now seen corresponding path program 44 times [2018-10-01 00:27:42,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:42,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:42,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:42,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:42,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:42,780 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:42,780 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:42,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:27:42,868 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:27:42,868 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:42,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:43,055 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:43,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-01 00:27:43,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-01 00:27:43,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-01 00:27:43,056 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:43,056 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 48 states. [2018-10-01 00:27:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:43,511 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-10-01 00:27:43,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-01 00:27:43,512 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 106 [2018-10-01 00:27:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:43,513 INFO L225 Difference]: With dead ends: 123 [2018-10-01 00:27:43,513 INFO L226 Difference]: Without dead ends: 109 [2018-10-01 00:27:43,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:27:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-01 00:27:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-01 00:27:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-01 00:27:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-10-01 00:27:43,517 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 106 [2018-10-01 00:27:43,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:43,518 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-10-01 00:27:43,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-01 00:27:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-10-01 00:27:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-01 00:27:43,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:43,519 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:43,519 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:43,519 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:43,519 INFO L82 PathProgramCache]: Analyzing trace with hash -371626724, now seen corresponding path program 45 times [2018-10-01 00:27:43,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:43,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:43,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:43,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:43,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:43,794 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:43,794 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:43,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:27:43,914 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-10-01 00:27:43,914 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:43,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:44,121 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:44,121 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-01 00:27:44,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-01 00:27:44,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-01 00:27:44,122 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:44,122 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 49 states. [2018-10-01 00:27:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:44,350 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-10-01 00:27:44,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-01 00:27:44,350 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 108 [2018-10-01 00:27:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:44,352 INFO L225 Difference]: With dead ends: 125 [2018-10-01 00:27:44,352 INFO L226 Difference]: Without dead ends: 111 [2018-10-01 00:27:44,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:27:44,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-01 00:27:44,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-10-01 00:27:44,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-01 00:27:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-10-01 00:27:44,357 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 108 [2018-10-01 00:27:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:44,358 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-10-01 00:27:44,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-01 00:27:44,358 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-10-01 00:27:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-01 00:27:44,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:44,359 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:44,359 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:44,359 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:44,359 INFO L82 PathProgramCache]: Analyzing trace with hash 955837976, now seen corresponding path program 46 times [2018-10-01 00:27:44,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:44,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:44,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:44,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:44,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:44,675 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:44,675 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:44,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:27:44,762 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:27:44,763 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:44,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:44,956 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:44,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-01 00:27:44,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-01 00:27:44,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-01 00:27:44,957 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:44,957 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 50 states. [2018-10-01 00:27:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:45,355 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-10-01 00:27:45,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-01 00:27:45,355 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 110 [2018-10-01 00:27:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:45,356 INFO L225 Difference]: With dead ends: 127 [2018-10-01 00:27:45,356 INFO L226 Difference]: Without dead ends: 113 [2018-10-01 00:27:45,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:27:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-01 00:27:45,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-10-01 00:27:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-01 00:27:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-10-01 00:27:45,362 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 110 [2018-10-01 00:27:45,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:45,363 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-10-01 00:27:45,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-01 00:27:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-10-01 00:27:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-01 00:27:45,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:45,363 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:45,364 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:45,364 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:45,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1044127764, now seen corresponding path program 47 times [2018-10-01 00:27:45,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:45,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:45,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:45,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:45,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2370 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:46,116 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:46,116 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:46,125 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:27:46,248 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-10-01 00:27:46,248 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:46,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2370 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:46,566 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:46,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-01 00:27:46,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-01 00:27:46,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-01 00:27:46,567 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:46,567 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 51 states. [2018-10-01 00:27:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:47,017 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-10-01 00:27:47,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-01 00:27:47,019 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 112 [2018-10-01 00:27:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:47,020 INFO L225 Difference]: With dead ends: 129 [2018-10-01 00:27:47,020 INFO L226 Difference]: Without dead ends: 115 [2018-10-01 00:27:47,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:27:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-01 00:27:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-10-01 00:27:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-01 00:27:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-10-01 00:27:47,026 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 112 [2018-10-01 00:27:47,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:47,026 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-10-01 00:27:47,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-01 00:27:47,026 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-10-01 00:27:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-01 00:27:47,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:47,027 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:47,027 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:47,027 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:47,027 INFO L82 PathProgramCache]: Analyzing trace with hash -8731888, now seen corresponding path program 48 times [2018-10-01 00:27:47,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:47,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:47,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:47,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2468 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:47,382 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:47,383 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:47,390 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:27:47,513 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2018-10-01 00:27:47,513 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:47,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2468 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:47,704 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:47,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-01 00:27:47,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-01 00:27:47,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-01 00:27:47,705 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:47,705 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 52 states. [2018-10-01 00:27:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:48,091 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-10-01 00:27:48,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-01 00:27:48,092 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 114 [2018-10-01 00:27:48,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:48,092 INFO L225 Difference]: With dead ends: 131 [2018-10-01 00:27:48,092 INFO L226 Difference]: Without dead ends: 117 [2018-10-01 00:27:48,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:27:48,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-01 00:27:48,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-10-01 00:27:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-01 00:27:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2018-10-01 00:27:48,099 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 114 [2018-10-01 00:27:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:48,099 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2018-10-01 00:27:48,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-01 00:27:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2018-10-01 00:27:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-01 00:27:48,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:48,100 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:48,100 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:48,100 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:48,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1805424396, now seen corresponding path program 49 times [2018-10-01 00:27:48,100 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:48,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:48,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:48,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:48,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:48,389 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:48,389 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:48,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:48,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:48,801 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:48,801 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-01 00:27:48,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-01 00:27:48,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-01 00:27:48,802 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:48,802 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 53 states. [2018-10-01 00:27:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:49,266 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-10-01 00:27:49,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-01 00:27:49,266 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 116 [2018-10-01 00:27:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:49,267 INFO L225 Difference]: With dead ends: 133 [2018-10-01 00:27:49,267 INFO L226 Difference]: Without dead ends: 119 [2018-10-01 00:27:49,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:27:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-01 00:27:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-10-01 00:27:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-01 00:27:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-10-01 00:27:49,274 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 116 [2018-10-01 00:27:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:49,274 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-10-01 00:27:49,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-01 00:27:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-10-01 00:27:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-01 00:27:49,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:49,275 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:49,275 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:49,275 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:49,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1452891144, now seen corresponding path program 50 times [2018-10-01 00:27:49,275 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:49,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:49,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:49,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:49,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:49,584 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:49,584 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:49,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:27:49,668 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:27:49,669 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:49,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:50,924 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:50,925 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-01 00:27:50,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-01 00:27:50,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-01 00:27:50,926 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:50,926 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 54 states. [2018-10-01 00:27:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:51,644 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-10-01 00:27:51,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-01 00:27:51,644 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 118 [2018-10-01 00:27:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:51,645 INFO L225 Difference]: With dead ends: 135 [2018-10-01 00:27:51,645 INFO L226 Difference]: Without dead ends: 121 [2018-10-01 00:27:51,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:27:51,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-01 00:27:51,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-10-01 00:27:51,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-01 00:27:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2018-10-01 00:27:51,650 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 118 [2018-10-01 00:27:51,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:51,650 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-10-01 00:27:51,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-01 00:27:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2018-10-01 00:27:51,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-01 00:27:51,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:51,650 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:51,651 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:51,651 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:51,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1970852356, now seen corresponding path program 51 times [2018-10-01 00:27:51,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:51,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:51,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:51,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:51,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:51,937 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:51,937 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:51,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:27:52,090 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-10-01 00:27:52,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:52,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:52,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:52,469 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:52,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-01 00:27:52,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-01 00:27:52,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-01 00:27:52,470 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:52,470 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. Second operand 55 states. [2018-10-01 00:27:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:52,845 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-10-01 00:27:52,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-01 00:27:52,845 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 120 [2018-10-01 00:27:52,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:52,846 INFO L225 Difference]: With dead ends: 137 [2018-10-01 00:27:52,846 INFO L226 Difference]: Without dead ends: 123 [2018-10-01 00:27:52,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:27:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-01 00:27:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-10-01 00:27:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-01 00:27:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 125 transitions. [2018-10-01 00:27:52,852 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 125 transitions. Word has length 120 [2018-10-01 00:27:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:52,852 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 125 transitions. [2018-10-01 00:27:52,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-01 00:27:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-10-01 00:27:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-01 00:27:52,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:52,853 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:52,853 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:52,853 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:52,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1515370752, now seen corresponding path program 52 times [2018-10-01 00:27:52,854 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:52,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:52,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:52,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:52,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2880 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:53,248 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:53,248 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:53,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:27:53,332 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:27:53,332 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:53,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2880 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:53,569 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:53,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-01 00:27:53,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-01 00:27:53,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-01 00:27:53,570 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:53,570 INFO L87 Difference]: Start difference. First operand 123 states and 125 transitions. Second operand 56 states. [2018-10-01 00:27:54,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:54,060 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-10-01 00:27:54,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-01 00:27:54,060 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 122 [2018-10-01 00:27:54,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:54,061 INFO L225 Difference]: With dead ends: 139 [2018-10-01 00:27:54,061 INFO L226 Difference]: Without dead ends: 125 [2018-10-01 00:27:54,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:27:54,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-01 00:27:54,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-10-01 00:27:54,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-01 00:27:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2018-10-01 00:27:54,068 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 122 [2018-10-01 00:27:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:54,068 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2018-10-01 00:27:54,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-01 00:27:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2018-10-01 00:27:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-01 00:27:54,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:54,069 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:54,070 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:54,070 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:54,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1884213500, now seen corresponding path program 53 times [2018-10-01 00:27:54,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:54,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:54,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:54,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:54,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2988 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:54,678 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:54,678 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:54,685 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:27:54,812 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2018-10-01 00:27:54,813 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:54,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2988 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:55,128 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:55,128 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-01 00:27:55,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-01 00:27:55,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-01 00:27:55,129 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:55,129 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 57 states. [2018-10-01 00:27:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:55,623 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-10-01 00:27:55,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-01 00:27:55,623 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 124 [2018-10-01 00:27:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:55,624 INFO L225 Difference]: With dead ends: 141 [2018-10-01 00:27:55,624 INFO L226 Difference]: Without dead ends: 127 [2018-10-01 00:27:55,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:27:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-01 00:27:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-01 00:27:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-01 00:27:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2018-10-01 00:27:55,629 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 124 [2018-10-01 00:27:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:55,629 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-10-01 00:27:55,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-01 00:27:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2018-10-01 00:27:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-01 00:27:55,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:55,630 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:55,630 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:55,630 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash -140191240, now seen corresponding path program 54 times [2018-10-01 00:27:55,631 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:55,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:55,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:55,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:55,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3098 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:56,737 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:56,737 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:56,746 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:27:56,886 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 56 check-sat command(s) [2018-10-01 00:27:56,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:56,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3098 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:57,216 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:57,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-01 00:27:57,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-01 00:27:57,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-01 00:27:57,217 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:57,218 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand 58 states. [2018-10-01 00:27:57,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:57,803 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-10-01 00:27:57,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-01 00:27:57,803 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 126 [2018-10-01 00:27:57,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:57,804 INFO L225 Difference]: With dead ends: 143 [2018-10-01 00:27:57,804 INFO L226 Difference]: Without dead ends: 129 [2018-10-01 00:27:57,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:27:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-01 00:27:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-10-01 00:27:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-01 00:27:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2018-10-01 00:27:57,809 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 126 [2018-10-01 00:27:57,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:57,809 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2018-10-01 00:27:57,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-01 00:27:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2018-10-01 00:27:57,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-01 00:27:57,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:57,810 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:57,810 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:57,810 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:57,810 INFO L82 PathProgramCache]: Analyzing trace with hash 27038708, now seen corresponding path program 55 times [2018-10-01 00:27:57,810 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:57,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:57,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:57,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:57,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3210 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:58,159 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:58,159 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:58,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:58,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3210 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:58,480 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:58,480 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-01 00:27:58,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-01 00:27:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-01 00:27:58,481 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:58,481 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2018-10-01 00:27:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:58,979 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-10-01 00:27:58,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-01 00:27:58,979 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2018-10-01 00:27:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:58,980 INFO L225 Difference]: With dead ends: 145 [2018-10-01 00:27:58,980 INFO L226 Difference]: Without dead ends: 131 [2018-10-01 00:27:58,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:27:58,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-01 00:27:58,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-10-01 00:27:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-01 00:27:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-10-01 00:27:58,986 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 128 [2018-10-01 00:27:58,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:58,986 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-10-01 00:27:58,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-01 00:27:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-10-01 00:27:58,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-01 00:27:58,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:58,987 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:27:58,987 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:58,987 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:58,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1821228784, now seen corresponding path program 56 times [2018-10-01 00:27:58,987 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:58,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:58,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:58,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:58,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3324 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:59,512 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:59,512 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:59,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:27:59,600 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:27:59,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:59,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3324 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:27:59,813 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:59,813 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-01 00:27:59,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-01 00:27:59,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-01 00:27:59,814 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:59,814 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 60 states. [2018-10-01 00:28:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:00,354 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-10-01 00:28:00,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-01 00:28:00,354 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 130 [2018-10-01 00:28:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:00,355 INFO L225 Difference]: With dead ends: 147 [2018-10-01 00:28:00,355 INFO L226 Difference]: Without dead ends: 133 [2018-10-01 00:28:00,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:28:00,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-01 00:28:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-10-01 00:28:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-01 00:28:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-10-01 00:28:00,361 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 130 [2018-10-01 00:28:00,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:00,361 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-10-01 00:28:00,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-01 00:28:00,361 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-10-01 00:28:00,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-01 00:28:00,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:00,362 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:00,362 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:00,362 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:00,363 INFO L82 PathProgramCache]: Analyzing trace with hash -538961172, now seen corresponding path program 57 times [2018-10-01 00:28:00,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:00,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:00,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:00,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:00,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3440 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:00,678 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:00,678 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:00,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:28:00,838 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2018-10-01 00:28:00,838 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:00,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3440 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:01,058 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:01,058 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-01 00:28:01,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-01 00:28:01,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-01 00:28:01,059 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:01,059 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 61 states. [2018-10-01 00:28:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:01,589 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2018-10-01 00:28:01,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-01 00:28:01,590 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 132 [2018-10-01 00:28:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:01,590 INFO L225 Difference]: With dead ends: 149 [2018-10-01 00:28:01,590 INFO L226 Difference]: Without dead ends: 135 [2018-10-01 00:28:01,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:28:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-01 00:28:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-10-01 00:28:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-01 00:28:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2018-10-01 00:28:01,596 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 132 [2018-10-01 00:28:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:01,596 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-10-01 00:28:01,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-01 00:28:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-10-01 00:28:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-01 00:28:01,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:01,597 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:01,597 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:01,597 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:01,597 INFO L82 PathProgramCache]: Analyzing trace with hash -938776600, now seen corresponding path program 58 times [2018-10-01 00:28:01,597 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:01,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:01,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:01,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:01,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:01,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3558 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:01,916 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:01,916 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:01,924 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:28:02,006 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:28:02,006 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:02,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3558 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:02,352 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:02,353 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-01 00:28:02,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-01 00:28:02,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-01 00:28:02,354 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:02,354 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 62 states. [2018-10-01 00:28:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:02,933 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2018-10-01 00:28:02,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-01 00:28:02,934 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 134 [2018-10-01 00:28:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:02,934 INFO L225 Difference]: With dead ends: 151 [2018-10-01 00:28:02,934 INFO L226 Difference]: Without dead ends: 137 [2018-10-01 00:28:02,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:28:02,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-01 00:28:02,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-10-01 00:28:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-01 00:28:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2018-10-01 00:28:02,939 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 134 [2018-10-01 00:28:02,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:02,940 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2018-10-01 00:28:02,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-01 00:28:02,940 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2018-10-01 00:28:02,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-01 00:28:02,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:02,940 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:02,940 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:02,941 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:02,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1385653732, now seen corresponding path program 59 times [2018-10-01 00:28:02,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:02,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:02,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:02,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:02,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3678 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:03,275 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:03,275 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:03,283 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:28:03,430 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2018-10-01 00:28:03,430 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:03,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3678 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:03,826 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:03,827 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-01 00:28:03,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-01 00:28:03,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-01 00:28:03,828 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:03,828 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand 63 states. [2018-10-01 00:28:04,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:04,396 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-10-01 00:28:04,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-01 00:28:04,397 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 136 [2018-10-01 00:28:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:04,397 INFO L225 Difference]: With dead ends: 153 [2018-10-01 00:28:04,398 INFO L226 Difference]: Without dead ends: 139 [2018-10-01 00:28:04,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:28:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-01 00:28:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-10-01 00:28:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-01 00:28:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2018-10-01 00:28:04,403 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 136 [2018-10-01 00:28:04,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:04,403 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2018-10-01 00:28:04,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-01 00:28:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2018-10-01 00:28:04,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-01 00:28:04,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:04,404 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:04,404 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:04,404 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:04,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1780208864, now seen corresponding path program 60 times [2018-10-01 00:28:04,405 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:04,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:04,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:04,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:04,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:04,753 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:04,753 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:04,760 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:28:04,914 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) [2018-10-01 00:28:04,915 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:04,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:05,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:05,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-01 00:28:05,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-01 00:28:05,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-01 00:28:05,150 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:05,150 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand 64 states. [2018-10-01 00:28:05,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:05,737 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-10-01 00:28:05,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-01 00:28:05,738 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 138 [2018-10-01 00:28:05,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:05,738 INFO L225 Difference]: With dead ends: 155 [2018-10-01 00:28:05,739 INFO L226 Difference]: Without dead ends: 141 [2018-10-01 00:28:05,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:28:05,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-01 00:28:05,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-10-01 00:28:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-01 00:28:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2018-10-01 00:28:05,744 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 138 [2018-10-01 00:28:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:05,744 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2018-10-01 00:28:05,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-01 00:28:05,745 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2018-10-01 00:28:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-01 00:28:05,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:05,745 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:05,746 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:05,746 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:05,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1304398628, now seen corresponding path program 61 times [2018-10-01 00:28:05,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:05,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:05,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:05,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:05,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3924 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:06,101 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:06,101 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:06,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:06,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3924 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:07,130 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:07,130 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-01 00:28:07,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-01 00:28:07,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-01 00:28:07,131 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:07,132 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand 65 states. [2018-10-01 00:28:07,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:07,935 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-10-01 00:28:07,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-01 00:28:07,935 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 140 [2018-10-01 00:28:07,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:07,936 INFO L225 Difference]: With dead ends: 157 [2018-10-01 00:28:07,936 INFO L226 Difference]: Without dead ends: 143 [2018-10-01 00:28:07,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:28:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-01 00:28:07,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-10-01 00:28:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-01 00:28:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2018-10-01 00:28:07,941 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 140 [2018-10-01 00:28:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:07,941 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2018-10-01 00:28:07,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-01 00:28:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2018-10-01 00:28:07,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-01 00:28:07,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:07,942 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:07,942 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:07,942 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:07,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2084764200, now seen corresponding path program 62 times [2018-10-01 00:28:07,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:07,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:07,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:07,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:07,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:08,428 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:08,428 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:08,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:28:08,524 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:28:08,524 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:08,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:08,760 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:08,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-01 00:28:08,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-01 00:28:08,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-01 00:28:08,761 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:08,761 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 66 states. [2018-10-01 00:28:09,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:09,867 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2018-10-01 00:28:09,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-01 00:28:09,867 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 142 [2018-10-01 00:28:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:09,868 INFO L225 Difference]: With dead ends: 159 [2018-10-01 00:28:09,869 INFO L226 Difference]: Without dead ends: 145 [2018-10-01 00:28:09,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:28:09,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-01 00:28:09,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-10-01 00:28:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-01 00:28:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2018-10-01 00:28:09,874 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 142 [2018-10-01 00:28:09,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:09,874 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-10-01 00:28:09,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-01 00:28:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2018-10-01 00:28:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-01 00:28:09,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:09,875 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:09,875 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:09,875 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:09,875 INFO L82 PathProgramCache]: Analyzing trace with hash -396802092, now seen corresponding path program 63 times [2018-10-01 00:28:09,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:09,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:09,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:09,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:09,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:10,264 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:10,264 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:10,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:28:10,449 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 65 check-sat command(s) [2018-10-01 00:28:10,449 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:10,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:10,697 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:10,697 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-01 00:28:10,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-01 00:28:10,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-01 00:28:10,698 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:10,698 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 67 states. [2018-10-01 00:28:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:11,352 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-10-01 00:28:11,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-01 00:28:11,352 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 144 [2018-10-01 00:28:11,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:11,353 INFO L225 Difference]: With dead ends: 161 [2018-10-01 00:28:11,353 INFO L226 Difference]: Without dead ends: 147 [2018-10-01 00:28:11,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:28:11,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-01 00:28:11,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-10-01 00:28:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-01 00:28:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2018-10-01 00:28:11,362 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 144 [2018-10-01 00:28:11,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:11,362 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2018-10-01 00:28:11,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-01 00:28:11,362 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2018-10-01 00:28:11,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-01 00:28:11,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:11,363 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:11,364 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:11,364 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:11,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1762854192, now seen corresponding path program 64 times [2018-10-01 00:28:11,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:11,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:11,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:11,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:11,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4308 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:11,764 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:11,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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:11,771 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:28:11,865 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:28:11,866 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:11,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4308 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:12,165 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:12,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-01 00:28:12,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-01 00:28:12,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-01 00:28:12,166 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:12,166 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 68 states. [2018-10-01 00:28:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:12,995 INFO L93 Difference]: Finished difference Result 163 states and 167 transitions. [2018-10-01 00:28:12,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-01 00:28:12,996 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 146 [2018-10-01 00:28:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:12,997 INFO L225 Difference]: With dead ends: 163 [2018-10-01 00:28:12,997 INFO L226 Difference]: Without dead ends: 149 [2018-10-01 00:28:12,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:28:12,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-01 00:28:13,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-10-01 00:28:13,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-01 00:28:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 151 transitions. [2018-10-01 00:28:13,004 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 151 transitions. Word has length 146 [2018-10-01 00:28:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:13,004 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 151 transitions. [2018-10-01 00:28:13,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-01 00:28:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 151 transitions. [2018-10-01 00:28:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-01 00:28:13,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:13,006 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:13,006 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:13,006 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:13,006 INFO L82 PathProgramCache]: Analyzing trace with hash -278929716, now seen corresponding path program 65 times [2018-10-01 00:28:13,006 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:13,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:13,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:13,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:13,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4440 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:13,511 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:13,511 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:13,518 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:28:13,694 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 67 check-sat command(s) [2018-10-01 00:28:13,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:13,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4440 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:13,961 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:13,961 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-01 00:28:13,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-01 00:28:13,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-01 00:28:13,962 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:13,962 INFO L87 Difference]: Start difference. First operand 149 states and 151 transitions. Second operand 69 states. [2018-10-01 00:28:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:14,429 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2018-10-01 00:28:14,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-01 00:28:14,430 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 148 [2018-10-01 00:28:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:14,431 INFO L225 Difference]: With dead ends: 165 [2018-10-01 00:28:14,431 INFO L226 Difference]: Without dead ends: 151 [2018-10-01 00:28:14,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:28:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-01 00:28:14,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-10-01 00:28:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-01 00:28:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2018-10-01 00:28:14,438 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 153 transitions. Word has length 148 [2018-10-01 00:28:14,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:14,438 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 153 transitions. [2018-10-01 00:28:14,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-01 00:28:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2018-10-01 00:28:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-01 00:28:14,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:14,439 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:14,439 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:14,439 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:14,440 INFO L82 PathProgramCache]: Analyzing trace with hash -156650552, now seen corresponding path program 66 times [2018-10-01 00:28:14,440 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:14,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:14,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:14,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:14,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4574 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:14,861 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:14,861 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:14,869 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:28:15,047 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 68 check-sat command(s) [2018-10-01 00:28:15,047 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:15,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4574 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:15,331 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:15,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-01 00:28:15,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-01 00:28:15,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-01 00:28:15,332 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:15,332 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. Second operand 70 states. [2018-10-01 00:28:15,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:15,969 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2018-10-01 00:28:15,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-01 00:28:15,969 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 150 [2018-10-01 00:28:15,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:15,970 INFO L225 Difference]: With dead ends: 167 [2018-10-01 00:28:15,970 INFO L226 Difference]: Without dead ends: 153 [2018-10-01 00:28:15,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:28:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-01 00:28:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-10-01 00:28:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-01 00:28:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 155 transitions. [2018-10-01 00:28:15,975 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 155 transitions. Word has length 150 [2018-10-01 00:28:15,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:15,975 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 155 transitions. [2018-10-01 00:28:15,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-01 00:28:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 155 transitions. [2018-10-01 00:28:15,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-01 00:28:15,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:15,976 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:15,976 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:15,976 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:15,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1389509060, now seen corresponding path program 67 times [2018-10-01 00:28:15,977 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:15,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:15,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:15,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:15,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4710 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:16,377 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:16,377 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:16,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:16,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:16,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4710 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:16,742 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:16,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-01 00:28:16,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-01 00:28:16,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-01 00:28:16,743 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:16,743 INFO L87 Difference]: Start difference. First operand 153 states and 155 transitions. Second operand 71 states. [2018-10-01 00:28:17,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:17,409 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2018-10-01 00:28:17,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-01 00:28:17,409 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 152 [2018-10-01 00:28:17,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:17,410 INFO L225 Difference]: With dead ends: 169 [2018-10-01 00:28:17,410 INFO L226 Difference]: Without dead ends: 155 [2018-10-01 00:28:17,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:28:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-01 00:28:17,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-10-01 00:28:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-01 00:28:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 157 transitions. [2018-10-01 00:28:17,416 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 157 transitions. Word has length 152 [2018-10-01 00:28:17,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:17,416 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 157 transitions. [2018-10-01 00:28:17,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-01 00:28:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 157 transitions. [2018-10-01 00:28:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-01 00:28:17,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:17,417 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:17,417 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:17,417 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:17,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1190211776, now seen corresponding path program 68 times [2018-10-01 00:28:17,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:17,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:17,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:17,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:17,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4848 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:18,122 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:18,122 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:18,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:28:18,223 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:28:18,224 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:18,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4848 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:18,758 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:18,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-01 00:28:18,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-01 00:28:18,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-01 00:28:18,760 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:18,760 INFO L87 Difference]: Start difference. First operand 155 states and 157 transitions. Second operand 72 states. [2018-10-01 00:28:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:19,345 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2018-10-01 00:28:19,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-01 00:28:19,346 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 154 [2018-10-01 00:28:19,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:19,347 INFO L225 Difference]: With dead ends: 171 [2018-10-01 00:28:19,347 INFO L226 Difference]: Without dead ends: 157 [2018-10-01 00:28:19,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:28:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-01 00:28:19,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-10-01 00:28:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-01 00:28:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2018-10-01 00:28:19,352 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 154 [2018-10-01 00:28:19,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:19,352 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2018-10-01 00:28:19,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-01 00:28:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2018-10-01 00:28:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-01 00:28:19,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:19,353 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:19,353 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:19,353 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:19,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1355917124, now seen corresponding path program 69 times [2018-10-01 00:28:19,354 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:19,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:19,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:19,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:19,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4988 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:19,756 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:19,756 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:19,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:28:19,964 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 71 check-sat command(s) [2018-10-01 00:28:19,965 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:19,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4988 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:20,221 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:20,221 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-01 00:28:20,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-01 00:28:20,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-01 00:28:20,222 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:20,222 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 73 states. [2018-10-01 00:28:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:20,793 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions. [2018-10-01 00:28:20,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-01 00:28:20,794 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 156 [2018-10-01 00:28:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:20,795 INFO L225 Difference]: With dead ends: 173 [2018-10-01 00:28:20,795 INFO L226 Difference]: Without dead ends: 159 [2018-10-01 00:28:20,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:28:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-01 00:28:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-10-01 00:28:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-01 00:28:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 161 transitions. [2018-10-01 00:28:20,801 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 161 transitions. Word has length 156 [2018-10-01 00:28:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:20,801 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 161 transitions. [2018-10-01 00:28:20,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-01 00:28:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 161 transitions. [2018-10-01 00:28:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-01 00:28:20,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:20,802 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:20,802 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:20,802 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:20,802 INFO L82 PathProgramCache]: Analyzing trace with hash -54431304, now seen corresponding path program 70 times [2018-10-01 00:28:20,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:20,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:20,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:20,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:20,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:21,243 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:21,243 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:21,250 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:28:21,353 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:28:21,353 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:21,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:21,653 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:21,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-01 00:28:21,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-01 00:28:21,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-01 00:28:21,654 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:21,655 INFO L87 Difference]: Start difference. First operand 159 states and 161 transitions. Second operand 74 states. [2018-10-01 00:28:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:22,343 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2018-10-01 00:28:22,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-01 00:28:22,343 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 158 [2018-10-01 00:28:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:22,344 INFO L225 Difference]: With dead ends: 175 [2018-10-01 00:28:22,345 INFO L226 Difference]: Without dead ends: 161 [2018-10-01 00:28:22,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:28:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-01 00:28:22,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-10-01 00:28:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-01 00:28:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2018-10-01 00:28:22,351 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 158 [2018-10-01 00:28:22,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:22,352 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2018-10-01 00:28:22,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-01 00:28:22,352 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2018-10-01 00:28:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-01 00:28:22,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:22,353 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:22,353 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:22,353 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash 837958580, now seen corresponding path program 71 times [2018-10-01 00:28:22,354 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:22,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:22,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5274 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:23,001 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:23,001 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:23,010 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:28:23,205 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 73 check-sat command(s) [2018-10-01 00:28:23,206 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:23,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5274 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:23,523 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:23,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-01 00:28:23,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-01 00:28:23,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-01 00:28:23,524 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:23,524 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 75 states. [2018-10-01 00:28:24,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:24,232 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2018-10-01 00:28:24,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-01 00:28:24,233 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 160 [2018-10-01 00:28:24,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:24,234 INFO L225 Difference]: With dead ends: 177 [2018-10-01 00:28:24,234 INFO L226 Difference]: Without dead ends: 163 [2018-10-01 00:28:24,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:28:24,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-01 00:28:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-10-01 00:28:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-01 00:28:24,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 165 transitions. [2018-10-01 00:28:24,244 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 165 transitions. Word has length 160 [2018-10-01 00:28:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:24,244 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 165 transitions. [2018-10-01 00:28:24,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-01 00:28:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 165 transitions. [2018-10-01 00:28:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-01 00:28:24,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:24,245 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:24,245 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:24,246 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:24,246 INFO L82 PathProgramCache]: Analyzing trace with hash -568822096, now seen corresponding path program 72 times [2018-10-01 00:28:24,246 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:24,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:24,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:24,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:24,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5420 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:24,707 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:24,708 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:24,714 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:28:24,929 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 74 check-sat command(s) [2018-10-01 00:28:24,930 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:24,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5420 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:25,204 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:25,204 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-01 00:28:25,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-01 00:28:25,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-01 00:28:25,206 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:25,206 INFO L87 Difference]: Start difference. First operand 163 states and 165 transitions. Second operand 76 states. [2018-10-01 00:28:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:25,638 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2018-10-01 00:28:25,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-01 00:28:25,639 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 162 [2018-10-01 00:28:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:25,639 INFO L225 Difference]: With dead ends: 179 [2018-10-01 00:28:25,639 INFO L226 Difference]: Without dead ends: 165 [2018-10-01 00:28:25,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:28:25,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-01 00:28:25,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-10-01 00:28:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-01 00:28:25,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 167 transitions. [2018-10-01 00:28:25,645 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 167 transitions. Word has length 162 [2018-10-01 00:28:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:25,645 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 167 transitions. [2018-10-01 00:28:25,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-01 00:28:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 167 transitions. [2018-10-01 00:28:25,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-01 00:28:25,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:25,646 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:25,646 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:25,646 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:25,646 INFO L82 PathProgramCache]: Analyzing trace with hash 429646508, now seen corresponding path program 73 times [2018-10-01 00:28:25,646 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:25,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:25,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:25,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:25,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:26,202 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:26,202 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:26,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:26,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:26,686 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:26,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-01 00:28:26,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-01 00:28:26,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-01 00:28:26,688 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:26,688 INFO L87 Difference]: Start difference. First operand 165 states and 167 transitions. Second operand 77 states. [2018-10-01 00:28:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:27,460 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2018-10-01 00:28:27,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-01 00:28:27,460 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 164 [2018-10-01 00:28:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:27,461 INFO L225 Difference]: With dead ends: 181 [2018-10-01 00:28:27,461 INFO L226 Difference]: Without dead ends: 167 [2018-10-01 00:28:27,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:28:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-01 00:28:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-10-01 00:28:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-01 00:28:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2018-10-01 00:28:27,466 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 164 [2018-10-01 00:28:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:27,466 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2018-10-01 00:28:27,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-01 00:28:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2018-10-01 00:28:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-01 00:28:27,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:27,467 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:27,467 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:27,467 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:27,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2114699352, now seen corresponding path program 74 times [2018-10-01 00:28:27,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:27,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:27,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:27,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:27,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5718 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:28,156 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:28,156 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:28,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:28:28,270 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:28:28,271 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:28,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5718 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:28,548 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:28,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-01 00:28:28,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-01 00:28:28,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-01 00:28:28,549 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:28,549 INFO L87 Difference]: Start difference. First operand 167 states and 169 transitions. Second operand 78 states. [2018-10-01 00:28:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:29,155 INFO L93 Difference]: Finished difference Result 183 states and 187 transitions. [2018-10-01 00:28:29,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-01 00:28:29,156 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 166 [2018-10-01 00:28:29,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:29,156 INFO L225 Difference]: With dead ends: 183 [2018-10-01 00:28:29,156 INFO L226 Difference]: Without dead ends: 169 [2018-10-01 00:28:29,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:28:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-01 00:28:29,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-10-01 00:28:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-01 00:28:29,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 171 transitions. [2018-10-01 00:28:29,162 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 171 transitions. Word has length 166 [2018-10-01 00:28:29,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:29,162 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 171 transitions. [2018-10-01 00:28:29,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-01 00:28:29,162 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 171 transitions. [2018-10-01 00:28:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-01 00:28:29,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:29,163 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:29,163 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:29,163 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:29,163 INFO L82 PathProgramCache]: Analyzing trace with hash 900287908, now seen corresponding path program 75 times [2018-10-01 00:28:29,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:29,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:29,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:29,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:29,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5870 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:29,610 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:29,610 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:29,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:28:29,839 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 77 check-sat command(s) [2018-10-01 00:28:29,839 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:29,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5870 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:30,126 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:30,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-01 00:28:30,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-01 00:28:30,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-01 00:28:30,127 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:30,127 INFO L87 Difference]: Start difference. First operand 169 states and 171 transitions. Second operand 79 states. [2018-10-01 00:28:30,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:30,620 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2018-10-01 00:28:30,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-01 00:28:30,620 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 168 [2018-10-01 00:28:30,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:30,621 INFO L225 Difference]: With dead ends: 185 [2018-10-01 00:28:30,621 INFO L226 Difference]: Without dead ends: 171 [2018-10-01 00:28:30,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:28:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-01 00:28:30,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-10-01 00:28:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-01 00:28:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2018-10-01 00:28:30,628 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 168 [2018-10-01 00:28:30,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:30,629 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2018-10-01 00:28:30,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-01 00:28:30,629 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2018-10-01 00:28:30,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-01 00:28:30,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:30,630 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:30,630 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:30,630 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:30,630 INFO L82 PathProgramCache]: Analyzing trace with hash -799880032, now seen corresponding path program 76 times [2018-10-01 00:28:30,630 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:30,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:30,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:30,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:30,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6024 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:31,105 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:31,105 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:31,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:28:31,223 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:28:31,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:31,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6024 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:31,516 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:31,516 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-01 00:28:31,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-01 00:28:31,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-01 00:28:31,517 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:31,517 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 80 states. [2018-10-01 00:28:32,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:32,003 INFO L93 Difference]: Finished difference Result 187 states and 191 transitions. [2018-10-01 00:28:32,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-01 00:28:32,004 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 170 [2018-10-01 00:28:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:32,004 INFO L225 Difference]: With dead ends: 187 [2018-10-01 00:28:32,005 INFO L226 Difference]: Without dead ends: 173 [2018-10-01 00:28:32,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:28:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-01 00:28:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-10-01 00:28:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-01 00:28:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 175 transitions. [2018-10-01 00:28:32,011 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 175 transitions. Word has length 170 [2018-10-01 00:28:32,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:32,012 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 175 transitions. [2018-10-01 00:28:32,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-01 00:28:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2018-10-01 00:28:32,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-01 00:28:32,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:32,013 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:32,014 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:32,014 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:32,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1721269404, now seen corresponding path program 77 times [2018-10-01 00:28:32,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:32,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:32,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:32,538 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:32,538 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:32,554 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:28:32,774 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 79 check-sat command(s) [2018-10-01 00:28:32,774 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:32,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:33,240 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:33,241 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-10-01 00:28:33,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-01 00:28:33,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-01 00:28:33,242 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:33,242 INFO L87 Difference]: Start difference. First operand 173 states and 175 transitions. Second operand 81 states. [2018-10-01 00:28:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:33,698 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2018-10-01 00:28:33,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-01 00:28:33,699 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 172 [2018-10-01 00:28:33,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:33,699 INFO L225 Difference]: With dead ends: 189 [2018-10-01 00:28:33,699 INFO L226 Difference]: Without dead ends: 175 [2018-10-01 00:28:33,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:28:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-01 00:28:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-10-01 00:28:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-01 00:28:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2018-10-01 00:28:33,707 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 172 [2018-10-01 00:28:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:33,707 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2018-10-01 00:28:33,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-01 00:28:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2018-10-01 00:28:33,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-01 00:28:33,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:33,709 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:33,709 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:33,709 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:33,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2110644840, now seen corresponding path program 78 times [2018-10-01 00:28:33,709 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:33,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:33,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:33,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:33,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6338 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:34,188 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:34,188 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:34,196 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:28:34,428 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 80 check-sat command(s) [2018-10-01 00:28:34,428 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:34,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6338 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:34,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:34,720 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-01 00:28:34,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-01 00:28:34,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-01 00:28:34,721 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:34,721 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 82 states. [2018-10-01 00:28:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:35,342 INFO L93 Difference]: Finished difference Result 191 states and 195 transitions. [2018-10-01 00:28:35,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-01 00:28:35,342 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 174 [2018-10-01 00:28:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:35,343 INFO L225 Difference]: With dead ends: 191 [2018-10-01 00:28:35,343 INFO L226 Difference]: Without dead ends: 177 [2018-10-01 00:28:35,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:28:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-01 00:28:35,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-10-01 00:28:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-01 00:28:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 179 transitions. [2018-10-01 00:28:35,349 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 179 transitions. Word has length 174 [2018-10-01 00:28:35,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:35,350 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 179 transitions. [2018-10-01 00:28:35,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-01 00:28:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 179 transitions. [2018-10-01 00:28:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-01 00:28:35,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:35,350 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:35,351 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:35,351 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:35,351 INFO L82 PathProgramCache]: Analyzing trace with hash 501706644, now seen corresponding path program 79 times [2018-10-01 00:28:35,351 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:35,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:35,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:35,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:35,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:35,832 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:35,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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:35,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:35,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:36,248 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:36,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2018-10-01 00:28:36,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-01 00:28:36,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-01 00:28:36,250 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:36,250 INFO L87 Difference]: Start difference. First operand 177 states and 179 transitions. Second operand 83 states. [2018-10-01 00:28:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:36,913 INFO L93 Difference]: Finished difference Result 193 states and 197 transitions. [2018-10-01 00:28:36,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-01 00:28:36,914 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 176 [2018-10-01 00:28:36,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:36,914 INFO L225 Difference]: With dead ends: 193 [2018-10-01 00:28:36,915 INFO L226 Difference]: Without dead ends: 179 [2018-10-01 00:28:36,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:28:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-01 00:28:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-10-01 00:28:36,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-01 00:28:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 181 transitions. [2018-10-01 00:28:36,920 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 181 transitions. Word has length 176 [2018-10-01 00:28:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:36,921 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 181 transitions. [2018-10-01 00:28:36,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-01 00:28:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 181 transitions. [2018-10-01 00:28:36,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-01 00:28:36,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:36,921 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:36,922 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:36,922 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:36,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1584385392, now seen corresponding path program 80 times [2018-10-01 00:28:36,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:36,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:36,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:36,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:36,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6660 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:37,421 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:37,421 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:37,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:28:37,539 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:28:37,540 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:37,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6660 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:37,838 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:37,839 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-10-01 00:28:37,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-01 00:28:37,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-01 00:28:37,840 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:37,840 INFO L87 Difference]: Start difference. First operand 179 states and 181 transitions. Second operand 84 states. [2018-10-01 00:28:38,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:38,553 INFO L93 Difference]: Finished difference Result 195 states and 199 transitions. [2018-10-01 00:28:38,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-01 00:28:38,553 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 178 [2018-10-01 00:28:38,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:38,554 INFO L225 Difference]: With dead ends: 195 [2018-10-01 00:28:38,554 INFO L226 Difference]: Without dead ends: 181 [2018-10-01 00:28:38,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:28:38,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-01 00:28:38,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-10-01 00:28:38,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-01 00:28:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 183 transitions. [2018-10-01 00:28:38,560 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 183 transitions. Word has length 178 [2018-10-01 00:28:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:38,560 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 183 transitions. [2018-10-01 00:28:38,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-01 00:28:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 183 transitions. [2018-10-01 00:28:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-01 00:28:38,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:38,561 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:38,561 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:38,562 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:38,562 INFO L82 PathProgramCache]: Analyzing trace with hash -569104756, now seen corresponding path program 81 times [2018-10-01 00:28:38,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:38,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:38,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:38,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:38,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6824 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:39,070 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:39,070 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:39,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:28:39,334 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 83 check-sat command(s) [2018-10-01 00:28:39,334 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:39,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6824 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:39,737 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:39,737 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2018-10-01 00:28:39,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-01 00:28:39,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-01 00:28:39,738 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:39,738 INFO L87 Difference]: Start difference. First operand 181 states and 183 transitions. Second operand 85 states. [2018-10-01 00:28:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:40,182 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2018-10-01 00:28:40,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-01 00:28:40,182 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 180 [2018-10-01 00:28:40,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:40,183 INFO L225 Difference]: With dead ends: 197 [2018-10-01 00:28:40,183 INFO L226 Difference]: Without dead ends: 183 [2018-10-01 00:28:40,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:28:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-01 00:28:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-10-01 00:28:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-01 00:28:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 185 transitions. [2018-10-01 00:28:40,190 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 185 transitions. Word has length 180 [2018-10-01 00:28:40,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:40,191 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 185 transitions. [2018-10-01 00:28:40,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-01 00:28:40,191 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 185 transitions. [2018-10-01 00:28:40,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-01 00:28:40,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:40,192 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:40,192 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:40,192 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:40,192 INFO L82 PathProgramCache]: Analyzing trace with hash 158010248, now seen corresponding path program 82 times [2018-10-01 00:28:40,193 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:40,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:40,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:40,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:40,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6990 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:40,701 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:40,701 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:40,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:28:40,824 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:28:40,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:40,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6990 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:41,144 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:41,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2018-10-01 00:28:41,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-01 00:28:41,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-01 00:28:41,146 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:41,146 INFO L87 Difference]: Start difference. First operand 183 states and 185 transitions. Second operand 86 states. [2018-10-01 00:28:41,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:41,834 INFO L93 Difference]: Finished difference Result 199 states and 203 transitions. [2018-10-01 00:28:41,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-01 00:28:41,834 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 182 [2018-10-01 00:28:41,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:41,835 INFO L225 Difference]: With dead ends: 199 [2018-10-01 00:28:41,835 INFO L226 Difference]: Without dead ends: 185 [2018-10-01 00:28:41,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:28:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-01 00:28:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-10-01 00:28:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-01 00:28:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2018-10-01 00:28:41,841 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 182 [2018-10-01 00:28:41,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:41,841 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2018-10-01 00:28:41,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-01 00:28:41,842 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2018-10-01 00:28:41,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-01 00:28:41,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:41,843 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:41,843 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:41,843 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:41,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1164140156, now seen corresponding path program 83 times [2018-10-01 00:28:41,843 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:41,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:41,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:41,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:41,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7158 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:42,448 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:42,448 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:42,458 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:28:42,704 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 85 check-sat command(s) [2018-10-01 00:28:42,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:42,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7158 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:43,009 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:43,010 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2018-10-01 00:28:43,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-01 00:28:43,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-01 00:28:43,011 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:43,011 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 87 states. [2018-10-01 00:28:43,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:43,835 INFO L93 Difference]: Finished difference Result 201 states and 205 transitions. [2018-10-01 00:28:43,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-01 00:28:43,835 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 184 [2018-10-01 00:28:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:43,836 INFO L225 Difference]: With dead ends: 201 [2018-10-01 00:28:43,836 INFO L226 Difference]: Without dead ends: 187 [2018-10-01 00:28:43,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:28:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-01 00:28:43,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-10-01 00:28:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-01 00:28:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 189 transitions. [2018-10-01 00:28:43,844 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 189 transitions. Word has length 184 [2018-10-01 00:28:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:43,844 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 189 transitions. [2018-10-01 00:28:43,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-01 00:28:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 189 transitions. [2018-10-01 00:28:43,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-01 00:28:43,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:43,845 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:43,846 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:43,846 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:43,846 INFO L82 PathProgramCache]: Analyzing trace with hash -440358784, now seen corresponding path program 84 times [2018-10-01 00:28:43,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:43,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:43,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:43,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:43,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7328 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:44,371 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:44,371 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:44,379 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:28:44,629 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 86 check-sat command(s) [2018-10-01 00:28:44,629 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:44,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7328 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:44,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:44,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2018-10-01 00:28:44,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-01 00:28:44,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-01 00:28:44,945 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:44,945 INFO L87 Difference]: Start difference. First operand 187 states and 189 transitions. Second operand 88 states. [2018-10-01 00:28:45,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:45,419 INFO L93 Difference]: Finished difference Result 203 states and 207 transitions. [2018-10-01 00:28:45,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-01 00:28:45,419 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 186 [2018-10-01 00:28:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:45,420 INFO L225 Difference]: With dead ends: 203 [2018-10-01 00:28:45,420 INFO L226 Difference]: Without dead ends: 189 [2018-10-01 00:28:45,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:28:45,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-01 00:28:45,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-10-01 00:28:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-01 00:28:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 191 transitions. [2018-10-01 00:28:45,428 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 191 transitions. Word has length 186 [2018-10-01 00:28:45,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:45,428 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 191 transitions. [2018-10-01 00:28:45,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-01 00:28:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 191 transitions. [2018-10-01 00:28:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-01 00:28:45,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:45,429 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:45,430 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:45,430 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:45,430 INFO L82 PathProgramCache]: Analyzing trace with hash -671162244, now seen corresponding path program 85 times [2018-10-01 00:28:45,430 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:45,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:45,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:45,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:45,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7500 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:46,037 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:46,037 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:46,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:46,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7500 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:46,480 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:46,481 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2018-10-01 00:28:46,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-01 00:28:46,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-01 00:28:46,482 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:46,482 INFO L87 Difference]: Start difference. First operand 189 states and 191 transitions. Second operand 89 states. [2018-10-01 00:28:46,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:46,931 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2018-10-01 00:28:46,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-01 00:28:46,931 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 188 [2018-10-01 00:28:46,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:46,932 INFO L225 Difference]: With dead ends: 205 [2018-10-01 00:28:46,932 INFO L226 Difference]: Without dead ends: 191 [2018-10-01 00:28:46,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:28:46,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-01 00:28:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-10-01 00:28:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-01 00:28:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 193 transitions. [2018-10-01 00:28:46,941 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 193 transitions. Word has length 188 [2018-10-01 00:28:46,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:46,941 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 193 transitions. [2018-10-01 00:28:46,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-01 00:28:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 193 transitions. [2018-10-01 00:28:46,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-01 00:28:46,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:46,942 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:46,942 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:46,943 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:46,943 INFO L82 PathProgramCache]: Analyzing trace with hash 865012088, now seen corresponding path program 86 times [2018-10-01 00:28:46,943 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:46,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:46,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:46,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:46,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7674 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:47,480 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:47,480 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:47,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:28:47,610 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:28:47,610 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:47,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7674 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:47,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:47,935 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2018-10-01 00:28:47,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-01 00:28:47,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-01 00:28:47,936 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:47,936 INFO L87 Difference]: Start difference. First operand 191 states and 193 transitions. Second operand 90 states. [2018-10-01 00:28:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:48,816 INFO L93 Difference]: Finished difference Result 207 states and 211 transitions. [2018-10-01 00:28:48,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-01 00:28:48,816 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 190 [2018-10-01 00:28:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:48,817 INFO L225 Difference]: With dead ends: 207 [2018-10-01 00:28:48,817 INFO L226 Difference]: Without dead ends: 193 [2018-10-01 00:28:48,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:28:48,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-01 00:28:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-10-01 00:28:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-01 00:28:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 195 transitions. [2018-10-01 00:28:48,823 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 195 transitions. Word has length 190 [2018-10-01 00:28:48,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:48,823 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 195 transitions. [2018-10-01 00:28:48,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-01 00:28:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 195 transitions. [2018-10-01 00:28:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-01 00:28:48,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:48,824 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:48,824 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:48,824 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash -340204684, now seen corresponding path program 87 times [2018-10-01 00:28:48,825 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:48,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:48,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:48,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:48,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7850 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:49,383 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:49,383 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:49,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:28:49,677 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 89 check-sat command(s) [2018-10-01 00:28:49,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:49,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7850 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:50,007 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:50,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2018-10-01 00:28:50,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-01 00:28:50,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-01 00:28:50,008 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:50,008 INFO L87 Difference]: Start difference. First operand 193 states and 195 transitions. Second operand 91 states. [2018-10-01 00:28:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:50,491 INFO L93 Difference]: Finished difference Result 209 states and 213 transitions. [2018-10-01 00:28:50,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-01 00:28:50,491 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 192 [2018-10-01 00:28:50,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:50,492 INFO L225 Difference]: With dead ends: 209 [2018-10-01 00:28:50,492 INFO L226 Difference]: Without dead ends: 195 [2018-10-01 00:28:50,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:28:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-01 00:28:50,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-10-01 00:28:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-01 00:28:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2018-10-01 00:28:50,498 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 192 [2018-10-01 00:28:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:50,498 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2018-10-01 00:28:50,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-01 00:28:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2018-10-01 00:28:50,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-01 00:28:50,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:50,499 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:50,499 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:50,499 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:50,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1087647344, now seen corresponding path program 88 times [2018-10-01 00:28:50,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:50,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:50,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:50,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:50,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 8028 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:51,104 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:51,104 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:51,111 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:28:51,233 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:28:51,233 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:51,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8028 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:51,559 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:51,559 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2018-10-01 00:28:51,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-01 00:28:51,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-01 00:28:51,560 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:51,560 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand 92 states. [2018-10-01 00:28:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:52,399 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2018-10-01 00:28:52,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-01 00:28:52,400 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 194 [2018-10-01 00:28:52,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:52,400 INFO L225 Difference]: With dead ends: 211 [2018-10-01 00:28:52,400 INFO L226 Difference]: Without dead ends: 197 [2018-10-01 00:28:52,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:28:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-01 00:28:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-10-01 00:28:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-01 00:28:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 199 transitions. [2018-10-01 00:28:52,406 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 199 transitions. Word has length 194 [2018-10-01 00:28:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:52,406 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 199 transitions. [2018-10-01 00:28:52,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-01 00:28:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 199 transitions. [2018-10-01 00:28:52,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-01 00:28:52,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:52,408 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:52,408 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:52,408 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:52,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1136088468, now seen corresponding path program 89 times [2018-10-01 00:28:52,408 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:52,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:52,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:52,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:52,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:53,006 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:53,006 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:53,015 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:28:53,286 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 91 check-sat command(s) [2018-10-01 00:28:53,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:53,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:53,888 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:53,888 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2018-10-01 00:28:53,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-01 00:28:53,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-01 00:28:53,889 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:53,889 INFO L87 Difference]: Start difference. First operand 197 states and 199 transitions. Second operand 93 states. [2018-10-01 00:28:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:54,662 INFO L93 Difference]: Finished difference Result 213 states and 217 transitions. [2018-10-01 00:28:54,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-01 00:28:54,662 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 196 [2018-10-01 00:28:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:54,663 INFO L225 Difference]: With dead ends: 213 [2018-10-01 00:28:54,663 INFO L226 Difference]: Without dead ends: 199 [2018-10-01 00:28:54,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:28:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-01 00:28:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-10-01 00:28:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-01 00:28:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2018-10-01 00:28:54,669 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 196 [2018-10-01 00:28:54,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:54,669 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2018-10-01 00:28:54,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-01 00:28:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2018-10-01 00:28:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-01 00:28:54,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:54,670 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:54,670 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:54,670 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:54,670 INFO L82 PathProgramCache]: Analyzing trace with hash 747509608, now seen corresponding path program 90 times [2018-10-01 00:28:54,671 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:54,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:54,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:54,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:54,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:55,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8390 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:55,261 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:55,261 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:55,268 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:28:55,549 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 92 check-sat command(s) [2018-10-01 00:28:55,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:55,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8390 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:55,880 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:55,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2018-10-01 00:28:55,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-01 00:28:55,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-01 00:28:55,881 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:55,881 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 94 states. [2018-10-01 00:28:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:56,615 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2018-10-01 00:28:56,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-01 00:28:56,615 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 198 [2018-10-01 00:28:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:56,616 INFO L225 Difference]: With dead ends: 215 [2018-10-01 00:28:56,616 INFO L226 Difference]: Without dead ends: 201 [2018-10-01 00:28:56,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:28:56,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-01 00:28:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-10-01 00:28:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-01 00:28:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 203 transitions. [2018-10-01 00:28:56,622 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 203 transitions. Word has length 198 [2018-10-01 00:28:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:56,622 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 203 transitions. [2018-10-01 00:28:56,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-01 00:28:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 203 transitions. [2018-10-01 00:28:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-01 00:28:56,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:56,623 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:56,623 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:56,623 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:56,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1590938268, now seen corresponding path program 91 times [2018-10-01 00:28:56,623 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:56,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:56,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:56,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:56,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8574 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:57,217 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:57,217 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:57,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:57,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8574 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:57,740 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:57,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2018-10-01 00:28:57,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-01 00:28:57,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-01 00:28:57,741 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:57,741 INFO L87 Difference]: Start difference. First operand 201 states and 203 transitions. Second operand 95 states. [2018-10-01 00:28:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:58,639 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2018-10-01 00:28:58,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-01 00:28:58,639 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 200 [2018-10-01 00:28:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:58,640 INFO L225 Difference]: With dead ends: 217 [2018-10-01 00:28:58,640 INFO L226 Difference]: Without dead ends: 203 [2018-10-01 00:28:58,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:28:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-01 00:28:58,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-10-01 00:28:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-01 00:28:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2018-10-01 00:28:58,646 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 200 [2018-10-01 00:28:58,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:58,646 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2018-10-01 00:28:58,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-01 00:28:58,646 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2018-10-01 00:28:58,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-01 00:28:58,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:58,647 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:28:58,647 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:58,647 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:58,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1723516000, now seen corresponding path program 92 times [2018-10-01 00:28:58,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:58,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:58,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:58,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:58,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8760 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:59,341 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:59,341 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:59,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:28:59,480 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:28:59,480 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:59,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8760 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:28:59,826 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:59,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2018-10-01 00:28:59,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-01 00:28:59,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-01 00:28:59,828 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:59,828 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 96 states. [2018-10-01 00:29:00,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:00,694 INFO L93 Difference]: Finished difference Result 219 states and 223 transitions. [2018-10-01 00:29:00,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-01 00:29:00,694 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 202 [2018-10-01 00:29:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:00,695 INFO L225 Difference]: With dead ends: 219 [2018-10-01 00:29:00,695 INFO L226 Difference]: Without dead ends: 205 [2018-10-01 00:29:00,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:29:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-01 00:29:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-10-01 00:29:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-01 00:29:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 207 transitions. [2018-10-01 00:29:00,704 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 207 transitions. Word has length 202 [2018-10-01 00:29:00,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:00,704 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 207 transitions. [2018-10-01 00:29:00,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-01 00:29:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 207 transitions. [2018-10-01 00:29:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-01 00:29:00,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:00,706 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:00,706 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:00,706 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:00,706 INFO L82 PathProgramCache]: Analyzing trace with hash 48333916, now seen corresponding path program 93 times [2018-10-01 00:29:00,706 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:00,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:00,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:00,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:00,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8948 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:01,342 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:01,342 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:01,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:29:01,665 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 95 check-sat command(s) [2018-10-01 00:29:01,665 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:01,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8948 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:02,009 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:02,010 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2018-10-01 00:29:02,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-01 00:29:02,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-01 00:29:02,011 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:02,011 INFO L87 Difference]: Start difference. First operand 205 states and 207 transitions. Second operand 97 states. [2018-10-01 00:29:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:02,555 INFO L93 Difference]: Finished difference Result 221 states and 225 transitions. [2018-10-01 00:29:02,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-01 00:29:02,555 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 204 [2018-10-01 00:29:02,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:02,556 INFO L225 Difference]: With dead ends: 221 [2018-10-01 00:29:02,556 INFO L226 Difference]: Without dead ends: 207 [2018-10-01 00:29:02,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:29:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-01 00:29:02,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-10-01 00:29:02,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-01 00:29:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 209 transitions. [2018-10-01 00:29:02,563 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 209 transitions. Word has length 204 [2018-10-01 00:29:02,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:02,564 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 209 transitions. [2018-10-01 00:29:02,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-01 00:29:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 209 transitions. [2018-10-01 00:29:02,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-01 00:29:02,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:02,565 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:02,565 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:02,565 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:02,566 INFO L82 PathProgramCache]: Analyzing trace with hash 811087192, now seen corresponding path program 94 times [2018-10-01 00:29:02,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:02,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:02,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:02,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:02,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9138 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:03,201 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:03,201 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:03,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:29:03,337 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:29:03,338 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:03,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9138 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:03,726 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:03,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2018-10-01 00:29:03,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-01 00:29:03,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-01 00:29:03,728 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:03,728 INFO L87 Difference]: Start difference. First operand 207 states and 209 transitions. Second operand 98 states. [2018-10-01 00:29:04,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:04,679 INFO L93 Difference]: Finished difference Result 223 states and 227 transitions. [2018-10-01 00:29:04,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-01 00:29:04,679 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 206 [2018-10-01 00:29:04,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:04,680 INFO L225 Difference]: With dead ends: 223 [2018-10-01 00:29:04,680 INFO L226 Difference]: Without dead ends: 209 [2018-10-01 00:29:04,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:29:04,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-01 00:29:04,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-10-01 00:29:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-01 00:29:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 211 transitions. [2018-10-01 00:29:04,686 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 211 transitions. Word has length 206 [2018-10-01 00:29:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:04,686 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 211 transitions. [2018-10-01 00:29:04,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-01 00:29:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 211 transitions. [2018-10-01 00:29:04,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-01 00:29:04,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:04,687 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:04,688 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:04,688 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:04,688 INFO L82 PathProgramCache]: Analyzing trace with hash -622422188, now seen corresponding path program 95 times [2018-10-01 00:29:04,688 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:04,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:04,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:04,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:04,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9330 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:05,340 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:05,340 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:05,347 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:29:05,657 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 97 check-sat command(s) [2018-10-01 00:29:05,657 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:05,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9330 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:06,020 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:06,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2018-10-01 00:29:06,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-01 00:29:06,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-01 00:29:06,021 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:06,021 INFO L87 Difference]: Start difference. First operand 209 states and 211 transitions. Second operand 99 states. [2018-10-01 00:29:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:06,594 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2018-10-01 00:29:06,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-01 00:29:06,594 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 208 [2018-10-01 00:29:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:06,595 INFO L225 Difference]: With dead ends: 225 [2018-10-01 00:29:06,595 INFO L226 Difference]: Without dead ends: 211 [2018-10-01 00:29:06,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:29:06,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-01 00:29:06,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-10-01 00:29:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-01 00:29:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 213 transitions. [2018-10-01 00:29:06,601 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 213 transitions. Word has length 208 [2018-10-01 00:29:06,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:06,602 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 213 transitions. [2018-10-01 00:29:06,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-01 00:29:06,602 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 213 transitions. [2018-10-01 00:29:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-01 00:29:06,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:06,603 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:06,603 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:06,603 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:06,603 INFO L82 PathProgramCache]: Analyzing trace with hash 459565648, now seen corresponding path program 96 times [2018-10-01 00:29:06,603 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:06,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:06,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:06,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:06,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9524 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:07,249 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:07,250 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:07,257 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:29:07,570 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 98 check-sat command(s) [2018-10-01 00:29:07,571 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:07,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:07,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9524 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:07,938 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:07,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2018-10-01 00:29:07,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-01 00:29:07,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-01 00:29:07,940 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:07,940 INFO L87 Difference]: Start difference. First operand 211 states and 213 transitions. Second operand 100 states. [2018-10-01 00:29:08,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:08,862 INFO L93 Difference]: Finished difference Result 227 states and 231 transitions. [2018-10-01 00:29:08,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-01 00:29:08,863 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 210 [2018-10-01 00:29:08,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:08,864 INFO L225 Difference]: With dead ends: 227 [2018-10-01 00:29:08,864 INFO L226 Difference]: Without dead ends: 213 [2018-10-01 00:29:08,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:29:08,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-01 00:29:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-10-01 00:29:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-01 00:29:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2018-10-01 00:29:08,870 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 210 [2018-10-01 00:29:08,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:08,870 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2018-10-01 00:29:08,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-01 00:29:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2018-10-01 00:29:08,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-01 00:29:08,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:08,872 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:08,872 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:08,872 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:08,872 INFO L82 PathProgramCache]: Analyzing trace with hash 867790412, now seen corresponding path program 97 times [2018-10-01 00:29:08,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:08,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:08,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:08,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:08,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:09,540 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:09,540 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:09,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:09,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:10,070 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:10,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2018-10-01 00:29:10,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-01 00:29:10,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-01 00:29:10,072 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:10,072 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 101 states. [2018-10-01 00:29:10,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:10,701 INFO L93 Difference]: Finished difference Result 229 states and 233 transitions. [2018-10-01 00:29:10,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-01 00:29:10,701 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 212 [2018-10-01 00:29:10,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:10,702 INFO L225 Difference]: With dead ends: 229 [2018-10-01 00:29:10,702 INFO L226 Difference]: Without dead ends: 215 [2018-10-01 00:29:10,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:29:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-01 00:29:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-10-01 00:29:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-01 00:29:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 217 transitions. [2018-10-01 00:29:10,712 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 217 transitions. Word has length 212 [2018-10-01 00:29:10,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:10,712 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 217 transitions. [2018-10-01 00:29:10,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-01 00:29:10,712 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 217 transitions. [2018-10-01 00:29:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-01 00:29:10,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:10,713 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:10,713 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:10,713 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:10,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1965202616, now seen corresponding path program 98 times [2018-10-01 00:29:10,714 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:10,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:10,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:10,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:10,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9918 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:11,372 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:11,372 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:11,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:29:11,527 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:29:11,527 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:11,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9918 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:11,912 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:11,912 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2018-10-01 00:29:11,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-01 00:29:11,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-01 00:29:11,914 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:11,914 INFO L87 Difference]: Start difference. First operand 215 states and 217 transitions. Second operand 102 states. [2018-10-01 00:29:12,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:12,832 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2018-10-01 00:29:12,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-01 00:29:12,832 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 214 [2018-10-01 00:29:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:12,834 INFO L225 Difference]: With dead ends: 231 [2018-10-01 00:29:12,834 INFO L226 Difference]: Without dead ends: 217 [2018-10-01 00:29:12,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:29:12,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-01 00:29:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-10-01 00:29:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-01 00:29:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2018-10-01 00:29:12,843 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 214 [2018-10-01 00:29:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:12,843 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2018-10-01 00:29:12,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-01 00:29:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2018-10-01 00:29:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-01 00:29:12,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:12,844 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:12,845 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:12,845 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:12,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1462236860, now seen corresponding path program 99 times [2018-10-01 00:29:12,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:12,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:12,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:12,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:12,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10118 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:13,585 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:13,585 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:13,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:29:13,967 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 101 check-sat command(s) [2018-10-01 00:29:13,968 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:13,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10118 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:14,497 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:14,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2018-10-01 00:29:14,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-01 00:29:14,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-01 00:29:14,498 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:14,499 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 103 states. [2018-10-01 00:29:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:15,086 INFO L93 Difference]: Finished difference Result 233 states and 237 transitions. [2018-10-01 00:29:15,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-01 00:29:15,087 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 216 [2018-10-01 00:29:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:15,088 INFO L225 Difference]: With dead ends: 233 [2018-10-01 00:29:15,088 INFO L226 Difference]: Without dead ends: 219 [2018-10-01 00:29:15,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:29:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-01 00:29:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-10-01 00:29:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-01 00:29:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 221 transitions. [2018-10-01 00:29:15,096 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 221 transitions. Word has length 216 [2018-10-01 00:29:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:15,096 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 221 transitions. [2018-10-01 00:29:15,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-01 00:29:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 221 transitions. [2018-10-01 00:29:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-01 00:29:15,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:15,098 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:15,098 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:15,098 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:15,098 INFO L82 PathProgramCache]: Analyzing trace with hash 851517504, now seen corresponding path program 100 times [2018-10-01 00:29:15,098 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:15,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:15,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:15,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:15,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10320 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:15,824 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:15,824 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:15,831 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:29:15,972 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:29:15,973 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:15,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10320 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:16,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:16,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2018-10-01 00:29:16,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-01 00:29:16,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-01 00:29:16,460 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:16,461 INFO L87 Difference]: Start difference. First operand 219 states and 221 transitions. Second operand 104 states. [2018-10-01 00:29:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:17,441 INFO L93 Difference]: Finished difference Result 235 states and 239 transitions. [2018-10-01 00:29:17,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-01 00:29:17,441 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 218 [2018-10-01 00:29:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:17,441 INFO L225 Difference]: With dead ends: 235 [2018-10-01 00:29:17,441 INFO L226 Difference]: Without dead ends: 221 [2018-10-01 00:29:17,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:29:17,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-01 00:29:17,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-10-01 00:29:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-01 00:29:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 223 transitions. [2018-10-01 00:29:17,447 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 223 transitions. Word has length 218 [2018-10-01 00:29:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:17,448 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 223 transitions. [2018-10-01 00:29:17,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-01 00:29:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 223 transitions. [2018-10-01 00:29:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-01 00:29:17,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:17,449 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:17,449 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:17,449 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:17,449 INFO L82 PathProgramCache]: Analyzing trace with hash -423598020, now seen corresponding path program 101 times [2018-10-01 00:29:17,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:17,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:17,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:17,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:17,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10524 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:18,190 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:18,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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:18,197 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:29:18,539 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 103 check-sat command(s) [2018-10-01 00:29:18,539 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:18,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10524 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:18,923 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:18,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 104 [2018-10-01 00:29:18,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-01 00:29:18,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-01 00:29:18,925 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:18,925 INFO L87 Difference]: Start difference. First operand 221 states and 223 transitions. Second operand 105 states. [2018-10-01 00:29:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:20,028 INFO L93 Difference]: Finished difference Result 237 states and 241 transitions. [2018-10-01 00:29:20,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-01 00:29:20,028 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 220 [2018-10-01 00:29:20,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:20,029 INFO L225 Difference]: With dead ends: 237 [2018-10-01 00:29:20,029 INFO L226 Difference]: Without dead ends: 223 [2018-10-01 00:29:20,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:29:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-01 00:29:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-10-01 00:29:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-01 00:29:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 225 transitions. [2018-10-01 00:29:20,036 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 225 transitions. Word has length 220 [2018-10-01 00:29:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:20,036 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 225 transitions. [2018-10-01 00:29:20,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-01 00:29:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 225 transitions. [2018-10-01 00:29:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-01 00:29:20,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:20,037 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:20,037 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:20,037 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1743937224, now seen corresponding path program 102 times [2018-10-01 00:29:20,037 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:20,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:20,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:20,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:20,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10730 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:20,751 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:20,751 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:20,758 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:29:21,106 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 104 check-sat command(s) [2018-10-01 00:29:21,106 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:21,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10730 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:21,519 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:21,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2018-10-01 00:29:21,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-01 00:29:21,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-01 00:29:21,520 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:21,520 INFO L87 Difference]: Start difference. First operand 223 states and 225 transitions. Second operand 106 states. [2018-10-01 00:29:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:22,542 INFO L93 Difference]: Finished difference Result 239 states and 243 transitions. [2018-10-01 00:29:22,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-01 00:29:22,543 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 222 [2018-10-01 00:29:22,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:22,543 INFO L225 Difference]: With dead ends: 239 [2018-10-01 00:29:22,543 INFO L226 Difference]: Without dead ends: 225 [2018-10-01 00:29:22,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:29:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-01 00:29:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-10-01 00:29:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-01 00:29:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 227 transitions. [2018-10-01 00:29:22,552 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 227 transitions. Word has length 222 [2018-10-01 00:29:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:22,552 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 227 transitions. [2018-10-01 00:29:22,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-01 00:29:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 227 transitions. [2018-10-01 00:29:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-01 00:29:22,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:22,553 INFO L375 BasicCegarLoop]: trace histogram [105, 104, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:22,553 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:22,554 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash 720407348, now seen corresponding path program 103 times [2018-10-01 00:29:22,554 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:22,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:22,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:22,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:22,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:23,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10938 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:23,339 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:23,339 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:23,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:23,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10938 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:23,924 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:23,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 106 [2018-10-01 00:29:23,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-01 00:29:23,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-01 00:29:23,926 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:23,926 INFO L87 Difference]: Start difference. First operand 225 states and 227 transitions. Second operand 107 states. [2018-10-01 00:29:24,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:24,879 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2018-10-01 00:29:24,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-01 00:29:24,879 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 224 [2018-10-01 00:29:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:24,880 INFO L225 Difference]: With dead ends: 241 [2018-10-01 00:29:24,880 INFO L226 Difference]: Without dead ends: 227 [2018-10-01 00:29:24,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:29:24,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-01 00:29:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-10-01 00:29:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-01 00:29:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2018-10-01 00:29:24,888 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 224 [2018-10-01 00:29:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:24,889 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2018-10-01 00:29:24,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-01 00:29:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2018-10-01 00:29:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-01 00:29:24,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:24,890 INFO L375 BasicCegarLoop]: trace histogram [106, 105, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:24,890 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:24,890 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:24,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1866406352, now seen corresponding path program 104 times [2018-10-01 00:29:24,890 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:24,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:24,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:24,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:24,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 11148 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:25,597 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:25,597 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:25,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:29:25,757 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:29:25,757 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:25,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 11148 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:26,141 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:26,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2018-10-01 00:29:26,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-01 00:29:26,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-01 00:29:26,143 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:26,143 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 108 states. [2018-10-01 00:29:26,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:26,848 INFO L93 Difference]: Finished difference Result 243 states and 247 transitions. [2018-10-01 00:29:26,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-01 00:29:26,848 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 226 [2018-10-01 00:29:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:26,849 INFO L225 Difference]: With dead ends: 243 [2018-10-01 00:29:26,849 INFO L226 Difference]: Without dead ends: 229 [2018-10-01 00:29:26,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:29:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-01 00:29:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-10-01 00:29:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-01 00:29:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 231 transitions. [2018-10-01 00:29:26,855 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 231 transitions. Word has length 226 [2018-10-01 00:29:26,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:26,855 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 231 transitions. [2018-10-01 00:29:26,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-01 00:29:26,855 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 231 transitions. [2018-10-01 00:29:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-01 00:29:26,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:26,856 INFO L375 BasicCegarLoop]: trace histogram [107, 106, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:26,856 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:26,856 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:26,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1008307668, now seen corresponding path program 105 times [2018-10-01 00:29:26,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:26,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:26,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:26,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:26,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 11360 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:27,604 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:27,605 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:27,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:29:28,005 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 107 check-sat command(s) [2018-10-01 00:29:28,005 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:28,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 11360 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:28,400 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:28,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 108 [2018-10-01 00:29:28,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-01 00:29:28,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-01 00:29:28,402 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:28,402 INFO L87 Difference]: Start difference. First operand 229 states and 231 transitions. Second operand 109 states. [2018-10-01 00:29:29,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:29,125 INFO L93 Difference]: Finished difference Result 245 states and 249 transitions. [2018-10-01 00:29:29,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-01 00:29:29,125 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 228 [2018-10-01 00:29:29,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:29,126 INFO L225 Difference]: With dead ends: 245 [2018-10-01 00:29:29,126 INFO L226 Difference]: Without dead ends: 231 [2018-10-01 00:29:29,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:29:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-01 00:29:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-10-01 00:29:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-01 00:29:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2018-10-01 00:29:29,132 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 228 [2018-10-01 00:29:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:29,132 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2018-10-01 00:29:29,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-01 00:29:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2018-10-01 00:29:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-01 00:29:29,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:29,133 INFO L375 BasicCegarLoop]: trace histogram [108, 107, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:29,133 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:29,133 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:29,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1009193176, now seen corresponding path program 106 times [2018-10-01 00:29:29,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:29,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:29,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 11574 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:30,039 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:30,039 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:30,047 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:29:30,194 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:29:30,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:30,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 11574 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:30,611 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:30,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2018-10-01 00:29:30,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-01 00:29:30,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-01 00:29:30,613 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:30,613 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 110 states. [2018-10-01 00:29:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:31,605 INFO L93 Difference]: Finished difference Result 247 states and 251 transitions. [2018-10-01 00:29:31,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-01 00:29:31,605 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 230 [2018-10-01 00:29:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:31,606 INFO L225 Difference]: With dead ends: 247 [2018-10-01 00:29:31,606 INFO L226 Difference]: Without dead ends: 233 [2018-10-01 00:29:31,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:29:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-01 00:29:31,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-10-01 00:29:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-01 00:29:31,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 235 transitions. [2018-10-01 00:29:31,612 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 235 transitions. Word has length 230 [2018-10-01 00:29:31,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:31,612 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 235 transitions. [2018-10-01 00:29:31,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-01 00:29:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 235 transitions. [2018-10-01 00:29:31,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-01 00:29:31,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:31,613 INFO L375 BasicCegarLoop]: trace histogram [109, 108, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:31,613 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:31,613 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:31,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1860166364, now seen corresponding path program 107 times [2018-10-01 00:29:31,614 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:31,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:31,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:31,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:31,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11790 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:32,344 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:32,344 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:32,352 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:29:32,735 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 109 check-sat command(s) [2018-10-01 00:29:32,735 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:32,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 11790 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:33,131 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:33,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 110 [2018-10-01 00:29:33,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-01 00:29:33,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-01 00:29:33,133 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:33,133 INFO L87 Difference]: Start difference. First operand 233 states and 235 transitions. Second operand 111 states. [2018-10-01 00:29:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:34,406 INFO L93 Difference]: Finished difference Result 249 states and 253 transitions. [2018-10-01 00:29:34,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-01 00:29:34,406 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 232 [2018-10-01 00:29:34,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:34,407 INFO L225 Difference]: With dead ends: 249 [2018-10-01 00:29:34,407 INFO L226 Difference]: Without dead ends: 235 [2018-10-01 00:29:34,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:29:34,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-01 00:29:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-01 00:29:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-01 00:29:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 237 transitions. [2018-10-01 00:29:34,413 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 237 transitions. Word has length 232 [2018-10-01 00:29:34,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:34,413 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 237 transitions. [2018-10-01 00:29:34,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-01 00:29:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 237 transitions. [2018-10-01 00:29:34,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-01 00:29:34,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:34,414 INFO L375 BasicCegarLoop]: trace histogram [110, 109, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:34,415 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:34,415 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash 693353504, now seen corresponding path program 108 times [2018-10-01 00:29:34,415 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:34,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:34,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:34,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:34,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12008 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:35,255 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:35,255 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:35,262 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:29:35,677 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 110 check-sat command(s) [2018-10-01 00:29:35,678 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:35,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12008 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:36,090 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:36,090 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2018-10-01 00:29:36,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-01 00:29:36,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-01 00:29:36,092 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:36,092 INFO L87 Difference]: Start difference. First operand 235 states and 237 transitions. Second operand 112 states. [2018-10-01 00:29:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:37,104 INFO L93 Difference]: Finished difference Result 251 states and 255 transitions. [2018-10-01 00:29:37,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-01 00:29:37,105 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 234 [2018-10-01 00:29:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:37,105 INFO L225 Difference]: With dead ends: 251 [2018-10-01 00:29:37,105 INFO L226 Difference]: Without dead ends: 237 [2018-10-01 00:29:37,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:29:37,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-01 00:29:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-01 00:29:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-01 00:29:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 239 transitions. [2018-10-01 00:29:37,112 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 239 transitions. Word has length 234 [2018-10-01 00:29:37,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:37,112 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 239 transitions. [2018-10-01 00:29:37,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-01 00:29:37,112 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 239 transitions. [2018-10-01 00:29:37,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-01 00:29:37,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:37,113 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:37,113 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:37,113 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:37,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2095346660, now seen corresponding path program 109 times [2018-10-01 00:29:37,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:37,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:37,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:37,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:37,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 12228 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:37,895 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:37,895 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:37,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:38,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12228 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:38,472 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:38,473 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 112 [2018-10-01 00:29:38,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-01 00:29:38,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-01 00:29:38,474 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:38,475 INFO L87 Difference]: Start difference. First operand 237 states and 239 transitions. Second operand 113 states. [2018-10-01 00:29:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:39,367 INFO L93 Difference]: Finished difference Result 253 states and 257 transitions. [2018-10-01 00:29:39,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-01 00:29:39,367 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 236 [2018-10-01 00:29:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:39,368 INFO L225 Difference]: With dead ends: 253 [2018-10-01 00:29:39,368 INFO L226 Difference]: Without dead ends: 239 [2018-10-01 00:29:39,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:29:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-01 00:29:39,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-01 00:29:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-01 00:29:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 241 transitions. [2018-10-01 00:29:39,377 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 241 transitions. Word has length 236 [2018-10-01 00:29:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:39,378 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 241 transitions. [2018-10-01 00:29:39,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-01 00:29:39,378 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 241 transitions. [2018-10-01 00:29:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-01 00:29:39,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:39,379 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:39,379 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:39,379 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1976611560, now seen corresponding path program 110 times [2018-10-01 00:29:39,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:39,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:39,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:39,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:39,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:40,351 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:40,351 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:40,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:29:40,512 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:29:40,512 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:40,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:40,953 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:40,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2018-10-01 00:29:40,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-01 00:29:40,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-01 00:29:40,955 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:40,955 INFO L87 Difference]: Start difference. First operand 239 states and 241 transitions. Second operand 114 states. [2018-10-01 00:29:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:42,161 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2018-10-01 00:29:42,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-01 00:29:42,161 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 238 [2018-10-01 00:29:42,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:42,162 INFO L225 Difference]: With dead ends: 255 [2018-10-01 00:29:42,162 INFO L226 Difference]: Without dead ends: 241 [2018-10-01 00:29:42,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:29:42,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-01 00:29:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-10-01 00:29:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-01 00:29:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2018-10-01 00:29:42,169 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 238 [2018-10-01 00:29:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:42,169 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2018-10-01 00:29:42,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-01 00:29:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2018-10-01 00:29:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-01 00:29:42,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:42,170 INFO L375 BasicCegarLoop]: trace histogram [113, 112, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:42,170 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:42,170 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:42,171 INFO L82 PathProgramCache]: Analyzing trace with hash 458669844, now seen corresponding path program 111 times [2018-10-01 00:29:42,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:42,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:42,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:42,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:42,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12674 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:42,933 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:42,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 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:42,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:29:43,370 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 113 check-sat command(s) [2018-10-01 00:29:43,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:43,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:43,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12674 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:43,799 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:43,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114] total 114 [2018-10-01 00:29:43,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-01 00:29:43,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-01 00:29:43,800 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:43,800 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 115 states. [2018-10-01 00:29:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:45,166 INFO L93 Difference]: Finished difference Result 257 states and 261 transitions. [2018-10-01 00:29:45,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-01 00:29:45,166 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 240 [2018-10-01 00:29:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:45,167 INFO L225 Difference]: With dead ends: 257 [2018-10-01 00:29:45,167 INFO L226 Difference]: Without dead ends: 243 [2018-10-01 00:29:45,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:29:45,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-01 00:29:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-10-01 00:29:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-01 00:29:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 245 transitions. [2018-10-01 00:29:45,173 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 245 transitions. Word has length 240 [2018-10-01 00:29:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:45,174 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 245 transitions. [2018-10-01 00:29:45,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-01 00:29:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 245 transitions. [2018-10-01 00:29:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-01 00:29:45,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:45,175 INFO L375 BasicCegarLoop]: trace histogram [114, 113, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:45,175 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:45,175 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:45,175 INFO L82 PathProgramCache]: Analyzing trace with hash 6922768, now seen corresponding path program 112 times [2018-10-01 00:29:45,175 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:45,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:45,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:45,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:45,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12900 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:45,946 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:45,946 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:45,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:29:46,109 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:29:46,109 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:46,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12900 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:46,690 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:46,691 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 115 [2018-10-01 00:29:46,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-01 00:29:46,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-01 00:29:46,693 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:46,693 INFO L87 Difference]: Start difference. First operand 243 states and 245 transitions. Second operand 116 states. [2018-10-01 00:29:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:47,850 INFO L93 Difference]: Finished difference Result 259 states and 263 transitions. [2018-10-01 00:29:47,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-01 00:29:47,850 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 242 [2018-10-01 00:29:47,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:47,851 INFO L225 Difference]: With dead ends: 259 [2018-10-01 00:29:47,851 INFO L226 Difference]: Without dead ends: 245 [2018-10-01 00:29:47,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:29:47,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-01 00:29:47,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-10-01 00:29:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-01 00:29:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2018-10-01 00:29:47,858 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 242 [2018-10-01 00:29:47,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:47,858 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2018-10-01 00:29:47,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-01 00:29:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2018-10-01 00:29:47,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-01 00:29:47,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:47,859 INFO L375 BasicCegarLoop]: trace histogram [115, 114, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:47,859 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:47,859 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:47,859 INFO L82 PathProgramCache]: Analyzing trace with hash -330320372, now seen corresponding path program 113 times [2018-10-01 00:29:47,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:47,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:47,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:47,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:47,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 13128 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:48,632 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:48,632 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:48,639 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:29:49,059 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 115 check-sat command(s) [2018-10-01 00:29:49,059 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:49,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 13128 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:49,490 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:49,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 116 [2018-10-01 00:29:49,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-01 00:29:49,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-01 00:29:49,491 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:49,491 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 117 states. [2018-10-01 00:29:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:50,919 INFO L93 Difference]: Finished difference Result 261 states and 265 transitions. [2018-10-01 00:29:50,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-01 00:29:50,919 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 244 [2018-10-01 00:29:50,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:50,920 INFO L225 Difference]: With dead ends: 261 [2018-10-01 00:29:50,920 INFO L226 Difference]: Without dead ends: 247 [2018-10-01 00:29:50,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:29:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-01 00:29:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-10-01 00:29:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-01 00:29:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 249 transitions. [2018-10-01 00:29:50,926 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 249 transitions. Word has length 244 [2018-10-01 00:29:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:50,926 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 249 transitions. [2018-10-01 00:29:50,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-01 00:29:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 249 transitions. [2018-10-01 00:29:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-01 00:29:50,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:50,927 INFO L375 BasicCegarLoop]: trace histogram [116, 115, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:50,927 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:50,927 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:50,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1996536584, now seen corresponding path program 114 times [2018-10-01 00:29:50,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:50,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:50,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:50,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:50,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 13358 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:51,735 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:51,735 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:51,742 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:29:52,160 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 116 check-sat command(s) [2018-10-01 00:29:52,160 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:52,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 13358 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:52,591 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:52,591 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 117 [2018-10-01 00:29:52,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-01 00:29:52,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-01 00:29:52,592 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:52,593 INFO L87 Difference]: Start difference. First operand 247 states and 249 transitions. Second operand 118 states. [2018-10-01 00:29:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:53,868 INFO L93 Difference]: Finished difference Result 263 states and 267 transitions. [2018-10-01 00:29:53,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-10-01 00:29:53,868 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 246 [2018-10-01 00:29:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:53,869 INFO L225 Difference]: With dead ends: 263 [2018-10-01 00:29:53,869 INFO L226 Difference]: Without dead ends: 249 [2018-10-01 00:29:53,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:29:53,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-01 00:29:53,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-10-01 00:29:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-01 00:29:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 251 transitions. [2018-10-01 00:29:53,875 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 251 transitions. Word has length 246 [2018-10-01 00:29:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:53,875 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 251 transitions. [2018-10-01 00:29:53,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-01 00:29:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 251 transitions. [2018-10-01 00:29:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-01 00:29:53,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:53,876 INFO L375 BasicCegarLoop]: trace histogram [117, 116, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:53,876 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:53,876 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:53,876 INFO L82 PathProgramCache]: Analyzing trace with hash 428110084, now seen corresponding path program 115 times [2018-10-01 00:29:53,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:53,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:53,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 13590 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:54,687 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:54,687 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:54,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:54,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 13590 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:55,473 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:55,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118] total 118 [2018-10-01 00:29:55,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-01 00:29:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-01 00:29:55,475 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:55,475 INFO L87 Difference]: Start difference. First operand 249 states and 251 transitions. Second operand 119 states. [2018-10-01 00:29:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:56,632 INFO L93 Difference]: Finished difference Result 265 states and 269 transitions. [2018-10-01 00:29:56,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-01 00:29:56,633 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 248 [2018-10-01 00:29:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:56,633 INFO L225 Difference]: With dead ends: 265 [2018-10-01 00:29:56,633 INFO L226 Difference]: Without dead ends: 251 [2018-10-01 00:29:56,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:29:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-01 00:29:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-10-01 00:29:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-01 00:29:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 253 transitions. [2018-10-01 00:29:56,640 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 253 transitions. Word has length 248 [2018-10-01 00:29:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:56,640 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 253 transitions. [2018-10-01 00:29:56,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-01 00:29:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 253 transitions. [2018-10-01 00:29:56,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-01 00:29:56,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:56,641 INFO L375 BasicCegarLoop]: trace histogram [118, 117, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:56,641 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:56,641 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:56,641 INFO L82 PathProgramCache]: Analyzing trace with hash 703764480, now seen corresponding path program 116 times [2018-10-01 00:29:56,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:56,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:56,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:56,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:56,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 13824 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:57,457 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:57,457 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:57,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:29:57,625 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:29:57,625 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:57,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:58,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13824 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:58,064 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:58,065 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 119 [2018-10-01 00:29:58,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-01 00:29:58,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-01 00:29:58,066 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:58,066 INFO L87 Difference]: Start difference. First operand 251 states and 253 transitions. Second operand 120 states. [2018-10-01 00:29:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:58,903 INFO L93 Difference]: Finished difference Result 267 states and 271 transitions. [2018-10-01 00:29:58,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-01 00:29:58,904 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 250 [2018-10-01 00:29:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:58,904 INFO L225 Difference]: With dead ends: 267 [2018-10-01 00:29:58,904 INFO L226 Difference]: Without dead ends: 253 [2018-10-01 00:29:58,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:29:58,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-01 00:29:58,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-10-01 00:29:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-01 00:29:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 255 transitions. [2018-10-01 00:29:58,911 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 255 transitions. Word has length 250 [2018-10-01 00:29:58,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:58,911 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 255 transitions. [2018-10-01 00:29:58,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-01 00:29:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 255 transitions. [2018-10-01 00:29:58,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-01 00:29:58,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:58,912 INFO L375 BasicCegarLoop]: trace histogram [119, 118, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:29:58,912 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:58,912 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:58,912 INFO L82 PathProgramCache]: Analyzing trace with hash -680333316, now seen corresponding path program 117 times [2018-10-01 00:29:58,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:58,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:58,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:58,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:58,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 14060 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:29:59,775 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:59,775 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:59,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:30:00,260 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 119 check-sat command(s) [2018-10-01 00:30:00,260 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:00,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 14060 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:00,764 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:00,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120] total 120 [2018-10-01 00:30:00,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-01 00:30:00,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-01 00:30:00,766 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:00,766 INFO L87 Difference]: Start difference. First operand 253 states and 255 transitions. Second operand 121 states. [2018-10-01 00:30:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:01,959 INFO L93 Difference]: Finished difference Result 269 states and 273 transitions. [2018-10-01 00:30:01,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-01 00:30:01,959 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 252 [2018-10-01 00:30:01,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:01,959 INFO L225 Difference]: With dead ends: 269 [2018-10-01 00:30:01,960 INFO L226 Difference]: Without dead ends: 255 [2018-10-01 00:30:01,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:30:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-01 00:30:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-10-01 00:30:01,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-01 00:30:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2018-10-01 00:30:01,966 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 252 [2018-10-01 00:30:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:01,966 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2018-10-01 00:30:01,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-01 00:30:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2018-10-01 00:30:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-01 00:30:01,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:01,967 INFO L375 BasicCegarLoop]: trace histogram [120, 119, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:01,967 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:01,967 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:01,968 INFO L82 PathProgramCache]: Analyzing trace with hash 641546488, now seen corresponding path program 118 times [2018-10-01 00:30:01,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:01,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:01,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:01,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:01,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 14298 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:02,859 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:02,859 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:02,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:30:03,035 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:30:03,035 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:03,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:03,463 INFO L134 CoverageAnalysis]: Checked inductivity of 14298 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:03,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:03,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 121 [2018-10-01 00:30:03,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-01 00:30:03,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-01 00:30:03,485 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:03,485 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 122 states. [2018-10-01 00:30:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:04,916 INFO L93 Difference]: Finished difference Result 271 states and 275 transitions. [2018-10-01 00:30:04,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-01 00:30:04,916 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 254 [2018-10-01 00:30:04,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:04,917 INFO L225 Difference]: With dead ends: 271 [2018-10-01 00:30:04,917 INFO L226 Difference]: Without dead ends: 257 [2018-10-01 00:30:04,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:30:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-01 00:30:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-10-01 00:30:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-01 00:30:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 259 transitions. [2018-10-01 00:30:04,927 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 259 transitions. Word has length 254 [2018-10-01 00:30:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:04,927 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 259 transitions. [2018-10-01 00:30:04,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-01 00:30:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 259 transitions. [2018-10-01 00:30:04,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-01 00:30:04,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:04,928 INFO L375 BasicCegarLoop]: trace histogram [121, 120, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:04,929 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:04,929 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:04,929 INFO L82 PathProgramCache]: Analyzing trace with hash -342281484, now seen corresponding path program 119 times [2018-10-01 00:30:04,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:04,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:04,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:04,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:04,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 14538 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:06,030 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:06,030 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:06,039 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:30:06,499 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 121 check-sat command(s) [2018-10-01 00:30:06,499 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:06,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14538 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:07,231 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:07,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122, 122] total 122 [2018-10-01 00:30:07,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-01 00:30:07,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-01 00:30:07,233 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:07,233 INFO L87 Difference]: Start difference. First operand 257 states and 259 transitions. Second operand 123 states. [2018-10-01 00:30:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:08,658 INFO L93 Difference]: Finished difference Result 273 states and 277 transitions. [2018-10-01 00:30:08,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-01 00:30:08,658 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 256 [2018-10-01 00:30:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:08,658 INFO L225 Difference]: With dead ends: 273 [2018-10-01 00:30:08,659 INFO L226 Difference]: Without dead ends: 259 [2018-10-01 00:30:08,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:30:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-01 00:30:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-10-01 00:30:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-01 00:30:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2018-10-01 00:30:08,665 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 256 [2018-10-01 00:30:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:08,666 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2018-10-01 00:30:08,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-01 00:30:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2018-10-01 00:30:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-01 00:30:08,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:08,667 INFO L375 BasicCegarLoop]: trace histogram [122, 121, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:08,667 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:08,667 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:08,667 INFO L82 PathProgramCache]: Analyzing trace with hash -908157456, now seen corresponding path program 120 times [2018-10-01 00:30:08,667 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:08,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:08,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:08,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:08,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 14780 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:09,544 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:09,544 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:09,551 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:30:10,010 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 122 check-sat command(s) [2018-10-01 00:30:10,010 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:10,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 14780 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:10,662 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:10,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123] total 123 [2018-10-01 00:30:10,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-01 00:30:10,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-01 00:30:10,664 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:10,664 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 124 states. [2018-10-01 00:30:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:11,749 INFO L93 Difference]: Finished difference Result 275 states and 279 transitions. [2018-10-01 00:30:11,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-10-01 00:30:11,750 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 258 [2018-10-01 00:30:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:11,750 INFO L225 Difference]: With dead ends: 275 [2018-10-01 00:30:11,750 INFO L226 Difference]: Without dead ends: 261 [2018-10-01 00:30:11,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:30:11,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-01 00:30:11,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-10-01 00:30:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-01 00:30:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 263 transitions. [2018-10-01 00:30:11,757 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 263 transitions. Word has length 258 [2018-10-01 00:30:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:11,757 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 263 transitions. [2018-10-01 00:30:11,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-01 00:30:11,757 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 263 transitions. [2018-10-01 00:30:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-01 00:30:11,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:11,758 INFO L375 BasicCegarLoop]: trace histogram [123, 122, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:11,758 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:11,758 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:11,758 INFO L82 PathProgramCache]: Analyzing trace with hash 745880044, now seen corresponding path program 121 times [2018-10-01 00:30:11,758 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:11,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:11,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:11,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:11,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 15024 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:12,624 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:12,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:12,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:12,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15024 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:13,260 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:13,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124, 124] total 124 [2018-10-01 00:30:13,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-01 00:30:13,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-01 00:30:13,262 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:13,262 INFO L87 Difference]: Start difference. First operand 261 states and 263 transitions. Second operand 125 states. [2018-10-01 00:30:14,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:14,093 INFO L93 Difference]: Finished difference Result 277 states and 281 transitions. [2018-10-01 00:30:14,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-01 00:30:14,093 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 260 [2018-10-01 00:30:14,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:14,093 INFO L225 Difference]: With dead ends: 277 [2018-10-01 00:30:14,094 INFO L226 Difference]: Without dead ends: 263 [2018-10-01 00:30:14,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:30:14,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-01 00:30:14,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-10-01 00:30:14,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-01 00:30:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 265 transitions. [2018-10-01 00:30:14,100 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 265 transitions. Word has length 260 [2018-10-01 00:30:14,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:14,101 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 265 transitions. [2018-10-01 00:30:14,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-01 00:30:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 265 transitions. [2018-10-01 00:30:14,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-01 00:30:14,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:14,102 INFO L375 BasicCegarLoop]: trace histogram [124, 123, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:14,102 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:14,102 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:14,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1138018024, now seen corresponding path program 122 times [2018-10-01 00:30:14,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:14,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:14,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:14,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:14,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15270 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:14,987 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:14,987 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:14,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:30:15,166 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:30:15,166 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:15,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 15270 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:15,852 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:15,853 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 125 [2018-10-01 00:30:15,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-01 00:30:15,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-01 00:30:15,854 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:15,855 INFO L87 Difference]: Start difference. First operand 263 states and 265 transitions. Second operand 126 states. [2018-10-01 00:30:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:17,295 INFO L93 Difference]: Finished difference Result 279 states and 283 transitions. [2018-10-01 00:30:17,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-01 00:30:17,295 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 262 [2018-10-01 00:30:17,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:17,296 INFO L225 Difference]: With dead ends: 279 [2018-10-01 00:30:17,296 INFO L226 Difference]: Without dead ends: 265 [2018-10-01 00:30:17,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:30:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-01 00:30:17,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-10-01 00:30:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-01 00:30:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 267 transitions. [2018-10-01 00:30:17,303 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 267 transitions. Word has length 262 [2018-10-01 00:30:17,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:17,303 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 267 transitions. [2018-10-01 00:30:17,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-01 00:30:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 267 transitions. [2018-10-01 00:30:17,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-01 00:30:17,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:17,304 INFO L375 BasicCegarLoop]: trace histogram [125, 124, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:17,305 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:17,305 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:17,305 INFO L82 PathProgramCache]: Analyzing trace with hash 25494756, now seen corresponding path program 123 times [2018-10-01 00:30:17,305 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:17,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:17,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:17,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:17,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15518 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:18,199 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:18,199 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:18,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:30:18,732 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 125 check-sat command(s) [2018-10-01 00:30:18,732 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:18,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 15518 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:19,190 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:19,190 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126, 126] total 126 [2018-10-01 00:30:19,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-01 00:30:19,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-01 00:30:19,192 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:19,192 INFO L87 Difference]: Start difference. First operand 265 states and 267 transitions. Second operand 127 states. [2018-10-01 00:30:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:20,908 INFO L93 Difference]: Finished difference Result 281 states and 285 transitions. [2018-10-01 00:30:20,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-10-01 00:30:20,909 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 264 [2018-10-01 00:30:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:20,909 INFO L225 Difference]: With dead ends: 281 [2018-10-01 00:30:20,909 INFO L226 Difference]: Without dead ends: 267 [2018-10-01 00:30:20,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:30:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-01 00:30:20,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-10-01 00:30:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-01 00:30:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 269 transitions. [2018-10-01 00:30:20,917 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 269 transitions. Word has length 264 [2018-10-01 00:30:20,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:20,917 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 269 transitions. [2018-10-01 00:30:20,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-01 00:30:20,917 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 269 transitions. [2018-10-01 00:30:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-01 00:30:20,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:20,918 INFO L375 BasicCegarLoop]: trace histogram [126, 125, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:20,919 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:20,919 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:20,919 INFO L82 PathProgramCache]: Analyzing trace with hash 337490912, now seen corresponding path program 124 times [2018-10-01 00:30:20,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:20,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:20,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:20,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:20,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15768 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:21,876 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:21,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 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:21,884 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:30:22,060 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:30:22,061 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:22,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15768 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:22,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:22,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127] total 127 [2018-10-01 00:30:22,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-01 00:30:22,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-01 00:30:22,535 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:22,535 INFO L87 Difference]: Start difference. First operand 267 states and 269 transitions. Second operand 128 states. [2018-10-01 00:30:23,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:23,709 INFO L93 Difference]: Finished difference Result 283 states and 287 transitions. [2018-10-01 00:30:23,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-10-01 00:30:23,710 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 266 [2018-10-01 00:30:23,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:23,711 INFO L225 Difference]: With dead ends: 283 [2018-10-01 00:30:23,711 INFO L226 Difference]: Without dead ends: 269 [2018-10-01 00:30:23,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:30:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-01 00:30:23,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-10-01 00:30:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-01 00:30:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2018-10-01 00:30:23,718 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 266 [2018-10-01 00:30:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:23,719 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2018-10-01 00:30:23,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-01 00:30:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2018-10-01 00:30:23,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-01 00:30:23,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:23,720 INFO L375 BasicCegarLoop]: trace histogram [127, 126, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:23,720 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:23,720 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:23,720 INFO L82 PathProgramCache]: Analyzing trace with hash -481913892, now seen corresponding path program 125 times [2018-10-01 00:30:23,720 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:23,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:23,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:23,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:23,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:24,645 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:24,645 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:24,655 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:30:25,179 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 127 check-sat command(s) [2018-10-01 00:30:25,179 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:25,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:25,827 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:25,848 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:25,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128] total 128 [2018-10-01 00:30:25,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-01 00:30:25,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-01 00:30:25,850 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:25,850 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 129 states. [2018-10-01 00:30:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:27,521 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2018-10-01 00:30:27,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-01 00:30:27,521 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 268 [2018-10-01 00:30:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:27,522 INFO L225 Difference]: With dead ends: 285 [2018-10-01 00:30:27,522 INFO L226 Difference]: Without dead ends: 271 [2018-10-01 00:30:27,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:30:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-01 00:30:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-10-01 00:30:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-01 00:30:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 273 transitions. [2018-10-01 00:30:27,530 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 273 transitions. Word has length 268 [2018-10-01 00:30:27,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:27,531 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 273 transitions. [2018-10-01 00:30:27,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-01 00:30:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 273 transitions. [2018-10-01 00:30:27,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-01 00:30:27,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:27,531 INFO L375 BasicCegarLoop]: trace histogram [128, 127, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:27,532 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:27,532 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:27,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1950915368, now seen corresponding path program 126 times [2018-10-01 00:30:27,532 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:27,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:27,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:27,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:27,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16274 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:28,502 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:28,502 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:28,512 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:30:29,010 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 128 check-sat command(s) [2018-10-01 00:30:29,010 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:29,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 16274 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:29,482 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:29,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129] total 129 [2018-10-01 00:30:29,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-10-01 00:30:29,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-10-01 00:30:29,484 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:29,484 INFO L87 Difference]: Start difference. First operand 271 states and 273 transitions. Second operand 130 states. [2018-10-01 00:30:31,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:31,255 INFO L93 Difference]: Finished difference Result 287 states and 291 transitions. [2018-10-01 00:30:31,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-10-01 00:30:31,255 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 270 [2018-10-01 00:30:31,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:31,256 INFO L225 Difference]: With dead ends: 287 [2018-10-01 00:30:31,256 INFO L226 Difference]: Without dead ends: 273 [2018-10-01 00:30:31,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:30:31,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-01 00:30:31,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-10-01 00:30:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-01 00:30:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2018-10-01 00:30:31,263 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 270 [2018-10-01 00:30:31,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:31,263 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2018-10-01 00:30:31,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-10-01 00:30:31,264 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2018-10-01 00:30:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-01 00:30:31,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:31,264 INFO L375 BasicCegarLoop]: trace histogram [129, 128, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:31,264 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:31,265 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash -617093420, now seen corresponding path program 127 times [2018-10-01 00:30:31,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:31,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:31,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:31,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:31,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16530 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:32,204 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:32,204 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:32,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:32,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 16530 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:32,860 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:32,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130, 130] total 130 [2018-10-01 00:30:32,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-01 00:30:32,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-01 00:30:32,862 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:32,862 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 131 states. [2018-10-01 00:30:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:34,767 INFO L93 Difference]: Finished difference Result 289 states and 293 transitions. [2018-10-01 00:30:34,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-01 00:30:34,767 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 272 [2018-10-01 00:30:34,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:34,768 INFO L225 Difference]: With dead ends: 289 [2018-10-01 00:30:34,768 INFO L226 Difference]: Without dead ends: 275 [2018-10-01 00:30:34,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:30:34,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-01 00:30:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-10-01 00:30:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-01 00:30:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 277 transitions. [2018-10-01 00:30:34,775 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 277 transitions. Word has length 272 [2018-10-01 00:30:34,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:34,775 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 277 transitions. [2018-10-01 00:30:34,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-01 00:30:34,775 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 277 transitions. [2018-10-01 00:30:34,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-01 00:30:34,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:34,776 INFO L375 BasicCegarLoop]: trace histogram [130, 129, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:34,776 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:34,776 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:34,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1285544400, now seen corresponding path program 128 times [2018-10-01 00:30:34,777 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:34,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:34,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:34,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:34,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16788 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:35,738 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:35,738 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:35,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:30:35,922 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:30:35,922 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:35,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16788 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:36,482 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:36,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 131 [2018-10-01 00:30:36,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-10-01 00:30:36,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-10-01 00:30:36,484 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:36,484 INFO L87 Difference]: Start difference. First operand 275 states and 277 transitions. Second operand 132 states. [2018-10-01 00:30:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:37,537 INFO L93 Difference]: Finished difference Result 291 states and 295 transitions. [2018-10-01 00:30:37,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-01 00:30:37,537 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 274 [2018-10-01 00:30:37,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:37,538 INFO L225 Difference]: With dead ends: 291 [2018-10-01 00:30:37,538 INFO L226 Difference]: Without dead ends: 277 [2018-10-01 00:30:37,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:30:37,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-01 00:30:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-10-01 00:30:37,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-01 00:30:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 279 transitions. [2018-10-01 00:30:37,545 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 279 transitions. Word has length 274 [2018-10-01 00:30:37,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:37,546 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 279 transitions. [2018-10-01 00:30:37,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-10-01 00:30:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 279 transitions. [2018-10-01 00:30:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-01 00:30:37,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:37,546 INFO L375 BasicCegarLoop]: trace histogram [131, 130, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:37,547 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:37,547 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:37,547 INFO L82 PathProgramCache]: Analyzing trace with hash 64421324, now seen corresponding path program 129 times [2018-10-01 00:30:37,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:37,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:37,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:37,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:37,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 17048 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:38,576 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:38,576 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:38,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:30:39,173 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 131 check-sat command(s) [2018-10-01 00:30:39,173 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:39,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17048 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:39,668 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:39,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132, 132] total 132 [2018-10-01 00:30:39,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-01 00:30:39,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-01 00:30:39,670 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:39,671 INFO L87 Difference]: Start difference. First operand 277 states and 279 transitions. Second operand 133 states. [2018-10-01 00:30:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:41,452 INFO L93 Difference]: Finished difference Result 293 states and 297 transitions. [2018-10-01 00:30:41,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-01 00:30:41,452 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 276 [2018-10-01 00:30:41,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:41,453 INFO L225 Difference]: With dead ends: 293 [2018-10-01 00:30:41,453 INFO L226 Difference]: Without dead ends: 279 [2018-10-01 00:30:41,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:30:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-01 00:30:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-10-01 00:30:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-01 00:30:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 281 transitions. [2018-10-01 00:30:41,460 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 281 transitions. Word has length 276 [2018-10-01 00:30:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:41,460 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 281 transitions. [2018-10-01 00:30:41,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-01 00:30:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 281 transitions. [2018-10-01 00:30:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-01 00:30:41,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:41,461 INFO L375 BasicCegarLoop]: trace histogram [132, 131, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:41,461 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:41,462 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:41,462 INFO L82 PathProgramCache]: Analyzing trace with hash -908782904, now seen corresponding path program 130 times [2018-10-01 00:30:41,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:41,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:41,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:41,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:41,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 17310 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:42,437 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:42,437 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:42,444 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:30:42,620 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:30:42,620 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:42,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 17310 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:43,174 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:43,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 133 [2018-10-01 00:30:43,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-10-01 00:30:43,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-10-01 00:30:43,175 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:43,175 INFO L87 Difference]: Start difference. First operand 279 states and 281 transitions. Second operand 134 states. [2018-10-01 00:30:44,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:44,876 INFO L93 Difference]: Finished difference Result 295 states and 299 transitions. [2018-10-01 00:30:44,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-10-01 00:30:44,876 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 278 [2018-10-01 00:30:44,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:44,877 INFO L225 Difference]: With dead ends: 295 [2018-10-01 00:30:44,877 INFO L226 Difference]: Without dead ends: 281 [2018-10-01 00:30:44,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:30:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-01 00:30:44,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-10-01 00:30:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-01 00:30:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 283 transitions. [2018-10-01 00:30:44,889 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 283 transitions. Word has length 278 [2018-10-01 00:30:44,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:44,889 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 283 transitions. [2018-10-01 00:30:44,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-10-01 00:30:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 283 transitions. [2018-10-01 00:30:44,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-01 00:30:44,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:44,890 INFO L375 BasicCegarLoop]: trace histogram [133, 132, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:44,890 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:44,891 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:44,891 INFO L82 PathProgramCache]: Analyzing trace with hash 144824516, now seen corresponding path program 131 times [2018-10-01 00:30:44,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:44,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:44,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:44,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:44,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 17574 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:45,939 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:45,939 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:45,945 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:30:46,513 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 133 check-sat command(s) [2018-10-01 00:30:46,513 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:46,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 17574 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:47,014 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:47,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134, 134] total 134 [2018-10-01 00:30:47,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-01 00:30:47,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-01 00:30:47,017 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:47,017 INFO L87 Difference]: Start difference. First operand 281 states and 283 transitions. Second operand 135 states. [2018-10-01 00:30:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:48,773 INFO L93 Difference]: Finished difference Result 297 states and 301 transitions. [2018-10-01 00:30:48,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-01 00:30:48,774 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 280 [2018-10-01 00:30:48,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:48,774 INFO L225 Difference]: With dead ends: 297 [2018-10-01 00:30:48,774 INFO L226 Difference]: Without dead ends: 283 [2018-10-01 00:30:48,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:30:48,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-01 00:30:48,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-10-01 00:30:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-01 00:30:48,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 285 transitions. [2018-10-01 00:30:48,786 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 285 transitions. Word has length 280 [2018-10-01 00:30:48,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:48,786 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 285 transitions. [2018-10-01 00:30:48,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-01 00:30:48,786 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 285 transitions. [2018-10-01 00:30:48,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-01 00:30:48,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:48,787 INFO L375 BasicCegarLoop]: trace histogram [134, 133, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:48,788 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:48,788 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:48,788 INFO L82 PathProgramCache]: Analyzing trace with hash -950726720, now seen corresponding path program 132 times [2018-10-01 00:30:48,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:48,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:48,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:48,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:48,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 17840 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:49,814 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:49,814 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:49,821 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:30:50,356 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 134 check-sat command(s) [2018-10-01 00:30:50,356 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:50,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:50,842 INFO L134 CoverageAnalysis]: Checked inductivity of 17840 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:50,863 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:50,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135] total 135 [2018-10-01 00:30:50,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-10-01 00:30:50,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-10-01 00:30:50,865 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:50,865 INFO L87 Difference]: Start difference. First operand 283 states and 285 transitions. Second operand 136 states. [2018-10-01 00:30:52,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:52,758 INFO L93 Difference]: Finished difference Result 299 states and 303 transitions. [2018-10-01 00:30:52,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-01 00:30:52,759 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 282 [2018-10-01 00:30:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:52,759 INFO L225 Difference]: With dead ends: 299 [2018-10-01 00:30:52,759 INFO L226 Difference]: Without dead ends: 285 [2018-10-01 00:30:52,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:30:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-01 00:30:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-10-01 00:30:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-01 00:30:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 287 transitions. [2018-10-01 00:30:52,767 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 287 transitions. Word has length 282 [2018-10-01 00:30:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:52,767 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 287 transitions. [2018-10-01 00:30:52,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-10-01 00:30:52,767 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 287 transitions. [2018-10-01 00:30:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-01 00:30:52,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:52,768 INFO L375 BasicCegarLoop]: trace histogram [135, 134, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:52,768 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:52,768 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:52,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1508476996, now seen corresponding path program 133 times [2018-10-01 00:30:52,768 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:52,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:52,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:52,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:52,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 18108 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:53,790 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:53,790 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:53,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:53,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:54,467 INFO L134 CoverageAnalysis]: Checked inductivity of 18108 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:54,487 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:54,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136, 136] total 136 [2018-10-01 00:30:54,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-01 00:30:54,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-01 00:30:54,489 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:54,489 INFO L87 Difference]: Start difference. First operand 285 states and 287 transitions. Second operand 137 states. [2018-10-01 00:30:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:56,473 INFO L93 Difference]: Finished difference Result 301 states and 305 transitions. [2018-10-01 00:30:56,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-01 00:30:56,474 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 284 [2018-10-01 00:30:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:56,474 INFO L225 Difference]: With dead ends: 301 [2018-10-01 00:30:56,474 INFO L226 Difference]: Without dead ends: 287 [2018-10-01 00:30:56,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:30:56,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-01 00:30:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-10-01 00:30:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-01 00:30:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 289 transitions. [2018-10-01 00:30:56,482 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 289 transitions. Word has length 284 [2018-10-01 00:30:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:56,482 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 289 transitions. [2018-10-01 00:30:56,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-01 00:30:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 289 transitions. [2018-10-01 00:30:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-01 00:30:56,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:56,483 INFO L375 BasicCegarLoop]: trace histogram [136, 135, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:30:56,483 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:56,483 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:56,483 INFO L82 PathProgramCache]: Analyzing trace with hash -635580232, now seen corresponding path program 134 times [2018-10-01 00:30:56,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:56,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:56,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 18378 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:57,586 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:57,586 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:57,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:30:57,773 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:30:57,773 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:57,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 18378 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:30:58,277 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:58,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137] total 137 [2018-10-01 00:30:58,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-01 00:30:58,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-01 00:30:58,279 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:58,279 INFO L87 Difference]: Start difference. First operand 287 states and 289 transitions. Second operand 138 states. [2018-10-01 00:31:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:00,249 INFO L93 Difference]: Finished difference Result 303 states and 307 transitions. [2018-10-01 00:31:00,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-01 00:31:00,249 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 286 [2018-10-01 00:31:00,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:00,250 INFO L225 Difference]: With dead ends: 303 [2018-10-01 00:31:00,250 INFO L226 Difference]: Without dead ends: 289 [2018-10-01 00:31:00,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:31:00,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-01 00:31:00,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-10-01 00:31:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-01 00:31:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 291 transitions. [2018-10-01 00:31:00,257 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 291 transitions. Word has length 286 [2018-10-01 00:31:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:00,257 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 291 transitions. [2018-10-01 00:31:00,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-01 00:31:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 291 transitions. [2018-10-01 00:31:00,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-01 00:31:00,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:00,258 INFO L375 BasicCegarLoop]: trace histogram [137, 136, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:31:00,259 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:00,259 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:00,259 INFO L82 PathProgramCache]: Analyzing trace with hash 699587252, now seen corresponding path program 135 times [2018-10-01 00:31:00,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:00,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:00,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:00,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:00,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 18650 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:01,296 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:01,296 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:01,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:31:01,931 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 137 check-sat command(s) [2018-10-01 00:31:01,931 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:01,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:02,495 INFO L134 CoverageAnalysis]: Checked inductivity of 18650 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:02,516 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:02,516 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138, 138] total 138 [2018-10-01 00:31:02,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-01 00:31:02,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-01 00:31:02,518 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:02,518 INFO L87 Difference]: Start difference. First operand 289 states and 291 transitions. Second operand 139 states. [2018-10-01 00:31:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:04,572 INFO L93 Difference]: Finished difference Result 305 states and 309 transitions. [2018-10-01 00:31:04,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-10-01 00:31:04,572 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 288 [2018-10-01 00:31:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:04,573 INFO L225 Difference]: With dead ends: 305 [2018-10-01 00:31:04,573 INFO L226 Difference]: Without dead ends: 291 [2018-10-01 00:31:04,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:31:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-01 00:31:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-10-01 00:31:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-01 00:31:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 293 transitions. [2018-10-01 00:31:04,580 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 293 transitions. Word has length 288 [2018-10-01 00:31:04,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:04,580 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 293 transitions. [2018-10-01 00:31:04,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-01 00:31:04,580 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 293 transitions. [2018-10-01 00:31:04,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-01 00:31:04,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:04,581 INFO L375 BasicCegarLoop]: trace histogram [138, 137, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:31:04,582 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:04,582 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:04,582 INFO L82 PathProgramCache]: Analyzing trace with hash -399682128, now seen corresponding path program 136 times [2018-10-01 00:31:04,582 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:04,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:04,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:04,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:04,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 18924 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:05,648 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:05,648 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:05,655 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:31:05,843 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:31:05,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:05,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18924 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:06,368 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:06,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139] total 139 [2018-10-01 00:31:06,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-10-01 00:31:06,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-10-01 00:31:06,371 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:06,371 INFO L87 Difference]: Start difference. First operand 291 states and 293 transitions. Second operand 140 states. [2018-10-01 00:31:08,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:08,323 INFO L93 Difference]: Finished difference Result 307 states and 311 transitions. [2018-10-01 00:31:08,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-10-01 00:31:08,323 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 290 [2018-10-01 00:31:08,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:08,324 INFO L225 Difference]: With dead ends: 307 [2018-10-01 00:31:08,324 INFO L226 Difference]: Without dead ends: 293 [2018-10-01 00:31:08,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:31:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-01 00:31:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-10-01 00:31:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-01 00:31:08,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 295 transitions. [2018-10-01 00:31:08,335 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 295 transitions. Word has length 290 [2018-10-01 00:31:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:08,336 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 295 transitions. [2018-10-01 00:31:08,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-10-01 00:31:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 295 transitions. [2018-10-01 00:31:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-01 00:31:08,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:08,337 INFO L375 BasicCegarLoop]: trace histogram [139, 138, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:31:08,337 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:08,337 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:08,338 INFO L82 PathProgramCache]: Analyzing trace with hash -235601492, now seen corresponding path program 137 times [2018-10-01 00:31:08,338 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:08,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:08,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:08,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:08,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 19200 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:09,463 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:09,463 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:09,470 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:31:10,069 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 139 check-sat command(s) [2018-10-01 00:31:10,069 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:10,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 19200 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:10,590 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:10,590 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140, 140] total 140 [2018-10-01 00:31:10,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-01 00:31:10,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-01 00:31:10,592 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:10,593 INFO L87 Difference]: Start difference. First operand 293 states and 295 transitions. Second operand 141 states. [2018-10-01 00:31:12,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:12,081 INFO L93 Difference]: Finished difference Result 309 states and 313 transitions. [2018-10-01 00:31:12,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-01 00:31:12,081 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 292 [2018-10-01 00:31:12,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:12,082 INFO L225 Difference]: With dead ends: 309 [2018-10-01 00:31:12,082 INFO L226 Difference]: Without dead ends: 295 [2018-10-01 00:31:12,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:31:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-01 00:31:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-10-01 00:31:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-01 00:31:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 297 transitions. [2018-10-01 00:31:12,090 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 297 transitions. Word has length 292 [2018-10-01 00:31:12,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:12,090 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 297 transitions. [2018-10-01 00:31:12,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-01 00:31:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 297 transitions. [2018-10-01 00:31:12,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-01 00:31:12,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:12,091 INFO L375 BasicCegarLoop]: trace histogram [140, 139, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:31:12,091 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:12,091 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:12,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1467900248, now seen corresponding path program 138 times [2018-10-01 00:31:12,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:12,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:12,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:12,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:12,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 19478 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:13,230 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:13,230 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:13,237 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:31:13,822 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 140 check-sat command(s) [2018-10-01 00:31:13,823 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:13,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 19478 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:14,345 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:14,346 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141] total 141 [2018-10-01 00:31:14,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-10-01 00:31:14,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-10-01 00:31:14,347 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:14,348 INFO L87 Difference]: Start difference. First operand 295 states and 297 transitions. Second operand 142 states. [2018-10-01 00:31:16,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:16,421 INFO L93 Difference]: Finished difference Result 311 states and 315 transitions. [2018-10-01 00:31:16,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-10-01 00:31:16,421 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 294 [2018-10-01 00:31:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:16,422 INFO L225 Difference]: With dead ends: 311 [2018-10-01 00:31:16,422 INFO L226 Difference]: Without dead ends: 297 [2018-10-01 00:31:16,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:31:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-01 00:31:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-10-01 00:31:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-01 00:31:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 299 transitions. [2018-10-01 00:31:16,429 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 299 transitions. Word has length 294 [2018-10-01 00:31:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:16,429 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 299 transitions. [2018-10-01 00:31:16,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-10-01 00:31:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 299 transitions. [2018-10-01 00:31:16,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-01 00:31:16,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:16,430 INFO L375 BasicCegarLoop]: trace histogram [141, 140, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:31:16,430 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:16,431 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:16,431 INFO L82 PathProgramCache]: Analyzing trace with hash -296031068, now seen corresponding path program 139 times [2018-10-01 00:31:16,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:16,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:16,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:16,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:16,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 19758 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:17,815 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:17,815 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:17,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:18,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 19758 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:18,581 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:18,581 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142, 142] total 142 [2018-10-01 00:31:18,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-01 00:31:18,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-01 00:31:18,583 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:18,583 INFO L87 Difference]: Start difference. First operand 297 states and 299 transitions. Second operand 143 states. [2018-10-01 00:31:20,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:20,393 INFO L93 Difference]: Finished difference Result 313 states and 317 transitions. [2018-10-01 00:31:20,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-01 00:31:20,393 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 296 [2018-10-01 00:31:20,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:20,394 INFO L225 Difference]: With dead ends: 313 [2018-10-01 00:31:20,394 INFO L226 Difference]: Without dead ends: 299 [2018-10-01 00:31:20,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:31:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-01 00:31:20,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-10-01 00:31:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-01 00:31:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 301 transitions. [2018-10-01 00:31:20,401 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 301 transitions. Word has length 296 [2018-10-01 00:31:20,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:20,402 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 301 transitions. [2018-10-01 00:31:20,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-01 00:31:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 301 transitions. [2018-10-01 00:31:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-01 00:31:20,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:20,403 INFO L375 BasicCegarLoop]: trace histogram [142, 141, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:31:20,403 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:20,403 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:20,403 INFO L82 PathProgramCache]: Analyzing trace with hash 588819360, now seen corresponding path program 140 times [2018-10-01 00:31:20,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:20,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:20,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:20,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:20,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20040 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:21,521 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:21,522 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:21,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:31:21,718 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:31:21,718 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:21,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:22,478 INFO L134 CoverageAnalysis]: Checked inductivity of 20040 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:22,499 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:22,500 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143] total 143 [2018-10-01 00:31:22,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-10-01 00:31:22,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-10-01 00:31:22,502 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:22,502 INFO L87 Difference]: Start difference. First operand 299 states and 301 transitions. Second operand 144 states. [2018-10-01 00:31:23,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:23,892 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2018-10-01 00:31:23,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-01 00:31:23,893 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 298 [2018-10-01 00:31:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:23,893 INFO L225 Difference]: With dead ends: 315 [2018-10-01 00:31:23,893 INFO L226 Difference]: Without dead ends: 301 [2018-10-01 00:31:23,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:31:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-01 00:31:23,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-10-01 00:31:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-01 00:31:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 303 transitions. [2018-10-01 00:31:23,901 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 303 transitions. Word has length 298 [2018-10-01 00:31:23,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:23,901 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 303 transitions. [2018-10-01 00:31:23,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-10-01 00:31:23,902 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 303 transitions. [2018-10-01 00:31:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-01 00:31:23,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:23,903 INFO L375 BasicCegarLoop]: trace histogram [143, 142, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:31:23,903 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:23,903 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:23,903 INFO L82 PathProgramCache]: Analyzing trace with hash 526556060, now seen corresponding path program 141 times [2018-10-01 00:31:23,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:23,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:23,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:23,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:23,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 20324 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:25,035 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:25,035 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:25,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:31:25,727 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 143 check-sat command(s) [2018-10-01 00:31:25,727 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:25,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 20324 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:26,265 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:26,265 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144, 144] total 144 [2018-10-01 00:31:26,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-01 00:31:26,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-01 00:31:26,267 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:26,267 INFO L87 Difference]: Start difference. First operand 301 states and 303 transitions. Second operand 145 states. [2018-10-01 00:31:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:28,327 INFO L93 Difference]: Finished difference Result 317 states and 321 transitions. [2018-10-01 00:31:28,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-01 00:31:28,327 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 300 [2018-10-01 00:31:28,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:28,328 INFO L225 Difference]: With dead ends: 317 [2018-10-01 00:31:28,328 INFO L226 Difference]: Without dead ends: 303 [2018-10-01 00:31:28,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:31:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-01 00:31:28,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-10-01 00:31:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-01 00:31:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 305 transitions. [2018-10-01 00:31:28,337 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 305 transitions. Word has length 300 [2018-10-01 00:31:28,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:28,337 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 305 transitions. [2018-10-01 00:31:28,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-01 00:31:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 305 transitions. [2018-10-01 00:31:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-01 00:31:28,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:28,338 INFO L375 BasicCegarLoop]: trace histogram [144, 143, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:31:28,338 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:28,338 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:28,338 INFO L82 PathProgramCache]: Analyzing trace with hash 821066904, now seen corresponding path program 142 times [2018-10-01 00:31:28,338 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:28,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:28,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:28,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:28,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:29,502 INFO L134 CoverageAnalysis]: Checked inductivity of 20610 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:29,502 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:29,502 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:29,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:31:29,707 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:31:29,707 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:29,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 20610 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:30,262 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:30,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145] total 145 [2018-10-01 00:31:30,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-10-01 00:31:30,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-10-01 00:31:30,265 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:30,265 INFO L87 Difference]: Start difference. First operand 303 states and 305 transitions. Second operand 146 states. [2018-10-01 00:31:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:32,587 INFO L93 Difference]: Finished difference Result 319 states and 323 transitions. [2018-10-01 00:31:32,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-01 00:31:32,588 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 302 [2018-10-01 00:31:32,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:32,589 INFO L225 Difference]: With dead ends: 319 [2018-10-01 00:31:32,589 INFO L226 Difference]: Without dead ends: 305 [2018-10-01 00:31:32,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:31:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-01 00:31:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-10-01 00:31:32,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-01 00:31:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 307 transitions. [2018-10-01 00:31:32,597 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 307 transitions. Word has length 302 [2018-10-01 00:31:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:32,597 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 307 transitions. [2018-10-01 00:31:32,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-10-01 00:31:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 307 transitions. [2018-10-01 00:31:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-01 00:31:32,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:32,598 INFO L375 BasicCegarLoop]: trace histogram [145, 144, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:31:32,598 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:32,599 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:32,599 INFO L82 PathProgramCache]: Analyzing trace with hash 378146452, now seen corresponding path program 143 times [2018-10-01 00:31:32,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:32,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:32,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:32,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:32,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 20898 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:33,817 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:33,817 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:33,824 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:31:34,473 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 145 check-sat command(s) [2018-10-01 00:31:34,473 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:34,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 20898 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:35,025 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:35,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146, 146] total 146 [2018-10-01 00:31:35,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-01 00:31:35,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-01 00:31:35,027 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:35,027 INFO L87 Difference]: Start difference. First operand 305 states and 307 transitions. Second operand 147 states. [2018-10-01 00:31:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:36,286 INFO L93 Difference]: Finished difference Result 321 states and 325 transitions. [2018-10-01 00:31:36,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-01 00:31:36,287 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 304 [2018-10-01 00:31:36,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:36,287 INFO L225 Difference]: With dead ends: 321 [2018-10-01 00:31:36,287 INFO L226 Difference]: Without dead ends: 307 [2018-10-01 00:31:36,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:31:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-01 00:31:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-10-01 00:31:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-01 00:31:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 309 transitions. [2018-10-01 00:31:36,295 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 309 transitions. Word has length 304 [2018-10-01 00:31:36,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:36,295 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 309 transitions. [2018-10-01 00:31:36,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-01 00:31:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 309 transitions. [2018-10-01 00:31:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-01 00:31:36,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:36,297 INFO L375 BasicCegarLoop]: trace histogram [146, 145, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:31:36,297 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:36,297 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:36,297 INFO L82 PathProgramCache]: Analyzing trace with hash -66645616, now seen corresponding path program 144 times [2018-10-01 00:31:36,297 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:36,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:36,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:36,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:36,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 21188 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:37,711 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:37,712 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:37,719 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:31:38,358 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 146 check-sat command(s) [2018-10-01 00:31:38,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:38,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 21188 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:38,899 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:38,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147] total 147 [2018-10-01 00:31:38,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-10-01 00:31:38,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-10-01 00:31:38,901 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:38,901 INFO L87 Difference]: Start difference. First operand 307 states and 309 transitions. Second operand 148 states. [2018-10-01 00:31:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:40,852 INFO L93 Difference]: Finished difference Result 323 states and 327 transitions. [2018-10-01 00:31:40,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-10-01 00:31:40,853 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 306 [2018-10-01 00:31:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:40,853 INFO L225 Difference]: With dead ends: 323 [2018-10-01 00:31:40,853 INFO L226 Difference]: Without dead ends: 309 [2018-10-01 00:31:40,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:31:40,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-01 00:31:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-10-01 00:31:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-01 00:31:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 311 transitions. [2018-10-01 00:31:40,861 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 311 transitions. Word has length 306 [2018-10-01 00:31:40,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:40,862 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 311 transitions. [2018-10-01 00:31:40,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-10-01 00:31:40,862 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 311 transitions. [2018-10-01 00:31:40,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-01 00:31:40,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:40,863 INFO L375 BasicCegarLoop]: trace histogram [147, 146, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:31:40,863 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:40,863 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:40,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1984906636, now seen corresponding path program 145 times [2018-10-01 00:31:40,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:40,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:40,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:40,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:40,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 21480 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:42,083 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:42,083 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:42,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:42,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 21480 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:43,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:43,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148, 148] total 148 [2018-10-01 00:31:43,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-01 00:31:43,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-01 00:31:43,131 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:43,131 INFO L87 Difference]: Start difference. First operand 309 states and 311 transitions. Second operand 149 states. [2018-10-01 00:31:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:45,115 INFO L93 Difference]: Finished difference Result 325 states and 329 transitions. [2018-10-01 00:31:45,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-01 00:31:45,115 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 308 [2018-10-01 00:31:45,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:45,116 INFO L225 Difference]: With dead ends: 325 [2018-10-01 00:31:45,116 INFO L226 Difference]: Without dead ends: 311 [2018-10-01 00:31:45,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:31:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-01 00:31:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-10-01 00:31:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-01 00:31:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 313 transitions. [2018-10-01 00:31:45,124 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 313 transitions. Word has length 308 [2018-10-01 00:31:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:45,125 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 313 transitions. [2018-10-01 00:31:45,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-10-01 00:31:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 313 transitions. [2018-10-01 00:31:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-01 00:31:45,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:45,126 INFO L375 BasicCegarLoop]: trace histogram [148, 147, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:31:45,126 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:45,126 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:45,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2136631944, now seen corresponding path program 146 times [2018-10-01 00:31:45,126 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:45,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:45,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:45,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:45,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 21774 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:46,381 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:46,381 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:46,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:31:46,593 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:31:46,593 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:46,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 21774 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:47,186 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:47,186 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 149] total 149 [2018-10-01 00:31:47,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-10-01 00:31:47,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-10-01 00:31:47,188 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:47,188 INFO L87 Difference]: Start difference. First operand 311 states and 313 transitions. Second operand 150 states. [2018-10-01 00:31:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:49,442 INFO L93 Difference]: Finished difference Result 327 states and 331 transitions. [2018-10-01 00:31:49,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-01 00:31:49,442 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 310 [2018-10-01 00:31:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:49,443 INFO L225 Difference]: With dead ends: 327 [2018-10-01 00:31:49,443 INFO L226 Difference]: Without dead ends: 313 [2018-10-01 00:31:49,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:31:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-01 00:31:49,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-10-01 00:31:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-01 00:31:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 315 transitions. [2018-10-01 00:31:49,451 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 315 transitions. Word has length 310 [2018-10-01 00:31:49,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:49,451 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 315 transitions. [2018-10-01 00:31:49,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-10-01 00:31:49,451 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 315 transitions. [2018-10-01 00:31:49,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-01 00:31:49,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:49,452 INFO L375 BasicCegarLoop]: trace histogram [149, 148, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:31:49,453 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:49,453 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1915764868, now seen corresponding path program 147 times [2018-10-01 00:31:49,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:49,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:49,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:49,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:49,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 22070 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:50,665 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:50,665 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:50,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:31:51,408 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 149 check-sat command(s) [2018-10-01 00:31:51,408 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:51,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 22070 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:51,974 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:51,974 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150, 150] total 150 [2018-10-01 00:31:51,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-10-01 00:31:51,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-10-01 00:31:51,976 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:51,976 INFO L87 Difference]: Start difference. First operand 313 states and 315 transitions. Second operand 151 states. [2018-10-01 00:31:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:54,291 INFO L93 Difference]: Finished difference Result 329 states and 333 transitions. [2018-10-01 00:31:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-10-01 00:31:54,291 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 312 [2018-10-01 00:31:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:54,292 INFO L225 Difference]: With dead ends: 329 [2018-10-01 00:31:54,292 INFO L226 Difference]: Without dead ends: 315 [2018-10-01 00:31:54,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:31:54,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-01 00:31:54,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-10-01 00:31:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-01 00:31:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 317 transitions. [2018-10-01 00:31:54,305 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 317 transitions. Word has length 312 [2018-10-01 00:31:54,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:54,305 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 317 transitions. [2018-10-01 00:31:54,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-10-01 00:31:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 317 transitions. [2018-10-01 00:31:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-01 00:31:54,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:54,307 INFO L375 BasicCegarLoop]: trace histogram [150, 149, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:31:54,307 INFO L423 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:54,307 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:54,307 INFO L82 PathProgramCache]: Analyzing trace with hash 115902336, now seen corresponding path program 148 times [2018-10-01 00:31:54,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:54,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:54,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:54,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:54,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 22368 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:55,574 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:55,574 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:55,582 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:31:55,784 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:31:55,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:55,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 22368 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:56,388 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:56,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151, 151] total 151 [2018-10-01 00:31:56,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-10-01 00:31:56,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-10-01 00:31:56,391 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:56,391 INFO L87 Difference]: Start difference. First operand 315 states and 317 transitions. Second operand 152 states. [2018-10-01 00:31:58,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:58,591 INFO L93 Difference]: Finished difference Result 331 states and 335 transitions. [2018-10-01 00:31:58,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-01 00:31:58,591 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 314 [2018-10-01 00:31:58,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:58,592 INFO L225 Difference]: With dead ends: 331 [2018-10-01 00:31:58,592 INFO L226 Difference]: Without dead ends: 317 [2018-10-01 00:31:58,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:31:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-01 00:31:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-10-01 00:31:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-01 00:31:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 319 transitions. [2018-10-01 00:31:58,600 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 319 transitions. Word has length 314 [2018-10-01 00:31:58,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:58,601 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 319 transitions. [2018-10-01 00:31:58,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-10-01 00:31:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 319 transitions. [2018-10-01 00:31:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-01 00:31:58,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:58,602 INFO L375 BasicCegarLoop]: trace histogram [151, 150, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:31:58,602 INFO L423 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:58,602 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:58,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1319829372, now seen corresponding path program 149 times [2018-10-01 00:31:58,602 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:58,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:58,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:58,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:58,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 22668 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:31:59,868 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:59,868 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:59,876 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:32:00,575 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 151 check-sat command(s) [2018-10-01 00:32:00,576 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:32:00,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:01,162 INFO L134 CoverageAnalysis]: Checked inductivity of 22668 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:01,183 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:01,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152, 152] total 152 [2018-10-01 00:32:01,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-10-01 00:32:01,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-10-01 00:32:01,186 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:01,186 INFO L87 Difference]: Start difference. First operand 317 states and 319 transitions. Second operand 153 states. [2018-10-01 00:32:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:03,370 INFO L93 Difference]: Finished difference Result 333 states and 337 transitions. [2018-10-01 00:32:03,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-01 00:32:03,370 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 316 [2018-10-01 00:32:03,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:03,371 INFO L225 Difference]: With dead ends: 333 [2018-10-01 00:32:03,371 INFO L226 Difference]: Without dead ends: 319 [2018-10-01 00:32:03,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:32:03,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-01 00:32:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-10-01 00:32:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-01 00:32:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 321 transitions. [2018-10-01 00:32:03,383 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 321 transitions. Word has length 316 [2018-10-01 00:32:03,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:03,383 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 321 transitions. [2018-10-01 00:32:03,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-10-01 00:32:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 321 transitions. [2018-10-01 00:32:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-01 00:32:03,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:03,385 INFO L375 BasicCegarLoop]: trace histogram [152, 151, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:32:03,385 INFO L423 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:03,385 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1347458952, now seen corresponding path program 150 times [2018-10-01 00:32:03,385 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:03,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:03,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:03,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:32:03,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 22970 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:04,716 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:04,716 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:04,723 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:32:05,406 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 152 check-sat command(s) [2018-10-01 00:32:05,406 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:32:05,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 22970 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:05,993 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:05,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153, 153] total 153 [2018-10-01 00:32:05,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-10-01 00:32:05,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-10-01 00:32:05,995 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:05,995 INFO L87 Difference]: Start difference. First operand 319 states and 321 transitions. Second operand 154 states. [2018-10-01 00:32:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:07,933 INFO L93 Difference]: Finished difference Result 335 states and 339 transitions. [2018-10-01 00:32:07,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-10-01 00:32:07,933 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 318 [2018-10-01 00:32:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:07,934 INFO L225 Difference]: With dead ends: 335 [2018-10-01 00:32:07,934 INFO L226 Difference]: Without dead ends: 321 [2018-10-01 00:32:07,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:32:07,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-01 00:32:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-10-01 00:32:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-01 00:32:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 323 transitions. [2018-10-01 00:32:07,943 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 323 transitions. Word has length 318 [2018-10-01 00:32:07,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:07,943 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 323 transitions. [2018-10-01 00:32:07,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-10-01 00:32:07,943 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 323 transitions. [2018-10-01 00:32:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-01 00:32:07,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:07,944 INFO L375 BasicCegarLoop]: trace histogram [153, 152, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:32:07,944 INFO L423 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:07,945 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:07,945 INFO L82 PathProgramCache]: Analyzing trace with hash -516062604, now seen corresponding path program 151 times [2018-10-01 00:32:07,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:07,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:07,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:07,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:32:07,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 23274 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:09,237 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:09,237 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:09,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:09,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 23274 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:10,060 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:10,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154, 154] total 154 [2018-10-01 00:32:10,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-10-01 00:32:10,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-10-01 00:32:10,062 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:10,062 INFO L87 Difference]: Start difference. First operand 321 states and 323 transitions. Second operand 155 states. [2018-10-01 00:32:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:11,484 INFO L93 Difference]: Finished difference Result 337 states and 341 transitions. [2018-10-01 00:32:11,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-01 00:32:11,484 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 320 [2018-10-01 00:32:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:11,485 INFO L225 Difference]: With dead ends: 337 [2018-10-01 00:32:11,485 INFO L226 Difference]: Without dead ends: 323 [2018-10-01 00:32:11,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:32:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-01 00:32:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-10-01 00:32:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-01 00:32:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 325 transitions. [2018-10-01 00:32:11,494 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 325 transitions. Word has length 320 [2018-10-01 00:32:11,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:11,494 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 325 transitions. [2018-10-01 00:32:11,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-10-01 00:32:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 325 transitions. [2018-10-01 00:32:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-01 00:32:11,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:11,495 INFO L375 BasicCegarLoop]: trace histogram [154, 153, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:32:11,495 INFO L423 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:11,495 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:11,495 INFO L82 PathProgramCache]: Analyzing trace with hash -408089232, now seen corresponding path program 152 times [2018-10-01 00:32:11,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:11,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:11,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:11,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:11,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 23580 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:12,807 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:12,807 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:12,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:32:13,023 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:32:13,023 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:32:13,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:13,845 INFO L134 CoverageAnalysis]: Checked inductivity of 23580 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:13,866 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:13,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155, 155] total 155 [2018-10-01 00:32:13,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-10-01 00:32:13,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-10-01 00:32:13,868 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:13,868 INFO L87 Difference]: Start difference. First operand 323 states and 325 transitions. Second operand 156 states. [2018-10-01 00:32:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:16,483 INFO L93 Difference]: Finished difference Result 339 states and 343 transitions. [2018-10-01 00:32:16,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-01 00:32:16,483 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 322 [2018-10-01 00:32:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:16,484 INFO L225 Difference]: With dead ends: 339 [2018-10-01 00:32:16,484 INFO L226 Difference]: Without dead ends: 325 [2018-10-01 00:32:16,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:32:16,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-01 00:32:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-10-01 00:32:16,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-01 00:32:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 327 transitions. [2018-10-01 00:32:16,497 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 327 transitions. Word has length 322 [2018-10-01 00:32:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:16,497 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 327 transitions. [2018-10-01 00:32:16,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-10-01 00:32:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 327 transitions. [2018-10-01 00:32:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-01 00:32:16,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:16,499 INFO L375 BasicCegarLoop]: trace histogram [155, 154, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:32:16,499 INFO L423 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:16,499 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:16,499 INFO L82 PathProgramCache]: Analyzing trace with hash 275106156, now seen corresponding path program 153 times [2018-10-01 00:32:16,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:16,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:16,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:16,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:32:16,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 23888 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:17,939 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:17,939 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:17,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:32:18,745 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 155 check-sat command(s) [2018-10-01 00:32:18,745 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:32:18,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 23888 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:19,351 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:19,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156, 156] total 156 [2018-10-01 00:32:19,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-10-01 00:32:19,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-10-01 00:32:19,353 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:19,353 INFO L87 Difference]: Start difference. First operand 325 states and 327 transitions. Second operand 157 states. [2018-10-01 00:32:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:21,657 INFO L93 Difference]: Finished difference Result 341 states and 345 transitions. [2018-10-01 00:32:21,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-01 00:32:21,657 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 324 [2018-10-01 00:32:21,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:21,658 INFO L225 Difference]: With dead ends: 341 [2018-10-01 00:32:21,658 INFO L226 Difference]: Without dead ends: 327 [2018-10-01 00:32:21,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:32:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-01 00:32:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-10-01 00:32:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-01 00:32:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 329 transitions. [2018-10-01 00:32:21,667 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 329 transitions. Word has length 324 [2018-10-01 00:32:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:21,667 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 329 transitions. [2018-10-01 00:32:21,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-10-01 00:32:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 329 transitions. [2018-10-01 00:32:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-01 00:32:21,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:21,668 INFO L375 BasicCegarLoop]: trace histogram [156, 155, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:32:21,668 INFO L423 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:21,668 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:21,669 INFO L82 PathProgramCache]: Analyzing trace with hash -304122264, now seen corresponding path program 154 times [2018-10-01 00:32:21,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:21,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:21,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:21,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:32:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 24198 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:22,993 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:22,994 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:23,001 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:32:23,210 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:32:23,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:32:23,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 24198 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:24,057 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:24,057 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157, 157] total 157 [2018-10-01 00:32:24,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-10-01 00:32:24,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-10-01 00:32:24,059 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:24,059 INFO L87 Difference]: Start difference. First operand 327 states and 329 transitions. Second operand 158 states. [2018-10-01 00:32:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:26,259 INFO L93 Difference]: Finished difference Result 343 states and 347 transitions. [2018-10-01 00:32:26,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-10-01 00:32:26,260 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 326 [2018-10-01 00:32:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:26,260 INFO L225 Difference]: With dead ends: 343 [2018-10-01 00:32:26,260 INFO L226 Difference]: Without dead ends: 329 [2018-10-01 00:32:26,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:32:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-01 00:32:26,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-10-01 00:32:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-01 00:32:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 331 transitions. [2018-10-01 00:32:26,269 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 331 transitions. Word has length 326 [2018-10-01 00:32:26,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:26,270 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 331 transitions. [2018-10-01 00:32:26,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-10-01 00:32:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 331 transitions. [2018-10-01 00:32:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-01 00:32:26,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:26,271 INFO L375 BasicCegarLoop]: trace histogram [157, 156, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:32:26,271 INFO L423 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:26,271 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:26,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1403114596, now seen corresponding path program 155 times [2018-10-01 00:32:26,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:26,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:26,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:26,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:32:26,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 24510 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:27,609 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:27,609 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:27,616 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:32:28,380 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 157 check-sat command(s) [2018-10-01 00:32:28,380 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:32:28,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 24510 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:29,251 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:29,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158, 158] total 158 [2018-10-01 00:32:29,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-10-01 00:32:29,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-10-01 00:32:29,253 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:29,254 INFO L87 Difference]: Start difference. First operand 329 states and 331 transitions. Second operand 159 states. [2018-10-01 00:32:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:31,418 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2018-10-01 00:32:31,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-01 00:32:31,418 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 328 [2018-10-01 00:32:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:31,419 INFO L225 Difference]: With dead ends: 345 [2018-10-01 00:32:31,419 INFO L226 Difference]: Without dead ends: 331 [2018-10-01 00:32:31,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:32:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-01 00:32:31,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-10-01 00:32:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-01 00:32:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 333 transitions. [2018-10-01 00:32:31,427 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 333 transitions. Word has length 328 [2018-10-01 00:32:31,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:31,427 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 333 transitions. [2018-10-01 00:32:31,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-10-01 00:32:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 333 transitions. [2018-10-01 00:32:31,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-01 00:32:31,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:31,428 INFO L375 BasicCegarLoop]: trace histogram [158, 157, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:32:31,428 INFO L423 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:31,429 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:31,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1380229984, now seen corresponding path program 156 times [2018-10-01 00:32:31,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:31,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:31,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:31,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:32:31,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 24824 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:32,822 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:32,822 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:32,829 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:32:33,562 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 158 check-sat command(s) [2018-10-01 00:32:33,562 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:32:33,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 24824 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:34,383 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:34,384 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159, 159] total 159 [2018-10-01 00:32:34,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-10-01 00:32:34,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-10-01 00:32:34,386 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:34,386 INFO L87 Difference]: Start difference. First operand 331 states and 333 transitions. Second operand 160 states. [2018-10-01 00:32:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:37,231 INFO L93 Difference]: Finished difference Result 347 states and 351 transitions. [2018-10-01 00:32:37,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-10-01 00:32:37,232 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 330 [2018-10-01 00:32:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:37,232 INFO L225 Difference]: With dead ends: 347 [2018-10-01 00:32:37,232 INFO L226 Difference]: Without dead ends: 333 [2018-10-01 00:32:37,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:32:37,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-01 00:32:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-10-01 00:32:37,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-01 00:32:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 335 transitions. [2018-10-01 00:32:37,240 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 335 transitions. Word has length 330 [2018-10-01 00:32:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:37,241 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 335 transitions. [2018-10-01 00:32:37,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-10-01 00:32:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 335 transitions. [2018-10-01 00:32:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-01 00:32:37,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:37,242 INFO L375 BasicCegarLoop]: trace histogram [159, 158, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:32:37,242 INFO L423 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:37,242 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:37,242 INFO L82 PathProgramCache]: Analyzing trace with hash 862954332, now seen corresponding path program 157 times [2018-10-01 00:32:37,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:37,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:37,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:37,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:32:37,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 25140 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:38,634 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:38,634 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:38,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:38,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 25140 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:39,610 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:39,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160, 160] total 160 [2018-10-01 00:32:39,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-10-01 00:32:39,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-10-01 00:32:39,612 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:39,612 INFO L87 Difference]: Start difference. First operand 333 states and 335 transitions. Second operand 161 states. [2018-10-01 00:32:41,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:41,228 INFO L93 Difference]: Finished difference Result 349 states and 353 transitions. [2018-10-01 00:32:41,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-10-01 00:32:41,228 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 332 [2018-10-01 00:32:41,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:41,229 INFO L225 Difference]: With dead ends: 349 [2018-10-01 00:32:41,229 INFO L226 Difference]: Without dead ends: 335 [2018-10-01 00:32:41,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:32:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-01 00:32:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-10-01 00:32:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-01 00:32:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 337 transitions. [2018-10-01 00:32:41,242 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 337 transitions. Word has length 332 [2018-10-01 00:32:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:41,242 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 337 transitions. [2018-10-01 00:32:41,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-10-01 00:32:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 337 transitions. [2018-10-01 00:32:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-01 00:32:41,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:41,244 INFO L375 BasicCegarLoop]: trace histogram [160, 159, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:32:41,244 INFO L423 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:41,244 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:41,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1977259096, now seen corresponding path program 158 times [2018-10-01 00:32:41,244 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:41,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:41,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:41,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:41,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 25458 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:42,738 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:42,738 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:42,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:32:42,976 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:32:42,976 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:32:42,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:43,699 INFO L134 CoverageAnalysis]: Checked inductivity of 25458 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:43,721 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:43,721 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161, 161] total 161 [2018-10-01 00:32:43,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-10-01 00:32:43,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-10-01 00:32:43,724 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:43,724 INFO L87 Difference]: Start difference. First operand 335 states and 337 transitions. Second operand 162 states. [2018-10-01 00:32:45,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:45,883 INFO L93 Difference]: Finished difference Result 351 states and 355 transitions. [2018-10-01 00:32:45,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-01 00:32:45,883 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 334 [2018-10-01 00:32:45,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:45,884 INFO L225 Difference]: With dead ends: 351 [2018-10-01 00:32:45,884 INFO L226 Difference]: Without dead ends: 337 [2018-10-01 00:32:45,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:32:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-01 00:32:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-10-01 00:32:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-01 00:32:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 339 transitions. [2018-10-01 00:32:45,893 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 339 transitions. Word has length 334 [2018-10-01 00:32:45,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:45,893 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 339 transitions. [2018-10-01 00:32:45,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-10-01 00:32:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 339 transitions. [2018-10-01 00:32:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-01 00:32:45,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:45,894 INFO L375 BasicCegarLoop]: trace histogram [161, 160, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:32:45,894 INFO L423 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:45,894 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:45,894 INFO L82 PathProgramCache]: Analyzing trace with hash -917686700, now seen corresponding path program 159 times [2018-10-01 00:32:45,895 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:45,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:45,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:45,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:32:45,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 25778 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:47,309 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:47,309 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:47,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:32:48,202 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 161 check-sat command(s) [2018-10-01 00:32:48,202 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:32:48,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 25778 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:48,835 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:48,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162, 162] total 162 [2018-10-01 00:32:48,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-10-01 00:32:48,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-10-01 00:32:48,837 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:48,838 INFO L87 Difference]: Start difference. First operand 337 states and 339 transitions. Second operand 163 states. [2018-10-01 00:32:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:51,783 INFO L93 Difference]: Finished difference Result 353 states and 357 transitions. [2018-10-01 00:32:51,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-10-01 00:32:51,783 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 336 [2018-10-01 00:32:51,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:51,784 INFO L225 Difference]: With dead ends: 353 [2018-10-01 00:32:51,784 INFO L226 Difference]: Without dead ends: 339 [2018-10-01 00:32:51,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:32:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-01 00:32:51,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-10-01 00:32:51,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-01 00:32:51,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 341 transitions. [2018-10-01 00:32:51,792 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 341 transitions. Word has length 336 [2018-10-01 00:32:51,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:51,792 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 341 transitions. [2018-10-01 00:32:51,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-10-01 00:32:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 341 transitions. [2018-10-01 00:32:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-01 00:32:51,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:51,794 INFO L375 BasicCegarLoop]: trace histogram [162, 161, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:32:51,794 INFO L423 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:51,794 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:51,794 INFO L82 PathProgramCache]: Analyzing trace with hash 178211152, now seen corresponding path program 160 times [2018-10-01 00:32:51,794 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:51,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:51,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:51,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:32:51,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:53,239 INFO L134 CoverageAnalysis]: Checked inductivity of 26100 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:53,239 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:53,239 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:53,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:32:53,461 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:32:53,461 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:32:53,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 26100 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:54,103 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:54,103 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163, 163] total 163 [2018-10-01 00:32:54,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-10-01 00:32:54,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-10-01 00:32:54,105 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:54,105 INFO L87 Difference]: Start difference. First operand 339 states and 341 transitions. Second operand 164 states. [2018-10-01 00:32:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:57,147 INFO L93 Difference]: Finished difference Result 355 states and 359 transitions. [2018-10-01 00:32:57,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-01 00:32:57,147 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 338 [2018-10-01 00:32:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:57,148 INFO L225 Difference]: With dead ends: 355 [2018-10-01 00:32:57,148 INFO L226 Difference]: Without dead ends: 341 [2018-10-01 00:32:57,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:32:57,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-10-01 00:32:57,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-10-01 00:32:57,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-01 00:32:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 343 transitions. [2018-10-01 00:32:57,157 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 343 transitions. Word has length 338 [2018-10-01 00:32:57,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:57,157 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 343 transitions. [2018-10-01 00:32:57,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-10-01 00:32:57,157 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 343 transitions. [2018-10-01 00:32:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-10-01 00:32:57,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:57,159 INFO L375 BasicCegarLoop]: trace histogram [163, 162, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:32:57,159 INFO L423 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:57,159 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:57,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1069059404, now seen corresponding path program 161 times [2018-10-01 00:32:57,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:57,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:57,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:57,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:32:57,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 26424 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:32:58,544 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:58,544 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:58,552 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:32:59,366 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 163 check-sat command(s) [2018-10-01 00:32:59,366 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:32:59,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 26424 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:00,100 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:00,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164, 164] total 164 [2018-10-01 00:33:00,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-10-01 00:33:00,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-10-01 00:33:00,102 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:00,102 INFO L87 Difference]: Start difference. First operand 341 states and 343 transitions. Second operand 165 states. [2018-10-01 00:33:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:03,189 INFO L93 Difference]: Finished difference Result 357 states and 361 transitions. [2018-10-01 00:33:03,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-01 00:33:03,190 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 340 [2018-10-01 00:33:03,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:03,191 INFO L225 Difference]: With dead ends: 357 [2018-10-01 00:33:03,191 INFO L226 Difference]: Without dead ends: 343 [2018-10-01 00:33:03,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:33:03,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-01 00:33:03,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-10-01 00:33:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-01 00:33:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 345 transitions. [2018-10-01 00:33:03,199 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 345 transitions. Word has length 340 [2018-10-01 00:33:03,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:03,199 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 345 transitions. [2018-10-01 00:33:03,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-10-01 00:33:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 345 transitions. [2018-10-01 00:33:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-01 00:33:03,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:03,201 INFO L375 BasicCegarLoop]: trace histogram [164, 163, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:33:03,201 INFO L423 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:03,201 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:03,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1819229624, now seen corresponding path program 162 times [2018-10-01 00:33:03,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:03,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:03,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:03,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:33:03,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 26750 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:04,954 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:04,954 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:04,962 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:33:05,749 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 164 check-sat command(s) [2018-10-01 00:33:05,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:33:05,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 26750 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:06,379 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:06,380 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165, 165] total 165 [2018-10-01 00:33:06,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-10-01 00:33:06,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-10-01 00:33:06,382 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:06,382 INFO L87 Difference]: Start difference. First operand 343 states and 345 transitions. Second operand 166 states. [2018-10-01 00:33:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:09,363 INFO L93 Difference]: Finished difference Result 359 states and 363 transitions. [2018-10-01 00:33:09,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-10-01 00:33:09,363 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 342 [2018-10-01 00:33:09,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:09,364 INFO L225 Difference]: With dead ends: 359 [2018-10-01 00:33:09,364 INFO L226 Difference]: Without dead ends: 345 [2018-10-01 00:33:09,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:33:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-01 00:33:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2018-10-01 00:33:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-01 00:33:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 347 transitions. [2018-10-01 00:33:09,374 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 347 transitions. Word has length 342 [2018-10-01 00:33:09,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:09,374 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 347 transitions. [2018-10-01 00:33:09,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-10-01 00:33:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 347 transitions. [2018-10-01 00:33:09,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-10-01 00:33:09,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:09,375 INFO L375 BasicCegarLoop]: trace histogram [165, 164, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:33:09,375 INFO L423 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:09,375 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:09,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1378854980, now seen corresponding path program 163 times [2018-10-01 00:33:09,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:09,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:09,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:09,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:33:09,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 27078 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:10,891 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:10,891 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:10,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:11,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 27078 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:11,754 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:11,754 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166, 166] total 166 [2018-10-01 00:33:11,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-10-01 00:33:11,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-10-01 00:33:11,756 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:11,756 INFO L87 Difference]: Start difference. First operand 345 states and 347 transitions. Second operand 167 states. [2018-10-01 00:33:14,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:14,844 INFO L93 Difference]: Finished difference Result 361 states and 365 transitions. [2018-10-01 00:33:14,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-10-01 00:33:14,844 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 344 [2018-10-01 00:33:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:14,845 INFO L225 Difference]: With dead ends: 361 [2018-10-01 00:33:14,845 INFO L226 Difference]: Without dead ends: 347 [2018-10-01 00:33:14,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:33:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-01 00:33:14,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-10-01 00:33:14,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-01 00:33:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 349 transitions. [2018-10-01 00:33:14,854 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 349 transitions. Word has length 344 [2018-10-01 00:33:14,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:14,854 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 349 transitions. [2018-10-01 00:33:14,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-10-01 00:33:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 349 transitions. [2018-10-01 00:33:14,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-01 00:33:14,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:14,855 INFO L375 BasicCegarLoop]: trace histogram [166, 165, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:33:14,856 INFO L423 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:14,856 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:14,856 INFO L82 PathProgramCache]: Analyzing trace with hash -458424512, now seen corresponding path program 164 times [2018-10-01 00:33:14,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:14,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:14,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:14,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:14,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:16,345 INFO L134 CoverageAnalysis]: Checked inductivity of 27408 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:16,346 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:16,346 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:16,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:33:16,580 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:33:16,580 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:33:16,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 27408 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:17,279 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:17,280 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167, 167] total 167 [2018-10-01 00:33:17,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-10-01 00:33:17,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-10-01 00:33:17,282 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:17,282 INFO L87 Difference]: Start difference. First operand 347 states and 349 transitions. Second operand 168 states. [2018-10-01 00:33:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:19,721 INFO L93 Difference]: Finished difference Result 363 states and 367 transitions. [2018-10-01 00:33:19,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-01 00:33:19,721 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 346 [2018-10-01 00:33:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:19,722 INFO L225 Difference]: With dead ends: 363 [2018-10-01 00:33:19,722 INFO L226 Difference]: Without dead ends: 349 [2018-10-01 00:33:19,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:33:19,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-01 00:33:19,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-10-01 00:33:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-01 00:33:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 351 transitions. [2018-10-01 00:33:19,731 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 351 transitions. Word has length 346 [2018-10-01 00:33:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:19,731 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 351 transitions. [2018-10-01 00:33:19,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-10-01 00:33:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 351 transitions. [2018-10-01 00:33:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-01 00:33:19,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:19,732 INFO L375 BasicCegarLoop]: trace histogram [167, 166, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:33:19,732 INFO L423 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:19,732 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:19,733 INFO L82 PathProgramCache]: Analyzing trace with hash -852457668, now seen corresponding path program 165 times [2018-10-01 00:33:19,733 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:19,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:19,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:19,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:33:19,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 27740 backedges. 0 proven. 27722 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:21,296 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:21,296 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:21,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:33:22,237 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 167 check-sat command(s) [2018-10-01 00:33:22,237 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:33:22,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 27740 backedges. 0 proven. 27722 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:22,888 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:22,888 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168, 168] total 168 [2018-10-01 00:33:22,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-10-01 00:33:22,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-10-01 00:33:22,891 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:22,891 INFO L87 Difference]: Start difference. First operand 349 states and 351 transitions. Second operand 169 states. [2018-10-01 00:33:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:24,786 INFO L93 Difference]: Finished difference Result 365 states and 369 transitions. [2018-10-01 00:33:24,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-10-01 00:33:24,786 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 348 [2018-10-01 00:33:24,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:24,787 INFO L225 Difference]: With dead ends: 365 [2018-10-01 00:33:24,787 INFO L226 Difference]: Without dead ends: 351 [2018-10-01 00:33:24,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:33:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-01 00:33:24,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-10-01 00:33:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-01 00:33:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 353 transitions. [2018-10-01 00:33:24,800 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 353 transitions. Word has length 348 [2018-10-01 00:33:24,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:24,801 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 353 transitions. [2018-10-01 00:33:24,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-10-01 00:33:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 353 transitions. [2018-10-01 00:33:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-01 00:33:24,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:24,802 INFO L375 BasicCegarLoop]: trace histogram [168, 167, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:33:24,803 INFO L423 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:24,803 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:24,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1561198536, now seen corresponding path program 166 times [2018-10-01 00:33:24,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:24,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:24,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:24,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:33:24,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 28074 backedges. 0 proven. 28056 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:26,381 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:26,381 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:26,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:33:26,608 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:33:26,609 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:33:26,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 28074 backedges. 0 proven. 28056 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:27,313 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:27,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169, 169] total 169 [2018-10-01 00:33:27,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-10-01 00:33:27,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-10-01 00:33:27,315 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:27,315 INFO L87 Difference]: Start difference. First operand 351 states and 353 transitions. Second operand 170 states. [2018-10-01 00:33:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:30,841 INFO L93 Difference]: Finished difference Result 367 states and 371 transitions. [2018-10-01 00:33:30,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-10-01 00:33:30,841 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 350 [2018-10-01 00:33:30,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:30,842 INFO L225 Difference]: With dead ends: 367 [2018-10-01 00:33:30,842 INFO L226 Difference]: Without dead ends: 353 [2018-10-01 00:33:30,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:33:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-10-01 00:33:30,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-10-01 00:33:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-01 00:33:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 355 transitions. [2018-10-01 00:33:30,851 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 355 transitions. Word has length 350 [2018-10-01 00:33:30,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:30,851 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 355 transitions. [2018-10-01 00:33:30,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-10-01 00:33:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 355 transitions. [2018-10-01 00:33:30,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-01 00:33:30,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:30,852 INFO L375 BasicCegarLoop]: trace histogram [169, 168, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:33:30,852 INFO L423 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:30,853 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:30,853 INFO L82 PathProgramCache]: Analyzing trace with hash 238627380, now seen corresponding path program 167 times [2018-10-01 00:33:30,853 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:30,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:30,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:30,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:33:30,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 28410 backedges. 0 proven. 28392 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:32,391 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:32,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 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:32,399 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:33:33,265 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 169 check-sat command(s) [2018-10-01 00:33:33,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:33:33,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:33,905 INFO L134 CoverageAnalysis]: Checked inductivity of 28410 backedges. 0 proven. 28392 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:33,927 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:33,927 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170, 170] total 170 [2018-10-01 00:33:33,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-10-01 00:33:33,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-10-01 00:33:33,930 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:33,930 INFO L87 Difference]: Start difference. First operand 353 states and 355 transitions. Second operand 171 states. [2018-10-01 00:33:36,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:36,907 INFO L93 Difference]: Finished difference Result 369 states and 373 transitions. [2018-10-01 00:33:36,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-01 00:33:36,908 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 352 [2018-10-01 00:33:36,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:36,908 INFO L225 Difference]: With dead ends: 369 [2018-10-01 00:33:36,909 INFO L226 Difference]: Without dead ends: 355 [2018-10-01 00:33:36,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:33:36,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-01 00:33:36,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-10-01 00:33:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-01 00:33:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 357 transitions. [2018-10-01 00:33:36,917 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 357 transitions. Word has length 352 [2018-10-01 00:33:36,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:36,918 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 357 transitions. [2018-10-01 00:33:36,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-10-01 00:33:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 357 transitions. [2018-10-01 00:33:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-01 00:33:36,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:36,919 INFO L375 BasicCegarLoop]: trace histogram [170, 169, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:33:36,919 INFO L423 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:36,919 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:36,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1000487632, now seen corresponding path program 168 times [2018-10-01 00:33:36,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:36,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:36,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:36,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:33:36,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 28748 backedges. 0 proven. 28730 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:38,461 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:38,461 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:38,469 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:33:39,322 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 170 check-sat command(s) [2018-10-01 00:33:39,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:33:39,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 28748 backedges. 0 proven. 28730 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:39,990 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:39,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171, 171] total 171 [2018-10-01 00:33:39,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-10-01 00:33:39,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-10-01 00:33:39,993 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:39,993 INFO L87 Difference]: Start difference. First operand 355 states and 357 transitions. Second operand 172 states. [2018-10-01 00:33:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:42,558 INFO L93 Difference]: Finished difference Result 371 states and 375 transitions. [2018-10-01 00:33:42,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-10-01 00:33:42,558 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 354 [2018-10-01 00:33:42,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:42,559 INFO L225 Difference]: With dead ends: 371 [2018-10-01 00:33:42,559 INFO L226 Difference]: Without dead ends: 357 [2018-10-01 00:33:42,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:33:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-01 00:33:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2018-10-01 00:33:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-10-01 00:33:42,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 359 transitions. [2018-10-01 00:33:42,568 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 359 transitions. Word has length 354 [2018-10-01 00:33:42,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:42,568 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 359 transitions. [2018-10-01 00:33:42,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-10-01 00:33:42,568 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 359 transitions. [2018-10-01 00:33:42,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-01 00:33:42,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:42,569 INFO L375 BasicCegarLoop]: trace histogram [171, 170, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:33:42,569 INFO L423 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:42,569 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:42,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2084073172, now seen corresponding path program 169 times [2018-10-01 00:33:42,570 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:42,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:42,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:42,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:33:42,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 29088 backedges. 0 proven. 29070 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:44,184 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:44,185 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:44,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:44,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 29088 backedges. 0 proven. 29070 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:45,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:45,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172, 172] total 172 [2018-10-01 00:33:45,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-10-01 00:33:45,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-10-01 00:33:45,152 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:45,153 INFO L87 Difference]: Start difference. First operand 357 states and 359 transitions. Second operand 173 states. [2018-10-01 00:33:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:48,836 INFO L93 Difference]: Finished difference Result 373 states and 377 transitions. [2018-10-01 00:33:48,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-10-01 00:33:48,836 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 356 [2018-10-01 00:33:48,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:48,837 INFO L225 Difference]: With dead ends: 373 [2018-10-01 00:33:48,837 INFO L226 Difference]: Without dead ends: 359 [2018-10-01 00:33:48,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:33:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-01 00:33:48,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-10-01 00:33:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-01 00:33:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 361 transitions. [2018-10-01 00:33:48,846 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 361 transitions. Word has length 356 [2018-10-01 00:33:48,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:48,846 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 361 transitions. [2018-10-01 00:33:48,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-10-01 00:33:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 361 transitions. [2018-10-01 00:33:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-01 00:33:48,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:48,847 INFO L375 BasicCegarLoop]: trace histogram [172, 171, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:33:48,847 INFO L423 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:48,848 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:48,848 INFO L82 PathProgramCache]: Analyzing trace with hash 267275816, now seen corresponding path program 170 times [2018-10-01 00:33:48,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:48,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:48,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:48,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:48,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 29430 backedges. 0 proven. 29412 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:50,595 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:50,595 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:50,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:33:50,836 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:33:50,836 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:33:50,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 29430 backedges. 0 proven. 29412 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:51,514 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:51,514 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173, 173] total 173 [2018-10-01 00:33:51,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-10-01 00:33:51,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-10-01 00:33:51,517 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:51,517 INFO L87 Difference]: Start difference. First operand 359 states and 361 transitions. Second operand 174 states. [2018-10-01 00:33:55,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:55,135 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2018-10-01 00:33:55,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-01 00:33:55,136 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 358 [2018-10-01 00:33:55,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:55,136 INFO L225 Difference]: With dead ends: 375 [2018-10-01 00:33:55,136 INFO L226 Difference]: Without dead ends: 361 [2018-10-01 00:33:55,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:33:55,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-10-01 00:33:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2018-10-01 00:33:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-01 00:33:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 363 transitions. [2018-10-01 00:33:55,147 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 363 transitions. Word has length 358 [2018-10-01 00:33:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:55,147 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 363 transitions. [2018-10-01 00:33:55,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-10-01 00:33:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 363 transitions. [2018-10-01 00:33:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-10-01 00:33:55,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:55,148 INFO L375 BasicCegarLoop]: trace histogram [173, 172, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:33:55,148 INFO L423 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:55,148 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:55,149 INFO L82 PathProgramCache]: Analyzing trace with hash 760855588, now seen corresponding path program 171 times [2018-10-01 00:33:55,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:55,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:55,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:55,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:33:55,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 29774 backedges. 0 proven. 29756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:56,901 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:56,901 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:56,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:33:57,903 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 173 check-sat command(s) [2018-10-01 00:33:57,904 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:33:57,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 29774 backedges. 0 proven. 29756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:33:58,572 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:58,572 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174, 174] total 174 [2018-10-01 00:33:58,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-10-01 00:33:58,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-10-01 00:33:58,575 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:58,575 INFO L87 Difference]: Start difference. First operand 361 states and 363 transitions. Second operand 175 states. [2018-10-01 00:34:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:00,748 INFO L93 Difference]: Finished difference Result 377 states and 381 transitions. [2018-10-01 00:34:00,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-10-01 00:34:00,748 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 360 [2018-10-01 00:34:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:00,748 INFO L225 Difference]: With dead ends: 377 [2018-10-01 00:34:00,749 INFO L226 Difference]: Without dead ends: 363 [2018-10-01 00:34:00,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:34:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-01 00:34:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-10-01 00:34:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-01 00:34:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 365 transitions. [2018-10-01 00:34:00,757 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 365 transitions. Word has length 360 [2018-10-01 00:34:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:00,758 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 365 transitions. [2018-10-01 00:34:00,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-10-01 00:34:00,758 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 365 transitions. [2018-10-01 00:34:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-01 00:34:00,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:00,759 INFO L375 BasicCegarLoop]: trace histogram [174, 173, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:34:00,759 INFO L423 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:00,759 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:00,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1650353376, now seen corresponding path program 172 times [2018-10-01 00:34:00,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:00,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:00,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:00,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:34:00,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 30120 backedges. 0 proven. 30102 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:02,424 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:02,424 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:34:02,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:34:02,670 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:34:02,670 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:34:02,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 30120 backedges. 0 proven. 30102 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:03,390 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:03,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175, 175] total 175 [2018-10-01 00:34:03,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-10-01 00:34:03,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-10-01 00:34:03,392 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:03,392 INFO L87 Difference]: Start difference. First operand 363 states and 365 transitions. Second operand 176 states. [2018-10-01 00:34:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:07,022 INFO L93 Difference]: Finished difference Result 379 states and 383 transitions. [2018-10-01 00:34:07,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-10-01 00:34:07,023 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 362 [2018-10-01 00:34:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:07,023 INFO L225 Difference]: With dead ends: 379 [2018-10-01 00:34:07,023 INFO L226 Difference]: Without dead ends: 365 [2018-10-01 00:34:07,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:34:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-01 00:34:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2018-10-01 00:34:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-10-01 00:34:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 367 transitions. [2018-10-01 00:34:07,032 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 367 transitions. Word has length 362 [2018-10-01 00:34:07,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:07,033 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 367 transitions. [2018-10-01 00:34:07,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-10-01 00:34:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 367 transitions. [2018-10-01 00:34:07,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-10-01 00:34:07,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:07,034 INFO L375 BasicCegarLoop]: trace histogram [175, 174, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:34:07,034 INFO L423 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:07,034 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:07,034 INFO L82 PathProgramCache]: Analyzing trace with hash 460172060, now seen corresponding path program 173 times [2018-10-01 00:34:07,034 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:07,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:07,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:07,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:34:07,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 30468 backedges. 0 proven. 30450 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:08,730 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:08,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 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:34:08,773 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:34:09,715 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 175 check-sat command(s) [2018-10-01 00:34:09,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:34:09,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30468 backedges. 0 proven. 30450 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:10,398 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:10,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176, 176] total 176 [2018-10-01 00:34:10,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-10-01 00:34:10,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-10-01 00:34:10,400 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:10,400 INFO L87 Difference]: Start difference. First operand 365 states and 367 transitions. Second operand 177 states. [2018-10-01 00:34:14,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:14,314 INFO L93 Difference]: Finished difference Result 381 states and 385 transitions. [2018-10-01 00:34:14,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-01 00:34:14,315 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 364 [2018-10-01 00:34:14,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:14,315 INFO L225 Difference]: With dead ends: 381 [2018-10-01 00:34:14,315 INFO L226 Difference]: Without dead ends: 367 [2018-10-01 00:34:14,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:34:14,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-01 00:34:14,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-10-01 00:34:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-01 00:34:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 369 transitions. [2018-10-01 00:34:14,324 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 369 transitions. Word has length 364 [2018-10-01 00:34:14,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:14,325 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 369 transitions. [2018-10-01 00:34:14,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-10-01 00:34:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 369 transitions. [2018-10-01 00:34:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-01 00:34:14,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:14,327 INFO L375 BasicCegarLoop]: trace histogram [176, 175, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:34:14,327 INFO L423 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:14,327 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:14,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1450552344, now seen corresponding path program 174 times [2018-10-01 00:34:14,327 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:14,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:14,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:14,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:34:14,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30818 backedges. 0 proven. 30800 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:16,129 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:16,129 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:34:16,138 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:34:17,047 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 176 check-sat command(s) [2018-10-01 00:34:17,047 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:34:17,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:17,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30818 backedges. 0 proven. 30800 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:17,707 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:17,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177, 177] total 177 [2018-10-01 00:34:17,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-10-01 00:34:17,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-10-01 00:34:17,710 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:17,710 INFO L87 Difference]: Start difference. First operand 367 states and 369 transitions. Second operand 178 states. [2018-10-01 00:34:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:21,922 INFO L93 Difference]: Finished difference Result 383 states and 387 transitions. [2018-10-01 00:34:21,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-10-01 00:34:21,922 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 366 [2018-10-01 00:34:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:21,923 INFO L225 Difference]: With dead ends: 383 [2018-10-01 00:34:21,923 INFO L226 Difference]: Without dead ends: 369 [2018-10-01 00:34:21,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:34:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-01 00:34:21,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2018-10-01 00:34:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-10-01 00:34:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 371 transitions. [2018-10-01 00:34:21,932 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 371 transitions. Word has length 366 [2018-10-01 00:34:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:21,932 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 371 transitions. [2018-10-01 00:34:21,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-10-01 00:34:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 371 transitions. [2018-10-01 00:34:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-01 00:34:21,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:21,933 INFO L375 BasicCegarLoop]: trace histogram [177, 176, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:34:21,934 INFO L423 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:21,934 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:21,934 INFO L82 PathProgramCache]: Analyzing trace with hash -276734444, now seen corresponding path program 175 times [2018-10-01 00:34:21,934 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:21,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:21,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:21,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:34:21,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 31170 backedges. 0 proven. 31152 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:23,597 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:23,598 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:34:23,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:23,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 31170 backedges. 0 proven. 31152 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:24,551 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:24,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178, 178] total 178 [2018-10-01 00:34:24,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-10-01 00:34:24,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-10-01 00:34:24,554 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:24,554 INFO L87 Difference]: Start difference. First operand 369 states and 371 transitions. Second operand 179 states. [2018-10-01 00:34:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:28,222 INFO L93 Difference]: Finished difference Result 385 states and 389 transitions. [2018-10-01 00:34:28,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-10-01 00:34:28,222 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 368 [2018-10-01 00:34:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:28,223 INFO L225 Difference]: With dead ends: 385 [2018-10-01 00:34:28,223 INFO L226 Difference]: Without dead ends: 371 [2018-10-01 00:34:28,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:34:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-10-01 00:34:28,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-10-01 00:34:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-01 00:34:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 373 transitions. [2018-10-01 00:34:28,232 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 373 transitions. Word has length 368 [2018-10-01 00:34:28,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:28,232 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 373 transitions. [2018-10-01 00:34:28,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-10-01 00:34:28,232 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 373 transitions. [2018-10-01 00:34:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-01 00:34:28,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:28,233 INFO L375 BasicCegarLoop]: trace histogram [178, 177, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:34:28,233 INFO L423 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:28,233 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1953005840, now seen corresponding path program 176 times [2018-10-01 00:34:28,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:28,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:28,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:28,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:28,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 31524 backedges. 0 proven. 31506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:29,980 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:29,980 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:34:29,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:34:30,231 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:34:30,232 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:34:30,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 31524 backedges. 0 proven. 31506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:31,018 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:31,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179, 179] total 179 [2018-10-01 00:34:31,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-10-01 00:34:31,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-10-01 00:34:31,021 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:31,021 INFO L87 Difference]: Start difference. First operand 371 states and 373 transitions. Second operand 180 states. [2018-10-01 00:34:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:34,985 INFO L93 Difference]: Finished difference Result 387 states and 391 transitions. [2018-10-01 00:34:34,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-01 00:34:34,985 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 370 [2018-10-01 00:34:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:34,986 INFO L225 Difference]: With dead ends: 387 [2018-10-01 00:34:34,986 INFO L226 Difference]: Without dead ends: 373 [2018-10-01 00:34:34,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:34:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-10-01 00:34:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-10-01 00:34:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-01 00:34:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 375 transitions. [2018-10-01 00:34:34,995 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 375 transitions. Word has length 370 [2018-10-01 00:34:34,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:34,995 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 375 transitions. [2018-10-01 00:34:34,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-10-01 00:34:34,995 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 375 transitions. [2018-10-01 00:34:34,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-10-01 00:34:34,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:34,996 INFO L375 BasicCegarLoop]: trace histogram [179, 178, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:34:34,997 INFO L423 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:34,997 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:34,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1544738060, now seen corresponding path program 177 times [2018-10-01 00:34:34,997 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:34,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:34,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:34,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:34:34,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 31880 backedges. 0 proven. 31862 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:36,944 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:36,944 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:34:36,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:34:38,026 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 179 check-sat command(s) [2018-10-01 00:34:38,026 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:34:38,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:38,684 INFO L134 CoverageAnalysis]: Checked inductivity of 31880 backedges. 0 proven. 31862 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:38,707 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:38,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180, 180] total 180 [2018-10-01 00:34:38,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-10-01 00:34:38,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-10-01 00:34:38,709 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:38,709 INFO L87 Difference]: Start difference. First operand 373 states and 375 transitions. Second operand 181 states. [2018-10-01 00:34:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:42,969 INFO L93 Difference]: Finished difference Result 389 states and 393 transitions. [2018-10-01 00:34:42,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-10-01 00:34:42,969 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 372 [2018-10-01 00:34:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:42,970 INFO L225 Difference]: With dead ends: 389 [2018-10-01 00:34:42,970 INFO L226 Difference]: Without dead ends: 375 [2018-10-01 00:34:42,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:34:42,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-01 00:34:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2018-10-01 00:34:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-10-01 00:34:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 377 transitions. [2018-10-01 00:34:42,979 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 377 transitions. Word has length 372 [2018-10-01 00:34:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:42,980 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 377 transitions. [2018-10-01 00:34:42,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-10-01 00:34:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 377 transitions. [2018-10-01 00:34:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-01 00:34:42,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:42,981 INFO L375 BasicCegarLoop]: trace histogram [180, 179, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:34:42,981 INFO L423 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:42,981 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:42,981 INFO L82 PathProgramCache]: Analyzing trace with hash 41425416, now seen corresponding path program 178 times [2018-10-01 00:34:42,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:42,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:42,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:42,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:34:42,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 32238 backedges. 0 proven. 32220 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:44,796 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:44,796 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:34:44,804 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:34:45,053 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:34:45,053 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:34:45,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 32238 backedges. 0 proven. 32220 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:45,788 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:45,788 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181, 181] total 181 [2018-10-01 00:34:45,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-10-01 00:34:45,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-10-01 00:34:45,791 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:45,791 INFO L87 Difference]: Start difference. First operand 375 states and 377 transitions. Second operand 182 states. [2018-10-01 00:34:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:49,973 INFO L93 Difference]: Finished difference Result 391 states and 395 transitions. [2018-10-01 00:34:49,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-10-01 00:34:49,978 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 374 [2018-10-01 00:34:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:49,979 INFO L225 Difference]: With dead ends: 391 [2018-10-01 00:34:49,979 INFO L226 Difference]: Without dead ends: 377 [2018-10-01 00:34:49,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:34:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-01 00:34:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2018-10-01 00:34:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-10-01 00:34:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 379 transitions. [2018-10-01 00:34:49,988 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 379 transitions. Word has length 374 [2018-10-01 00:34:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:49,988 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 379 transitions. [2018-10-01 00:34:49,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-10-01 00:34:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 379 transitions. [2018-10-01 00:34:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-01 00:34:49,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:49,990 INFO L375 BasicCegarLoop]: trace histogram [181, 180, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:34:49,990 INFO L423 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:49,990 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:49,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1533014012, now seen corresponding path program 179 times [2018-10-01 00:34:49,990 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:49,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:49,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:49,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:34:49,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 32598 backedges. 0 proven. 32580 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:51,817 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:51,818 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:34:51,824 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:34:52,850 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 181 check-sat command(s) [2018-10-01 00:34:52,850 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:34:52,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 32598 backedges. 0 proven. 32580 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:53,552 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:53,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182, 182] total 182 [2018-10-01 00:34:53,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-10-01 00:34:53,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-10-01 00:34:53,555 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:53,555 INFO L87 Difference]: Start difference. First operand 377 states and 379 transitions. Second operand 183 states. [2018-10-01 00:34:56,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:56,616 INFO L93 Difference]: Finished difference Result 393 states and 397 transitions. [2018-10-01 00:34:56,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-01 00:34:56,616 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 376 [2018-10-01 00:34:56,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:56,617 INFO L225 Difference]: With dead ends: 393 [2018-10-01 00:34:56,617 INFO L226 Difference]: Without dead ends: 379 [2018-10-01 00:34:56,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:34:56,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-01 00:34:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-10-01 00:34:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-01 00:34:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 381 transitions. [2018-10-01 00:34:56,628 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 381 transitions. Word has length 376 [2018-10-01 00:34:56,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:56,628 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 381 transitions. [2018-10-01 00:34:56,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-10-01 00:34:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 381 transitions. [2018-10-01 00:34:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-10-01 00:34:56,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:56,629 INFO L375 BasicCegarLoop]: trace histogram [182, 181, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:34:56,629 INFO L423 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:56,630 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1554151168, now seen corresponding path program 180 times [2018-10-01 00:34:56,630 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:56,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:56,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:56,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:34:56,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:58,488 INFO L134 CoverageAnalysis]: Checked inductivity of 32960 backedges. 0 proven. 32942 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:34:58,488 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:58,488 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:34:58,495 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:34:59,488 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 182 check-sat command(s) [2018-10-01 00:34:59,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:34:59,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 32960 backedges. 0 proven. 32942 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:00,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:00,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183, 183] total 183 [2018-10-01 00:35:00,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-10-01 00:35:00,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-10-01 00:35:00,248 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:00,248 INFO L87 Difference]: Start difference. First operand 379 states and 381 transitions. Second operand 184 states. [2018-10-01 00:35:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:02,580 INFO L93 Difference]: Finished difference Result 395 states and 399 transitions. [2018-10-01 00:35:02,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-10-01 00:35:02,580 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 378 [2018-10-01 00:35:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:02,581 INFO L225 Difference]: With dead ends: 395 [2018-10-01 00:35:02,581 INFO L226 Difference]: Without dead ends: 381 [2018-10-01 00:35:02,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:35:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-01 00:35:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-01 00:35:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-01 00:35:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 383 transitions. [2018-10-01 00:35:02,590 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 383 transitions. Word has length 378 [2018-10-01 00:35:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:02,590 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 383 transitions. [2018-10-01 00:35:02,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-10-01 00:35:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 383 transitions. [2018-10-01 00:35:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-01 00:35:02,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:02,592 INFO L375 BasicCegarLoop]: trace histogram [183, 182, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:35:02,592 INFO L423 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:02,592 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:02,592 INFO L82 PathProgramCache]: Analyzing trace with hash 497487612, now seen corresponding path program 181 times [2018-10-01 00:35:02,592 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:02,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:02,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:35:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 33324 backedges. 0 proven. 33306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:04,459 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:04,459 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:35:04,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:04,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 33324 backedges. 0 proven. 33306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:05,447 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:05,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184, 184] total 184 [2018-10-01 00:35:05,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-10-01 00:35:05,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-10-01 00:35:05,450 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:05,450 INFO L87 Difference]: Start difference. First operand 381 states and 383 transitions. Second operand 185 states. [2018-10-01 00:35:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:09,259 INFO L93 Difference]: Finished difference Result 397 states and 401 transitions. [2018-10-01 00:35:09,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-01 00:35:09,259 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 380 [2018-10-01 00:35:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:09,260 INFO L225 Difference]: With dead ends: 397 [2018-10-01 00:35:09,260 INFO L226 Difference]: Without dead ends: 383 [2018-10-01 00:35:09,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:35:09,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-01 00:35:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-10-01 00:35:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-01 00:35:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 385 transitions. [2018-10-01 00:35:09,270 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 385 transitions. Word has length 380 [2018-10-01 00:35:09,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:09,271 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 385 transitions. [2018-10-01 00:35:09,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-10-01 00:35:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 385 transitions. [2018-10-01 00:35:09,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-01 00:35:09,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:09,272 INFO L375 BasicCegarLoop]: trace histogram [184, 183, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:35:09,272 INFO L423 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:09,272 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:09,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1343907848, now seen corresponding path program 182 times [2018-10-01 00:35:09,272 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:09,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:09,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:09,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:09,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 33690 backedges. 0 proven. 33672 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:11,183 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:11,183 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:35:11,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:35:11,442 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:35:11,442 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:35:11,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 33690 backedges. 0 proven. 33672 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:12,154 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:12,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185, 185] total 185 [2018-10-01 00:35:12,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-10-01 00:35:12,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-10-01 00:35:12,157 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:12,158 INFO L87 Difference]: Start difference. First operand 383 states and 385 transitions. Second operand 186 states. [2018-10-01 00:35:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:14,781 INFO L93 Difference]: Finished difference Result 399 states and 403 transitions. [2018-10-01 00:35:14,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-01 00:35:14,781 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 382 [2018-10-01 00:35:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:14,782 INFO L225 Difference]: With dead ends: 399 [2018-10-01 00:35:14,782 INFO L226 Difference]: Without dead ends: 385 [2018-10-01 00:35:14,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:35:14,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-01 00:35:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2018-10-01 00:35:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-01 00:35:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 387 transitions. [2018-10-01 00:35:14,792 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 387 transitions. Word has length 382 [2018-10-01 00:35:14,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:14,792 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 387 transitions. [2018-10-01 00:35:14,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-10-01 00:35:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 387 transitions. [2018-10-01 00:35:14,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-10-01 00:35:14,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:14,794 INFO L375 BasicCegarLoop]: trace histogram [185, 184, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:35:14,794 INFO L423 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:14,794 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:14,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1398418956, now seen corresponding path program 183 times [2018-10-01 00:35:14,794 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:14,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:14,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:14,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:35:14,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 34058 backedges. 0 proven. 34040 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:16,650 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:16,650 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:35:16,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:35:17,817 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 185 check-sat command(s) [2018-10-01 00:35:17,817 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:35:17,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:18,571 INFO L134 CoverageAnalysis]: Checked inductivity of 34058 backedges. 0 proven. 34040 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:18,593 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:18,593 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186, 186] total 186 [2018-10-01 00:35:18,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-10-01 00:35:18,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-10-01 00:35:18,596 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:18,596 INFO L87 Difference]: Start difference. First operand 385 states and 387 transitions. Second operand 187 states. [2018-10-01 00:35:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:23,075 INFO L93 Difference]: Finished difference Result 401 states and 405 transitions. [2018-10-01 00:35:23,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-01 00:35:23,075 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 384 [2018-10-01 00:35:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:23,076 INFO L225 Difference]: With dead ends: 401 [2018-10-01 00:35:23,076 INFO L226 Difference]: Without dead ends: 387 [2018-10-01 00:35:23,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:35:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-01 00:35:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-10-01 00:35:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-01 00:35:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 389 transitions. [2018-10-01 00:35:23,086 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 389 transitions. Word has length 384 [2018-10-01 00:35:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:23,086 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 389 transitions. [2018-10-01 00:35:23,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-10-01 00:35:23,086 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 389 transitions. [2018-10-01 00:35:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-01 00:35:23,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:23,087 INFO L375 BasicCegarLoop]: trace histogram [186, 185, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:35:23,087 INFO L423 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:23,088 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:23,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2050981104, now seen corresponding path program 184 times [2018-10-01 00:35:23,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:23,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:23,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:23,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:35:23,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 34428 backedges. 0 proven. 34410 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:25,058 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:25,058 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:35:25,064 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:35:25,320 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:35:25,321 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:35:25,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 34428 backedges. 0 proven. 34410 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:26,063 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:26,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187, 187] total 187 [2018-10-01 00:35:26,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-10-01 00:35:26,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-10-01 00:35:26,066 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:26,066 INFO L87 Difference]: Start difference. First operand 387 states and 389 transitions. Second operand 188 states. [2018-10-01 00:35:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:28,311 INFO L93 Difference]: Finished difference Result 403 states and 407 transitions. [2018-10-01 00:35:28,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-01 00:35:28,311 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 386 [2018-10-01 00:35:28,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:28,312 INFO L225 Difference]: With dead ends: 403 [2018-10-01 00:35:28,312 INFO L226 Difference]: Without dead ends: 389 [2018-10-01 00:35:28,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:35:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-10-01 00:35:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-10-01 00:35:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-01 00:35:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 391 transitions. [2018-10-01 00:35:28,322 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 391 transitions. Word has length 386 [2018-10-01 00:35:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:28,322 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 391 transitions. [2018-10-01 00:35:28,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-10-01 00:35:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 391 transitions. [2018-10-01 00:35:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-01 00:35:28,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:28,323 INFO L375 BasicCegarLoop]: trace histogram [187, 186, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:35:28,323 INFO L423 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:28,324 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:28,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1209686252, now seen corresponding path program 185 times [2018-10-01 00:35:28,324 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:28,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:28,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:28,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:35:28,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 34800 backedges. 0 proven. 34782 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:30,224 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:30,224 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:35:30,231 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:35:31,323 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 187 check-sat command(s) [2018-10-01 00:35:31,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:35:31,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 34800 backedges. 0 proven. 34782 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:32,068 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:32,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188, 188] total 188 [2018-10-01 00:35:32,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-10-01 00:35:32,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-10-01 00:35:32,072 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:32,072 INFO L87 Difference]: Start difference. First operand 389 states and 391 transitions. Second operand 189 states. [2018-10-01 00:35:36,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:36,400 INFO L93 Difference]: Finished difference Result 405 states and 409 transitions. [2018-10-01 00:35:36,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-01 00:35:36,400 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 388 [2018-10-01 00:35:36,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:36,401 INFO L225 Difference]: With dead ends: 405 [2018-10-01 00:35:36,401 INFO L226 Difference]: Without dead ends: 391 [2018-10-01 00:35:36,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:35:36,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-10-01 00:35:36,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2018-10-01 00:35:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-10-01 00:35:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 393 transitions. [2018-10-01 00:35:36,411 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 393 transitions. Word has length 388 [2018-10-01 00:35:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:36,412 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 393 transitions. [2018-10-01 00:35:36,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-10-01 00:35:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 393 transitions. [2018-10-01 00:35:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-10-01 00:35:36,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:36,413 INFO L375 BasicCegarLoop]: trace histogram [188, 187, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:35:36,413 INFO L423 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:36,413 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:36,413 INFO L82 PathProgramCache]: Analyzing trace with hash 179185128, now seen corresponding path program 186 times [2018-10-01 00:35:36,414 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:36,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:36,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:36,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:35:36,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 35174 backedges. 0 proven. 35156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:38,628 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:38,628 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:35:38,636 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:35:39,682 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 188 check-sat command(s) [2018-10-01 00:35:39,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:35:39,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 35174 backedges. 0 proven. 35156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:40,431 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:40,431 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189, 189] total 189 [2018-10-01 00:35:40,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-10-01 00:35:40,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-10-01 00:35:40,433 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:40,433 INFO L87 Difference]: Start difference. First operand 391 states and 393 transitions. Second operand 190 states. [2018-10-01 00:35:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:44,740 INFO L93 Difference]: Finished difference Result 407 states and 411 transitions. [2018-10-01 00:35:44,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-10-01 00:35:44,740 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 390 [2018-10-01 00:35:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:44,741 INFO L225 Difference]: With dead ends: 407 [2018-10-01 00:35:44,741 INFO L226 Difference]: Without dead ends: 393 [2018-10-01 00:35:44,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:35:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-01 00:35:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-10-01 00:35:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-01 00:35:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 395 transitions. [2018-10-01 00:35:44,751 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 395 transitions. Word has length 390 [2018-10-01 00:35:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:44,751 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 395 transitions. [2018-10-01 00:35:44,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-10-01 00:35:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 395 transitions. [2018-10-01 00:35:44,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-01 00:35:44,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:44,753 INFO L375 BasicCegarLoop]: trace histogram [189, 188, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:35:44,753 INFO L423 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:44,753 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:44,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2005050340, now seen corresponding path program 187 times [2018-10-01 00:35:44,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:44,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:44,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:44,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:35:44,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 35550 backedges. 0 proven. 35532 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:46,645 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:46,645 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:35:46,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:46,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 35550 backedges. 0 proven. 35532 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:47,666 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:47,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190, 190] total 190 [2018-10-01 00:35:47,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-10-01 00:35:47,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-10-01 00:35:47,669 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:47,669 INFO L87 Difference]: Start difference. First operand 393 states and 395 transitions. Second operand 191 states. [2018-10-01 00:35:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:50,229 INFO L93 Difference]: Finished difference Result 409 states and 413 transitions. [2018-10-01 00:35:50,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-01 00:35:50,229 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 392 [2018-10-01 00:35:50,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:50,230 INFO L225 Difference]: With dead ends: 409 [2018-10-01 00:35:50,230 INFO L226 Difference]: Without dead ends: 395 [2018-10-01 00:35:50,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:35:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-01 00:35:50,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-01 00:35:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-01 00:35:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 397 transitions. [2018-10-01 00:35:50,239 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 397 transitions. Word has length 392 [2018-10-01 00:35:50,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:50,240 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 397 transitions. [2018-10-01 00:35:50,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-10-01 00:35:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 397 transitions. [2018-10-01 00:35:50,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-01 00:35:50,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:50,241 INFO L375 BasicCegarLoop]: trace histogram [190, 189, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:35:50,241 INFO L423 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:50,241 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:50,242 INFO L82 PathProgramCache]: Analyzing trace with hash 19895008, now seen corresponding path program 188 times [2018-10-01 00:35:50,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:50,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:50,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:50,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:50,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 35928 backedges. 0 proven. 35910 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:52,247 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:52,248 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:35:52,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:35:52,510 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:35:52,510 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:35:52,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 35928 backedges. 0 proven. 35910 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:53,312 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:53,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191, 191] total 191 [2018-10-01 00:35:53,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-10-01 00:35:53,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-10-01 00:35:53,315 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:53,315 INFO L87 Difference]: Start difference. First operand 395 states and 397 transitions. Second operand 192 states. [2018-10-01 00:35:55,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:55,684 INFO L93 Difference]: Finished difference Result 411 states and 415 transitions. [2018-10-01 00:35:55,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-01 00:35:55,685 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 394 [2018-10-01 00:35:55,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:55,685 INFO L225 Difference]: With dead ends: 411 [2018-10-01 00:35:55,685 INFO L226 Difference]: Without dead ends: 397 [2018-10-01 00:35:55,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:35:55,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-01 00:35:55,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2018-10-01 00:35:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-01 00:35:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 399 transitions. [2018-10-01 00:35:55,695 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 399 transitions. Word has length 394 [2018-10-01 00:35:55,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:55,696 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 399 transitions. [2018-10-01 00:35:55,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-10-01 00:35:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 399 transitions. [2018-10-01 00:35:55,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-01 00:35:55,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:55,698 INFO L375 BasicCegarLoop]: trace histogram [191, 190, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:35:55,698 INFO L423 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:55,698 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:55,698 INFO L82 PathProgramCache]: Analyzing trace with hash -748899620, now seen corresponding path program 189 times [2018-10-01 00:35:55,698 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:55,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:55,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:55,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:35:55,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 36308 backedges. 0 proven. 36290 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:57,789 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:57,789 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:35:57,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:35:59,053 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 191 check-sat command(s) [2018-10-01 00:35:59,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:35:59,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 36308 backedges. 0 proven. 36290 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:35:59,807 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:59,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192] total 192 [2018-10-01 00:35:59,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-10-01 00:35:59,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-10-01 00:35:59,810 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:59,810 INFO L87 Difference]: Start difference. First operand 397 states and 399 transitions. Second operand 193 states. [2018-10-01 00:36:02,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:02,425 INFO L93 Difference]: Finished difference Result 413 states and 417 transitions. [2018-10-01 00:36:02,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-10-01 00:36:02,425 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 396 [2018-10-01 00:36:02,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:02,426 INFO L225 Difference]: With dead ends: 413 [2018-10-01 00:36:02,426 INFO L226 Difference]: Without dead ends: 399 [2018-10-01 00:36:02,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:36:02,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-01 00:36:02,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-10-01 00:36:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-01 00:36:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 401 transitions. [2018-10-01 00:36:02,435 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 401 transitions. Word has length 396 [2018-10-01 00:36:02,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:02,435 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 401 transitions. [2018-10-01 00:36:02,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-10-01 00:36:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 401 transitions. [2018-10-01 00:36:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-10-01 00:36:02,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:02,436 INFO L375 BasicCegarLoop]: trace histogram [192, 191, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:36:02,436 INFO L423 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:02,436 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:02,437 INFO L82 PathProgramCache]: Analyzing trace with hash -826162216, now seen corresponding path program 190 times [2018-10-01 00:36:02,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:02,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:02,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:02,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:36:02,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 36690 backedges. 0 proven. 36672 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:04,580 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:04,580 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:04,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:36:04,854 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:36:04,854 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:36:04,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 36690 backedges. 0 proven. 36672 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:05,635 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:05,636 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 193] total 193 [2018-10-01 00:36:05,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-10-01 00:36:05,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-10-01 00:36:05,639 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:05,639 INFO L87 Difference]: Start difference. First operand 399 states and 401 transitions. Second operand 194 states. [2018-10-01 00:36:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:08,479 INFO L93 Difference]: Finished difference Result 415 states and 419 transitions. [2018-10-01 00:36:08,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-10-01 00:36:08,480 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 398 [2018-10-01 00:36:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:08,480 INFO L225 Difference]: With dead ends: 415 [2018-10-01 00:36:08,480 INFO L226 Difference]: Without dead ends: 401 [2018-10-01 00:36:08,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:36:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-01 00:36:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2018-10-01 00:36:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-10-01 00:36:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 403 transitions. [2018-10-01 00:36:08,491 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 403 transitions. Word has length 398 [2018-10-01 00:36:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:08,491 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 403 transitions. [2018-10-01 00:36:08,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-10-01 00:36:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 403 transitions. [2018-10-01 00:36:08,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-10-01 00:36:08,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:08,493 INFO L375 BasicCegarLoop]: trace histogram [193, 192, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:36:08,493 INFO L423 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:08,493 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:08,493 INFO L82 PathProgramCache]: Analyzing trace with hash -2061072940, now seen corresponding path program 191 times [2018-10-01 00:36:08,493 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:08,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:08,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:08,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:36:08,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 37074 backedges. 0 proven. 37056 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:10,578 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:10,579 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:10,587 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:36:11,746 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 193 check-sat command(s) [2018-10-01 00:36:11,746 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:36:11,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 37074 backedges. 0 proven. 37056 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:12,566 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:12,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194, 194] total 194 [2018-10-01 00:36:12,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-10-01 00:36:12,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-10-01 00:36:12,569 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:12,569 INFO L87 Difference]: Start difference. First operand 401 states and 403 transitions. Second operand 195 states. [2018-10-01 00:36:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:14,924 INFO L93 Difference]: Finished difference Result 417 states and 421 transitions. [2018-10-01 00:36:14,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-01 00:36:14,924 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 400 [2018-10-01 00:36:14,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:14,925 INFO L225 Difference]: With dead ends: 417 [2018-10-01 00:36:14,925 INFO L226 Difference]: Without dead ends: 403 [2018-10-01 00:36:14,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:36:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-01 00:36:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-01 00:36:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-01 00:36:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 405 transitions. [2018-10-01 00:36:14,935 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 405 transitions. Word has length 400 [2018-10-01 00:36:14,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:14,935 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 405 transitions. [2018-10-01 00:36:14,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-10-01 00:36:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 405 transitions. [2018-10-01 00:36:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-01 00:36:14,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:14,936 INFO L375 BasicCegarLoop]: trace histogram [194, 193, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:36:14,936 INFO L423 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:14,937 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:14,937 INFO L82 PathProgramCache]: Analyzing trace with hash 895662288, now seen corresponding path program 192 times [2018-10-01 00:36:14,937 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:14,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:14,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:14,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:36:14,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 37460 backedges. 0 proven. 37442 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:17,063 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:17,063 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:17,070 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:36:18,168 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 194 check-sat command(s) [2018-10-01 00:36:18,169 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:36:18,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 37460 backedges. 0 proven. 37442 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:18,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:18,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195, 195] total 195 [2018-10-01 00:36:18,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-10-01 00:36:18,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-10-01 00:36:18,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:18,934 INFO L87 Difference]: Start difference. First operand 403 states and 405 transitions. Second operand 196 states. [2018-10-01 00:36:21,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:21,590 INFO L93 Difference]: Finished difference Result 419 states and 423 transitions. [2018-10-01 00:36:21,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-10-01 00:36:21,591 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 402 [2018-10-01 00:36:21,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:21,591 INFO L225 Difference]: With dead ends: 419 [2018-10-01 00:36:21,591 INFO L226 Difference]: Without dead ends: 405 [2018-10-01 00:36:21,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:36:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-10-01 00:36:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2018-10-01 00:36:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-01 00:36:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 407 transitions. [2018-10-01 00:36:21,602 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 407 transitions. Word has length 402 [2018-10-01 00:36:21,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:21,602 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 407 transitions. [2018-10-01 00:36:21,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-10-01 00:36:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 407 transitions. [2018-10-01 00:36:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-10-01 00:36:21,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:21,603 INFO L375 BasicCegarLoop]: trace histogram [195, 194, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:36:21,604 INFO L423 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:21,604 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:21,604 INFO L82 PathProgramCache]: Analyzing trace with hash -950133556, now seen corresponding path program 193 times [2018-10-01 00:36:21,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:21,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:21,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:21,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:36:21,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 37848 backedges. 0 proven. 37830 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:23,745 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:23,745 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:23,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:24,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 37848 backedges. 0 proven. 37830 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:24,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:24,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196, 196] total 196 [2018-10-01 00:36:24,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-10-01 00:36:24,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-10-01 00:36:24,936 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:24,936 INFO L87 Difference]: Start difference. First operand 405 states and 407 transitions. Second operand 197 states. [2018-10-01 00:36:29,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:29,793 INFO L93 Difference]: Finished difference Result 421 states and 425 transitions. [2018-10-01 00:36:29,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-10-01 00:36:29,794 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 404 [2018-10-01 00:36:29,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:29,794 INFO L225 Difference]: With dead ends: 421 [2018-10-01 00:36:29,794 INFO L226 Difference]: Without dead ends: 407 [2018-10-01 00:36:29,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:36:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-01 00:36:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2018-10-01 00:36:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-10-01 00:36:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 409 transitions. [2018-10-01 00:36:29,803 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 409 transitions. Word has length 404 [2018-10-01 00:36:29,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:29,804 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 409 transitions. [2018-10-01 00:36:29,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-10-01 00:36:29,804 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 409 transitions. [2018-10-01 00:36:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-10-01 00:36:29,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:29,805 INFO L375 BasicCegarLoop]: trace histogram [196, 195, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:36:29,805 INFO L423 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:29,805 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:29,805 INFO L82 PathProgramCache]: Analyzing trace with hash -938446392, now seen corresponding path program 194 times [2018-10-01 00:36:29,805 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:29,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:29,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:29,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:29,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 38238 backedges. 0 proven. 38220 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:31,983 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:31,983 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:31,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:36:32,255 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:36:32,255 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:36:32,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 38238 backedges. 0 proven. 38220 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:33,023 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:33,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197, 197] total 197 [2018-10-01 00:36:33,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-10-01 00:36:33,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-10-01 00:36:33,026 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:33,026 INFO L87 Difference]: Start difference. First operand 407 states and 409 transitions. Second operand 198 states. [2018-10-01 00:36:37,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:37,332 INFO L93 Difference]: Finished difference Result 423 states and 427 transitions. [2018-10-01 00:36:37,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-01 00:36:37,332 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 406 [2018-10-01 00:36:37,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:37,333 INFO L225 Difference]: With dead ends: 423 [2018-10-01 00:36:37,333 INFO L226 Difference]: Without dead ends: 409 [2018-10-01 00:36:37,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:36:37,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-10-01 00:36:37,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2018-10-01 00:36:37,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-01 00:36:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 411 transitions. [2018-10-01 00:36:37,342 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 411 transitions. Word has length 406 [2018-10-01 00:36:37,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:37,342 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 411 transitions. [2018-10-01 00:36:37,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-10-01 00:36:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 411 transitions. [2018-10-01 00:36:37,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-10-01 00:36:37,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:37,343 INFO L375 BasicCegarLoop]: trace histogram [197, 196, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:36:37,344 INFO L423 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:37,344 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:37,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1702983620, now seen corresponding path program 195 times [2018-10-01 00:36:37,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:37,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:37,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:37,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:36:37,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 38630 backedges. 0 proven. 38612 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:39,560 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:39,561 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:39,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:36:40,882 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 197 check-sat command(s) [2018-10-01 00:36:40,883 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:36:40,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 38630 backedges. 0 proven. 38612 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:41,647 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:41,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198, 198] total 198 [2018-10-01 00:36:41,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-10-01 00:36:41,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-10-01 00:36:41,650 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:41,650 INFO L87 Difference]: Start difference. First operand 409 states and 411 transitions. Second operand 199 states. [2018-10-01 00:36:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:44,841 INFO L93 Difference]: Finished difference Result 425 states and 429 transitions. [2018-10-01 00:36:44,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-01 00:36:44,841 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 408 [2018-10-01 00:36:44,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:44,842 INFO L225 Difference]: With dead ends: 425 [2018-10-01 00:36:44,842 INFO L226 Difference]: Without dead ends: 411 [2018-10-01 00:36:44,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:36:44,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-10-01 00:36:44,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-10-01 00:36:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-01 00:36:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 413 transitions. [2018-10-01 00:36:44,852 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 413 transitions. Word has length 408 [2018-10-01 00:36:44,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:44,852 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 413 transitions. [2018-10-01 00:36:44,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-10-01 00:36:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 413 transitions. [2018-10-01 00:36:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-01 00:36:44,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:44,854 INFO L375 BasicCegarLoop]: trace histogram [198, 197, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:36:44,854 INFO L423 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:44,854 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:44,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1791553216, now seen corresponding path program 196 times [2018-10-01 00:36:44,854 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:44,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:44,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:44,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:36:44,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 39024 backedges. 0 proven. 39006 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:46,916 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:46,916 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:46,924 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:36:47,203 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:36:47,203 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:36:47,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 39024 backedges. 0 proven. 39006 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:48,004 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:48,004 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199, 199] total 199 [2018-10-01 00:36:48,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-10-01 00:36:48,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-10-01 00:36:48,008 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:48,008 INFO L87 Difference]: Start difference. First operand 411 states and 413 transitions. Second operand 200 states. [2018-10-01 00:36:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:52,729 INFO L93 Difference]: Finished difference Result 427 states and 431 transitions. [2018-10-01 00:36:52,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-10-01 00:36:52,729 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 410 [2018-10-01 00:36:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:52,730 INFO L225 Difference]: With dead ends: 427 [2018-10-01 00:36:52,730 INFO L226 Difference]: Without dead ends: 413 [2018-10-01 00:36:52,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:36:52,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-10-01 00:36:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-10-01 00:36:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-10-01 00:36:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 415 transitions. [2018-10-01 00:36:52,740 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 415 transitions. Word has length 410 [2018-10-01 00:36:52,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:52,740 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 415 transitions. [2018-10-01 00:36:52,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-10-01 00:36:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 415 transitions. [2018-10-01 00:36:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-10-01 00:36:52,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:52,742 INFO L375 BasicCegarLoop]: trace histogram [199, 198, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:36:52,742 INFO L423 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:52,742 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:52,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1007589052, now seen corresponding path program 197 times [2018-10-01 00:36:52,742 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:52,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:52,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:52,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:36:52,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 39420 backedges. 0 proven. 39402 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:55,120 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:55,120 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:55,127 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:36:56,372 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 199 check-sat command(s) [2018-10-01 00:36:56,372 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:36:56,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 39420 backedges. 0 proven. 39402 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:36:57,161 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:57,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200, 200] total 200 [2018-10-01 00:36:57,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-10-01 00:36:57,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-10-01 00:36:57,164 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:57,164 INFO L87 Difference]: Start difference. First operand 413 states and 415 transitions. Second operand 201 states. [2018-10-01 00:37:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:37:00,361 INFO L93 Difference]: Finished difference Result 429 states and 433 transitions. [2018-10-01 00:37:00,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-01 00:37:00,362 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 412 [2018-10-01 00:37:00,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:37:00,362 INFO L225 Difference]: With dead ends: 429 [2018-10-01 00:37:00,362 INFO L226 Difference]: Without dead ends: 415 [2018-10-01 00:37:00,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:37:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-01 00:37:00,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2018-10-01 00:37:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-10-01 00:37:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 417 transitions. [2018-10-01 00:37:00,373 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 417 transitions. Word has length 412 [2018-10-01 00:37:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:37:00,373 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 417 transitions. [2018-10-01 00:37:00,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-10-01 00:37:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 417 transitions. [2018-10-01 00:37:00,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-01 00:37:00,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:37:00,375 INFO L375 BasicCegarLoop]: trace histogram [200, 199, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:37:00,375 INFO L423 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:37:00,376 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:37:00,376 INFO L82 PathProgramCache]: Analyzing trace with hash -762695752, now seen corresponding path program 198 times [2018-10-01 00:37:00,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:37:00,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:37:00,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:00,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:37:00,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 39818 backedges. 0 proven. 39800 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:37:02,664 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:37:02,664 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:37:02,671 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:37:03,832 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 200 check-sat command(s) [2018-10-01 00:37:03,832 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:37:03,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:37:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 39818 backedges. 0 proven. 39800 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:37:04,684 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:37:04,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201, 201] total 201 [2018-10-01 00:37:04,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-10-01 00:37:04,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-10-01 00:37:04,687 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:37:04,687 INFO L87 Difference]: Start difference. First operand 415 states and 417 transitions. Second operand 202 states. [2018-10-01 00:37:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:37:10,473 INFO L93 Difference]: Finished difference Result 431 states and 435 transitions. [2018-10-01 00:37:10,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-10-01 00:37:10,474 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 414 [2018-10-01 00:37:10,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:37:10,474 INFO L225 Difference]: With dead ends: 431 [2018-10-01 00:37:10,474 INFO L226 Difference]: Without dead ends: 417 [2018-10-01 00:37:10,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:37:10,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-01 00:37:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-10-01 00:37:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-01 00:37:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 419 transitions. [2018-10-01 00:37:10,485 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 419 transitions. Word has length 414 [2018-10-01 00:37:10,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:37:10,485 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 419 transitions. [2018-10-01 00:37:10,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-10-01 00:37:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 419 transitions. [2018-10-01 00:37:10,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-01 00:37:10,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:37:10,487 INFO L375 BasicCegarLoop]: trace histogram [201, 200, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:37:10,487 INFO L423 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:37:10,487 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:37:10,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1199343180, now seen corresponding path program 199 times [2018-10-01 00:37:10,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:37:10,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:37:10,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:10,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:37:10,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 40218 backedges. 0 proven. 40200 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:37:12,678 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:37:12,678 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:37:12,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:37:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:12,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:37:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 40218 backedges. 0 proven. 40200 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:37:13,820 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:37:13,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [202, 202] total 202 [2018-10-01 00:37:13,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-10-01 00:37:13,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-10-01 00:37:13,823 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:37:13,823 INFO L87 Difference]: Start difference. First operand 417 states and 419 transitions. Second operand 203 states. [2018-10-01 00:37:16,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:37:16,784 INFO L93 Difference]: Finished difference Result 433 states and 437 transitions. [2018-10-01 00:37:16,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-01 00:37:16,784 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 416 [2018-10-01 00:37:16,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:37:16,785 INFO L225 Difference]: With dead ends: 433 [2018-10-01 00:37:16,785 INFO L226 Difference]: Without dead ends: 419 [2018-10-01 00:37:16,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:37:16,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-01 00:37:16,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2018-10-01 00:37:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-01 00:37:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 421 transitions. [2018-10-01 00:37:16,795 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 421 transitions. Word has length 416 [2018-10-01 00:37:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:37:16,795 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 421 transitions. [2018-10-01 00:37:16,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-10-01 00:37:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 421 transitions. [2018-10-01 00:37:16,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-01 00:37:16,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:37:16,797 INFO L375 BasicCegarLoop]: trace histogram [202, 201, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:37:16,797 INFO L423 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:37:16,797 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:37:16,797 INFO L82 PathProgramCache]: Analyzing trace with hash 89273520, now seen corresponding path program 200 times [2018-10-01 00:37:16,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:37:16,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:37:16,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:16,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:37:16,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 40620 backedges. 0 proven. 40602 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:37:18,990 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:37:18,990 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:37:18,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:37:19,268 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:37:19,268 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:37:19,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:37:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 40620 backedges. 0 proven. 40602 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:37:20,118 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:37:20,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203, 203] total 203 [2018-10-01 00:37:20,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-10-01 00:37:20,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-10-01 00:37:20,121 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:37:20,121 INFO L87 Difference]: Start difference. First operand 419 states and 421 transitions. Second operand 204 states. [2018-10-01 00:37:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:37:24,311 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2018-10-01 00:37:24,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-01 00:37:24,311 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 418 [2018-10-01 00:37:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:37:24,312 INFO L225 Difference]: With dead ends: 435 [2018-10-01 00:37:24,312 INFO L226 Difference]: Without dead ends: 421 [2018-10-01 00:37:24,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:37:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-01 00:37:24,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2018-10-01 00:37:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-01 00:37:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 423 transitions. [2018-10-01 00:37:24,321 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 423 transitions. Word has length 418 [2018-10-01 00:37:24,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:37:24,322 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 423 transitions. [2018-10-01 00:37:24,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-10-01 00:37:24,322 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 423 transitions. [2018-10-01 00:37:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-10-01 00:37:24,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:37:24,323 INFO L375 BasicCegarLoop]: trace histogram [203, 202, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:37:24,323 INFO L423 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:37:24,323 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:37:24,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1499340972, now seen corresponding path program 201 times [2018-10-01 00:37:24,324 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:37:24,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:37:24,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:24,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:37:24,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 41024 backedges. 0 proven. 41006 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:37:26,649 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:37:26,649 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:37:26,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:37:28,066 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 203 check-sat command(s) [2018-10-01 00:37:28,066 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:37:28,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:37:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 41024 backedges. 0 proven. 41006 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:37:28,928 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:37:28,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204, 204] total 204 [2018-10-01 00:37:28,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-10-01 00:37:28,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-10-01 00:37:28,931 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:37:28,931 INFO L87 Difference]: Start difference. First operand 421 states and 423 transitions. Second operand 205 states. [2018-10-01 00:37:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:37:34,530 INFO L93 Difference]: Finished difference Result 437 states and 441 transitions. [2018-10-01 00:37:34,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-10-01 00:37:34,530 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 420 [2018-10-01 00:37:34,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:37:34,531 INFO L225 Difference]: With dead ends: 437 [2018-10-01 00:37:34,531 INFO L226 Difference]: Without dead ends: 423 [2018-10-01 00:37:34,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:37:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-01 00:37:34,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-10-01 00:37:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-01 00:37:34,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 425 transitions. [2018-10-01 00:37:34,541 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 425 transitions. Word has length 420 [2018-10-01 00:37:34,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:37:34,542 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 425 transitions. [2018-10-01 00:37:34,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-10-01 00:37:34,542 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 425 transitions. [2018-10-01 00:37:34,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-01 00:37:34,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:37:34,543 INFO L375 BasicCegarLoop]: trace histogram [204, 203, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:37:34,543 INFO L423 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:37:34,544 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:37:34,544 INFO L82 PathProgramCache]: Analyzing trace with hash -635503192, now seen corresponding path program 202 times [2018-10-01 00:37:34,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:37:34,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:37:34,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:34,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:37:34,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 41430 backedges. 0 proven. 41412 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:37:36,991 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:37:36,991 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:37:36,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:37:37,265 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:37:37,266 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:37:37,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:37:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 41430 backedges. 0 proven. 41412 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:37:38,108 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:37:38,108 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205, 205] total 205 [2018-10-01 00:37:38,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-10-01 00:37:38,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-10-01 00:37:38,111 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:37:38,111 INFO L87 Difference]: Start difference. First operand 423 states and 425 transitions. Second operand 206 states. [2018-10-01 00:37:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:37:43,546 INFO L93 Difference]: Finished difference Result 439 states and 443 transitions. [2018-10-01 00:37:43,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-10-01 00:37:43,546 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 422 [2018-10-01 00:37:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:37:43,547 INFO L225 Difference]: With dead ends: 439 [2018-10-01 00:37:43,547 INFO L226 Difference]: Without dead ends: 425 [2018-10-01 00:37:43,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:37:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-10-01 00:37:43,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2018-10-01 00:37:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-10-01 00:37:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 427 transitions. [2018-10-01 00:37:43,557 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 427 transitions. Word has length 422 [2018-10-01 00:37:43,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:37:43,558 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 427 transitions. [2018-10-01 00:37:43,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-10-01 00:37:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 427 transitions. [2018-10-01 00:37:43,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-01 00:37:43,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:37:43,559 INFO L375 BasicCegarLoop]: trace histogram [205, 204, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:37:43,559 INFO L423 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:37:43,560 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:37:43,560 INFO L82 PathProgramCache]: Analyzing trace with hash 773622692, now seen corresponding path program 203 times [2018-10-01 00:37:43,560 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:37:43,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:37:43,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:43,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:37:43,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 41838 backedges. 0 proven. 41820 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:37:45,784 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:37:45,784 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:37:45,792 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:37:47,146 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 205 check-sat command(s) [2018-10-01 00:37:47,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:37:47,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:37:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 41838 backedges. 0 proven. 41820 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:37:48,031 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:37:48,031 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [206, 206] total 206 [2018-10-01 00:37:48,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 207 states [2018-10-01 00:37:48,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2018-10-01 00:37:48,034 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:37:48,034 INFO L87 Difference]: Start difference. First operand 425 states and 427 transitions. Second operand 207 states. [2018-10-01 00:37:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:37:52,713 INFO L93 Difference]: Finished difference Result 441 states and 445 transitions. [2018-10-01 00:37:52,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-01 00:37:52,713 INFO L78 Accepts]: Start accepts. Automaton has 207 states. Word has length 424 [2018-10-01 00:37:52,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:37:52,714 INFO L225 Difference]: With dead ends: 441 [2018-10-01 00:37:52,714 INFO L226 Difference]: Without dead ends: 427 [2018-10-01 00:37:52,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:37:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-01 00:37:52,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2018-10-01 00:37:52,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-01 00:37:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 429 transitions. [2018-10-01 00:37:52,724 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 429 transitions. Word has length 424 [2018-10-01 00:37:52,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:37:52,725 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 429 transitions. [2018-10-01 00:37:52,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 207 states. [2018-10-01 00:37:52,725 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 429 transitions. [2018-10-01 00:37:52,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-10-01 00:37:52,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:37:52,726 INFO L375 BasicCegarLoop]: trace histogram [206, 205, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:37:52,726 INFO L423 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:37:52,727 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:37:52,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2028898976, now seen corresponding path program 204 times [2018-10-01 00:37:52,727 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:37:52,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:37:52,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:52,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:37:52,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 42248 backedges. 0 proven. 42230 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:37:55,109 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:37:55,109 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:37:55,116 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:37:56,360 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 206 check-sat command(s) [2018-10-01 00:37:56,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:37:56,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:37:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 42248 backedges. 0 proven. 42230 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:37:57,265 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:37:57,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207, 207] total 207 [2018-10-01 00:37:57,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-10-01 00:37:57,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-10-01 00:37:57,268 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:37:57,268 INFO L87 Difference]: Start difference. First operand 427 states and 429 transitions. Second operand 208 states. [2018-10-01 00:38:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:01,801 INFO L93 Difference]: Finished difference Result 443 states and 447 transitions. [2018-10-01 00:38:01,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-10-01 00:38:01,802 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 426 [2018-10-01 00:38:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:01,802 INFO L225 Difference]: With dead ends: 443 [2018-10-01 00:38:01,802 INFO L226 Difference]: Without dead ends: 429 [2018-10-01 00:38:01,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:38:01,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-01 00:38:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2018-10-01 00:38:01,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-10-01 00:38:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 431 transitions. [2018-10-01 00:38:01,811 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 431 transitions. Word has length 426 [2018-10-01 00:38:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:01,812 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 431 transitions. [2018-10-01 00:38:01,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-10-01 00:38:01,812 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 431 transitions. [2018-10-01 00:38:01,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-10-01 00:38:01,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:01,813 INFO L375 BasicCegarLoop]: trace histogram [207, 206, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:38:01,813 INFO L423 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:01,814 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:01,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1463597724, now seen corresponding path program 205 times [2018-10-01 00:38:01,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:01,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:01,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:01,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:01,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 42660 backedges. 0 proven. 42642 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:38:04,360 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:04,360 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:04,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:04,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 42660 backedges. 0 proven. 42642 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:38:05,527 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:05,527 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [208, 208] total 208 [2018-10-01 00:38:05,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-10-01 00:38:05,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-10-01 00:38:05,530 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:05,530 INFO L87 Difference]: Start difference. First operand 429 states and 431 transitions. Second operand 209 states. [2018-10-01 00:38:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:10,632 INFO L93 Difference]: Finished difference Result 445 states and 449 transitions. [2018-10-01 00:38:10,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-01 00:38:10,633 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 428 [2018-10-01 00:38:10,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:10,633 INFO L225 Difference]: With dead ends: 445 [2018-10-01 00:38:10,634 INFO L226 Difference]: Without dead ends: 431 [2018-10-01 00:38:10,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:38:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-10-01 00:38:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-10-01 00:38:10,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-01 00:38:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 433 transitions. [2018-10-01 00:38:10,644 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 433 transitions. Word has length 428 [2018-10-01 00:38:10,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:10,644 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 433 transitions. [2018-10-01 00:38:10,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-10-01 00:38:10,644 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 433 transitions. [2018-10-01 00:38:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-01 00:38:10,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:10,646 INFO L375 BasicCegarLoop]: trace histogram [208, 207, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:38:10,646 INFO L423 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:10,646 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:10,646 INFO L82 PathProgramCache]: Analyzing trace with hash -625026152, now seen corresponding path program 206 times [2018-10-01 00:38:10,646 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:10,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:10,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:10,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:10,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 43074 backedges. 0 proven. 43056 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:38:13,249 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:13,249 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:13,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:38:13,539 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:38:13,539 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:13,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 43074 backedges. 0 proven. 43056 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:38:14,354 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:14,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [209, 209] total 209 [2018-10-01 00:38:14,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-10-01 00:38:14,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-10-01 00:38:14,357 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:14,357 INFO L87 Difference]: Start difference. First operand 431 states and 433 transitions. Second operand 210 states. [2018-10-01 00:38:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:19,149 INFO L93 Difference]: Finished difference Result 447 states and 451 transitions. [2018-10-01 00:38:19,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-01 00:38:19,149 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 430 [2018-10-01 00:38:19,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:19,150 INFO L225 Difference]: With dead ends: 447 [2018-10-01 00:38:19,150 INFO L226 Difference]: Without dead ends: 433 [2018-10-01 00:38:19,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:38:19,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-01 00:38:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-10-01 00:38:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-10-01 00:38:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 435 transitions. [2018-10-01 00:38:19,161 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 435 transitions. Word has length 430 [2018-10-01 00:38:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:19,161 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 435 transitions. [2018-10-01 00:38:19,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-10-01 00:38:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 435 transitions. [2018-10-01 00:38:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-10-01 00:38:19,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:19,163 INFO L375 BasicCegarLoop]: trace histogram [209, 208, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:38:19,163 INFO L423 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:19,163 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash -2042843756, now seen corresponding path program 207 times [2018-10-01 00:38:19,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:19,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:19,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:19,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:19,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 43490 backedges. 0 proven. 43472 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:38:21,575 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:21,575 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:21,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:38:23,139 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 209 check-sat command(s) [2018-10-01 00:38:23,140 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:23,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 43490 backedges. 0 proven. 43472 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:38:23,965 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:23,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [210, 210] total 210 [2018-10-01 00:38:23,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 211 states [2018-10-01 00:38:23,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2018-10-01 00:38:23,968 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:23,969 INFO L87 Difference]: Start difference. First operand 433 states and 435 transitions. Second operand 211 states. [2018-10-01 00:38:29,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:29,270 INFO L93 Difference]: Finished difference Result 449 states and 453 transitions. [2018-10-01 00:38:29,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-10-01 00:38:29,271 INFO L78 Accepts]: Start accepts. Automaton has 211 states. Word has length 432 [2018-10-01 00:38:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:29,271 INFO L225 Difference]: With dead ends: 449 [2018-10-01 00:38:29,271 INFO L226 Difference]: Without dead ends: 435 [2018-10-01 00:38:29,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:38:29,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-10-01 00:38:29,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2018-10-01 00:38:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-01 00:38:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 437 transitions. [2018-10-01 00:38:29,281 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 437 transitions. Word has length 432 [2018-10-01 00:38:29,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:29,281 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 437 transitions. [2018-10-01 00:38:29,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 211 states. [2018-10-01 00:38:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 437 transitions. [2018-10-01 00:38:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-10-01 00:38:29,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:29,283 INFO L375 BasicCegarLoop]: trace histogram [210, 209, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:38:29,283 INFO L423 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:29,283 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:29,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1234038928, now seen corresponding path program 208 times [2018-10-01 00:38:29,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:29,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:29,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:29,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:29,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 43908 backedges. 0 proven. 43890 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:38:31,835 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:31,835 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:31,843 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:38:32,130 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:38:32,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:32,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 43908 backedges. 0 proven. 43890 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:38:33,144 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:33,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211, 211] total 211 [2018-10-01 00:38:33,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-10-01 00:38:33,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-10-01 00:38:33,147 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:33,147 INFO L87 Difference]: Start difference. First operand 435 states and 437 transitions. Second operand 212 states. [2018-10-01 00:38:36,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:36,549 INFO L93 Difference]: Finished difference Result 451 states and 455 transitions. [2018-10-01 00:38:36,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-10-01 00:38:36,549 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 434 [2018-10-01 00:38:36,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:36,550 INFO L225 Difference]: With dead ends: 451 [2018-10-01 00:38:36,550 INFO L226 Difference]: Without dead ends: 437 [2018-10-01 00:38:36,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:38:36,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-10-01 00:38:36,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2018-10-01 00:38:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-10-01 00:38:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 439 transitions. [2018-10-01 00:38:36,560 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 439 transitions. Word has length 434 [2018-10-01 00:38:36,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:36,560 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 439 transitions. [2018-10-01 00:38:36,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-10-01 00:38:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 439 transitions. [2018-10-01 00:38:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-10-01 00:38:36,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:36,561 INFO L375 BasicCegarLoop]: trace histogram [211, 210, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:38:36,562 INFO L423 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:36,562 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash 2107270284, now seen corresponding path program 209 times [2018-10-01 00:38:36,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:36,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:36,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:36,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:36,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 44328 backedges. 0 proven. 44310 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:38:39,005 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:39,005 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:39,053 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:38:40,491 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 211 check-sat command(s) [2018-10-01 00:38:40,491 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:40,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 44328 backedges. 0 proven. 44310 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:38:41,366 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:41,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [212, 212] total 212 [2018-10-01 00:38:41,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 213 states [2018-10-01 00:38:41,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2018-10-01 00:38:41,369 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:41,370 INFO L87 Difference]: Start difference. First operand 437 states and 439 transitions. Second operand 213 states. [2018-10-01 00:38:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:45,716 INFO L93 Difference]: Finished difference Result 453 states and 457 transitions. [2018-10-01 00:38:45,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-01 00:38:45,716 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 436 [2018-10-01 00:38:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:45,717 INFO L225 Difference]: With dead ends: 453 [2018-10-01 00:38:45,717 INFO L226 Difference]: Without dead ends: 439 [2018-10-01 00:38:45,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:38:45,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-10-01 00:38:45,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2018-10-01 00:38:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-01 00:38:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 441 transitions. [2018-10-01 00:38:45,727 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 441 transitions. Word has length 436 [2018-10-01 00:38:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:45,727 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 441 transitions. [2018-10-01 00:38:45,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 213 states. [2018-10-01 00:38:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 441 transitions. [2018-10-01 00:38:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-01 00:38:45,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:45,729 INFO L375 BasicCegarLoop]: trace histogram [212, 211, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:38:45,729 INFO L423 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:45,729 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:45,730 INFO L82 PathProgramCache]: Analyzing trace with hash -530986616, now seen corresponding path program 210 times [2018-10-01 00:38:45,730 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:45,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:45,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:45,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:45,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 44750 backedges. 0 proven. 44732 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:38:48,505 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:48,505 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:48,511 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:38:49,860 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 212 check-sat command(s) [2018-10-01 00:38:49,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:49,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 44750 backedges. 0 proven. 44732 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:38:50,718 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:50,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [213, 213] total 213 [2018-10-01 00:38:50,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-10-01 00:38:50,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-10-01 00:38:50,722 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:50,722 INFO L87 Difference]: Start difference. First operand 439 states and 441 transitions. Second operand 214 states. [2018-10-01 00:38:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:56,539 INFO L93 Difference]: Finished difference Result 455 states and 459 transitions. [2018-10-01 00:38:56,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-10-01 00:38:56,540 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 438 [2018-10-01 00:38:56,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:56,540 INFO L225 Difference]: With dead ends: 455 [2018-10-01 00:38:56,540 INFO L226 Difference]: Without dead ends: 441 [2018-10-01 00:38:56,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:38:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-10-01 00:38:56,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2018-10-01 00:38:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-10-01 00:38:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 443 transitions. [2018-10-01 00:38:56,550 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 443 transitions. Word has length 438 [2018-10-01 00:38:56,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:56,550 INFO L480 AbstractCegarLoop]: Abstraction has 441 states and 443 transitions. [2018-10-01 00:38:56,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-10-01 00:38:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 443 transitions. [2018-10-01 00:38:56,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-10-01 00:38:56,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:56,552 INFO L375 BasicCegarLoop]: trace histogram [213, 212, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:38:56,552 INFO L423 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:56,552 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:56,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1865162876, now seen corresponding path program 211 times [2018-10-01 00:38:56,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:56,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:56,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:56,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:56,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 45174 backedges. 0 proven. 45156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:38:59,394 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:59,394 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:59,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:59,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 45174 backedges. 0 proven. 45156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:39:00,566 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:00,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [214, 214] total 214 [2018-10-01 00:39:00,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 215 states [2018-10-01 00:39:00,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2018-10-01 00:39:00,570 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:00,571 INFO L87 Difference]: Start difference. First operand 441 states and 443 transitions. Second operand 215 states. [2018-10-01 00:39:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:03,652 INFO L93 Difference]: Finished difference Result 457 states and 461 transitions. [2018-10-01 00:39:03,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-10-01 00:39:03,653 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 440 [2018-10-01 00:39:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:03,653 INFO L225 Difference]: With dead ends: 457 [2018-10-01 00:39:03,654 INFO L226 Difference]: Without dead ends: 443 [2018-10-01 00:39:03,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:39:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-10-01 00:39:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2018-10-01 00:39:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-10-01 00:39:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 445 transitions. [2018-10-01 00:39:03,664 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 445 transitions. Word has length 440 [2018-10-01 00:39:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:03,664 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 445 transitions. [2018-10-01 00:39:03,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 215 states. [2018-10-01 00:39:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 445 transitions. [2018-10-01 00:39:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-10-01 00:39:03,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:03,666 INFO L375 BasicCegarLoop]: trace histogram [214, 213, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:39:03,666 INFO L423 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:03,666 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:03,666 INFO L82 PathProgramCache]: Analyzing trace with hash 186672768, now seen corresponding path program 212 times [2018-10-01 00:39:03,667 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:03,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:03,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:03,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:03,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 45600 backedges. 0 proven. 45582 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:39:06,328 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:06,328 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:06,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:06,621 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:06,621 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:06,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 45600 backedges. 0 proven. 45582 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:39:07,477 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:07,478 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215, 215] total 215 [2018-10-01 00:39:07,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-10-01 00:39:07,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-10-01 00:39:07,481 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:07,482 INFO L87 Difference]: Start difference. First operand 443 states and 445 transitions. Second operand 216 states. [2018-10-01 00:39:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:13,097 INFO L93 Difference]: Finished difference Result 459 states and 463 transitions. [2018-10-01 00:39:13,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-01 00:39:13,097 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 442 [2018-10-01 00:39:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:13,098 INFO L225 Difference]: With dead ends: 459 [2018-10-01 00:39:13,098 INFO L226 Difference]: Without dead ends: 445 [2018-10-01 00:39:13,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:39:13,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-01 00:39:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2018-10-01 00:39:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-10-01 00:39:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 447 transitions. [2018-10-01 00:39:13,109 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 447 transitions. Word has length 442 [2018-10-01 00:39:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:13,109 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 447 transitions. [2018-10-01 00:39:13,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-10-01 00:39:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 447 transitions. [2018-10-01 00:39:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-10-01 00:39:13,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:13,111 INFO L375 BasicCegarLoop]: trace histogram [215, 214, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:39:13,111 INFO L423 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:13,111 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:13,111 INFO L82 PathProgramCache]: Analyzing trace with hash 610737788, now seen corresponding path program 213 times [2018-10-01 00:39:13,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:13,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:13,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:13,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:13,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 46028 backedges. 0 proven. 46010 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:39:15,687 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:15,687 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:15,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:17,323 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 215 check-sat command(s) [2018-10-01 00:39:17,324 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:17,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 46028 backedges. 0 proven. 46010 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:39:18,178 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:18,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [216, 216] total 216 [2018-10-01 00:39:18,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 217 states [2018-10-01 00:39:18,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2018-10-01 00:39:18,181 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:18,181 INFO L87 Difference]: Start difference. First operand 445 states and 447 transitions. Second operand 217 states. [2018-10-01 00:39:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:23,856 INFO L93 Difference]: Finished difference Result 461 states and 465 transitions. [2018-10-01 00:39:23,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-10-01 00:39:23,857 INFO L78 Accepts]: Start accepts. Automaton has 217 states. Word has length 444 [2018-10-01 00:39:23,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:23,857 INFO L225 Difference]: With dead ends: 461 [2018-10-01 00:39:23,857 INFO L226 Difference]: Without dead ends: 447 [2018-10-01 00:39:23,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:39:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-01 00:39:23,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2018-10-01 00:39:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-10-01 00:39:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 449 transitions. [2018-10-01 00:39:23,868 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 449 transitions. Word has length 444 [2018-10-01 00:39:23,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:23,868 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 449 transitions. [2018-10-01 00:39:23,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 217 states. [2018-10-01 00:39:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 449 transitions. [2018-10-01 00:39:23,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-10-01 00:39:23,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:23,870 INFO L375 BasicCegarLoop]: trace histogram [216, 215, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:39:23,870 INFO L423 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:23,870 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:23,870 INFO L82 PathProgramCache]: Analyzing trace with hash 115328888, now seen corresponding path program 214 times [2018-10-01 00:39:23,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:23,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:23,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:23,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:23,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 46458 backedges. 0 proven. 46440 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:39:26,499 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:26,499 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:26,507 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:39:26,794 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:39:26,795 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:26,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 46458 backedges. 0 proven. 46440 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:39:27,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:27,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [217, 217] total 217 [2018-10-01 00:39:27,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-10-01 00:39:27,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-10-01 00:39:27,761 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:27,761 INFO L87 Difference]: Start difference. First operand 447 states and 449 transitions. Second operand 218 states. [2018-10-01 00:39:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:32,291 INFO L93 Difference]: Finished difference Result 463 states and 467 transitions. [2018-10-01 00:39:32,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-10-01 00:39:32,292 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 446 [2018-10-01 00:39:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:32,293 INFO L225 Difference]: With dead ends: 463 [2018-10-01 00:39:32,293 INFO L226 Difference]: Without dead ends: 449 [2018-10-01 00:39:32,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:39:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-01 00:39:32,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2018-10-01 00:39:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-10-01 00:39:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 451 transitions. [2018-10-01 00:39:32,304 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 451 transitions. Word has length 446 [2018-10-01 00:39:32,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:32,304 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 451 transitions. [2018-10-01 00:39:32,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-10-01 00:39:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 451 transitions. [2018-10-01 00:39:32,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-10-01 00:39:32,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:32,306 INFO L375 BasicCegarLoop]: trace histogram [217, 216, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:39:32,306 INFO L423 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:32,306 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:32,306 INFO L82 PathProgramCache]: Analyzing trace with hash 768745844, now seen corresponding path program 215 times [2018-10-01 00:39:32,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:32,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:32,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:32,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:32,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 46890 backedges. 0 proven. 46872 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:39:34,987 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:34,987 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:34,994 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:39:36,464 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 217 check-sat command(s) [2018-10-01 00:39:36,465 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:36,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 46890 backedges. 0 proven. 46872 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:39:37,374 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:37,374 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [218, 218] total 218 [2018-10-01 00:39:37,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-10-01 00:39:37,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-10-01 00:39:37,378 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:37,378 INFO L87 Difference]: Start difference. First operand 449 states and 451 transitions. Second operand 219 states. [2018-10-01 00:39:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:44,366 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2018-10-01 00:39:44,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-01 00:39:44,367 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 448 [2018-10-01 00:39:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:44,368 INFO L225 Difference]: With dead ends: 465 [2018-10-01 00:39:44,368 INFO L226 Difference]: Without dead ends: 451 [2018-10-01 00:39:44,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time [2018-10-01 00:39:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-10-01 00:39:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2018-10-01 00:39:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-01 00:39:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 453 transitions. [2018-10-01 00:39:44,379 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 453 transitions. Word has length 448 [2018-10-01 00:39:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:44,379 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 453 transitions. [2018-10-01 00:39:44,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-10-01 00:39:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 453 transitions. [2018-10-01 00:39:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-01 00:39:44,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:44,381 INFO L375 BasicCegarLoop]: trace histogram [218, 217, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:39:44,381 INFO L423 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:44,381 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:44,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1637215344, now seen corresponding path program 216 times [2018-10-01 00:39:44,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:44,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:44,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:44,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 47324 backedges. 0 proven. 47306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:39:47,170 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:47,170 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:47,176 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:39:48,600 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 218 check-sat command(s) [2018-10-01 00:39:48,601 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:48,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 47324 backedges. 0 proven. 47306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:39:49,730 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:49,730 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [219, 219] total 219 [2018-10-01 00:39:49,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 220 states [2018-10-01 00:39:49,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2018-10-01 00:39:49,734 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:49,734 INFO L87 Difference]: Start difference. First operand 451 states and 453 transitions. Second operand 220 states. [2018-10-01 00:39:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:55,861 INFO L93 Difference]: Finished difference Result 467 states and 471 transitions. [2018-10-01 00:39:55,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-01 00:39:55,861 INFO L78 Accepts]: Start accepts. Automaton has 220 states. Word has length 450 [2018-10-01 00:39:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:55,862 INFO L225 Difference]: With dead ends: 467 [2018-10-01 00:39:55,862 INFO L226 Difference]: Without dead ends: 453 [2018-10-01 00:39:55,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time [2018-10-01 00:39:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-10-01 00:39:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2018-10-01 00:39:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-10-01 00:39:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 455 transitions. [2018-10-01 00:39:55,878 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 455 transitions. Word has length 450 [2018-10-01 00:39:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:55,878 INFO L480 AbstractCegarLoop]: Abstraction has 453 states and 455 transitions. [2018-10-01 00:39:55,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 220 states. [2018-10-01 00:39:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 455 transitions. [2018-10-01 00:39:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-10-01 00:39:55,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:55,880 INFO L375 BasicCegarLoop]: trace histogram [219, 218, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:39:55,881 INFO L423 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:55,881 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:55,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1282217876, now seen corresponding path program 217 times [2018-10-01 00:39:55,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:55,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:55,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:55,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:55,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 47760 backedges. 0 proven. 47742 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:39:58,710 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:58,710 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:58,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:59,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 47760 backedges. 0 proven. 47742 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:40:00,114 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:00,115 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [220, 220] total 220 [2018-10-01 00:40:00,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 221 states [2018-10-01 00:40:00,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 221 interpolants. [2018-10-01 00:40:00,118 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:00,118 INFO L87 Difference]: Start difference. First operand 453 states and 455 transitions. Second operand 221 states. [2018-10-01 00:40:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:06,568 INFO L93 Difference]: Finished difference Result 469 states and 473 transitions. [2018-10-01 00:40:06,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-10-01 00:40:06,570 INFO L78 Accepts]: Start accepts. Automaton has 221 states. Word has length 452 [2018-10-01 00:40:06,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:06,571 INFO L225 Difference]: With dead ends: 469 [2018-10-01 00:40:06,571 INFO L226 Difference]: Without dead ends: 455 [2018-10-01 00:40:06,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time [2018-10-01 00:40:06,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-10-01 00:40:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2018-10-01 00:40:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-10-01 00:40:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 457 transitions. [2018-10-01 00:40:06,582 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 457 transitions. Word has length 452 [2018-10-01 00:40:06,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:06,583 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 457 transitions. [2018-10-01 00:40:06,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 221 states. [2018-10-01 00:40:06,583 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 457 transitions. [2018-10-01 00:40:06,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-10-01 00:40:06,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:06,584 INFO L375 BasicCegarLoop]: trace histogram [220, 219, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:40:06,585 INFO L423 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:06,585 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:06,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2051069288, now seen corresponding path program 218 times [2018-10-01 00:40:06,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:06,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:06,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:06,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:06,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 48198 backedges. 0 proven. 48180 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:40:09,516 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:09,516 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:09,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:09,879 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:09,879 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:09,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 48198 backedges. 0 proven. 48180 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:40:10,804 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:10,804 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [221, 221] total 221 [2018-10-01 00:40:10,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 222 states [2018-10-01 00:40:10,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 222 interpolants. [2018-10-01 00:40:10,808 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:10,808 INFO L87 Difference]: Start difference. First operand 455 states and 457 transitions. Second operand 222 states. [2018-10-01 00:40:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:17,532 INFO L93 Difference]: Finished difference Result 471 states and 475 transitions. [2018-10-01 00:40:17,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-10-01 00:40:17,532 INFO L78 Accepts]: Start accepts. Automaton has 222 states. Word has length 454 [2018-10-01 00:40:17,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:17,533 INFO L225 Difference]: With dead ends: 471 [2018-10-01 00:40:17,533 INFO L226 Difference]: Without dead ends: 457 [2018-10-01 00:40:17,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:40:17,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-10-01 00:40:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2018-10-01 00:40:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-10-01 00:40:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 459 transitions. [2018-10-01 00:40:17,544 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 459 transitions. Word has length 454 [2018-10-01 00:40:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:17,545 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 459 transitions. [2018-10-01 00:40:17,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 222 states. [2018-10-01 00:40:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 459 transitions. [2018-10-01 00:40:17,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-10-01 00:40:17,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:17,547 INFO L375 BasicCegarLoop]: trace histogram [221, 220, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:40:17,547 INFO L423 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:17,547 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:17,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1294431076, now seen corresponding path program 219 times [2018-10-01 00:40:17,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:17,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:17,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:17,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:17,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 48638 backedges. 0 proven. 48620 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:40:20,564 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:20,564 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:20,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:22,295 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 221 check-sat command(s) [2018-10-01 00:40:22,295 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:22,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 48638 backedges. 0 proven. 48620 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:40:23,189 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:23,189 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [222, 222] total 222 [2018-10-01 00:40:23,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 223 states [2018-10-01 00:40:23,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 223 interpolants. [2018-10-01 00:40:23,192 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:23,193 INFO L87 Difference]: Start difference. First operand 457 states and 459 transitions. Second operand 223 states. Received shutdown request... [2018-10-01 00:40:27,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-10-01 00:40:27,801 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-01 00:40:27,806 WARN L206 ceAbstractionStarter]: Timeout [2018-10-01 00:40:27,806 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:40:27 BoogieIcfgContainer [2018-10-01 00:40:27,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:40:27,807 INFO L168 Benchmark]: Toolchain (without parser) took 808461.61 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 982.0 MB). Free memory was 1.5 GB in the beginning and 848.3 MB in the end (delta: 615.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-01 00:40:27,809 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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-10-01 00:40:27,809 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.88 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-10-01 00:40:27,809 INFO L168 Benchmark]: Boogie Preprocessor took 19.56 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-10-01 00:40:27,810 INFO L168 Benchmark]: RCFGBuilder took 390.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:40:27,810 INFO L168 Benchmark]: TraceAbstraction took 808005.33 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 982.0 MB). Free memory was 1.4 GB in the beginning and 848.3 MB in the end (delta: 594.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-01 00:40:27,812 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.25 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 39.88 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 19.56 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 390.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 808005.33 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 982.0 MB). Free memory was 1.4 GB in the beginning and 848.3 MB in the end (delta: 594.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 83). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and FLOYD_HOARE automaton (currently 190 states, 223 states before enhancement), while ReachableStatesComputation was computing reachable states (376 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. TIMEOUT Result, 807.9s OverallTime, 223 OverallIterations, 221 TraceHistogramMax, 382.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2000 SDtfs, 31 SDslu, 65702 SDs, 0 SdLazy, 41211 SolverSat, 668 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 48.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76672 GetRequests, 52135 SyntacticMatches, 0 SemanticMatches, 24537 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 249.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=457occurred in iteration=222, 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: 1.6s AutomataMinimizationTime, 222 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 6.2s SsaConstructionTime, 115.4s SatisfiabilityAnalysisTime, 283.4s InterpolantComputationTime, 104291 NumberOfCodeBlocks, 104291 NumberOfCodeBlocksAsserted, 12688 NumberOfCheckSat, 103848 ConstructedInterpolants, 0 QuantifiedInterpolants, 92114286 SizeOfPredicates, 220 NumberOfNonLiveVariables, 257361 ConjunctsInSsa, 24750 ConjunctsInUnsatCore, 443 InterpolantComputations, 3 PerfectInterpolantSequences, 7896/7203656 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/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-40-27-821.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-40-27-821.csv Completed graceful shutdown