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.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 23:34:58,620 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 23:34:58,622 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 23:34:58,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 23:34:58,635 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 23:34:58,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 23:34:58,637 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 23:34:58,639 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 23:34:58,641 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 23:34:58,642 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 23:34:58,642 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 23:34:58,643 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 23:34:58,644 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 23:34:58,645 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 23:34:58,646 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 23:34:58,647 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 23:34:58,647 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 23:34:58,649 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 23:34:58,651 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 23:34:58,653 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 23:34:58,654 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 23:34:58,655 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 23:34:58,658 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 23:34:58,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 23:34:58,662 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 23:34:58,663 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 23:34:58,668 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 23:34:58,669 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 23:34:58,671 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 23:34:58,673 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 23:34:58,673 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 23:34:58,674 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 23:34:58,674 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 23:34:58,674 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 23:34:58,678 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 23:34:58,679 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 23:34:58,679 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 23:34:58,710 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 23:34:58,711 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 23:34:58,712 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 23:34:58,712 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 23:34:58,712 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 23:34:58,713 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 23:34:58,713 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 23:34:58,713 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 23:34:58,713 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 23:34:58,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 23:34:58,715 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 23:34:58,715 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 23:34:58,715 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 23:34:58,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 23:34:58,715 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 23:34:58,716 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 23:34:58,716 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 23:34:58,716 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 23:34:58,716 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 23:34:58,718 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 23:34:58,718 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 23:34:58,718 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 23:34:58,718 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:34:58,718 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 23:34:58,719 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 23:34:58,719 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 23:34:58,719 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 23:34:58,719 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 23:34:58,719 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 23:34:58,720 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 23:34:58,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 23:34:58,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 23:34:58,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 23:34:58,812 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 23:34:58,812 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 23:34:58,813 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2018-09-30 23:34:58,813 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2018-09-30 23:34:58,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 23:34:58,899 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 23:34:58,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 23:34:58,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 23:34:58,900 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 23:34:58,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:34:58" (1/1) ... [2018-09-30 23:34:58,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:34:58" (1/1) ... [2018-09-30 23:34:58,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 23:34:58,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 23:34:58,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 23:34:58,949 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 23:34:58,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:34:58" (1/1) ... [2018-09-30 23:34:58,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:34:58" (1/1) ... [2018-09-30 23:34:58,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:34:58" (1/1) ... [2018-09-30 23:34:58,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:34:58" (1/1) ... [2018-09-30 23:34:58,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:34:58" (1/1) ... [2018-09-30 23:34:58,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:34:58" (1/1) ... [2018-09-30 23:34:58,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:34:58" (1/1) ... [2018-09-30 23:34:58,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 23:34:58,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 23:34:58,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 23:34:58,980 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 23:34:58,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:34:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:34:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 23:34:59,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 23:34:59,296 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 23:34:59,297 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:34:59 BoogieIcfgContainer [2018-09-30 23:34:59,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 23:34:59,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 23:34:59,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 23:34:59,302 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 23:34:59,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:34:58" (1/2) ... [2018-09-30 23:34:59,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a8318b and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 11:34:59, skipping insertion in model container [2018-09-30 23:34:59,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:34:59" (2/2) ... [2018-09-30 23:34:59,306 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2018-09-30 23:34:59,316 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 23:34:59,324 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 23:34:59,369 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 23:34:59,369 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 23:34:59,370 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 23:34:59,370 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 23:34:59,370 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 23:34:59,370 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 23:34:59,370 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 23:34:59,371 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 23:34:59,371 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 23:34:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-09-30 23:34:59,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 23:34:59,392 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:34:59,393 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-30 23:34:59,395 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:34:59,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:34:59,401 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-09-30 23:34:59,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:34:59,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:34:59,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:34:59,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:34:59,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:34:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:34:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:34:59,667 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:34:59,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:34:59,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 23:34:59,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 23:34:59,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:34:59,692 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2018-09-30 23:34:59,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:34:59,847 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-09-30 23:34:59,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 23:34:59,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-30 23:34:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:34:59,861 INFO L225 Difference]: With dead ends: 15 [2018-09-30 23:34:59,861 INFO L226 Difference]: Without dead ends: 9 [2018-09-30 23:34:59,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:34:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-30 23:34:59,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-30 23:34:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 23:34:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-30 23:34:59,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-09-30 23:34:59,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:34:59,904 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-30 23:34:59,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 23:34:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-30 23:34:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:34:59,904 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:34:59,905 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-30 23:34:59,905 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:34:59,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:34:59,905 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2018-09-30 23:34:59,905 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:34:59,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:34:59,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:34:59,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:34:59,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:34:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:00,010 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:00,010 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:00,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:35:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:00,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:00,101 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:00,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-09-30 23:35:00,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 23:35:00,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 23:35:00,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:35:00,102 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-09-30 23:35:00,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:00,203 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-09-30 23:35:00,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 23:35:00,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-30 23:35:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:00,204 INFO L225 Difference]: With dead ends: 13 [2018-09-30 23:35:00,204 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 23:35:00,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-30 23:35:00,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 23:35:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-30 23:35:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 23:35:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-30 23:35:00,210 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-09-30 23:35:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:00,211 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-30 23:35:00,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 23:35:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-30 23:35:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 23:35:00,212 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:00,212 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 23:35:00,212 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:00,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-09-30 23:35:00,213 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:00,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:00,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:00,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:35:00,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:00,535 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:00,535 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:00,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:35:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:00,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:00,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:00,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:00,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:00,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:35:00,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:00,925 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:00,925 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-30 23:35:00,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:35:00,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:35:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:35:00,926 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 10 states. [2018-09-30 23:35:01,104 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-30 23:35:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:01,346 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-09-30 23:35:01,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 23:35:01,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-30 23:35:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:01,347 INFO L225 Difference]: With dead ends: 19 [2018-09-30 23:35:01,347 INFO L226 Difference]: Without dead ends: 13 [2018-09-30 23:35:01,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:35:01,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-30 23:35:01,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-30 23:35:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 23:35:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-30 23:35:01,355 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-09-30 23:35:01,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:01,355 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-30 23:35:01,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:35:01,355 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-30 23:35:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:35:01,356 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:01,356 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 23:35:01,357 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:01,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:01,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1765270407, now seen corresponding path program 2 times [2018-09-30 23:35:01,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:01,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:01,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:01,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:35:01,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:01,489 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:01,489 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:01,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:35:01,514 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:35:01,515 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:01,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:01,544 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:01,544 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-09-30 23:35:01,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 23:35:01,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 23:35:01,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-30 23:35:01,546 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-09-30 23:35:01,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:01,908 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-30 23:35:01,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 23:35:01,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-09-30 23:35:01,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:01,910 INFO L225 Difference]: With dead ends: 17 [2018-09-30 23:35:01,911 INFO L226 Difference]: Without dead ends: 15 [2018-09-30 23:35:01,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:35:01,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-30 23:35:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-30 23:35:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-30 23:35:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-30 23:35:01,917 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-09-30 23:35:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:01,918 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-30 23:35:01,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 23:35:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-30 23:35:01,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 23:35:01,919 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:01,919 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-09-30 23:35:01,919 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:01,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:01,919 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 3 times [2018-09-30 23:35:01,920 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:01,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:01,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:01,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:01,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:02,148 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:02,148 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:02,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:35:02,185 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-30 23:35:02,186 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:02,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:02,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:02,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:02,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:02,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:35:02,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-09-30 23:35:02,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:02,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:02,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-09-30 23:35:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:02,402 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:02,402 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-30 23:35:02,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 23:35:02,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 23:35:02,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-30 23:35:02,403 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 13 states. [2018-09-30 23:35:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:03,001 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-09-30 23:35:03,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 23:35:03,001 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-09-30 23:35:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:03,002 INFO L225 Difference]: With dead ends: 25 [2018-09-30 23:35:03,002 INFO L226 Difference]: Without dead ends: 17 [2018-09-30 23:35:03,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:35:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-30 23:35:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-30 23:35:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-30 23:35:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-09-30 23:35:03,010 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-09-30 23:35:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:03,010 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-09-30 23:35:03,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 23:35:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-30 23:35:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:35:03,011 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:03,011 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2018-09-30 23:35:03,012 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:03,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:03,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1096334355, now seen corresponding path program 4 times [2018-09-30 23:35:03,012 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:03,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:03,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:03,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:03,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:03,097 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:03,097 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:03,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:35:03,130 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:35:03,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:03,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:03,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:03,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:03,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:03,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:35:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-30 23:35:03,270 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:03,271 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-09-30 23:35:03,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:35:03,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:35:03,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:35:03,272 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2018-09-30 23:35:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:03,503 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-09-30 23:35:03,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 23:35:03,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-30 23:35:03,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:03,504 INFO L225 Difference]: With dead ends: 21 [2018-09-30 23:35:03,505 INFO L226 Difference]: Without dead ends: 19 [2018-09-30 23:35:03,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-09-30 23:35:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-30 23:35:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-30 23:35:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-30 23:35:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-30 23:35:03,512 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-09-30 23:35:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:03,512 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-30 23:35:03,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:35:03,512 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-30 23:35:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 23:35:03,513 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:03,513 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-09-30 23:35:03,514 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:03,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:03,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 5 times [2018-09-30 23:35:03,514 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:03,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:03,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:03,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:03,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:03,881 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:03,881 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:03,890 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:35:03,907 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-09-30 23:35:03,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:03,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:04,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:04,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:04,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:04,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:35:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:04,163 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:04,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-09-30 23:35:04,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 23:35:04,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 23:35:04,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:35:04,165 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 16 states. [2018-09-30 23:35:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:05,135 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-09-30 23:35:05,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 23:35:05,136 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-30 23:35:05,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:05,137 INFO L225 Difference]: With dead ends: 35 [2018-09-30 23:35:05,137 INFO L226 Difference]: Without dead ends: 23 [2018-09-30 23:35:05,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2018-09-30 23:35:05,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-30 23:35:05,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-30 23:35:05,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-30 23:35:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-09-30 23:35:05,147 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-09-30 23:35:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:05,148 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-09-30 23:35:05,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 23:35:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-30 23:35:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 23:35:05,149 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:05,149 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-09-30 23:35:05,149 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:05,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:05,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 6 times [2018-09-30 23:35:05,150 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:05,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:05,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:05,396 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:05,397 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:05,404 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:35:05,431 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-09-30 23:35:05,432 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:05,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:05,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:05,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:05,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:05,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:35:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:05,744 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:05,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-09-30 23:35:05,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 23:35:05,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 23:35:05,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:35:05,746 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 19 states. [2018-09-30 23:35:06,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:06,621 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-09-30 23:35:06,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:35:06,621 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2018-09-30 23:35:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:06,622 INFO L225 Difference]: With dead ends: 37 [2018-09-30 23:35:06,623 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 23:35:06,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-09-30 23:35:06,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 23:35:06,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-30 23:35:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-30 23:35:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-09-30 23:35:06,632 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-09-30 23:35:06,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:06,632 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-09-30 23:35:06,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 23:35:06,633 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-09-30 23:35:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:35:06,633 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:06,633 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2018-09-30 23:35:06,634 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:06,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:06,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1774380245, now seen corresponding path program 7 times [2018-09-30 23:35:06,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:06,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:06,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:06,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:06,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:06,838 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:06,838 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:06,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:35:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:06,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:06,928 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:06,928 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-09-30 23:35:06,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:35:06,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:35:06,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:35:06,933 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2018-09-30 23:35:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:07,282 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-09-30 23:35:07,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 23:35:07,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-09-30 23:35:07,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:07,284 INFO L225 Difference]: With dead ends: 29 [2018-09-30 23:35:07,284 INFO L226 Difference]: Without dead ends: 27 [2018-09-30 23:35:07,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:35:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-30 23:35:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-30 23:35:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-30 23:35:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-30 23:35:07,294 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-09-30 23:35:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:07,294 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-30 23:35:07,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:35:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-30 23:35:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-30 23:35:07,295 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:07,296 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-09-30 23:35:07,296 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:07,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:07,296 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 8 times [2018-09-30 23:35:07,297 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:07,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:07,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:07,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:35:07,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:07,551 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:07,551 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:07,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:35:07,603 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:35:07,604 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:07,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:08,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:08,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:08,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:08,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:35:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:08,183 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:08,183 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-09-30 23:35:08,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 23:35:08,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 23:35:08,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-09-30 23:35:08,184 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 22 states. [2018-09-30 23:35:08,413 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-09-30 23:35:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:08,867 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-09-30 23:35:08,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:35:08,868 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-09-30 23:35:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:08,869 INFO L225 Difference]: With dead ends: 43 [2018-09-30 23:35:08,869 INFO L226 Difference]: Without dead ends: 29 [2018-09-30 23:35:08,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2018-09-30 23:35:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-30 23:35:08,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-30 23:35:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-30 23:35:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-09-30 23:35:08,880 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-09-30 23:35:08,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:08,880 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-09-30 23:35:08,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 23:35:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-09-30 23:35:08,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 23:35:08,881 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:08,881 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2018-09-30 23:35:08,881 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:08,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:08,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1980325449, now seen corresponding path program 9 times [2018-09-30 23:35:08,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:08,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:08,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:08,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:08,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:09,031 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:09,031 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) [2018-09-30 23:35:09,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:09,075 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-30 23:35:09,076 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:09,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:09,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:09,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:09,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:09,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:35:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-30 23:35:09,199 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:09,199 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-09-30 23:35:09,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 23:35:09,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 23:35:09,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:35:09,201 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 16 states. [2018-09-30 23:35:09,786 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-09-30 23:35:09,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:09,815 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-09-30 23:35:09,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:35:09,815 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-30 23:35:09,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:09,816 INFO L225 Difference]: With dead ends: 33 [2018-09-30 23:35:09,816 INFO L226 Difference]: Without dead ends: 31 [2018-09-30 23:35:09,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-09-30 23:35:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-30 23:35:09,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-30 23:35:09,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 23:35:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-09-30 23:35:09,826 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-09-30 23:35:09,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:09,827 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-09-30 23:35:09,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 23:35:09,827 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-09-30 23:35:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 23:35:09,828 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:09,828 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-09-30 23:35:09,828 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:09,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:09,828 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 10 times [2018-09-30 23:35:09,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:09,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:09,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:09,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:09,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:10,113 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:10,113 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:10,121 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:35:10,134 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:35:10,134 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:10,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:10,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:10,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:10,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:10,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:35:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-30 23:35:10,329 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:10,329 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 23 [2018-09-30 23:35:10,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-30 23:35:10,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-30 23:35:10,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-09-30 23:35:10,331 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 23 states. [2018-09-30 23:35:11,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:11,010 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-09-30 23:35:11,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 23:35:11,010 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-09-30 23:35:11,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:11,011 INFO L225 Difference]: With dead ends: 53 [2018-09-30 23:35:11,011 INFO L226 Difference]: Without dead ends: 35 [2018-09-30 23:35:11,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 23:35:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-30 23:35:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-30 23:35:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 23:35:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-09-30 23:35:11,026 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-09-30 23:35:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:11,026 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-09-30 23:35:11,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-30 23:35:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-09-30 23:35:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 23:35:11,027 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:11,027 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-09-30 23:35:11,028 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:11,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:11,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 11 times [2018-09-30 23:35:11,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:11,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:11,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:11,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:11,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:11,389 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:11,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:11,397 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:35:11,424 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-09-30 23:35:11,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:11,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:11,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:11,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:11,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:11,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:35:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 20 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:11,918 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:11,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-09-30 23:35:11,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-30 23:35:11,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-30 23:35:11,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2018-09-30 23:35:11,920 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 32 states. [2018-09-30 23:35:13,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:13,586 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-09-30 23:35:13,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 23:35:13,586 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-09-30 23:35:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:13,587 INFO L225 Difference]: With dead ends: 59 [2018-09-30 23:35:13,587 INFO L226 Difference]: Without dead ends: 39 [2018-09-30 23:35:13,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=313, Invalid=2549, Unknown=0, NotChecked=0, Total=2862 [2018-09-30 23:35:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-30 23:35:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-30 23:35:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-30 23:35:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-09-30 23:35:13,602 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-09-30 23:35:13,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:13,603 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-09-30 23:35:13,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-30 23:35:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-09-30 23:35:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-30 23:35:13,604 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:13,604 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-09-30 23:35:13,604 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:13,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:13,605 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 12 times [2018-09-30 23:35:13,605 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:13,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:13,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:13,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:13,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:14,038 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:14,038 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:14,045 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:35:14,095 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-09-30 23:35:14,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:14,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:14,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:14,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:14,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:14,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:35:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:14,461 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:14,462 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2018-09-30 23:35:14,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-30 23:35:14,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-30 23:35:14,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2018-09-30 23:35:14,463 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 31 states. [2018-09-30 23:35:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:15,237 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-09-30 23:35:15,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 23:35:15,237 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-09-30 23:35:15,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:15,238 INFO L225 Difference]: With dead ends: 61 [2018-09-30 23:35:15,238 INFO L226 Difference]: Without dead ends: 41 [2018-09-30 23:35:15,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=187, Invalid=1535, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 23:35:15,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-30 23:35:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-30 23:35:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-30 23:35:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-09-30 23:35:15,253 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-09-30 23:35:15,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:15,254 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-09-30 23:35:15,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-30 23:35:15,254 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-09-30 23:35:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-30 23:35:15,255 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:15,255 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2018-09-30 23:35:15,255 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:15,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:15,255 INFO L82 PathProgramCache]: Analyzing trace with hash 830172837, now seen corresponding path program 13 times [2018-09-30 23:35:15,255 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:15,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:15,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:15,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:15,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 72 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:15,458 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:15,458 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:15,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:35:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:15,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:15,497 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 72 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:15,517 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:15,518 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2018-09-30 23:35:15,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 23:35:15,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 23:35:15,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-09-30 23:35:15,519 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 13 states. [2018-09-30 23:35:15,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:15,643 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-09-30 23:35:15,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 23:35:15,643 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-09-30 23:35:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:15,644 INFO L225 Difference]: With dead ends: 45 [2018-09-30 23:35:15,644 INFO L226 Difference]: Without dead ends: 43 [2018-09-30 23:35:15,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-30 23:35:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-30 23:35:15,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-30 23:35:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-30 23:35:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-09-30 23:35:15,657 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-09-30 23:35:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:15,657 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-09-30 23:35:15,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 23:35:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-09-30 23:35:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-30 23:35:15,658 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:15,658 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-09-30 23:35:15,658 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:15,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:15,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 14 times [2018-09-30 23:35:15,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:15,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:15,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:15,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:35:15,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:16,719 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:16,719 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:16,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:35:16,749 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:35:16,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:16,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:17,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:17,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:17,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:17,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:35:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:17,288 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:17,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 33 [2018-09-30 23:35:17,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-30 23:35:17,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-30 23:35:17,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 23:35:17,290 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 34 states. [2018-09-30 23:35:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:18,428 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-09-30 23:35:18,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 23:35:18,428 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 42 [2018-09-30 23:35:18,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:18,429 INFO L225 Difference]: With dead ends: 67 [2018-09-30 23:35:18,429 INFO L226 Difference]: Without dead ends: 45 [2018-09-30 23:35:18,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 23:35:18,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-30 23:35:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-30 23:35:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-30 23:35:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-09-30 23:35:18,447 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-09-30 23:35:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:18,447 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-09-30 23:35:18,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-30 23:35:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-09-30 23:35:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-30 23:35:18,448 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:18,448 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2018-09-30 23:35:18,448 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:18,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:18,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2070347801, now seen corresponding path program 15 times [2018-09-30 23:35:18,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:18,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:18,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:18,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:18,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 90 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:18,703 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:18,703 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:18,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:35:18,741 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-30 23:35:18,742 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:18,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:18,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:18,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:18,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:18,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:35:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-30 23:35:19,023 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:19,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-09-30 23:35:19,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-30 23:35:19,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-30 23:35:19,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-09-30 23:35:19,024 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 24 states. [2018-09-30 23:35:19,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:19,604 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-09-30 23:35:19,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 23:35:19,605 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-30 23:35:19,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:19,605 INFO L225 Difference]: With dead ends: 49 [2018-09-30 23:35:19,606 INFO L226 Difference]: Without dead ends: 47 [2018-09-30 23:35:19,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=1032, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 23:35:19,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-30 23:35:19,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-30 23:35:19,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-30 23:35:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-09-30 23:35:19,621 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-09-30 23:35:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:19,621 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-09-30 23:35:19,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-30 23:35:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-09-30 23:35:19,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-30 23:35:19,622 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:19,622 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-09-30 23:35:19,623 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:19,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:19,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 16 times [2018-09-30 23:35:19,623 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:19,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:19,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:19,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:19,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:20,308 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:20,308 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:20,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:35:20,351 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:35:20,352 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:20,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:20,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:20,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:20,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:20,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:35:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-30 23:35:20,754 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:20,754 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 35 [2018-09-30 23:35:20,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-30 23:35:20,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-30 23:35:20,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 23:35:20,755 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 35 states. [2018-09-30 23:35:21,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:21,902 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-09-30 23:35:21,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 23:35:21,903 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 46 [2018-09-30 23:35:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:21,904 INFO L225 Difference]: With dead ends: 77 [2018-09-30 23:35:21,904 INFO L226 Difference]: Without dead ends: 51 [2018-09-30 23:35:21,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=205, Invalid=2245, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 23:35:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-30 23:35:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-30 23:35:21,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-30 23:35:21,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-09-30 23:35:21,925 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2018-09-30 23:35:21,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:21,926 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-09-30 23:35:21,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-30 23:35:21,926 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-09-30 23:35:21,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-30 23:35:21,926 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:21,927 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-09-30 23:35:21,927 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:21,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:21,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 17 times [2018-09-30 23:35:21,927 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:21,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:21,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:21,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:21,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:22,395 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:22,395 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:22,404 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:35:22,446 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-30 23:35:22,447 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:22,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:23,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:23,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:23,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:23,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:35:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 72 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:23,271 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:23,271 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 47 [2018-09-30 23:35:23,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-30 23:35:23,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-30 23:35:23,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2034, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 23:35:23,275 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 48 states. [2018-09-30 23:35:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:25,675 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-09-30 23:35:25,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 23:35:25,675 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 50 [2018-09-30 23:35:25,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:25,676 INFO L225 Difference]: With dead ends: 83 [2018-09-30 23:35:25,676 INFO L226 Difference]: Without dead ends: 55 [2018-09-30 23:35:25,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=567, Invalid=5439, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 23:35:25,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-30 23:35:25,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-30 23:35:25,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-30 23:35:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-09-30 23:35:25,695 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2018-09-30 23:35:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:25,695 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-09-30 23:35:25,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-30 23:35:25,695 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-09-30 23:35:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-30 23:35:25,696 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:25,696 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-09-30 23:35:25,696 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:25,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:25,697 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 18 times [2018-09-30 23:35:25,697 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:25,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:25,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:25,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:25,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:26,272 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:26,272 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:26,280 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:35:26,327 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-30 23:35:26,327 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:26,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:26,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:26,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:26,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:26,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:35:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-09-30 23:35:27,075 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:27,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15] total 41 [2018-09-30 23:35:27,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-30 23:35:27,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-30 23:35:27,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1538, Unknown=0, NotChecked=0, Total=1640 [2018-09-30 23:35:27,077 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 41 states. [2018-09-30 23:35:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:28,699 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-09-30 23:35:28,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 23:35:28,699 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 54 [2018-09-30 23:35:28,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:28,700 INFO L225 Difference]: With dead ends: 89 [2018-09-30 23:35:28,700 INFO L226 Difference]: Without dead ends: 59 [2018-09-30 23:35:28,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=239, Invalid=3067, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 23:35:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-30 23:35:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-30 23:35:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-30 23:35:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-09-30 23:35:28,720 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-09-30 23:35:28,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:28,720 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-09-30 23:35:28,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-30 23:35:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-09-30 23:35:28,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-30 23:35:28,721 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:28,721 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-09-30 23:35:28,721 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:28,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:28,722 INFO L82 PathProgramCache]: Analyzing trace with hash 361552815, now seen corresponding path program 19 times [2018-09-30 23:35:28,722 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:28,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:28,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:28,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:28,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:30,073 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:30,073 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:30,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:35:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:30,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:30,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:30,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:30,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:30,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:35:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:30,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:30,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 45 [2018-09-30 23:35:30,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-30 23:35:30,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-30 23:35:30,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 23:35:30,786 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 46 states. [2018-09-30 23:35:32,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:32,208 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-09-30 23:35:32,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 23:35:32,209 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 58 [2018-09-30 23:35:32,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:32,210 INFO L225 Difference]: With dead ends: 91 [2018-09-30 23:35:32,210 INFO L226 Difference]: Without dead ends: 61 [2018-09-30 23:35:32,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 23:35:32,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-30 23:35:32,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-30 23:35:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-30 23:35:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-09-30 23:35:32,241 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-09-30 23:35:32,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:32,241 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-09-30 23:35:32,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-30 23:35:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-09-30 23:35:32,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-30 23:35:32,242 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:32,242 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1] [2018-09-30 23:35:32,242 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:32,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:32,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1210122729, now seen corresponding path program 20 times [2018-09-30 23:35:32,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:32,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:32,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:32,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:35:32,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 182 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:32,736 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:32,736 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:32,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:35:32,779 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:35:32,779 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:32,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 182 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:32,818 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:32,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 17 [2018-09-30 23:35:32,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 23:35:32,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 23:35:32,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-09-30 23:35:32,819 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 18 states. [2018-09-30 23:35:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:33,046 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-09-30 23:35:33,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 23:35:33,048 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-09-30 23:35:33,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:33,049 INFO L225 Difference]: With dead ends: 65 [2018-09-30 23:35:33,049 INFO L226 Difference]: Without dead ends: 63 [2018-09-30 23:35:33,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-30 23:35:33,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-30 23:35:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-30 23:35:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-30 23:35:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-09-30 23:35:33,074 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-09-30 23:35:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:33,074 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-09-30 23:35:33,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 23:35:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-09-30 23:35:33,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-30 23:35:33,075 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:33,075 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-09-30 23:35:33,075 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:33,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:33,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1008142301, now seen corresponding path program 21 times [2018-09-30 23:35:33,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:33,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:33,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:33,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:33,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:34,164 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:34,164 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:34,164 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:34,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:35:34,231 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-09-30 23:35:34,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:34,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:34,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:34,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:34,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:34,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:35:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-09-30 23:35:34,881 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:34,881 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17] total 47 [2018-09-30 23:35:34,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-30 23:35:34,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-30 23:35:34,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2044, Unknown=0, NotChecked=0, Total=2162 [2018-09-30 23:35:34,883 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 47 states. [2018-09-30 23:35:36,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:36,805 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-09-30 23:35:36,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 23:35:36,806 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 62 [2018-09-30 23:35:36,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:36,807 INFO L225 Difference]: With dead ends: 101 [2018-09-30 23:35:36,807 INFO L226 Difference]: Without dead ends: 67 [2018-09-30 23:35:36,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=273, Invalid=4017, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 23:35:36,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-30 23:35:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-30 23:35:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-30 23:35:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-30 23:35:36,830 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2018-09-30 23:35:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:36,830 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-30 23:35:36,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-30 23:35:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-30 23:35:36,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 23:35:36,831 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:36,831 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-09-30 23:35:36,831 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:36,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:36,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1978312041, now seen corresponding path program 22 times [2018-09-30 23:35:36,831 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:36,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:36,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:36,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:36,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:37,713 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:37,713 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:37,720 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:35:37,756 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:35:37,756 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:37,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:38,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:38,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:38,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:38,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:35:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-09-30 23:35:38,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:38,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 18] total 50 [2018-09-30 23:35:38,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 23:35:38,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 23:35:38,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2324, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 23:35:38,959 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 50 states. [2018-09-30 23:35:40,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:40,826 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-09-30 23:35:40,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 23:35:40,826 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-09-30 23:35:40,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:40,827 INFO L225 Difference]: With dead ends: 107 [2018-09-30 23:35:40,827 INFO L226 Difference]: Without dead ends: 71 [2018-09-30 23:35:40,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=290, Invalid=4540, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 23:35:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-30 23:35:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-30 23:35:40,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-30 23:35:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-09-30 23:35:40,851 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2018-09-30 23:35:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:40,851 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-09-30 23:35:40,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 23:35:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-09-30 23:35:40,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-30 23:35:40,851 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:40,851 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-09-30 23:35:40,852 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:40,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:40,852 INFO L82 PathProgramCache]: Analyzing trace with hash 303497995, now seen corresponding path program 23 times [2018-09-30 23:35:40,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:40,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:40,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:40,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:40,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:41,970 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:41,970 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:41,977 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:35:42,068 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-09-30 23:35:42,068 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:42,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:43,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:43,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:43,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:43,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:35:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 182 proven. 362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:43,492 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:43,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 67 [2018-09-30 23:35:43,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-30 23:35:43,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-30 23:35:43,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=4119, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 23:35:43,494 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 68 states. [2018-09-30 23:35:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:46,834 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-09-30 23:35:46,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 23:35:46,834 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 70 [2018-09-30 23:35:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:46,835 INFO L225 Difference]: With dead ends: 113 [2018-09-30 23:35:46,835 INFO L226 Difference]: Without dead ends: 75 [2018-09-30 23:35:46,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=997, Invalid=10559, Unknown=0, NotChecked=0, Total=11556 [2018-09-30 23:35:46,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-30 23:35:46,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-30 23:35:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-30 23:35:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-09-30 23:35:46,861 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2018-09-30 23:35:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:46,862 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-09-30 23:35:46,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-30 23:35:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-09-30 23:35:46,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-30 23:35:46,862 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:46,862 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-09-30 23:35:46,862 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:46,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:46,863 INFO L82 PathProgramCache]: Analyzing trace with hash -177016449, now seen corresponding path program 24 times [2018-09-30 23:35:46,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:46,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:46,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:46,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:46,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:47,750 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:47,750 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:47,759 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:35:47,832 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-09-30 23:35:47,832 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:47,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:48,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:48,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:48,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:48,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:35:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:48,767 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:48,767 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 57 [2018-09-30 23:35:48,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-30 23:35:48,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-30 23:35:48,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 23:35:48,768 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 58 states. [2018-09-30 23:35:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:50,790 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-09-30 23:35:50,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 23:35:50,790 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 74 [2018-09-30 23:35:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:50,791 INFO L225 Difference]: With dead ends: 115 [2018-09-30 23:35:50,792 INFO L226 Difference]: Without dead ends: 77 [2018-09-30 23:35:50,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 23:35:50,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-30 23:35:50,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-30 23:35:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-30 23:35:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-09-30 23:35:50,820 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-09-30 23:35:50,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:50,820 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-09-30 23:35:50,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-30 23:35:50,821 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-09-30 23:35:50,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-30 23:35:50,821 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:50,821 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1] [2018-09-30 23:35:50,821 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:50,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:50,822 INFO L82 PathProgramCache]: Analyzing trace with hash -42507335, now seen corresponding path program 25 times [2018-09-30 23:35:50,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:50,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:50,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:50,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:50,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 306 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:51,116 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:51,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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:51,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:35:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:51,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 306 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:51,198 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:51,199 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 21 [2018-09-30 23:35:51,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 23:35:51,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 23:35:51,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-09-30 23:35:51,200 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 22 states. [2018-09-30 23:35:51,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:51,594 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-09-30 23:35:51,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 23:35:51,595 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 76 [2018-09-30 23:35:51,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:51,596 INFO L225 Difference]: With dead ends: 81 [2018-09-30 23:35:51,596 INFO L226 Difference]: Without dead ends: 79 [2018-09-30 23:35:51,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 23:35:51,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-30 23:35:51,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-30 23:35:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-30 23:35:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-09-30 23:35:51,631 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-09-30 23:35:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:51,631 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-09-30 23:35:51,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 23:35:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-09-30 23:35:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-30 23:35:51,632 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:51,632 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-09-30 23:35:51,632 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:51,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:51,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2100176371, now seen corresponding path program 26 times [2018-09-30 23:35:51,633 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:51,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:51,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:51,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:35:51,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:53,185 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:53,185 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:53,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:53,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:35:53,239 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:35:53,239 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:53,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:54,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:54,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:54,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:54,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:35:54,467 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:54,487 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:54,487 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 60 [2018-09-30 23:35:54,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-30 23:35:54,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-30 23:35:54,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3482, Unknown=0, NotChecked=0, Total=3660 [2018-09-30 23:35:54,489 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 61 states. [2018-09-30 23:35:56,131 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-09-30 23:35:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:56,687 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-09-30 23:35:56,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 23:35:56,687 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 78 [2018-09-30 23:35:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:56,688 INFO L225 Difference]: With dead ends: 121 [2018-09-30 23:35:56,688 INFO L226 Difference]: Without dead ends: 81 [2018-09-30 23:35:56,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=377, Invalid=6265, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 23:35:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-30 23:35:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-30 23:35:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-30 23:35:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-09-30 23:35:56,717 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-09-30 23:35:56,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:56,717 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-09-30 23:35:56,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-30 23:35:56,718 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-09-30 23:35:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-30 23:35:56,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:56,718 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1] [2018-09-30 23:35:56,718 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:56,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:56,719 INFO L82 PathProgramCache]: Analyzing trace with hash 752544557, now seen corresponding path program 27 times [2018-09-30 23:35:56,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:56,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:56,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:56,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:56,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:35:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 342 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:35:57,188 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:35:57,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:35:57,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:35:57,282 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-09-30 23:35:57,282 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:35:57,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:35:58,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:35:58,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:35:58,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:35:58,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:35:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-09-30 23:35:58,181 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:35:58,181 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2018-09-30 23:35:58,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-30 23:35:58,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-30 23:35:58,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1450, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 23:35:58,182 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 42 states. [2018-09-30 23:35:59,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:35:59,521 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-09-30 23:35:59,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 23:35:59,521 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-30 23:35:59,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:35:59,522 INFO L225 Difference]: With dead ends: 85 [2018-09-30 23:35:59,522 INFO L226 Difference]: Without dead ends: 83 [2018-09-30 23:35:59,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=588, Invalid=3318, Unknown=0, NotChecked=0, Total=3906 [2018-09-30 23:35:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-30 23:35:59,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-30 23:35:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-30 23:35:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-09-30 23:35:59,555 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-09-30 23:35:59,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:35:59,555 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-09-30 23:35:59,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-30 23:35:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-09-30 23:35:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-30 23:35:59,556 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:35:59,556 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-09-30 23:35:59,556 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:35:59,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:35:59,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1640865895, now seen corresponding path program 28 times [2018-09-30 23:35:59,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:35:59,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:35:59,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:59,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:35:59,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:35:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:36:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:00,639 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:36:00,639 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:36:00,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:36:00,676 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:36:00,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:36:00,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:36:01,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:36:01,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:36:01,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:36:01,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:36:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-09-30 23:36:01,717 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:36:01,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 22] total 62 [2018-09-30 23:36:01,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-30 23:36:01,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-30 23:36:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=3624, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 23:36:01,719 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 62 states. [2018-09-30 23:36:04,755 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-30 23:36:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:36:04,967 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-09-30 23:36:04,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-30 23:36:04,968 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 82 [2018-09-30 23:36:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:36:04,969 INFO L225 Difference]: With dead ends: 131 [2018-09-30 23:36:04,969 INFO L226 Difference]: Without dead ends: 87 [2018-09-30 23:36:04,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=358, Invalid=6952, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 23:36:04,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-30 23:36:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-30 23:36:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-30 23:36:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-09-30 23:36:05,005 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2018-09-30 23:36:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:36:05,005 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-09-30 23:36:05,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-30 23:36:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-09-30 23:36:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-30 23:36:05,005 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:36:05,005 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-09-30 23:36:05,006 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:36:05,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:36:05,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1957273381, now seen corresponding path program 29 times [2018-09-30 23:36:05,006 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:36:05,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:36:05,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:05,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:36:05,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:36:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:06,063 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:36:06,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:36:06,073 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:36:06,200 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-09-30 23:36:06,200 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:36:06,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:36:08,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:36:08,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:36:08,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:36:08,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:36:08,230 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 306 proven. 534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:08,251 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:36:08,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 83 [2018-09-30 23:36:08,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-30 23:36:08,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-30 23:36:08,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=6309, Unknown=0, NotChecked=0, Total=6972 [2018-09-30 23:36:08,253 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 84 states. [2018-09-30 23:36:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:36:13,094 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-09-30 23:36:13,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 23:36:13,095 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 86 [2018-09-30 23:36:13,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:36:13,096 INFO L225 Difference]: With dead ends: 137 [2018-09-30 23:36:13,096 INFO L226 Difference]: Without dead ends: 91 [2018-09-30 23:36:13,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2976 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1431, Invalid=15861, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 23:36:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-30 23:36:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-30 23:36:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-30 23:36:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-09-30 23:36:13,145 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2018-09-30 23:36:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:36:13,146 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-09-30 23:36:13,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-30 23:36:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-09-30 23:36:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-30 23:36:13,146 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:36:13,146 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-09-30 23:36:13,147 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:36:13,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:36:13,147 INFO L82 PathProgramCache]: Analyzing trace with hash -783456433, now seen corresponding path program 30 times [2018-09-30 23:36:13,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:36:13,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:36:13,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:13,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:36:13,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:36:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:15,482 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:36:15,482 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:36:15,489 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:36:15,591 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-09-30 23:36:15,591 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:36:15,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:36:16,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:36:16,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:36:16,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:36:16,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:36:16,970 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:16,991 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:36:16,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 69 [2018-09-30 23:36:16,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-30 23:36:16,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-30 23:36:16,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 23:36:16,992 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 70 states. [2018-09-30 23:36:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:36:19,665 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-09-30 23:36:19,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 23:36:19,665 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 90 [2018-09-30 23:36:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:36:19,666 INFO L225 Difference]: With dead ends: 139 [2018-09-30 23:36:19,666 INFO L226 Difference]: Without dead ends: 93 [2018-09-30 23:36:19,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 23:36:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-30 23:36:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-30 23:36:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 23:36:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-09-30 23:36:19,717 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-09-30 23:36:19,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:36:19,717 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-09-30 23:36:19,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-30 23:36:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-09-30 23:36:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-30 23:36:19,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:36:19,718 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1] [2018-09-30 23:36:19,718 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:36:19,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:36:19,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1017783689, now seen corresponding path program 31 times [2018-09-30 23:36:19,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:36:19,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:36:19,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:19,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:36:19,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:36:20,279 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 462 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:20,279 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:36:20,279 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:36:20,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:36:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:36:20,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:36:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 462 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:20,374 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:36:20,374 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 25 [2018-09-30 23:36:20,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-30 23:36:20,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-30 23:36:20,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-09-30 23:36:20,375 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 26 states. [2018-09-30 23:36:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:36:20,808 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-09-30 23:36:20,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 23:36:20,808 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 92 [2018-09-30 23:36:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:36:20,809 INFO L225 Difference]: With dead ends: 97 [2018-09-30 23:36:20,809 INFO L226 Difference]: Without dead ends: 95 [2018-09-30 23:36:20,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 23:36:20,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-30 23:36:20,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-30 23:36:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-30 23:36:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-09-30 23:36:20,849 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-09-30 23:36:20,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:36:20,850 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-09-30 23:36:20,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-30 23:36:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-09-30 23:36:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-30 23:36:20,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:36:20,850 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-09-30 23:36:20,851 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:36:20,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:36:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1162366013, now seen corresponding path program 32 times [2018-09-30 23:36:20,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:36:20,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:36:20,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:20,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:36:20,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:36:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:22,125 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:36:22,125 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:36:22,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:36:22,180 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:36:22,181 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:36:22,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:36:23,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:36:23,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:36:23,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:36:23,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:36:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:23,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:36:23,582 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 72 [2018-09-30 23:36:23,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-30 23:36:23,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-30 23:36:23,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=5042, Unknown=0, NotChecked=0, Total=5256 [2018-09-30 23:36:23,583 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 73 states. [2018-09-30 23:36:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:36:26,652 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-09-30 23:36:26,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 23:36:26,652 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 94 [2018-09-30 23:36:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:36:26,653 INFO L225 Difference]: With dead ends: 145 [2018-09-30 23:36:26,653 INFO L226 Difference]: Without dead ends: 97 [2018-09-30 23:36:26,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=453, Invalid=9053, Unknown=0, NotChecked=0, Total=9506 [2018-09-30 23:36:26,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-30 23:36:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-30 23:36:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-30 23:36:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-09-30 23:36:26,695 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-09-30 23:36:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:36:26,696 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-09-30 23:36:26,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-30 23:36:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-09-30 23:36:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-30 23:36:26,696 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:36:26,696 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1] [2018-09-30 23:36:26,696 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:36:26,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:36:26,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1867070211, now seen corresponding path program 33 times [2018-09-30 23:36:26,697 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:36:26,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:36:26,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:26,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:36:26,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:36:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 506 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:27,371 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:36:27,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:36:27,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:36:27,505 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-09-30 23:36:27,505 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:36:27,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:36:28,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:36:28,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:36:28,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:36:28,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:36:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-09-30 23:36:28,180 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:36:28,180 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2018-09-30 23:36:28,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 23:36:28,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 23:36:28,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2076, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 23:36:28,181 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 50 states. [2018-09-30 23:36:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:36:29,932 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-09-30 23:36:29,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 23:36:29,933 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-30 23:36:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:36:29,934 INFO L225 Difference]: With dead ends: 101 [2018-09-30 23:36:29,934 INFO L226 Difference]: Without dead ends: 99 [2018-09-30 23:36:29,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=800, Invalid=4750, Unknown=0, NotChecked=0, Total=5550 [2018-09-30 23:36:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-30 23:36:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-30 23:36:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-30 23:36:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-09-30 23:36:29,993 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-09-30 23:36:29,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:36:29,994 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-09-30 23:36:29,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 23:36:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-09-30 23:36:29,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-30 23:36:29,995 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:36:29,995 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-09-30 23:36:29,995 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:36:29,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:36:29,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1041909303, now seen corresponding path program 34 times [2018-09-30 23:36:29,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:36:29,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:36:29,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:29,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:36:29,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:36:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 1104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:31,296 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:36:31,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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:36:31,303 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:36:31,340 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:36:31,341 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:36:31,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:36:32,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:36:32,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:36:32,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:36:32,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:36:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-09-30 23:36:32,806 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:36:32,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 26] total 74 [2018-09-30 23:36:32,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-30 23:36:32,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-30 23:36:32,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=5212, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 23:36:32,808 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 74 states. [2018-09-30 23:36:36,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:36:36,886 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-09-30 23:36:36,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-30 23:36:36,887 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 98 [2018-09-30 23:36:36,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:36:36,888 INFO L225 Difference]: With dead ends: 155 [2018-09-30 23:36:36,888 INFO L226 Difference]: Without dead ends: 103 [2018-09-30 23:36:36,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=426, Invalid=9876, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 23:36:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-30 23:36:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-30 23:36:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-30 23:36:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-09-30 23:36:36,934 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2018-09-30 23:36:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:36:36,935 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-09-30 23:36:36,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-30 23:36:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-09-30 23:36:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-30 23:36:36,935 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:36:36,935 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-09-30 23:36:36,935 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:36:36,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:36:36,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2122703189, now seen corresponding path program 35 times [2018-09-30 23:36:36,936 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:36:36,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:36:36,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:36,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:36:36,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:36:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 1200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:38,325 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:36:38,325 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:36:38,334 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:36:38,534 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-09-30 23:36:38,534 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:36:38,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:36:41,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:36:41,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:36:41,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:36:41,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:36:41,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 462 proven. 738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:41,682 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:36:41,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 99 [2018-09-30 23:36:41,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-30 23:36:41,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-30 23:36:41,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=937, Invalid=8963, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 23:36:41,684 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 100 states. [2018-09-30 23:36:47,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:36:47,790 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-09-30 23:36:47,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-30 23:36:47,790 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 102 [2018-09-30 23:36:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:36:47,792 INFO L225 Difference]: With dead ends: 161 [2018-09-30 23:36:47,792 INFO L226 Difference]: Without dead ends: 107 [2018-09-30 23:36:47,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4198 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1945, Invalid=22235, Unknown=0, NotChecked=0, Total=24180 [2018-09-30 23:36:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-30 23:36:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-30 23:36:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-30 23:36:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-09-30 23:36:47,843 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102 [2018-09-30 23:36:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:36:47,843 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-09-30 23:36:47,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-30 23:36:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-09-30 23:36:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-30 23:36:47,844 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:36:47,844 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-09-30 23:36:47,844 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:36:47,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:36:47,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1705231073, now seen corresponding path program 36 times [2018-09-30 23:36:47,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:36:47,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:36:47,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:47,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:36:47,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:36:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:49,799 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:36:49,799 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:36:49,806 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:36:49,949 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-09-30 23:36:49,949 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:36:49,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:36:51,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:36:51,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:36:51,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:36:51,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:36:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:51,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:36:51,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 81 [2018-09-30 23:36:51,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-30 23:36:51,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-30 23:36:51,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 23:36:51,881 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 82 states. [2018-09-30 23:36:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:36:55,756 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-09-30 23:36:55,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 23:36:55,756 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 106 [2018-09-30 23:36:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:36:55,757 INFO L225 Difference]: With dead ends: 163 [2018-09-30 23:36:55,757 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 23:36:55,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 23:36:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 23:36:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-30 23:36:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 23:36:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-09-30 23:36:55,813 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-09-30 23:36:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:36:55,813 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-09-30 23:36:55,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-30 23:36:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-09-30 23:36:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-30 23:36:55,814 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:36:55,814 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1] [2018-09-30 23:36:55,815 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:36:55,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:36:55,815 INFO L82 PathProgramCache]: Analyzing trace with hash 653870937, now seen corresponding path program 37 times [2018-09-30 23:36:55,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:36:55,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:36:55,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:55,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:36:55,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:36:56,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 650 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:56,417 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:36:56,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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:36:56,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:36:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:36:56,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:36:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 650 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:56,538 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:36:56,538 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 29 [2018-09-30 23:36:56,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-30 23:36:56,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-30 23:36:56,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-09-30 23:36:56,539 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 30 states. [2018-09-30 23:36:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:36:57,150 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-09-30 23:36:57,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 23:36:57,151 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 108 [2018-09-30 23:36:57,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:36:57,152 INFO L225 Difference]: With dead ends: 113 [2018-09-30 23:36:57,152 INFO L226 Difference]: Without dead ends: 111 [2018-09-30 23:36:57,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 23:36:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-30 23:36:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-30 23:36:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-30 23:36:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-09-30 23:36:57,206 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-09-30 23:36:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:36:57,206 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-09-30 23:36:57,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-30 23:36:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-09-30 23:36:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-30 23:36:57,206 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:36:57,207 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-09-30 23:36:57,207 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:36:57,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:36:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1304797587, now seen corresponding path program 38 times [2018-09-30 23:36:57,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:36:57,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:36:57,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:57,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:36:57,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:36:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:36:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:36:58,888 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:36:58,888 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:36:58,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:36:58,963 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:36:58,964 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:36:58,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:01,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:37:01,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:37:01,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:37:01,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:37:01,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:37:01,123 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:01,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 84 [2018-09-30 23:37:01,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-30 23:37:01,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-30 23:37:01,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=6890, Unknown=0, NotChecked=0, Total=7140 [2018-09-30 23:37:01,125 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 85 states. [2018-09-30 23:37:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:05,269 INFO L93 Difference]: Finished difference Result 169 states and 171 transitions. [2018-09-30 23:37:05,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 23:37:05,269 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 110 [2018-09-30 23:37:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:05,270 INFO L225 Difference]: With dead ends: 169 [2018-09-30 23:37:05,271 INFO L226 Difference]: Without dead ends: 113 [2018-09-30 23:37:05,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=529, Invalid=12353, Unknown=0, NotChecked=0, Total=12882 [2018-09-30 23:37:05,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-30 23:37:05,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-30 23:37:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-30 23:37:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-09-30 23:37:05,325 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-09-30 23:37:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:05,325 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-09-30 23:37:05,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-30 23:37:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-09-30 23:37:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-30 23:37:05,325 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:05,326 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1] [2018-09-30 23:37:05,326 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:05,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:05,326 INFO L82 PathProgramCache]: Analyzing trace with hash -738263347, now seen corresponding path program 39 times [2018-09-30 23:37:05,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:05,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:05,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:05,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:05,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 702 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:37:06,049 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:06,049 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:06,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:37:06,233 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-09-30 23:37:06,233 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:06,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:07,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:37:07,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:37:07,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:37:07,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:37:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-09-30 23:37:08,064 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:08,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 58 [2018-09-30 23:37:08,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-30 23:37:08,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-30 23:37:08,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2814, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 23:37:08,065 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 58 states. [2018-09-30 23:37:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:10,132 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-09-30 23:37:10,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 23:37:10,132 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-30 23:37:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:10,133 INFO L225 Difference]: With dead ends: 117 [2018-09-30 23:37:10,133 INFO L226 Difference]: Without dead ends: 115 [2018-09-30 23:37:10,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1044, Invalid=6438, Unknown=0, NotChecked=0, Total=7482 [2018-09-30 23:37:10,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-30 23:37:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-30 23:37:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-30 23:37:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-09-30 23:37:10,198 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-09-30 23:37:10,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:10,198 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-09-30 23:37:10,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-30 23:37:10,198 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-09-30 23:37:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-30 23:37:10,199 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:10,199 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-09-30 23:37:10,199 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:10,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:10,199 INFO L82 PathProgramCache]: Analyzing trace with hash -801420281, now seen corresponding path program 40 times [2018-09-30 23:37:10,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:10,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:10,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:10,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:10,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:37:12,189 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:12,189 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-30 23:37:12,197 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:37:12,238 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:37:12,239 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:12,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:14,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:37:14,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:37:14,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:37:14,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:37:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-09-30 23:37:14,257 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:14,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 30] total 86 [2018-09-30 23:37:14,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-30 23:37:14,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-30 23:37:14,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=7088, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 23:37:14,258 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 86 states. [2018-09-30 23:37:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:19,992 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2018-09-30 23:37:19,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-30 23:37:19,992 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 114 [2018-09-30 23:37:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:19,993 INFO L225 Difference]: With dead ends: 179 [2018-09-30 23:37:19,993 INFO L226 Difference]: Without dead ends: 119 [2018-09-30 23:37:19,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=494, Invalid=13312, Unknown=0, NotChecked=0, Total=13806 [2018-09-30 23:37:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-30 23:37:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-30 23:37:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-30 23:37:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-09-30 23:37:20,060 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2018-09-30 23:37:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:20,060 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-09-30 23:37:20,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-30 23:37:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-09-30 23:37:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-30 23:37:20,061 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:20,061 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-09-30 23:37:20,061 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:20,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:20,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2050868101, now seen corresponding path program 41 times [2018-09-30 23:37:20,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:20,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:20,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:20,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:20,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 1624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:37:22,666 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:22,666 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-09-30 23:37:22,675 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:37:22,980 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-09-30 23:37:22,980 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:22,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:26,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:37:26,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:37:26,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:37:26,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:37:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 650 proven. 974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:37:26,990 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:26,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 115 [2018-09-30 23:37:26,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-30 23:37:26,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-30 23:37:26,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=12081, Unknown=0, NotChecked=0, Total=13340 [2018-09-30 23:37:26,992 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 116 states. [2018-09-30 23:37:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:34,980 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2018-09-30 23:37:34,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-30 23:37:34,981 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 118 [2018-09-30 23:37:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:34,982 INFO L225 Difference]: With dead ends: 185 [2018-09-30 23:37:34,982 INFO L226 Difference]: Without dead ends: 123 [2018-09-30 23:37:34,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5628 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=2539, Invalid=29681, Unknown=0, NotChecked=0, Total=32220 [2018-09-30 23:37:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-30 23:37:35,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-30 23:37:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-30 23:37:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-09-30 23:37:35,050 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 118 [2018-09-30 23:37:35,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:35,050 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-09-30 23:37:35,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-30 23:37:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-09-30 23:37:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-30 23:37:35,051 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:35,051 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-09-30 23:37:35,052 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:35,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:35,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1042320657, now seen corresponding path program 42 times [2018-09-30 23:37:35,052 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:35,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:35,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:35,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:35,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 1740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:37:37,468 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:37,469 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-09-30 23:37:37,476 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:37:37,676 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2018-09-30 23:37:37,676 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:37,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:39,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:37:39,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:37:39,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:37:39,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:37:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-09-30 23:37:39,929 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:39,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 32] total 92 [2018-09-30 23:37:39,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-30 23:37:39,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-30 23:37:39,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=8134, Unknown=0, NotChecked=0, Total=8372 [2018-09-30 23:37:39,930 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 92 states. [2018-09-30 23:37:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:45,956 INFO L93 Difference]: Finished difference Result 191 states and 195 transitions. [2018-09-30 23:37:45,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-30 23:37:45,956 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 122 [2018-09-30 23:37:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:45,957 INFO L225 Difference]: With dead ends: 191 [2018-09-30 23:37:45,958 INFO L226 Difference]: Without dead ends: 127 [2018-09-30 23:37:45,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=528, Invalid=15222, Unknown=0, NotChecked=0, Total=15750 [2018-09-30 23:37:45,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-30 23:37:46,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-30 23:37:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-30 23:37:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-09-30 23:37:46,054 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2018-09-30 23:37:46,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:46,054 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-09-30 23:37:46,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-30 23:37:46,055 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-09-30 23:37:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-30 23:37:46,055 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:46,056 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-09-30 23:37:46,056 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:46,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:46,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2020085917, now seen corresponding path program 43 times [2018-09-30 23:37:46,056 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:46,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:46,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:46,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:46,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 1860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:37:48,572 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:48,572 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-09-30 23:37:48,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:37:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:48,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:50,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:37:50,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:37:50,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:37:50,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:37:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 1860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:37:51,054 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:51,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 96 [2018-09-30 23:37:51,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-30 23:37:51,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-30 23:37:51,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=9026, Unknown=0, NotChecked=0, Total=9312 [2018-09-30 23:37:51,056 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 97 states. [2018-09-30 23:37:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:56,162 INFO L93 Difference]: Finished difference Result 193 states and 195 transitions. [2018-09-30 23:37:56,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-30 23:37:56,162 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 126 [2018-09-30 23:37:56,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:56,163 INFO L225 Difference]: With dead ends: 193 [2018-09-30 23:37:56,164 INFO L226 Difference]: Without dead ends: 129 [2018-09-30 23:37:56,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=605, Invalid=16165, Unknown=0, NotChecked=0, Total=16770 [2018-09-30 23:37:56,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-30 23:37:56,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-30 23:37:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-30 23:37:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-09-30 23:37:56,238 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-09-30 23:37:56,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:56,238 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-09-30 23:37:56,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-30 23:37:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-09-30 23:37:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-30 23:37:56,239 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:56,239 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1] [2018-09-30 23:37:56,239 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:56,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:56,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2012453021, now seen corresponding path program 44 times [2018-09-30 23:37:56,240 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:56,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:56,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:56,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:37:56,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 930 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:37:57,142 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:57,143 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-09-30 23:37:57,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:37:57,220 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:37:57,221 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:57,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 930 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:37:57,282 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:57,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 34 [2018-09-30 23:37:57,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-30 23:37:57,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-30 23:37:57,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 23:37:57,284 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 35 states. [2018-09-30 23:37:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:57,962 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-09-30 23:37:57,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-30 23:37:57,963 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 128 [2018-09-30 23:37:57,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:57,964 INFO L225 Difference]: With dead ends: 133 [2018-09-30 23:37:57,964 INFO L226 Difference]: Without dead ends: 131 [2018-09-30 23:37:57,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 23:37:57,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-30 23:37:58,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-30 23:37:58,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-30 23:37:58,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-09-30 23:37:58,053 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-09-30 23:37:58,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:58,053 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-09-30 23:37:58,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-30 23:37:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-09-30 23:37:58,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-30 23:37:58,054 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:58,054 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-09-30 23:37:58,054 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:58,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:58,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1232122327, now seen corresponding path program 45 times [2018-09-30 23:37:58,054 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:58,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:58,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:58,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:58,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 1984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:00,852 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:38:00,852 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-09-30 23:38:00,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:38:01,118 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-09-30 23:38:01,118 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:38:01,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:38:03,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:38:03,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:38:03,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:38:03,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:38:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 1984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:03,859 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:38:03,859 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 99 [2018-09-30 23:38:03,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-30 23:38:03,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-30 23:38:03,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 23:38:03,860 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 100 states. [2018-09-30 23:38:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:38:09,662 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-09-30 23:38:09,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 23:38:09,663 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 130 [2018-09-30 23:38:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:38:09,664 INFO L225 Difference]: With dead ends: 199 [2018-09-30 23:38:09,664 INFO L226 Difference]: Without dead ends: 133 [2018-09-30 23:38:09,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2018-09-30 23:38:09,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-30 23:38:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-30 23:38:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-30 23:38:09,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-09-30 23:38:09,738 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-09-30 23:38:09,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:38:09,739 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-09-30 23:38:09,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-30 23:38:09,739 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-09-30 23:38:09,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-30 23:38:09,739 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:38:09,739 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1] [2018-09-30 23:38:09,740 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:38:09,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:38:09,740 INFO L82 PathProgramCache]: Analyzing trace with hash -452907503, now seen corresponding path program 46 times [2018-09-30 23:38:09,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:38:09,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:38:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:09,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:38:09,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 992 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:11,232 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:38:11,232 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-09-30 23:38:11,239 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:38:11,289 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:38:11,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:38:11,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:38:12,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:38:12,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:38:12,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:38:12,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:38:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-09-30 23:38:12,732 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:38:12,732 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 68 [2018-09-30 23:38:12,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-30 23:38:12,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-30 23:38:12,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=662, Invalid=3894, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 23:38:12,733 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 68 states. [2018-09-30 23:38:15,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:38:15,456 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-09-30 23:38:15,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 23:38:15,456 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-30 23:38:15,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:38:15,457 INFO L225 Difference]: With dead ends: 137 [2018-09-30 23:38:15,458 INFO L226 Difference]: Without dead ends: 135 [2018-09-30 23:38:15,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2143 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1394, Invalid=8908, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 23:38:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-30 23:38:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-30 23:38:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-30 23:38:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-09-30 23:38:15,551 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-09-30 23:38:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:38:15,552 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-09-30 23:38:15,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-30 23:38:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-09-30 23:38:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-30 23:38:15,553 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:38:15,553 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-09-30 23:38:15,553 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:38:15,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:38:15,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1452361141, now seen corresponding path program 47 times [2018-09-30 23:38:15,553 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:38:15,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:38:15,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:15,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:38:15,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 2112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:18,344 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:38:18,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 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-09-30 23:38:18,352 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:38:18,816 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2018-09-30 23:38:18,817 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:38:18,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:38:23,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:38:23,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:38:23,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:38:23,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:38:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 870 proven. 1242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:23,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:38:23,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 131 [2018-09-30 23:38:23,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-30 23:38:23,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-30 23:38:23,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1629, Invalid=15663, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 23:38:23,806 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 132 states. [2018-09-30 23:38:29,359 WARN L178 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-09-30 23:38:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:38:34,155 INFO L93 Difference]: Finished difference Result 209 states and 213 transitions. [2018-09-30 23:38:34,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-30 23:38:34,155 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 134 [2018-09-30 23:38:34,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:38:34,156 INFO L225 Difference]: With dead ends: 209 [2018-09-30 23:38:34,156 INFO L226 Difference]: Without dead ends: 139 [2018-09-30 23:38:34,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7266 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=3213, Invalid=38199, Unknown=0, NotChecked=0, Total=41412 [2018-09-30 23:38:34,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-30 23:38:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-30 23:38:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-30 23:38:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-09-30 23:38:34,238 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2018-09-30 23:38:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:38:34,238 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-09-30 23:38:34,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-30 23:38:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-09-30 23:38:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-30 23:38:34,239 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:38:34,239 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-09-30 23:38:34,239 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:38:34,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:38:34,239 INFO L82 PathProgramCache]: Analyzing trace with hash 957810879, now seen corresponding path program 48 times [2018-09-30 23:38:34,239 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:38:34,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:38:34,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:34,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:38:34,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 2244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:37,117 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:38:37,117 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-09-30 23:38:37,124 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:38:37,406 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-09-30 23:38:37,406 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:38:37,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:38:40,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:38:40,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:38:40,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:38:40,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:38:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 2244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:40,707 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:38:40,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 105 [2018-09-30 23:38:40,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-30 23:38:40,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-30 23:38:40,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 23:38:40,708 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 106 states. [2018-09-30 23:38:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:38:47,019 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2018-09-30 23:38:47,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-30 23:38:47,019 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 138 [2018-09-30 23:38:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:38:47,020 INFO L225 Difference]: With dead ends: 211 [2018-09-30 23:38:47,021 INFO L226 Difference]: Without dead ends: 141 [2018-09-30 23:38:47,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2355 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2018-09-30 23:38:47,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-30 23:38:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-30 23:38:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-30 23:38:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-09-30 23:38:47,113 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-09-30 23:38:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:38:47,113 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-09-30 23:38:47,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-30 23:38:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-09-30 23:38:47,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-30 23:38:47,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:38:47,114 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1] [2018-09-30 23:38:47,114 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:38:47,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:38:47,114 INFO L82 PathProgramCache]: Analyzing trace with hash 32287481, now seen corresponding path program 49 times [2018-09-30 23:38:47,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:38:47,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:38:47,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:47,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:38:47,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1122 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:48,709 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:38:48,709 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-09-30 23:38:48,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:38:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:48,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:38:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1122 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:48,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:38:48,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 37 [2018-09-30 23:38:48,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-30 23:38:48,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-30 23:38:48,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 23:38:48,860 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 38 states. [2018-09-30 23:38:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:38:49,619 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-09-30 23:38:49,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-30 23:38:49,620 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 140 [2018-09-30 23:38:49,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:38:49,621 INFO L225 Difference]: With dead ends: 145 [2018-09-30 23:38:49,621 INFO L226 Difference]: Without dead ends: 143 [2018-09-30 23:38:49,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-30 23:38:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-30 23:38:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-30 23:38:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-30 23:38:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-09-30 23:38:49,709 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-09-30 23:38:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:38:49,709 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-09-30 23:38:49,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-30 23:38:49,709 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-09-30 23:38:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-30 23:38:49,710 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:38:49,710 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-09-30 23:38:49,710 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:38:49,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:38:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash 963550515, now seen corresponding path program 50 times [2018-09-30 23:38:49,711 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:38:49,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:38:49,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:49,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:38:49,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:38:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:38:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:52,781 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:38:52,781 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-09-30 23:38:52,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:38:52,867 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:38:52,867 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:38:52,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:38:55,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:38:55,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:38:55,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:38:55,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:38:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:38:56,139 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:38:56,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 108 [2018-09-30 23:38:56,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-30 23:38:56,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-30 23:38:56,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=11450, Unknown=0, NotChecked=0, Total=11772 [2018-09-30 23:38:56,141 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 109 states. [2018-09-30 23:39:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:02,148 INFO L93 Difference]: Finished difference Result 217 states and 219 transitions. [2018-09-30 23:39:02,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-30 23:39:02,148 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 142 [2018-09-30 23:39:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:02,150 INFO L225 Difference]: With dead ends: 217 [2018-09-30 23:39:02,150 INFO L226 Difference]: Without dead ends: 145 [2018-09-30 23:39:02,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2494 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=681, Invalid=20489, Unknown=0, NotChecked=0, Total=21170 [2018-09-30 23:39:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-30 23:39:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-30 23:39:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-30 23:39:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-09-30 23:39:02,237 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2018-09-30 23:39:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:02,238 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-09-30 23:39:02,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-30 23:39:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-09-30 23:39:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-30 23:39:02,239 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:02,239 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 34, 1, 1, 1, 1] [2018-09-30 23:39:02,239 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:02,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:02,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2111083117, now seen corresponding path program 51 times [2018-09-30 23:39:02,240 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:02,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:02,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:02,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:39:02,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1190 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:03,065 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:39:03,065 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-09-30 23:39:03,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:39:03,400 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-09-30 23:39:03,400 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:39:03,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:39:04,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:39:04,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:39:04,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:39:04,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:39:04,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2018-09-30 23:39:04,997 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:39:04,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 74 [2018-09-30 23:39:04,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-30 23:39:04,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-30 23:39:04,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=776, Invalid=4626, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 23:39:04,998 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 74 states. [2018-09-30 23:39:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:08,276 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-09-30 23:39:08,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-30 23:39:08,276 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-09-30 23:39:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:08,277 INFO L225 Difference]: With dead ends: 149 [2018-09-30 23:39:08,277 INFO L226 Difference]: Without dead ends: 147 [2018-09-30 23:39:08,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2554 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1628, Invalid=10582, Unknown=0, NotChecked=0, Total=12210 [2018-09-30 23:39:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-30 23:39:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-30 23:39:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-30 23:39:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-09-30 23:39:08,371 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-09-30 23:39:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:08,372 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-09-30 23:39:08,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-30 23:39:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-09-30 23:39:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-30 23:39:08,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:08,372 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2018-09-30 23:39:08,373 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:08,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:08,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1526364071, now seen corresponding path program 52 times [2018-09-30 23:39:08,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:08,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:08,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:08,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:39:08,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 2520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:11,566 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:39:11,567 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-09-30 23:39:11,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:39:11,627 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:39:11,627 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:39:11,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:39:14,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:39:14,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:39:14,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:39:14,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:39:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2018-09-30 23:39:15,105 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:39:15,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 38] total 110 [2018-09-30 23:39:15,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-30 23:39:15,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-30 23:39:15,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=11704, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 23:39:15,107 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 110 states. [2018-09-30 23:39:24,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:24,261 INFO L93 Difference]: Finished difference Result 227 states and 231 transitions. [2018-09-30 23:39:24,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-30 23:39:24,261 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 146 [2018-09-30 23:39:24,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:24,262 INFO L225 Difference]: With dead ends: 227 [2018-09-30 23:39:24,263 INFO L226 Difference]: Without dead ends: 151 [2018-09-30 23:39:24,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=630, Invalid=21720, Unknown=0, NotChecked=0, Total=22350 [2018-09-30 23:39:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-30 23:39:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-30 23:39:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-30 23:39:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-09-30 23:39:24,373 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 146 [2018-09-30 23:39:24,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:24,373 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-09-30 23:39:24,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-30 23:39:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-09-30 23:39:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-30 23:39:24,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:24,374 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1] [2018-09-30 23:39:24,374 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:24,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:24,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2109708315, now seen corresponding path program 53 times [2018-09-30 23:39:24,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:24,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:24,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:24,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:39:24,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 2664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:27,765 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:39:27,765 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-09-30 23:39:27,771 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:39:28,461 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-09-30 23:39:28,461 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:39:28,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:39:34,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:39:34,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:39:34,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:39:34,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:39:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1122 proven. 1542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:34,953 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:39:34,953 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 147 [2018-09-30 23:39:34,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-30 23:39:34,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-30 23:39:34,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=19709, Unknown=0, NotChecked=0, Total=21756 [2018-09-30 23:39:34,956 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 148 states. [2018-09-30 23:39:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:47,133 INFO L93 Difference]: Finished difference Result 233 states and 237 transitions. [2018-09-30 23:39:47,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-30 23:39:47,133 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 150 [2018-09-30 23:39:47,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:47,134 INFO L225 Difference]: With dead ends: 233 [2018-09-30 23:39:47,134 INFO L226 Difference]: Without dead ends: 155 [2018-09-30 23:39:47,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=3967, Invalid=47789, Unknown=0, NotChecked=0, Total=51756 [2018-09-30 23:39:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-30 23:39:47,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-30 23:39:47,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-30 23:39:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-09-30 23:39:47,239 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 150 [2018-09-30 23:39:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:47,239 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-09-30 23:39:47,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-30 23:39:47,239 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-09-30 23:39:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-30 23:39:47,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:47,240 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2018-09-30 23:39:47,240 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:47,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:47,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1900215951, now seen corresponding path program 54 times [2018-09-30 23:39:47,241 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:47,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:47,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:47,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:39:47,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 2812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:50,491 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:39:50,491 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-09-30 23:39:50,499 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:39:50,842 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2018-09-30 23:39:50,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:39:50,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:39:54,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:39:54,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:39:54,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:39:54,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:39:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-09-30 23:39:54,377 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:39:54,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 40] total 116 [2018-09-30 23:39:54,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-30 23:39:54,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-30 23:39:54,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=13038, Unknown=0, NotChecked=0, Total=13340 [2018-09-30 23:39:54,379 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 116 states. [2018-09-30 23:40:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:40:03,605 INFO L93 Difference]: Finished difference Result 239 states and 243 transitions. [2018-09-30 23:40:03,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-30 23:40:03,605 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 154 [2018-09-30 23:40:03,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:40:03,606 INFO L225 Difference]: With dead ends: 239 [2018-09-30 23:40:03,606 INFO L226 Difference]: Without dead ends: 159 [2018-09-30 23:40:03,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=664, Invalid=24142, Unknown=0, NotChecked=0, Total=24806 [2018-09-30 23:40:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-30 23:40:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-30 23:40:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-30 23:40:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-09-30 23:40:03,710 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2018-09-30 23:40:03,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:40:03,710 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-09-30 23:40:03,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-30 23:40:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-09-30 23:40:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-30 23:40:03,711 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:40:03,711 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1] [2018-09-30 23:40:03,711 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:40:03,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:40:03,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1266046205, now seen corresponding path program 55 times [2018-09-30 23:40:03,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:40:03,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:40:03,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:40:03,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:40:03,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:40:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:40:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 2964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:40:07,138 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:40:07,139 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-09-30 23:40:07,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:40:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:40:07,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:40:12,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:40:12,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:40:12,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:40:12,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:40:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 2964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:40:12,599 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:40:12,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 120 [2018-09-30 23:40:12,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-09-30 23:40:12,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-09-30 23:40:12,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=14162, Unknown=0, NotChecked=0, Total=14520 [2018-09-30 23:40:12,601 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 121 states. [2018-09-30 23:40:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:40:20,244 INFO L93 Difference]: Finished difference Result 241 states and 243 transitions. [2018-09-30 23:40:20,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-30 23:40:20,244 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 158 [2018-09-30 23:40:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:40:20,245 INFO L225 Difference]: With dead ends: 241 [2018-09-30 23:40:20,245 INFO L226 Difference]: Without dead ends: 161 [2018-09-30 23:40:20,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3090 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=757, Invalid=25325, Unknown=0, NotChecked=0, Total=26082 [2018-09-30 23:40:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-30 23:40:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-30 23:40:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-30 23:40:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-09-30 23:40:20,353 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2018-09-30 23:40:20,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:40:20,354 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-09-30 23:40:20,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-09-30 23:40:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-09-30 23:40:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-30 23:40:20,354 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:40:20,354 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 38, 1, 1, 1, 1] [2018-09-30 23:40:20,355 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:40:20,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:40:20,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1726082109, now seen corresponding path program 56 times [2018-09-30 23:40:20,355 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:40:20,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:40:20,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:40:20,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:40:20,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:40:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:40:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 1482 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:40:21,135 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:40:21,135 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-09-30 23:40:21,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:40:21,224 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:40:21,224 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:40:21,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:40:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 1482 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:40:21,280 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:40:21,280 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 42 [2018-09-30 23:40:21,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-30 23:40:21,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-30 23:40:21,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-09-30 23:40:21,281 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 43 states. [2018-09-30 23:40:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:40:22,235 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-09-30 23:40:22,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-30 23:40:22,236 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 160 [2018-09-30 23:40:22,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:40:22,236 INFO L225 Difference]: With dead ends: 165 [2018-09-30 23:40:22,236 INFO L226 Difference]: Without dead ends: 163 [2018-09-30 23:40:22,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 23:40:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-30 23:40:22,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-30 23:40:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-30 23:40:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-09-30 23:40:22,352 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2018-09-30 23:40:22,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:40:22,352 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-09-30 23:40:22,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-30 23:40:22,352 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-09-30 23:40:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-30 23:40:22,353 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:40:22,353 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2018-09-30 23:40:22,353 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:40:22,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:40:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash 907582839, now seen corresponding path program 57 times [2018-09-30 23:40:22,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:40:22,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:40:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:40:22,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:40:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:40:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:40:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 3120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:40:25,932 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:40:25,932 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-09-30 23:40:25,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:40:26,407 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-30 23:40:26,408 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:40:26,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:40:30,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:40:30,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:40:30,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:40:30,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:40:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 3120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:40:30,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:40:30,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 123 [2018-09-30 23:40:30,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-30 23:40:30,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-30 23:40:30,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=14885, Unknown=0, NotChecked=0, Total=15252 [2018-09-30 23:40:30,270 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 124 states. [2018-09-30 23:40:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:40:38,979 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-09-30 23:40:38,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-30 23:40:38,979 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 162 [2018-09-30 23:40:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:40:38,980 INFO L225 Difference]: With dead ends: 247 [2018-09-30 23:40:38,980 INFO L226 Difference]: Without dead ends: 165 [2018-09-30 23:40:38,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3249 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=776, Invalid=26614, Unknown=0, NotChecked=0, Total=27390 [2018-09-30 23:40:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-30 23:40:39,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-30 23:40:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-30 23:40:39,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-09-30 23:40:39,104 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-09-30 23:40:39,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:40:39,104 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-09-30 23:40:39,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-30 23:40:39,104 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-09-30 23:40:39,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-30 23:40:39,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:40:39,105 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 39, 1, 1, 1, 1] [2018-09-30 23:40:39,105 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:40:39,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:40:39,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1818644047, now seen corresponding path program 58 times [2018-09-30 23:40:39,106 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:40:39,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:40:39,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:40:39,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:40:39,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:40:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:40:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 1560 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:40:40,084 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:40:40,084 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-09-30 23:40:40,092 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:40:40,153 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:40:40,153 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:40:40,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:40:42,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:40:42,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:40:42,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:40:42,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:40:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-09-30 23:40:42,251 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:40:42,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42] total 84 [2018-09-30 23:40:42,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-30 23:40:42,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-30 23:40:42,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=986, Invalid=5986, Unknown=0, NotChecked=0, Total=6972 [2018-09-30 23:40:42,252 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 84 states. [2018-09-30 23:40:46,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:40:46,631 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2018-09-30 23:40:46,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-30 23:40:46,632 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-09-30 23:40:46,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:40:46,633 INFO L225 Difference]: With dead ends: 169 [2018-09-30 23:40:46,633 INFO L226 Difference]: Without dead ends: 167 [2018-09-30 23:40:46,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3319 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2058, Invalid=13692, Unknown=0, NotChecked=0, Total=15750 [2018-09-30 23:40:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-30 23:40:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-30 23:40:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-30 23:40:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-09-30 23:40:46,752 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2018-09-30 23:40:46,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:40:46,752 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-09-30 23:40:46,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-30 23:40:46,752 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-09-30 23:40:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-30 23:40:46,753 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:40:46,753 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1] [2018-09-30 23:40:46,753 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:40:46,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:40:46,753 INFO L82 PathProgramCache]: Analyzing trace with hash 334812651, now seen corresponding path program 59 times [2018-09-30 23:40:46,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:40:46,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:40:46,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:40:46,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:40:46,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:40:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:40:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 3280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:40:50,102 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:40:50,102 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-09-30 23:40:50,111 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:40:51,114 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2018-09-30 23:40:51,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:40:51,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:40:58,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:40:58,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:40:58,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:40:58,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:40:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 1406 proven. 1874 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:40:58,432 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:40:58,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 163 [2018-09-30 23:40:58,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-09-30 23:40:58,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-09-30 23:40:58,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2513, Invalid=24219, Unknown=0, NotChecked=0, Total=26732 [2018-09-30 23:40:58,434 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 164 states. [2018-09-30 23:41:13,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:41:13,257 INFO L93 Difference]: Finished difference Result 257 states and 261 transitions. [2018-09-30 23:41:13,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-30 23:41:13,258 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 166 [2018-09-30 23:41:13,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:41:13,259 INFO L225 Difference]: With dead ends: 257 [2018-09-30 23:41:13,259 INFO L226 Difference]: Without dead ends: 171 [2018-09-30 23:41:13,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11166 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=4801, Invalid=58451, Unknown=0, NotChecked=0, Total=63252 [2018-09-30 23:41:13,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-30 23:41:13,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-09-30 23:41:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-30 23:41:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-09-30 23:41:13,397 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 166 [2018-09-30 23:41:13,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:41:13,397 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-09-30 23:41:13,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-09-30 23:41:13,397 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-09-30 23:41:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-30 23:41:13,398 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:41:13,398 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1] [2018-09-30 23:41:13,399 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:41:13,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:41:13,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1537430623, now seen corresponding path program 60 times [2018-09-30 23:41:13,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:41:13,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:41:13,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:41:13,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:41:13,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:41:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:41:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 3444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:41:17,192 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:41:17,192 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-09-30 23:41:17,200 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:41:17,635 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 42 check-sat command(s) [2018-09-30 23:41:17,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:41:17,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:41:21,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:41:21,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:41:21,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:41:21,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:41:22,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-09-30 23:41:22,042 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:41:22,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 44] total 128 [2018-09-30 23:41:22,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-30 23:41:22,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-30 23:41:22,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=15922, Unknown=0, NotChecked=0, Total=16256 [2018-09-30 23:41:22,044 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 128 states. [2018-09-30 23:41:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:41:32,985 INFO L93 Difference]: Finished difference Result 263 states and 267 transitions. [2018-09-30 23:41:32,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-30 23:41:32,986 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 170 [2018-09-30 23:41:32,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:41:32,987 INFO L225 Difference]: With dead ends: 263 [2018-09-30 23:41:32,987 INFO L226 Difference]: Without dead ends: 175 [2018-09-30 23:41:32,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=732, Invalid=29370, Unknown=0, NotChecked=0, Total=30102 [2018-09-30 23:41:32,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-30 23:41:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-09-30 23:41:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-30 23:41:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-09-30 23:41:33,120 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 170 [2018-09-30 23:41:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:41:33,120 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-09-30 23:41:33,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-30 23:41:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-09-30 23:41:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-30 23:41:33,121 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:41:33,121 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1] [2018-09-30 23:41:33,122 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:41:33,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:41:33,122 INFO L82 PathProgramCache]: Analyzing trace with hash -903276333, now seen corresponding path program 61 times [2018-09-30 23:41:33,122 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:41:33,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:41:33,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:41:33,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:41:33,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:41:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:41:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 3612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:41:36,754 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:41:36,754 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-09-30 23:41:36,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:41:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:41:36,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:41:41,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:41:41,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:41:41,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:41:41,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:41:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 3612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:41:41,349 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:41:41,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 132 [2018-09-30 23:41:41,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-09-30 23:41:41,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-09-30 23:41:41,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=17162, Unknown=0, NotChecked=0, Total=17556 [2018-09-30 23:41:41,351 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 133 states. [2018-09-30 23:41:51,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:41:51,062 INFO L93 Difference]: Finished difference Result 265 states and 267 transitions. [2018-09-30 23:41:51,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-30 23:41:51,062 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 174 [2018-09-30 23:41:51,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:41:51,064 INFO L225 Difference]: With dead ends: 265 [2018-09-30 23:41:51,064 INFO L226 Difference]: Without dead ends: 177 [2018-09-30 23:41:51,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3750 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=833, Invalid=30673, Unknown=0, NotChecked=0, Total=31506 [2018-09-30 23:41:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-30 23:41:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-09-30 23:41:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-30 23:41:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-09-30 23:41:51,227 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-09-30 23:41:51,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:41:51,227 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-09-30 23:41:51,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-09-30 23:41:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-09-30 23:41:51,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-30 23:41:51,228 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:41:51,228 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 42, 1, 1, 1, 1] [2018-09-30 23:41:51,228 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:41:51,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:41:51,229 INFO L82 PathProgramCache]: Analyzing trace with hash 878421517, now seen corresponding path program 62 times [2018-09-30 23:41:51,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:41:51,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:41:51,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:41:51,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:41:51,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:41:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:41:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 1806 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:41:52,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:41:52,088 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-30 23:41:52,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:41:52,186 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:41:52,186 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:41:52,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:41:52,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 1806 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:41:52,255 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:41:52,255 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45] total 46 [2018-09-30 23:41:52,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-30 23:41:52,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-30 23:41:52,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-09-30 23:41:52,256 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 47 states. [2018-09-30 23:41:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:41:53,453 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2018-09-30 23:41:53,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-30 23:41:53,454 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 176 [2018-09-30 23:41:53,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:41:53,455 INFO L225 Difference]: With dead ends: 181 [2018-09-30 23:41:53,455 INFO L226 Difference]: Without dead ends: 179 [2018-09-30 23:41:53,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-30 23:41:53,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-30 23:41:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-09-30 23:41:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-30 23:41:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-09-30 23:41:53,588 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2018-09-30 23:41:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:41:53,589 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-09-30 23:41:53,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-30 23:41:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-09-30 23:41:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-30 23:41:53,590 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:41:53,590 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1] [2018-09-30 23:41:53,590 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:41:53,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:41:53,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1945427129, now seen corresponding path program 63 times [2018-09-30 23:41:53,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:41:53,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:41:53,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:41:53,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:41:53,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:41:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:41:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 3784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:41:57,347 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:41:57,348 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-09-30 23:41:57,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:41:57,967 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-09-30 23:41:57,968 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:41:57,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:42:02,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:42:02,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:42:02,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:42:02,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:42:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-09-30 23:42:02,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:42:02,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 46] total 134 [2018-09-30 23:42:02,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-30 23:42:02,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-30 23:42:02,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=17472, Unknown=0, NotChecked=0, Total=17822 [2018-09-30 23:42:02,937 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 134 states. [2018-09-30 23:42:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:14,759 INFO L93 Difference]: Finished difference Result 275 states and 279 transitions. [2018-09-30 23:42:14,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-30 23:42:14,760 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 178 [2018-09-30 23:42:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:14,761 INFO L225 Difference]: With dead ends: 275 [2018-09-30 23:42:14,761 INFO L226 Difference]: Without dead ends: 183 [2018-09-30 23:42:14,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=766, Invalid=32176, Unknown=0, NotChecked=0, Total=32942 [2018-09-30 23:42:14,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-30 23:42:14,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-09-30 23:42:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-30 23:42:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-09-30 23:42:14,902 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 178 [2018-09-30 23:42:14,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:14,903 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-09-30 23:42:14,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-30 23:42:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-09-30 23:42:14,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-30 23:42:14,904 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:14,904 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1] [2018-09-30 23:42:14,904 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:14,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:14,904 INFO L82 PathProgramCache]: Analyzing trace with hash -45190213, now seen corresponding path program 64 times [2018-09-30 23:42:14,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:14,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:14,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:14,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:42:14,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 3960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:19,040 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:42:19,040 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-09-30 23:42:19,047 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:42:19,113 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:42:19,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:42:19,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:42:24,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:42:24,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:42:24,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:42:24,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:42:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-09-30 23:42:24,345 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:42:24,345 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 47] total 137 [2018-09-30 23:42:24,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-09-30 23:42:24,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-09-30 23:42:24,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=18274, Unknown=0, NotChecked=0, Total=18632 [2018-09-30 23:42:24,347 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 137 states. [2018-09-30 23:42:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:42:37,528 INFO L93 Difference]: Finished difference Result 281 states and 285 transitions. [2018-09-30 23:42:37,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-30 23:42:37,528 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 182 [2018-09-30 23:42:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:42:37,530 INFO L225 Difference]: With dead ends: 281 [2018-09-30 23:42:37,530 INFO L226 Difference]: Without dead ends: 187 [2018-09-30 23:42:37,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=783, Invalid=33627, Unknown=0, NotChecked=0, Total=34410 [2018-09-30 23:42:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-30 23:42:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-09-30 23:42:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-30 23:42:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-09-30 23:42:37,672 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 182 [2018-09-30 23:42:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:42:37,672 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-09-30 23:42:37,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-09-30 23:42:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-09-30 23:42:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-30 23:42:37,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:42:37,673 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1] [2018-09-30 23:42:37,673 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:42:37,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:42:37,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1769474607, now seen corresponding path program 65 times [2018-09-30 23:42:37,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:42:37,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:42:37,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:37,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:42:37,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:42:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:42:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 4140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:42,114 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:42:42,114 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-09-30 23:42:42,122 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:42:43,642 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2018-09-30 23:42:43,642 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:42:43,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:42:52,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:42:52,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:42:52,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:42:52,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:42:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 1806 proven. 2334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:42:53,117 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:42:53,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 183 [2018-09-30 23:42:53,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-09-30 23:42:53,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-09-30 23:42:53,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=30509, Unknown=0, NotChecked=0, Total=33672 [2018-09-30 23:42:53,120 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 184 states. [2018-09-30 23:43:11,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:43:11,069 INFO L93 Difference]: Finished difference Result 287 states and 291 transitions. [2018-09-30 23:43:11,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-30 23:43:11,070 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 186 [2018-09-30 23:43:11,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:43:11,071 INFO L225 Difference]: With dead ends: 287 [2018-09-30 23:43:11,071 INFO L226 Difference]: Without dead ends: 191 [2018-09-30 23:43:11,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14026 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=5956, Invalid=73286, Unknown=0, NotChecked=0, Total=79242 [2018-09-30 23:43:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-30 23:43:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-30 23:43:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-30 23:43:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-09-30 23:43:11,222 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 186 [2018-09-30 23:43:11,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:43:11,222 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-09-30 23:43:11,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-09-30 23:43:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-09-30 23:43:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-30 23:43:11,223 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:43:11,223 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1] [2018-09-30 23:43:11,223 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:43:11,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:43:11,224 INFO L82 PathProgramCache]: Analyzing trace with hash -879958365, now seen corresponding path program 66 times [2018-09-30 23:43:11,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:43:11,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:43:11,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:43:11,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:43:11,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:43:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:43:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 4324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:43:15,752 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:43:15,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 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-09-30 23:43:15,759 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:43:16,394 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 47 check-sat command(s) [2018-09-30 23:43:16,394 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:43:16,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:43:21,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:43:21,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:43:21,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:43:21,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:43:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-09-30 23:43:22,003 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:43:22,004 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 49] total 143 [2018-09-30 23:43:22,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-09-30 23:43:22,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-09-30 23:43:22,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=19932, Unknown=0, NotChecked=0, Total=20306 [2018-09-30 23:43:22,005 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 143 states. [2018-09-30 23:43:36,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:43:36,605 INFO L93 Difference]: Finished difference Result 293 states and 297 transitions. [2018-09-30 23:43:36,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-30 23:43:36,606 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 190 [2018-09-30 23:43:36,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:43:36,607 INFO L225 Difference]: With dead ends: 293 [2018-09-30 23:43:36,607 INFO L226 Difference]: Without dead ends: 195 [2018-09-30 23:43:36,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=817, Invalid=36625, Unknown=0, NotChecked=0, Total=37442 [2018-09-30 23:43:36,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-30 23:43:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-09-30 23:43:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-30 23:43:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-09-30 23:43:36,772 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 190 [2018-09-30 23:43:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:43:36,772 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-09-30 23:43:36,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-09-30 23:43:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-09-30 23:43:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-30 23:43:36,773 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:43:36,774 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1] [2018-09-30 23:43:36,774 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:43:36,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:43:36,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1911420649, now seen corresponding path program 67 times [2018-09-30 23:43:36,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:43:36,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:43:36,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:43:36,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:43:36,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:43:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:43:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 4512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:43:41,540 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:43:41,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 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-09-30 23:43:41,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:43:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:43:41,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:43:47,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:43:47,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:43:47,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:43:47,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:43:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 4512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:43:47,228 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:43:47,229 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 147 [2018-09-30 23:43:47,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-30 23:43:47,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-30 23:43:47,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=21317, Unknown=0, NotChecked=0, Total=21756 [2018-09-30 23:43:47,230 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 148 states. [2018-09-30 23:44:00,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:44:00,576 INFO L93 Difference]: Finished difference Result 295 states and 297 transitions. [2018-09-30 23:44:00,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-30 23:44:00,576 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 194 [2018-09-30 23:44:00,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:44:00,577 INFO L225 Difference]: With dead ends: 295 [2018-09-30 23:44:00,577 INFO L226 Difference]: Without dead ends: 197 [2018-09-30 23:44:00,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4665 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=928, Invalid=38078, Unknown=0, NotChecked=0, Total=39006 [2018-09-30 23:44:00,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-30 23:44:00,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-09-30 23:44:00,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-30 23:44:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-09-30 23:44:00,735 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2018-09-30 23:44:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:44:00,736 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-09-30 23:44:00,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-30 23:44:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-09-30 23:44:00,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-30 23:44:00,737 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:44:00,737 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 47, 1, 1, 1, 1] [2018-09-30 23:44:00,737 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:44:00,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:44:00,737 INFO L82 PathProgramCache]: Analyzing trace with hash 86226257, now seen corresponding path program 68 times [2018-09-30 23:44:00,737 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:44:00,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:44:00,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:44:00,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:44:00,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:44:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:44:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 2256 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:44:01,743 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:44:01,743 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-09-30 23:44:01,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:44:01,854 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:44:01,854 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:44:01,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:44:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 2256 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:44:01,915 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:44:01,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50] total 51 [2018-09-30 23:44:01,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-30 23:44:01,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-30 23:44:01,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 23:44:01,917 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 52 states. [2018-09-30 23:44:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:44:03,231 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2018-09-30 23:44:03,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-30 23:44:03,231 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 196 [2018-09-30 23:44:03,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:44:03,232 INFO L225 Difference]: With dead ends: 201 [2018-09-30 23:44:03,232 INFO L226 Difference]: Without dead ends: 199 [2018-09-30 23:44:03,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2303 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 23:44:03,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-30 23:44:03,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-09-30 23:44:03,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-30 23:44:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-09-30 23:44:03,406 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2018-09-30 23:44:03,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:44:03,407 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-09-30 23:44:03,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-30 23:44:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-09-30 23:44:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-30 23:44:03,407 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:44:03,408 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1, 1, 1] [2018-09-30 23:44:03,408 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:44:03,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:44:03,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1259106699, now seen corresponding path program 69 times [2018-09-30 23:44:03,408 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:44:03,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:44:03,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:44:03,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:44:03,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:44:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:44:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 4704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:44:08,229 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:44:08,229 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-09-30 23:44:08,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:44:09,057 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-09-30 23:44:09,057 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:44:09,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:44:14,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:44:14,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:44:14,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:44:14,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:44:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 4704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:44:14,718 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:44:14,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 150 [2018-09-30 23:44:14,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-09-30 23:44:14,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-09-30 23:44:14,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=22202, Unknown=0, NotChecked=0, Total=22650 [2018-09-30 23:44:14,720 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 151 states. [2018-09-30 23:44:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:44:28,622 INFO L93 Difference]: Finished difference Result 301 states and 303 transitions. [2018-09-30 23:44:28,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-30 23:44:28,623 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 198 [2018-09-30 23:44:28,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:44:28,624 INFO L225 Difference]: With dead ends: 301 [2018-09-30 23:44:28,624 INFO L226 Difference]: Without dead ends: 201 [2018-09-30 23:44:28,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4860 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=947, Invalid=39655, Unknown=0, NotChecked=0, Total=40602 [2018-09-30 23:44:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-30 23:44:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-09-30 23:44:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-30 23:44:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-09-30 23:44:28,786 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2018-09-30 23:44:28,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:44:28,786 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-09-30 23:44:28,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-09-30 23:44:28,786 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-09-30 23:44:28,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-30 23:44:28,787 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:44:28,787 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 48, 1, 1, 1, 1] [2018-09-30 23:44:28,787 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:44:28,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:44:28,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1285124293, now seen corresponding path program 70 times [2018-09-30 23:44:28,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:44:28,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:44:28,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:44:28,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:44:28,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:44:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:44:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4802 backedges. 2352 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:44:29,871 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:44:29,871 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-09-30 23:44:29,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:44:29,951 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:44:29,951 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:44:29,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:44:32,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:44:32,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:44:32,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:44:32,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:44:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4802 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-09-30 23:44:32,646 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:44:32,646 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51] total 102 [2018-09-30 23:44:32,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-30 23:44:32,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-30 23:44:32,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1427, Invalid=8875, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 23:44:32,647 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 102 states. [2018-09-30 23:44:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:44:38,784 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2018-09-30 23:44:38,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-30 23:44:38,784 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-09-30 23:44:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:44:38,786 INFO L225 Difference]: With dead ends: 205 [2018-09-30 23:44:38,786 INFO L226 Difference]: Without dead ends: 203 [2018-09-30 23:44:38,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4948 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2958, Invalid=20298, Unknown=0, NotChecked=0, Total=23256 [2018-09-30 23:44:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-30 23:44:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-09-30 23:44:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-30 23:44:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-09-30 23:44:38,960 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2018-09-30 23:44:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:44:38,960 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-09-30 23:44:38,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-30 23:44:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-09-30 23:44:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-30 23:44:38,961 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:44:38,961 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1] [2018-09-30 23:44:38,961 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:44:38,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:44:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1946083329, now seen corresponding path program 71 times [2018-09-30 23:44:38,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:44:38,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:44:38,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:44:38,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:44:38,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:44:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:44:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:44:43,937 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:44:43,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 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-09-30 23:44:43,945 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:44:45,963 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2018-09-30 23:44:45,963 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:44:45,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:44:57,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:44:57,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:44:57,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:44:57,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:44:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2162 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:44:57,553 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:44:57,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 199 [2018-09-30 23:44:57,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-09-30 23:44:57,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-09-30 23:44:57,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3737, Invalid=36063, Unknown=0, NotChecked=0, Total=39800 [2018-09-30 23:44:57,557 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 200 states. [2018-09-30 23:45:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:17,132 INFO L93 Difference]: Finished difference Result 311 states and 315 transitions. [2018-09-30 23:45:17,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-30 23:45:17,132 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 202 [2018-09-30 23:45:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:17,133 INFO L225 Difference]: With dead ends: 311 [2018-09-30 23:45:17,133 INFO L226 Difference]: Without dead ends: 207 [2018-09-30 23:45:17,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16548 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=6970, Invalid=86360, Unknown=0, NotChecked=0, Total=93330 [2018-09-30 23:45:17,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-30 23:45:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-09-30 23:45:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-30 23:45:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-09-30 23:45:17,312 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 202 [2018-09-30 23:45:17,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:17,312 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-09-30 23:45:17,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-09-30 23:45:17,313 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-09-30 23:45:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-30 23:45:17,314 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:17,314 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1, 1, 1] [2018-09-30 23:45:17,314 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:17,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:17,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1980427149, now seen corresponding path program 72 times [2018-09-30 23:45:17,314 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:17,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:17,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:17,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:45:17,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 5100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:45:22,149 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:45:22,149 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-09-30 23:45:22,156 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:45:22,929 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2018-09-30 23:45:22,929 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:45:22,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:45:29,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:45:29,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:45:29,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:45:29,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:45:29,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-09-30 23:45:29,342 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:45:29,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 53] total 155 [2018-09-30 23:45:29,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-09-30 23:45:29,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-09-30 23:45:29,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=23464, Unknown=0, NotChecked=0, Total=23870 [2018-09-30 23:45:29,344 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 155 states. [2018-09-30 23:45:44,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:44,852 INFO L93 Difference]: Finished difference Result 317 states and 321 transitions. [2018-09-30 23:45:44,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-30 23:45:44,852 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 206 [2018-09-30 23:45:44,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:44,853 INFO L225 Difference]: With dead ends: 317 [2018-09-30 23:45:44,853 INFO L226 Difference]: Without dead ends: 211 [2018-09-30 23:45:44,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=885, Invalid=43005, Unknown=0, NotChecked=0, Total=43890 [2018-09-30 23:45:44,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-30 23:45:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-30 23:45:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-30 23:45:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-09-30 23:45:45,031 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 206 [2018-09-30 23:45:45,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:45,031 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-09-30 23:45:45,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-09-30 23:45:45,032 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-09-30 23:45:45,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-30 23:45:45,032 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:45,032 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1] [2018-09-30 23:45:45,033 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:45,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:45,033 INFO L82 PathProgramCache]: Analyzing trace with hash -311603481, now seen corresponding path program 73 times [2018-09-30 23:45:45,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:45,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:45,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:45,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:45:45,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 5304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:45:50,322 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:45:50,323 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-09-30 23:45:50,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:50,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:45:56,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:45:56,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:45:56,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:45:56,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:45:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 5304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:45:56,686 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:45:56,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 159 [2018-09-30 23:45:56,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-09-30 23:45:56,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-09-30 23:45:56,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=24965, Unknown=0, NotChecked=0, Total=25440 [2018-09-30 23:45:56,688 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 160 states. [2018-09-30 23:46:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:46:11,314 INFO L93 Difference]: Finished difference Result 319 states and 321 transitions. [2018-09-30 23:46:11,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-30 23:46:11,314 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 210 [2018-09-30 23:46:11,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:46:11,316 INFO L225 Difference]: With dead ends: 319 [2018-09-30 23:46:11,316 INFO L226 Difference]: Without dead ends: 213 [2018-09-30 23:46:11,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5469 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=1004, Invalid=44578, Unknown=0, NotChecked=0, Total=45582 [2018-09-30 23:46:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-09-30 23:46:11,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-09-30 23:46:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-30 23:46:11,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-09-30 23:46:11,498 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2018-09-30 23:46:11,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:46:11,498 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-09-30 23:46:11,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-09-30 23:46:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-09-30 23:46:11,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-30 23:46:11,499 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:46:11,499 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 51, 1, 1, 1, 1] [2018-09-30 23:46:11,500 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:46:11,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:46:11,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1977399519, now seen corresponding path program 74 times [2018-09-30 23:46:11,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:46:11,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:46:11,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:11,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:46:11,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:46:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 2652 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:46:12,657 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:46:12,657 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-09-30 23:46:12,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:46:12,776 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:46:12,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:46:12,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:46:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 2652 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:46:12,847 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:46:12,847 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 55 [2018-09-30 23:46:12,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-30 23:46:12,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-30 23:46:12,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 23:46:12,848 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 56 states. [2018-09-30 23:46:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:46:14,551 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2018-09-30 23:46:14,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-30 23:46:14,551 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 212 [2018-09-30 23:46:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:46:14,552 INFO L225 Difference]: With dead ends: 217 [2018-09-30 23:46:14,552 INFO L226 Difference]: Without dead ends: 215 [2018-09-30 23:46:14,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2703 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-30 23:46:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-30 23:46:14,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-09-30 23:46:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-09-30 23:46:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-09-30 23:46:14,737 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2018-09-30 23:46:14,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:46:14,737 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-09-30 23:46:14,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-30 23:46:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-09-30 23:46:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-30 23:46:14,738 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:46:14,738 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1, 1, 1] [2018-09-30 23:46:14,738 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:46:14,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:46:14,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1905340581, now seen corresponding path program 75 times [2018-09-30 23:46:14,739 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:46:14,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:46:14,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:14,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:46:14,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:46:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 5512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:46:20,307 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:46:20,307 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-09-30 23:46:20,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:46:21,347 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-09-30 23:46:21,347 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:46:21,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:46:27,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:46:27,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:27,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:46:27,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 23:46:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 5512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:46:27,714 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:46:27,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 162 [2018-09-30 23:46:27,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-09-30 23:46:27,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-09-30 23:46:27,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=25922, Unknown=0, NotChecked=0, Total=26406 [2018-09-30 23:46:27,715 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 163 states. [2018-09-30 23:46:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:46:41,618 INFO L93 Difference]: Finished difference Result 325 states and 327 transitions. [2018-09-30 23:46:41,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-30 23:46:41,618 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 214 [2018-09-30 23:46:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:46:41,620 INFO L225 Difference]: With dead ends: 325 [2018-09-30 23:46:41,620 INFO L226 Difference]: Without dead ends: 217 [2018-09-30 23:46:41,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5680 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=1023, Invalid=46283, Unknown=0, NotChecked=0, Total=47306 [2018-09-30 23:46:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-09-30 23:46:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-09-30 23:46:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-30 23:46:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-09-30 23:46:41,811 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 214 [2018-09-30 23:46:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:46:41,812 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-09-30 23:46:41,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-09-30 23:46:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-09-30 23:46:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-30 23:46:41,812 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:46:41,813 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 52, 1, 1, 1, 1] [2018-09-30 23:46:41,813 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:46:41,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:46:41,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1922701973, now seen corresponding path program 76 times [2018-09-30 23:46:41,813 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:46:41,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:46:41,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:41,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:46:41,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:46:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 2756 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:46:43,061 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:46:43,061 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-09-30 23:46:43,068 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:46:43,148 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:46:43,148 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:46:43,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:46:46,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:46:46,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:46:46,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:46:46,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:46:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2018-09-30 23:46:46,421 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:46:46,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 110 [2018-09-30 23:46:46,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-30 23:46:46,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-30 23:46:46,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=10341, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 23:46:46,423 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 110 states. [2018-09-30 23:46:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:46:53,436 INFO L93 Difference]: Finished difference Result 221 states and 222 transitions. [2018-09-30 23:46:53,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-30 23:46:53,436 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-09-30 23:46:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:46:53,438 INFO L225 Difference]: With dead ends: 221 [2018-09-30 23:46:53,438 INFO L226 Difference]: Without dead ends: 219 [2018-09-30 23:46:53,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5776 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=3410, Invalid=23650, Unknown=0, NotChecked=0, Total=27060 [2018-09-30 23:46:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-30 23:46:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-09-30 23:46:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-09-30 23:46:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-09-30 23:46:53,641 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 216 [2018-09-30 23:46:53,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:46:53,642 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-09-30 23:46:53,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-30 23:46:53,642 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-09-30 23:46:53,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-30 23:46:53,643 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:46:53,643 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1] [2018-09-30 23:46:53,643 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:46:53,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:46:53,643 INFO L82 PathProgramCache]: Analyzing trace with hash 880711119, now seen corresponding path program 77 times [2018-09-30 23:46:53,644 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:46:53,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:46:53,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:53,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:46:53,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:46:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:46:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 5724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:46:59,189 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:46:59,189 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-30 23:46:59,196 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:47:01,876 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-30 23:47:01,876 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:47:01,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:47:14,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:47:14,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:47:14,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:47:14,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:47:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2550 proven. 3174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:47:14,323 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:47:14,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 215 [2018-09-30 23:47:14,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-09-30 23:47:14,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-09-30 23:47:14,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4359, Invalid=42081, Unknown=0, NotChecked=0, Total=46440 [2018-09-30 23:47:14,325 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 216 states. [2018-09-30 23:47:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:47:37,381 INFO L93 Difference]: Finished difference Result 335 states and 339 transitions. [2018-09-30 23:47:37,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-09-30 23:47:37,381 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 218 [2018-09-30 23:47:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:47:37,383 INFO L225 Difference]: With dead ends: 335 [2018-09-30 23:47:37,383 INFO L226 Difference]: Without dead ends: 223 [2018-09-30 23:47:37,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19278 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=8064, Invalid=100506, Unknown=0, NotChecked=0, Total=108570 [2018-09-30 23:47:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-30 23:47:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-09-30 23:47:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-09-30 23:47:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-09-30 23:47:37,590 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 218 [2018-09-30 23:47:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:47:37,590 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-09-30 23:47:37,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-09-30 23:47:37,590 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-09-30 23:47:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-30 23:47:37,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:47:37,591 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1, 1, 1] [2018-09-30 23:47:37,591 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:47:37,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:47:37,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1453433411, now seen corresponding path program 78 times [2018-09-30 23:47:37,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:47:37,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:47:37,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:47:37,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:47:37,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:47:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:47:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 5940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:47:43,625 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:47:43,626 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-09-30 23:47:43,633 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:47:44,579 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-30 23:47:44,579 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:47:44,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:47:52,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 23:47:52,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 23:47:52,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 23:47:52,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 23:47:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 3078 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2018-09-30 23:47:52,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:47:52,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 58] total 167 [2018-09-30 23:47:52,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-09-30 23:47:52,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-09-30 23:47:52,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=27284, Unknown=0, NotChecked=0, Total=27722 [2018-09-30 23:47:52,280 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 167 states. Received shutdown request... [2018-09-30 23:47:55,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 23:47:55,331 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 23:47:55,338 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 23:47:55,338 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 11:47:55 BoogieIcfgContainer [2018-09-30 23:47:55,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 23:47:55,339 INFO L168 Benchmark]: Toolchain (without parser) took 776445.10 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -280.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-30 23:47:55,339 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:47:55,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:47:55,340 INFO L168 Benchmark]: Boogie Preprocessor took 25.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:47:55,340 INFO L168 Benchmark]: RCFGBuilder took 322.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 23:47:55,340 INFO L168 Benchmark]: TraceAbstraction took 776039.67 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -301.8 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-09-30 23:47:55,342 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.18 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 49.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.62 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 322.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 776039.67 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -301.8 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 80). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and FLOYD_HOARE automaton (currently 40 states, 167 states before enhancement), while ReachableStatesComputation was computing reachable states (75 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 775.9s OverallTime, 80 OverallIterations, 55 TraceHistogramMax, 407.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4144 SDtfs, 15228 SDslu, 297596 SDs, 0 SdLazy, 309971 SolverSat, 16336 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 189.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16032 GetRequests, 7273 SyntacticMatches, 37 SemanticMatches, 8722 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187030 ImplicationChecksByTransitivity, 494.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=79, 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: 5.9s AutomataMinimizationTime, 79 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 20.4s SatisfiabilityAnalysisTime, 336.1s InterpolantComputationTime, 17862 NumberOfCodeBlocks, 17481 NumberOfCodeBlocksAsserted, 1256 NumberOfCheckSat, 17703 ConstructedInterpolants, 0 QuantifiedInterpolants, 14928643 SizeOfPredicates, 470 NumberOfNonLiveVariables, 29624 ConjunctsInSsa, 8742 ConjunctsInUnsatCore, 159 InterpolantComputations, 1 PerfectInterpolantSequences, 76288/314196 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/invert_string.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_23-47-55-350.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_23-47-55-350.csv Completed graceful shutdown