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-b2fde6a [2018-09-28 10:05:22,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-28 10:05:22,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-28 10:05:22,749 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-28 10:05:22,749 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-28 10:05:22,751 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-28 10:05:22,752 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-28 10:05:22,755 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-28 10:05:22,759 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-28 10:05:22,760 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-28 10:05:22,761 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-28 10:05:22,761 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-28 10:05:22,762 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-28 10:05:22,763 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-28 10:05:22,764 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-28 10:05:22,765 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-28 10:05:22,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-28 10:05:22,771 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-28 10:05:22,776 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-28 10:05:22,781 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-28 10:05:22,782 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-28 10:05:22,787 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-28 10:05:22,790 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-28 10:05:22,790 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-28 10:05:22,790 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-28 10:05:22,791 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-28 10:05:22,793 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-28 10:05:22,794 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-28 10:05:22,795 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-28 10:05:22,798 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-28 10:05:22,798 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-28 10:05:22,799 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-28 10:05:22,799 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-28 10:05:22,800 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-28 10:05:22,801 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-28 10:05:22,802 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-28 10:05:22,802 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-28 10:05:22,829 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-28 10:05:22,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-28 10:05:22,830 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-28 10:05:22,830 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-28 10:05:22,832 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-28 10:05:22,832 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-28 10:05:22,832 INFO L133 SettingsManager]: * Use SBE=true [2018-09-28 10:05:22,832 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-28 10:05:22,833 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-28 10:05:22,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-28 10:05:22,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-28 10:05:22,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-28 10:05:22,833 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-28 10:05:22,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-28 10:05:22,835 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-28 10:05:22,835 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-28 10:05:22,835 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-28 10:05:22,835 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-28 10:05:22,835 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-28 10:05:22,836 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-28 10:05:22,836 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-28 10:05:22,836 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-28 10:05:22,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 10:05:22,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-28 10:05:22,837 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-28 10:05:22,837 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-28 10:05:22,837 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-28 10:05:22,837 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-28 10:05:22,839 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-28 10:05:22,839 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-28 10:05:22,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-28 10:05:22,921 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-28 10:05:22,929 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-28 10:05:22,931 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-28 10:05:22,932 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-28 10:05:22,932 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-28 10:05:22,933 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2018-09-28 10:05:23,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-28 10:05:23,016 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-28 10:05:23,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-28 10:05:23,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-28 10:05:23,017 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-28 10:05:23,038 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 28.09 10:05:23" (1/1) ... [2018-09-28 10:05:23,054 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 28.09 10:05:23" (1/1) ... [2018-09-28 10:05:23,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-28 10:05:23,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-28 10:05:23,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-28 10:05:23,063 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-28 10:05:23,074 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 28.09 10:05:23" (1/1) ... [2018-09-28 10:05:23,074 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 28.09 10:05:23" (1/1) ... [2018-09-28 10:05:23,077 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 28.09 10:05:23" (1/1) ... [2018-09-28 10:05:23,077 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 28.09 10:05:23" (1/1) ... [2018-09-28 10:05:23,083 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 28.09 10:05:23" (1/1) ... [2018-09-28 10:05:23,086 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 28.09 10:05:23" (1/1) ... [2018-09-28 10:05:23,087 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 28.09 10:05:23" (1/1) ... [2018-09-28 10:05:23,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-28 10:05:23,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-28 10:05:23,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-28 10:05:23,090 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-28 10:05:23,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:05:23" (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-28 10:05:23,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-28 10:05:23,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-28 10:05:23,364 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-28 10:05:23,367 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:05:23 BoogieIcfgContainer [2018-09-28 10:05:23,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-28 10:05:23,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-28 10:05:23,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-28 10:05:23,372 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-28 10:05:23,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:05:23" (1/2) ... [2018-09-28 10:05:23,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7665e7b6 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.09 10:05:23, skipping insertion in model container [2018-09-28 10:05:23,378 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 28.09 10:05:23" (2/2) ... [2018-09-28 10:05:23,380 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2018-09-28 10:05:23,393 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-28 10:05:23,403 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-28 10:05:23,455 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-28 10:05:23,456 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-28 10:05:23,456 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-28 10:05:23,457 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-28 10:05:23,457 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-28 10:05:23,457 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-28 10:05:23,457 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-28 10:05:23,458 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-28 10:05:23,458 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-28 10:05:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-09-28 10:05:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-28 10:05:23,480 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:23,481 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-28 10:05:23,482 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:23,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:23,489 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-09-28 10:05:23,491 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:23,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:23,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:23,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:05:23,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:23,753 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-28 10:05:23,756 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:05:23,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:05:23,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-28 10:05:23,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-28 10:05:23,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-28 10:05:23,782 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2018-09-28 10:05:23,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:23,936 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-09-28 10:05:23,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-28 10:05:23,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-28 10:05:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:23,955 INFO L225 Difference]: With dead ends: 15 [2018-09-28 10:05:23,955 INFO L226 Difference]: Without dead ends: 9 [2018-09-28 10:05:23,961 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-28 10:05:23,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-28 10:05:23,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-28 10:05:23,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-28 10:05:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-28 10:05:23,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-09-28 10:05:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:23,991 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-28 10:05:23,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-28 10:05:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-28 10:05:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-28 10:05:23,992 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:23,992 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-28 10:05:23,992 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:23,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:23,993 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2018-09-28 10:05:23,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:23,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:23,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:23,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:05:23,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:24,113 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-28 10:05:24,113 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:24,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 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-28 10:05:24,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:05:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:24,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:24,171 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-28 10:05:24,193 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:24,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-09-28 10:05:24,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-28 10:05:24,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-28 10:05:24,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-28 10:05:24,194 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-09-28 10:05:24,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:24,297 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-09-28 10:05:24,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-28 10:05:24,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-28 10:05:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:24,300 INFO L225 Difference]: With dead ends: 13 [2018-09-28 10:05:24,300 INFO L226 Difference]: Without dead ends: 11 [2018-09-28 10:05:24,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-28 10:05:24,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-28 10:05:24,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-28 10:05:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-28 10:05:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-28 10:05:24,306 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-09-28 10:05:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:24,307 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-28 10:05:24,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-28 10:05:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-28 10:05:24,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-28 10:05:24,308 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:24,308 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-09-28 10:05:24,308 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:24,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:24,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-09-28 10:05:24,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:24,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:24,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:24,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:05:24,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:24,615 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-28 10:05:24,615 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:24,618 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-28 10:05:24,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:05:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:24,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:24,886 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-28 10:05:24,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:24,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:24,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:05:24,951 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-28 10:05:24,971 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:24,971 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-28 10:05:24,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-28 10:05:24,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-28 10:05:24,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-28 10:05:24,973 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 10 states. [2018-09-28 10:05:25,131 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-28 10:05:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:25,378 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-09-28 10:05:25,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-28 10:05:25,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-28 10:05:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:25,380 INFO L225 Difference]: With dead ends: 19 [2018-09-28 10:05:25,380 INFO L226 Difference]: Without dead ends: 13 [2018-09-28 10:05:25,381 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-28 10:05:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-28 10:05:25,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-28 10:05:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-28 10:05:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-28 10:05:25,392 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-09-28 10:05:25,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:25,393 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-28 10:05:25,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-28 10:05:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-28 10:05:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 10:05:25,394 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:25,395 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-09-28 10:05:25,395 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:25,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:25,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1765270407, now seen corresponding path program 2 times [2018-09-28 10:05:25,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:25,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:25,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:25,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:05:25,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:25,493 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-28 10:05:25,494 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:25,494 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-28 10:05:25,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:05:25,548 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:05:25,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:25,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:25,559 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-28 10:05:25,585 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:25,586 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-09-28 10:05:25,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-28 10:05:25,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-28 10:05:25,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-28 10:05:25,587 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-09-28 10:05:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:25,948 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-28 10:05:25,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-28 10:05:25,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-09-28 10:05:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:25,950 INFO L225 Difference]: With dead ends: 17 [2018-09-28 10:05:25,950 INFO L226 Difference]: Without dead ends: 15 [2018-09-28 10:05:25,951 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-28 10:05:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-28 10:05:25,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-28 10:05:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-28 10:05:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-28 10:05:25,962 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-09-28 10:05:25,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:25,964 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-28 10:05:25,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-28 10:05:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-28 10:05:25,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-28 10:05:25,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:25,965 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-09-28 10:05:25,966 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:25,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:25,966 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 3 times [2018-09-28 10:05:25,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:25,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:25,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:25,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:25,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:26,182 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-28 10:05:26,183 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:26,183 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:05:26,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:05:26,228 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-28 10:05:26,229 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:26,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:26,337 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-28 10:05:26,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:26,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:26,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:05:26,385 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-28 10:05:26,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:26,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:26,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-09-28 10:05:26,436 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-28 10:05:26,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:26,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-28 10:05:26,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-28 10:05:26,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-28 10:05:26,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-28 10:05:26,460 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 13 states. [2018-09-28 10:05:26,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:26,930 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-09-28 10:05:26,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-28 10:05:26,930 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-09-28 10:05:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:26,931 INFO L225 Difference]: With dead ends: 25 [2018-09-28 10:05:26,932 INFO L226 Difference]: Without dead ends: 17 [2018-09-28 10:05:26,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-09-28 10:05:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-28 10:05:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-28 10:05:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-28 10:05:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-09-28 10:05:26,939 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-09-28 10:05:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:26,939 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-09-28 10:05:26,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-28 10:05:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-28 10:05:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 10:05:26,940 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:26,940 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2018-09-28 10:05:26,941 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:26,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:26,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1096334355, now seen corresponding path program 4 times [2018-09-28 10:05:26,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:26,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:26,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:26,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:26,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:27,142 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-28 10:05:27,143 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:27,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 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-28 10:05:27,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:05:27,173 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:05:27,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:27,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:27,207 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-28 10:05:27,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:27,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:27,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:05:27,255 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-28 10:05:27,279 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:27,280 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-09-28 10:05:27,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-28 10:05:27,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-28 10:05:27,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-28 10:05:27,281 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2018-09-28 10:05:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:27,509 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-09-28 10:05:27,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-28 10:05:27,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-28 10:05:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:27,510 INFO L225 Difference]: With dead ends: 21 [2018-09-28 10:05:27,510 INFO L226 Difference]: Without dead ends: 19 [2018-09-28 10:05:27,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-09-28 10:05:27,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-28 10:05:27,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-28 10:05:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-28 10:05:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-28 10:05:27,517 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-09-28 10:05:27,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:27,518 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-28 10:05:27,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-28 10:05:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-28 10:05:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-28 10:05:27,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:27,519 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-09-28 10:05:27,519 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:27,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:27,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 5 times [2018-09-28 10:05:27,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:27,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:27,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:27,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:27,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:27,741 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-28 10:05:27,742 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:27,742 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-28 10:05:27,749 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:05:27,767 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-09-28 10:05:27,768 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:27,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:27,968 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-28 10:05:27,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:27,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:27,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:05:28,008 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-28 10:05:28,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:28,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-09-28 10:05:28,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-28 10:05:28,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-28 10:05:28,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-09-28 10:05:28,030 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 16 states. [2018-09-28 10:05:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:29,113 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-09-28 10:05:29,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-28 10:05:29,113 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-28 10:05:29,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:29,115 INFO L225 Difference]: With dead ends: 35 [2018-09-28 10:05:29,115 INFO L226 Difference]: Without dead ends: 23 [2018-09-28 10:05:29,116 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-28 10:05:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-28 10:05:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-28 10:05:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-28 10:05:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-09-28 10:05:29,125 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-09-28 10:05:29,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:29,125 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-09-28 10:05:29,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-28 10:05:29,125 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-28 10:05:29,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-28 10:05:29,126 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:29,126 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-09-28 10:05:29,127 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:29,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:29,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 6 times [2018-09-28 10:05:29,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:29,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:29,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:29,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:29,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:29,444 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-28 10:05:29,445 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:29,445 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-28 10:05:29,452 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:05:29,497 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-09-28 10:05:29,497 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:29,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:29,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-28 10:05:29,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:29,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:29,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:05:29,691 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-28 10:05:29,712 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:29,713 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-09-28 10:05:29,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-28 10:05:29,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-28 10:05:29,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-09-28 10:05:29,714 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 19 states. [2018-09-28 10:05:30,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:30,286 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-09-28 10:05:30,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-28 10:05:30,286 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2018-09-28 10:05:30,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:30,287 INFO L225 Difference]: With dead ends: 37 [2018-09-28 10:05:30,287 INFO L226 Difference]: Without dead ends: 25 [2018-09-28 10:05:30,288 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-28 10:05:30,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-28 10:05:30,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-28 10:05:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-28 10:05:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-09-28 10:05:30,296 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-09-28 10:05:30,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:30,296 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-09-28 10:05:30,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-28 10:05:30,296 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-09-28 10:05:30,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-28 10:05:30,297 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:30,297 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2018-09-28 10:05:30,297 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:30,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:30,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1774380245, now seen corresponding path program 7 times [2018-09-28 10:05:30,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:30,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:30,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:30,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:30,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:30,405 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-28 10:05:30,405 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:30,405 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-28 10:05:30,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:05:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:30,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:30,452 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-28 10:05:30,482 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:30,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-09-28 10:05:30,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 10:05:30,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 10:05:30,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-09-28 10:05:30,483 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2018-09-28 10:05:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:30,821 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-09-28 10:05:30,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-28 10:05:30,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-09-28 10:05:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:30,822 INFO L225 Difference]: With dead ends: 29 [2018-09-28 10:05:30,822 INFO L226 Difference]: Without dead ends: 27 [2018-09-28 10:05:30,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-28 10:05:30,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-28 10:05:30,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-28 10:05:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-28 10:05:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-28 10:05:30,833 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-09-28 10:05:30,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:30,833 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-28 10:05:30,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 10:05:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-28 10:05:30,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-28 10:05:30,834 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:30,835 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-09-28 10:05:30,835 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:30,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:30,835 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 8 times [2018-09-28 10:05:30,835 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:30,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:30,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:30,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:05:30,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:31,112 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-28 10:05:31,113 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:31,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 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-28 10:05:31,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:05:31,165 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:05:31,166 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:31,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:31,708 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-28 10:05:31,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:31,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:31,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:05:31,739 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-28 10:05:31,760 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:31,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-09-28 10:05:31,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-28 10:05:31,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-28 10:05:31,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-09-28 10:05:31,762 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 22 states. [2018-09-28 10:05:32,094 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-09-28 10:05:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:32,433 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-09-28 10:05:32,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-28 10:05:32,434 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-09-28 10:05:32,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:32,435 INFO L225 Difference]: With dead ends: 43 [2018-09-28 10:05:32,435 INFO L226 Difference]: Without dead ends: 29 [2018-09-28 10:05:32,436 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-28 10:05:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-28 10:05:32,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-28 10:05:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-28 10:05:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-09-28 10:05:32,444 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-09-28 10:05:32,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:32,445 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-09-28 10:05:32,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-28 10:05:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-09-28 10:05:32,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-28 10:05:32,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:32,446 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2018-09-28 10:05:32,446 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:32,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:32,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1980325449, now seen corresponding path program 9 times [2018-09-28 10:05:32,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:32,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:32,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:32,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:32,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:32,594 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-28 10:05:32,595 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:32,595 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:05:32,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:05:32,643 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-28 10:05:32,643 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:32,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:32,726 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-28 10:05:32,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:32,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:32,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:05:32,756 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-28 10:05:32,777 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:32,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-09-28 10:05:32,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-28 10:05:32,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-28 10:05:32,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-09-28 10:05:32,778 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 16 states. [2018-09-28 10:05:33,375 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-09-28 10:05:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:33,408 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-09-28 10:05:33,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-28 10:05:33,408 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-28 10:05:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:33,409 INFO L225 Difference]: With dead ends: 33 [2018-09-28 10:05:33,410 INFO L226 Difference]: Without dead ends: 31 [2018-09-28 10:05:33,410 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-28 10:05:33,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-28 10:05:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-28 10:05:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-28 10:05:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-09-28 10:05:33,420 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-09-28 10:05:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:33,420 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-09-28 10:05:33,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-28 10:05:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-09-28 10:05:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-28 10:05:33,421 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:33,422 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-09-28 10:05:33,422 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:33,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:33,422 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 10 times [2018-09-28 10:05:33,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:33,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:33,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:33,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:33,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:33,704 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-28 10:05:33,705 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:33,705 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-28 10:05:33,712 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:05:33,728 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:05:33,729 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:33,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:33,913 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-28 10:05:33,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:33,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:33,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:05:33,989 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-28 10:05:34,009 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:34,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 23 [2018-09-28 10:05:34,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-28 10:05:34,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-28 10:05:34,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-09-28 10:05:34,011 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 23 states. [2018-09-28 10:05:34,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:34,802 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-09-28 10:05:34,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-28 10:05:34,803 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-09-28 10:05:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:34,804 INFO L225 Difference]: With dead ends: 53 [2018-09-28 10:05:34,804 INFO L226 Difference]: Without dead ends: 35 [2018-09-28 10:05:34,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2018-09-28 10:05:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-28 10:05:34,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-28 10:05:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-28 10:05:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-09-28 10:05:34,818 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-09-28 10:05:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:34,818 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-09-28 10:05:34,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-28 10:05:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-09-28 10:05:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:05:34,820 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:34,820 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-09-28 10:05:34,820 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:34,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:34,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 11 times [2018-09-28 10:05:34,821 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:34,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:34,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:34,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:34,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:35,094 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-28 10:05:35,095 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:35,095 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-28 10:05:35,102 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:05:35,129 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-09-28 10:05:35,129 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:35,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:35,598 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-28 10:05:35,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:35,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:35,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:05:35,672 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-28 10:05:35,694 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:35,695 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-09-28 10:05:35,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-28 10:05:35,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-28 10:05:35,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2018-09-28 10:05:35,696 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 32 states. [2018-09-28 10:05:37,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:37,543 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-09-28 10:05:37,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-28 10:05:37,543 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-09-28 10:05:37,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:37,544 INFO L225 Difference]: With dead ends: 59 [2018-09-28 10:05:37,545 INFO L226 Difference]: Without dead ends: 39 [2018-09-28 10:05:37,546 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-28 10:05:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-28 10:05:37,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-28 10:05:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-28 10:05:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-09-28 10:05:37,558 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-09-28 10:05:37,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:37,558 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-09-28 10:05:37,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-28 10:05:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-09-28 10:05:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-28 10:05:37,559 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:37,559 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-09-28 10:05:37,560 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:37,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:37,560 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 12 times [2018-09-28 10:05:37,560 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:37,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:37,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:37,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:37,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:37,960 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-28 10:05:37,961 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:37,961 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:05:37,968 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:05:38,016 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-09-28 10:05:38,016 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:38,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:38,293 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-28 10:05:38,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:38,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:38,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:05:38,330 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-28 10:05:38,350 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:38,350 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2018-09-28 10:05:38,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-28 10:05:38,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-28 10:05:38,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2018-09-28 10:05:38,352 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 31 states. [2018-09-28 10:05:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:39,123 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-09-28 10:05:39,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-28 10:05:39,123 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-09-28 10:05:39,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:39,124 INFO L225 Difference]: With dead ends: 61 [2018-09-28 10:05:39,124 INFO L226 Difference]: Without dead ends: 41 [2018-09-28 10:05:39,125 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-28 10:05:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-28 10:05:39,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-28 10:05:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-28 10:05:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-09-28 10:05:39,139 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-09-28 10:05:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:39,139 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-09-28 10:05:39,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-28 10:05:39,140 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-09-28 10:05:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-28 10:05:39,140 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:39,140 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2018-09-28 10:05:39,141 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:39,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:39,141 INFO L82 PathProgramCache]: Analyzing trace with hash 830172837, now seen corresponding path program 13 times [2018-09-28 10:05:39,141 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:39,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:39,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:39,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:39,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:39,439 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-28 10:05:39,439 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:39,439 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-28 10:05:39,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:05:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:39,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:39,482 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-28 10:05:39,502 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:39,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2018-09-28 10:05:39,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-28 10:05:39,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-28 10:05:39,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-09-28 10:05:39,503 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 13 states. [2018-09-28 10:05:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:39,652 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-09-28 10:05:39,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-28 10:05:39,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-09-28 10:05:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:39,654 INFO L225 Difference]: With dead ends: 45 [2018-09-28 10:05:39,654 INFO L226 Difference]: Without dead ends: 43 [2018-09-28 10:05:39,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-28 10:05:39,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-28 10:05:39,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-28 10:05:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-28 10:05:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-09-28 10:05:39,670 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-09-28 10:05:39,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:39,670 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-09-28 10:05:39,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-28 10:05:39,671 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-09-28 10:05:39,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-28 10:05:39,671 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:39,671 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-09-28 10:05:39,672 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:39,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:39,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 14 times [2018-09-28 10:05:39,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:39,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:39,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:39,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:05:39,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:40,396 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-28 10:05:40,396 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:40,396 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-28 10:05:40,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:05:40,429 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:05:40,429 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:40,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:40,814 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-28 10:05:40,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:40,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:40,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:05:40,958 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-28 10:05:40,978 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:40,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 33 [2018-09-28 10:05:40,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-28 10:05:40,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-28 10:05:40,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-09-28 10:05:40,980 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 34 states. [2018-09-28 10:05:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:41,945 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-09-28 10:05:41,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-28 10:05:41,946 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 42 [2018-09-28 10:05:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:41,947 INFO L225 Difference]: With dead ends: 67 [2018-09-28 10:05:41,947 INFO L226 Difference]: Without dead ends: 45 [2018-09-28 10:05:41,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2018-09-28 10:05:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-28 10:05:41,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-28 10:05:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-28 10:05:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-09-28 10:05:41,964 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-09-28 10:05:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:41,965 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-09-28 10:05:41,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-28 10:05:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-09-28 10:05:41,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-28 10:05:41,966 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:41,966 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2018-09-28 10:05:41,966 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:41,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:41,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2070347801, now seen corresponding path program 15 times [2018-09-28 10:05:41,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:41,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:41,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:41,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:41,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:42,425 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-28 10:05:42,425 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:42,425 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-28 10:05:42,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:05:42,469 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-28 10:05:42,469 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:42,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:42,653 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-28 10:05:42,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:42,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:42,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:05:42,689 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-28 10:05:42,710 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:42,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-09-28 10:05:42,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-28 10:05:42,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-28 10:05:42,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-09-28 10:05:42,712 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 24 states. [2018-09-28 10:05:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:43,192 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-09-28 10:05:43,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-28 10:05:43,192 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-28 10:05:43,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:43,193 INFO L225 Difference]: With dead ends: 49 [2018-09-28 10:05:43,193 INFO L226 Difference]: Without dead ends: 47 [2018-09-28 10:05:43,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=228, Invalid=1032, Unknown=0, NotChecked=0, Total=1260 [2018-09-28 10:05:43,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-28 10:05:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-28 10:05:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-28 10:05:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-09-28 10:05:43,208 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-09-28 10:05:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:43,208 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-09-28 10:05:43,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-28 10:05:43,208 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-09-28 10:05:43,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-28 10:05:43,209 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:43,209 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-09-28 10:05:43,210 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:43,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:43,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 16 times [2018-09-28 10:05:43,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:43,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:43,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:43,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:43,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:43,661 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-28 10:05:43,661 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:43,661 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-28 10:05:43,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:05:43,697 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:05:43,698 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:43,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:44,018 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-28 10:05:44,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:44,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:44,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:05:44,076 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-28 10:05:44,099 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:44,099 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 35 [2018-09-28 10:05:44,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-28 10:05:44,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-28 10:05:44,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-09-28 10:05:44,100 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 35 states. [2018-09-28 10:05:45,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:45,402 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-09-28 10:05:45,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-28 10:05:45,403 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 46 [2018-09-28 10:05:45,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:45,404 INFO L225 Difference]: With dead ends: 77 [2018-09-28 10:05:45,404 INFO L226 Difference]: Without dead ends: 51 [2018-09-28 10:05:45,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=205, Invalid=2245, Unknown=0, NotChecked=0, Total=2450 [2018-09-28 10:05:45,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-28 10:05:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-28 10:05:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-28 10:05:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-09-28 10:05:45,427 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2018-09-28 10:05:45,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:45,428 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-09-28 10:05:45,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-28 10:05:45,428 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-09-28 10:05:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-28 10:05:45,429 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:45,429 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-09-28 10:05:45,429 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:45,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:45,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 17 times [2018-09-28 10:05:45,430 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:45,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:45,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:45,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:45,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:45,931 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-28 10:05:45,932 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:45,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 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-28 10:05:45,939 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:05:45,982 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-28 10:05:45,982 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:45,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:46,696 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-28 10:05:46,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:46,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:46,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:05:46,754 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-28 10:05:46,775 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:46,775 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 47 [2018-09-28 10:05:46,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-28 10:05:46,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-28 10:05:46,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2034, Unknown=0, NotChecked=0, Total=2256 [2018-09-28 10:05:46,777 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 48 states. [2018-09-28 10:05:48,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:48,934 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-09-28 10:05:48,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-28 10:05:48,934 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 50 [2018-09-28 10:05:48,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:48,935 INFO L225 Difference]: With dead ends: 83 [2018-09-28 10:05:48,935 INFO L226 Difference]: Without dead ends: 55 [2018-09-28 10:05:48,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=567, Invalid=5439, Unknown=0, NotChecked=0, Total=6006 [2018-09-28 10:05:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-28 10:05:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-28 10:05:48,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-28 10:05:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-09-28 10:05:48,961 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2018-09-28 10:05:48,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:48,961 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-09-28 10:05:48,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-28 10:05:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-09-28 10:05:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-28 10:05:48,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:48,962 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-09-28 10:05:48,963 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:48,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:48,963 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 18 times [2018-09-28 10:05:48,963 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:48,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:48,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:48,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:48,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:50,087 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-28 10:05:50,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:50,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 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-28 10:05:50,097 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:05:50,146 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-28 10:05:50,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:50,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:50,624 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-28 10:05:50,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:50,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:50,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:05:50,679 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-28 10:05:50,699 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:50,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15] total 41 [2018-09-28 10:05:50,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-28 10:05:50,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-28 10:05:50,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1538, Unknown=0, NotChecked=0, Total=1640 [2018-09-28 10:05:50,701 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 41 states. [2018-09-28 10:05:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:52,128 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-09-28 10:05:52,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-28 10:05:52,128 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 54 [2018-09-28 10:05:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:52,129 INFO L225 Difference]: With dead ends: 89 [2018-09-28 10:05:52,129 INFO L226 Difference]: Without dead ends: 59 [2018-09-28 10:05:52,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=239, Invalid=3067, Unknown=0, NotChecked=0, Total=3306 [2018-09-28 10:05:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-28 10:05:52,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-28 10:05:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-28 10:05:52,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-09-28 10:05:52,156 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-09-28 10:05:52,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:52,156 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-09-28 10:05:52,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-28 10:05:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-09-28 10:05:52,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-28 10:05:52,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:52,157 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-09-28 10:05:52,157 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:52,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:52,157 INFO L82 PathProgramCache]: Analyzing trace with hash 361552815, now seen corresponding path program 19 times [2018-09-28 10:05:52,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:52,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:52,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:52,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:52,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:52,833 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-28 10:05:52,833 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:52,833 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-28 10:05:52,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:05:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:52,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:53,462 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-28 10:05:53,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:53,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:53,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:05:53,518 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-28 10:05:53,538 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:53,538 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 45 [2018-09-28 10:05:53,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-28 10:05:53,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-28 10:05:53,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2018-09-28 10:05:53,539 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 46 states. [2018-09-28 10:05:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:55,090 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-09-28 10:05:55,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-28 10:05:55,091 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 58 [2018-09-28 10:05:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:55,092 INFO L225 Difference]: With dead ends: 91 [2018-09-28 10:05:55,092 INFO L226 Difference]: Without dead ends: 61 [2018-09-28 10:05:55,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2018-09-28 10:05:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-28 10:05:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-28 10:05:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-28 10:05:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-09-28 10:05:55,116 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-09-28 10:05:55,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:55,116 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-09-28 10:05:55,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-28 10:05:55,116 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-09-28 10:05:55,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-28 10:05:55,117 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:55,117 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1] [2018-09-28 10:05:55,117 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:55,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:55,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1210122729, now seen corresponding path program 20 times [2018-09-28 10:05:55,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:55,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:55,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:55,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:05:55,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:55,344 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-28 10:05:55,344 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:55,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 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-28 10:05:55,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:05:55,388 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:05:55,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:55,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:55,401 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-28 10:05:55,421 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:55,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 17 [2018-09-28 10:05:55,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-28 10:05:55,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-28 10:05:55,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-09-28 10:05:55,422 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 18 states. [2018-09-28 10:05:55,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:55,642 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-09-28 10:05:55,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-28 10:05:55,644 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-09-28 10:05:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:55,644 INFO L225 Difference]: With dead ends: 65 [2018-09-28 10:05:55,644 INFO L226 Difference]: Without dead ends: 63 [2018-09-28 10:05:55,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-28 10:05:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-28 10:05:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-28 10:05:55,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-28 10:05:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-09-28 10:05:55,665 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-09-28 10:05:55,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:55,665 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-09-28 10:05:55,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-28 10:05:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-09-28 10:05:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-28 10:05:55,666 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:55,666 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-09-28 10:05:55,666 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:55,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1008142301, now seen corresponding path program 21 times [2018-09-28 10:05:55,666 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:55,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:55,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:55,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:55,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:56,393 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-28 10:05:56,393 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:56,393 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-28 10:05:56,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:05:56,461 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-09-28 10:05:56,461 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:05:56,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:05:57,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-28 10:05:57,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:05:57,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:05:57,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:05:57,062 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-28 10:05:57,083 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:05:57,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17] total 47 [2018-09-28 10:05:57,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-28 10:05:57,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-28 10:05:57,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2044, Unknown=0, NotChecked=0, Total=2162 [2018-09-28 10:05:57,085 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 47 states. [2018-09-28 10:05:58,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:05:58,947 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-09-28 10:05:58,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-28 10:05:58,948 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 62 [2018-09-28 10:05:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:05:58,949 INFO L225 Difference]: With dead ends: 101 [2018-09-28 10:05:58,949 INFO L226 Difference]: Without dead ends: 67 [2018-09-28 10:05:58,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=273, Invalid=4017, Unknown=0, NotChecked=0, Total=4290 [2018-09-28 10:05:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-28 10:05:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-28 10:05:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-28 10:05:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-28 10:05:58,992 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2018-09-28 10:05:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:05:58,992 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-28 10:05:58,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-28 10:05:58,993 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-28 10:05:58,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-28 10:05:58,993 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:05:58,993 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-09-28 10:05:58,993 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:05:58,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:05:58,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1978312041, now seen corresponding path program 22 times [2018-09-28 10:05:58,994 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:05:58,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:05:58,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:58,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:05:58,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:05:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:05:59,976 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-28 10:05:59,976 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:05:59,977 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-28 10:05:59,984 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:06:00,017 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:06:00,018 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:06:00,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:06:00,917 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-28 10:06:00,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:06:00,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:06:00,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:06:00,979 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-28 10:06:00,999 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:06:00,999 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 18] total 50 [2018-09-28 10:06:01,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-28 10:06:01,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-28 10:06:01,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2324, Unknown=0, NotChecked=0, Total=2450 [2018-09-28 10:06:01,001 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 50 states. [2018-09-28 10:06:02,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:06:02,872 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-09-28 10:06:02,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-28 10:06:02,873 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-09-28 10:06:02,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:06:02,874 INFO L225 Difference]: With dead ends: 107 [2018-09-28 10:06:02,874 INFO L226 Difference]: Without dead ends: 71 [2018-09-28 10:06:02,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=290, Invalid=4540, Unknown=0, NotChecked=0, Total=4830 [2018-09-28 10:06:02,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-28 10:06:02,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-28 10:06:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-28 10:06:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-09-28 10:06:02,900 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2018-09-28 10:06:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:06:02,900 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-09-28 10:06:02,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-28 10:06:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-09-28 10:06:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-28 10:06:02,900 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:06:02,900 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-09-28 10:06:02,901 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:06:02,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:06:02,901 INFO L82 PathProgramCache]: Analyzing trace with hash 303497995, now seen corresponding path program 23 times [2018-09-28 10:06:02,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:06:02,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:06:02,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:02,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:06:02,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:06:04,056 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-28 10:06:04,056 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:06:04,056 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-28 10:06:04,063 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:06:04,155 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-09-28 10:06:04,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:06:04,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:06:05,827 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-28 10:06:05,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:06:05,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:06:05,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:06:05,894 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-28 10:06:05,915 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:06:05,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 67 [2018-09-28 10:06:05,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-28 10:06:05,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-28 10:06:05,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=4119, Unknown=0, NotChecked=0, Total=4556 [2018-09-28 10:06:05,917 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 68 states. [2018-09-28 10:06:09,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:06:09,090 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-09-28 10:06:09,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-28 10:06:09,091 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 70 [2018-09-28 10:06:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:06:09,092 INFO L225 Difference]: With dead ends: 113 [2018-09-28 10:06:09,092 INFO L226 Difference]: Without dead ends: 75 [2018-09-28 10:06:09,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=997, Invalid=10559, Unknown=0, NotChecked=0, Total=11556 [2018-09-28 10:06:09,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-28 10:06:09,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-28 10:06:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-28 10:06:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-09-28 10:06:09,118 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2018-09-28 10:06:09,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:06:09,118 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-09-28 10:06:09,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-28 10:06:09,118 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-09-28 10:06:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-28 10:06:09,119 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:06:09,119 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-09-28 10:06:09,119 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:06:09,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:06:09,119 INFO L82 PathProgramCache]: Analyzing trace with hash -177016449, now seen corresponding path program 24 times [2018-09-28 10:06:09,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:06:09,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:06:09,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:09,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:06:09,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:06:10,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-28 10:06:10,746 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:06:10,746 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-28 10:06:10,754 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:06:10,829 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-09-28 10:06:10,829 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:06:10,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:06:11,678 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-28 10:06:11,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:06:11,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:06:11,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:06:11,741 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-28 10:06:11,762 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:06:11,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 57 [2018-09-28 10:06:11,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-28 10:06:11,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-28 10:06:11,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2018-09-28 10:06:11,763 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 58 states. [2018-09-28 10:06:13,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:06:13,573 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-09-28 10:06:13,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-28 10:06:13,574 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 74 [2018-09-28 10:06:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:06:13,575 INFO L225 Difference]: With dead ends: 115 [2018-09-28 10:06:13,575 INFO L226 Difference]: Without dead ends: 77 [2018-09-28 10:06:13,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2018-09-28 10:06:13,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-28 10:06:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-28 10:06:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-28 10:06:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-09-28 10:06:13,606 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-09-28 10:06:13,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:06:13,607 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-09-28 10:06:13,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-28 10:06:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-09-28 10:06:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-28 10:06:13,607 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:06:13,607 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1] [2018-09-28 10:06:13,607 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:06:13,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:06:13,608 INFO L82 PathProgramCache]: Analyzing trace with hash -42507335, now seen corresponding path program 25 times [2018-09-28 10:06:13,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:06:13,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:06:13,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:13,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:06:13,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:06:14,049 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-28 10:06:14,049 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:06:14,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 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-28 10:06:14,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:06:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:06:14,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:06:14,113 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-28 10:06:14,133 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:06:14,133 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 21 [2018-09-28 10:06:14,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-28 10:06:14,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-28 10:06:14,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-09-28 10:06:14,134 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 22 states. [2018-09-28 10:06:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:06:14,444 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-09-28 10:06:14,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-28 10:06:14,445 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 76 [2018-09-28 10:06:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:06:14,446 INFO L225 Difference]: With dead ends: 81 [2018-09-28 10:06:14,446 INFO L226 Difference]: Without dead ends: 79 [2018-09-28 10:06:14,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-28 10:06:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-28 10:06:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-28 10:06:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-28 10:06:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-09-28 10:06:14,474 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-09-28 10:06:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:06:14,474 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-09-28 10:06:14,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-28 10:06:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-09-28 10:06:14,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-28 10:06:14,475 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:06:14,475 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-09-28 10:06:14,476 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:06:14,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:06:14,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2100176371, now seen corresponding path program 26 times [2018-09-28 10:06:14,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:06:14,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:06:14,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:14,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:06:14,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:06:15,780 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-28 10:06:15,781 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:06:15,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 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-28 10:06:15,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:06:15,832 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:06:15,832 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:06:15,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:06:16,751 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-28 10:06:16,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:06:16,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:06:16,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:06:16,822 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-28 10:06:16,842 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:06:16,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 60 [2018-09-28 10:06:16,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-28 10:06:16,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-28 10:06:16,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3482, Unknown=0, NotChecked=0, Total=3660 [2018-09-28 10:06:16,843 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 61 states. [2018-09-28 10:06:18,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:06:18,912 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-09-28 10:06:18,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-28 10:06:18,912 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 78 [2018-09-28 10:06:18,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:06:18,913 INFO L225 Difference]: With dead ends: 121 [2018-09-28 10:06:18,913 INFO L226 Difference]: Without dead ends: 81 [2018-09-28 10:06:18,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=377, Invalid=6265, Unknown=0, NotChecked=0, Total=6642 [2018-09-28 10:06:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-28 10:06:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-28 10:06:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-28 10:06:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-09-28 10:06:18,943 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-09-28 10:06:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:06:18,943 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-09-28 10:06:18,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-28 10:06:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-09-28 10:06:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-28 10:06:18,944 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:06:18,944 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1] [2018-09-28 10:06:18,944 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:06:18,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:06:18,945 INFO L82 PathProgramCache]: Analyzing trace with hash 752544557, now seen corresponding path program 27 times [2018-09-28 10:06:18,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:06:18,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:06:18,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:18,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:06:18,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:06:19,356 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-28 10:06:19,357 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:06:19,357 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-28 10:06:19,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:06:19,480 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-09-28 10:06:19,480 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:06:19,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:06:21,360 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-28 10:06:21,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:06:21,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:06:21,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:06:21,423 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-28 10:06:21,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:06:21,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2018-09-28 10:06:21,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-28 10:06:21,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-28 10:06:21,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1450, Unknown=0, NotChecked=0, Total=1722 [2018-09-28 10:06:21,444 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 42 states. [2018-09-28 10:06:22,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:06:22,589 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-09-28 10:06:22,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-28 10:06:22,589 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-28 10:06:22,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:06:22,590 INFO L225 Difference]: With dead ends: 85 [2018-09-28 10:06:22,590 INFO L226 Difference]: Without dead ends: 83 [2018-09-28 10:06:22,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=588, Invalid=3318, Unknown=0, NotChecked=0, Total=3906 [2018-09-28 10:06:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-28 10:06:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-28 10:06:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-28 10:06:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-09-28 10:06:22,622 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-09-28 10:06:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:06:22,622 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-09-28 10:06:22,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-28 10:06:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-09-28 10:06:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-28 10:06:22,623 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:06:22,623 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-09-28 10:06:22,623 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:06:22,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:06:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1640865895, now seen corresponding path program 28 times [2018-09-28 10:06:22,624 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:06:22,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:06:22,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:22,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:06:22,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:06:23,709 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-28 10:06:23,709 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:06:23,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 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-28 10:06:23,716 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:06:23,745 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:06:23,746 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:06:23,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:06:24,799 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-28 10:06:24,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:06:24,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:06:24,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:06:24,872 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-28 10:06:24,893 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:06:24,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 22] total 62 [2018-09-28 10:06:24,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-28 10:06:24,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-28 10:06:24,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=3624, Unknown=0, NotChecked=0, Total=3782 [2018-09-28 10:06:24,895 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 62 states. [2018-09-28 10:06:27,910 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-28 10:06:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:06:28,152 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-09-28 10:06:28,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-28 10:06:28,153 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 82 [2018-09-28 10:06:28,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:06:28,154 INFO L225 Difference]: With dead ends: 131 [2018-09-28 10:06:28,154 INFO L226 Difference]: Without dead ends: 87 [2018-09-28 10:06:28,155 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-28 10:06:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-28 10:06:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-28 10:06:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-28 10:06:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-09-28 10:06:28,200 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2018-09-28 10:06:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:06:28,201 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-09-28 10:06:28,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-28 10:06:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-09-28 10:06:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-28 10:06:28,201 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:06:28,202 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-09-28 10:06:28,202 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:06:28,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:06:28,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1957273381, now seen corresponding path program 29 times [2018-09-28 10:06:28,202 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:06:28,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:06:28,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:28,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:06:28,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:06:29,234 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-28 10:06:29,234 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:06:29,234 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-28 10:06:29,243 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:06:29,373 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-09-28 10:06:29,373 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:06:29,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:06:32,955 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-28 10:06:32,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:06:32,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:06:32,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:06:33,041 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-28 10:06:33,062 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:06:33,062 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 83 [2018-09-28 10:06:33,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-28 10:06:33,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-28 10:06:33,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=6309, Unknown=0, NotChecked=0, Total=6972 [2018-09-28 10:06:33,063 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 84 states. [2018-09-28 10:06:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:06:37,798 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-09-28 10:06:37,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-28 10:06:37,799 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 86 [2018-09-28 10:06:37,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:06:37,800 INFO L225 Difference]: With dead ends: 137 [2018-09-28 10:06:37,800 INFO L226 Difference]: Without dead ends: 91 [2018-09-28 10:06:37,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2976 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1431, Invalid=15861, Unknown=0, NotChecked=0, Total=17292 [2018-09-28 10:06:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-28 10:06:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-28 10:06:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-28 10:06:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-09-28 10:06:37,849 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2018-09-28 10:06:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:06:37,849 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-09-28 10:06:37,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-28 10:06:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-09-28 10:06:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-28 10:06:37,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:06:37,850 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-09-28 10:06:37,850 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:06:37,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:06:37,851 INFO L82 PathProgramCache]: Analyzing trace with hash -783456433, now seen corresponding path program 30 times [2018-09-28 10:06:37,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:06:37,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:06:37,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:37,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:06:37,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:06:39,013 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-28 10:06:39,013 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:06:39,013 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-28 10:06:39,025 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:06:39,128 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-09-28 10:06:39,128 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:06:39,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:06:40,303 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-28 10:06:40,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:06:40,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:06:40,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:06:40,379 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-28 10:06:40,400 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:06:40,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 69 [2018-09-28 10:06:40,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-28 10:06:40,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-28 10:06:40,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2018-09-28 10:06:40,402 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 70 states. [2018-09-28 10:06:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:06:43,096 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-09-28 10:06:43,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-28 10:06:43,096 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 90 [2018-09-28 10:06:43,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:06:43,097 INFO L225 Difference]: With dead ends: 139 [2018-09-28 10:06:43,097 INFO L226 Difference]: Without dead ends: 93 [2018-09-28 10:06:43,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2018-09-28 10:06:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-28 10:06:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-28 10:06:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-28 10:06:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-09-28 10:06:43,147 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-09-28 10:06:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:06:43,147 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-09-28 10:06:43,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-28 10:06:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-09-28 10:06:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-28 10:06:43,148 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:06:43,148 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1] [2018-09-28 10:06:43,148 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:06:43,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:06:43,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1017783689, now seen corresponding path program 31 times [2018-09-28 10:06:43,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:06:43,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:06:43,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:43,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:06:43,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:06:43,494 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-28 10:06:43,495 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:06:43,495 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-28 10:06:43,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:06:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:06:43,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:06:43,663 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-28 10:06:43,692 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:06:43,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 25 [2018-09-28 10:06:43,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-28 10:06:43,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-28 10:06:43,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-09-28 10:06:43,693 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 26 states. [2018-09-28 10:06:44,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:06:44,119 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-09-28 10:06:44,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-28 10:06:44,120 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 92 [2018-09-28 10:06:44,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:06:44,121 INFO L225 Difference]: With dead ends: 97 [2018-09-28 10:06:44,121 INFO L226 Difference]: Without dead ends: 95 [2018-09-28 10:06:44,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-28 10:06:44,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-28 10:06:44,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-28 10:06:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-28 10:06:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-09-28 10:06:44,161 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-09-28 10:06:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:06:44,161 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-09-28 10:06:44,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-28 10:06:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-09-28 10:06:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-28 10:06:44,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:06:44,162 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-09-28 10:06:44,162 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:06:44,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:06:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1162366013, now seen corresponding path program 32 times [2018-09-28 10:06:44,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:06:44,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:06:44,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:44,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:06:44,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:06:45,322 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-28 10:06:45,322 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:06:45,322 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:06:45,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:06:45,378 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:06:45,379 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:06:45,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:06:46,925 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-28 10:06:46,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:06:46,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:06:46,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:06:47,008 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-28 10:06:47,028 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:06:47,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 72 [2018-09-28 10:06:47,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-28 10:06:47,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-28 10:06:47,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=5042, Unknown=0, NotChecked=0, Total=5256 [2018-09-28 10:06:47,030 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 73 states. [2018-09-28 10:06:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:06:49,957 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-09-28 10:06:49,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-28 10:06:49,957 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 94 [2018-09-28 10:06:49,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:06:49,958 INFO L225 Difference]: With dead ends: 145 [2018-09-28 10:06:49,958 INFO L226 Difference]: Without dead ends: 97 [2018-09-28 10:06:49,959 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-28 10:06:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-28 10:06:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-28 10:06:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-28 10:06:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-09-28 10:06:50,008 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-09-28 10:06:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:06:50,008 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-09-28 10:06:50,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-28 10:06:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-09-28 10:06:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-28 10:06:50,009 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:06:50,009 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1] [2018-09-28 10:06:50,009 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:06:50,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:06:50,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1867070211, now seen corresponding path program 33 times [2018-09-28 10:06:50,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:06:50,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:06:50,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:50,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:06:50,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:06:50,568 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-28 10:06:50,568 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:06:50,568 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-28 10:06:50,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:06:50,701 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-09-28 10:06:50,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:06:50,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:06:51,473 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-28 10:06:51,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:06:51,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:06:51,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:06:51,538 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-28 10:06:51,558 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:06:51,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2018-09-28 10:06:51,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-28 10:06:51,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-28 10:06:51,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2076, Unknown=0, NotChecked=0, Total=2450 [2018-09-28 10:06:51,559 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 50 states. [2018-09-28 10:06:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:06:53,122 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-09-28 10:06:53,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-28 10:06:53,122 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-28 10:06:53,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:06:53,123 INFO L225 Difference]: With dead ends: 101 [2018-09-28 10:06:53,123 INFO L226 Difference]: Without dead ends: 99 [2018-09-28 10:06:53,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=800, Invalid=4750, Unknown=0, NotChecked=0, Total=5550 [2018-09-28 10:06:53,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-28 10:06:53,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-28 10:06:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-28 10:06:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-09-28 10:06:53,168 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-09-28 10:06:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:06:53,168 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-09-28 10:06:53,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-28 10:06:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-09-28 10:06:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-28 10:06:53,169 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:06:53,169 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-09-28 10:06:53,169 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:06:53,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:06:53,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1041909303, now seen corresponding path program 34 times [2018-09-28 10:06:53,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:06:53,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:06:53,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:53,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:06:53,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:06:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:06:54,506 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-28 10:06:54,506 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:06:54,506 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-28 10:06:54,513 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:06:54,550 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:06:54,550 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:06:54,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:06:56,196 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-28 10:06:56,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:06:56,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:06:56,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:06:56,281 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-28 10:06:56,301 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:06:56,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 26] total 74 [2018-09-28 10:06:56,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-28 10:06:56,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-28 10:06:56,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=5212, Unknown=0, NotChecked=0, Total=5402 [2018-09-28 10:06:56,302 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 74 states. [2018-09-28 10:07:00,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:07:00,075 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-09-28 10:07:00,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-28 10:07:00,076 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 98 [2018-09-28 10:07:00,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:07:00,077 INFO L225 Difference]: With dead ends: 155 [2018-09-28 10:07:00,077 INFO L226 Difference]: Without dead ends: 103 [2018-09-28 10:07:00,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=426, Invalid=9876, Unknown=0, NotChecked=0, Total=10302 [2018-09-28 10:07:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-28 10:07:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-28 10:07:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-28 10:07:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-09-28 10:07:00,123 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2018-09-28 10:07:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:07:00,124 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-09-28 10:07:00,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-28 10:07:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-09-28 10:07:00,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-28 10:07:00,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:07:00,124 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-09-28 10:07:00,124 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:07:00,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:07:00,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2122703189, now seen corresponding path program 35 times [2018-09-28 10:07:00,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:07:00,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:07:00,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:00,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:07:00,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:07:01,905 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-28 10:07:01,906 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:07:01,906 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:07:01,913 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:07:02,109 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-09-28 10:07:02,109 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:07:02,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:07:04,815 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-28 10:07:04,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:07:04,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:07:04,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:07:04,914 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-28 10:07:04,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:07:04,935 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 99 [2018-09-28 10:07:04,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-28 10:07:04,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-28 10:07:04,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=937, Invalid=8963, Unknown=0, NotChecked=0, Total=9900 [2018-09-28 10:07:04,936 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 100 states. [2018-09-28 10:07:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:07:11,062 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-09-28 10:07:11,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-28 10:07:11,062 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 102 [2018-09-28 10:07:11,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:07:11,063 INFO L225 Difference]: With dead ends: 161 [2018-09-28 10:07:11,063 INFO L226 Difference]: Without dead ends: 107 [2018-09-28 10:07:11,065 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-28 10:07:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-28 10:07:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-28 10:07:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-28 10:07:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-09-28 10:07:11,116 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102 [2018-09-28 10:07:11,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:07:11,116 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-09-28 10:07:11,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-28 10:07:11,117 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-09-28 10:07:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-28 10:07:11,117 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:07:11,117 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-09-28 10:07:11,118 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:07:11,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:07:11,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1705231073, now seen corresponding path program 36 times [2018-09-28 10:07:11,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:07:11,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:07:11,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:11,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:07:11,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:07:12,813 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-28 10:07:12,813 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:07:12,813 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-28 10:07:12,820 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:07:12,967 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-09-28 10:07:12,967 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:07:12,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:07:14,588 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-28 10:07:14,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:07:14,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:07:14,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:07:14,684 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-28 10:07:14,704 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:07:14,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 81 [2018-09-28 10:07:14,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-28 10:07:14,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-28 10:07:14,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2018-09-28 10:07:14,706 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 82 states. [2018-09-28 10:07:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:07:18,643 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-09-28 10:07:18,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-28 10:07:18,644 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 106 [2018-09-28 10:07:18,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:07:18,645 INFO L225 Difference]: With dead ends: 163 [2018-09-28 10:07:18,645 INFO L226 Difference]: Without dead ends: 109 [2018-09-28 10:07:18,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2018-09-28 10:07:18,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-28 10:07:18,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-28 10:07:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-28 10:07:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-09-28 10:07:18,705 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-09-28 10:07:18,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:07:18,705 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-09-28 10:07:18,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-28 10:07:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-09-28 10:07:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-28 10:07:18,706 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:07:18,706 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1] [2018-09-28 10:07:18,707 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:07:18,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:07:18,707 INFO L82 PathProgramCache]: Analyzing trace with hash 653870937, now seen corresponding path program 37 times [2018-09-28 10:07:18,707 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:07:18,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:07:18,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:18,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:07:18,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:07:19,736 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-28 10:07:19,736 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:07:19,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 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-28 10:07:19,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:07:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:07:19,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:07:19,838 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-28 10:07:19,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:07:19,875 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 29 [2018-09-28 10:07:19,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-28 10:07:19,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-28 10:07:19,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-09-28 10:07:19,876 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 30 states. [2018-09-28 10:07:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:07:20,424 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-09-28 10:07:20,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-28 10:07:20,424 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 108 [2018-09-28 10:07:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:07:20,425 INFO L225 Difference]: With dead ends: 113 [2018-09-28 10:07:20,426 INFO L226 Difference]: Without dead ends: 111 [2018-09-28 10:07:20,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-28 10:07:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-28 10:07:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-28 10:07:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-28 10:07:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-09-28 10:07:20,478 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-09-28 10:07:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:07:20,478 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-09-28 10:07:20,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-28 10:07:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-09-28 10:07:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-28 10:07:20,479 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:07:20,479 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-09-28 10:07:20,479 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:07:20,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:07:20,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1304797587, now seen corresponding path program 38 times [2018-09-28 10:07:20,479 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:07:20,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:07:20,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:20,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:07:20,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:07:22,474 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-28 10:07:22,474 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:07:22,474 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-28 10:07:22,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:07:22,549 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:07:22,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:07:22,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:07:24,468 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-28 10:07:24,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:07:24,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:07:24,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:07:24,568 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-28 10:07:24,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:07:24,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 84 [2018-09-28 10:07:24,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-28 10:07:24,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-28 10:07:24,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=6890, Unknown=0, NotChecked=0, Total=7140 [2018-09-28 10:07:24,590 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 85 states. [2018-09-28 10:07:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:07:29,103 INFO L93 Difference]: Finished difference Result 169 states and 171 transitions. [2018-09-28 10:07:29,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-28 10:07:29,103 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 110 [2018-09-28 10:07:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:07:29,104 INFO L225 Difference]: With dead ends: 169 [2018-09-28 10:07:29,105 INFO L226 Difference]: Without dead ends: 113 [2018-09-28 10:07:29,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=529, Invalid=12353, Unknown=0, NotChecked=0, Total=12882 [2018-09-28 10:07:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-28 10:07:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-28 10:07:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-28 10:07:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-09-28 10:07:29,163 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-09-28 10:07:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:07:29,164 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-09-28 10:07:29,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-28 10:07:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-09-28 10:07:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-28 10:07:29,164 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:07:29,164 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1] [2018-09-28 10:07:29,164 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:07:29,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:07:29,165 INFO L82 PathProgramCache]: Analyzing trace with hash -738263347, now seen corresponding path program 39 times [2018-09-28 10:07:29,165 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:07:29,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:07:29,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:29,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:07:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:07:29,791 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-28 10:07:29,792 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:07:29,792 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:07:29,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:07:29,978 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-09-28 10:07:29,978 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:07:29,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:07:32,358 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-28 10:07:32,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:07:32,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:07:32,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:07:32,426 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-28 10:07:32,447 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:07:32,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 58 [2018-09-28 10:07:32,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-28 10:07:32,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-28 10:07:32,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2814, Unknown=0, NotChecked=0, Total=3306 [2018-09-28 10:07:32,448 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 58 states. [2018-09-28 10:07:34,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:07:34,449 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-09-28 10:07:34,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-28 10:07:34,450 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-28 10:07:34,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:07:34,451 INFO L225 Difference]: With dead ends: 117 [2018-09-28 10:07:34,451 INFO L226 Difference]: Without dead ends: 115 [2018-09-28 10:07:34,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1044, Invalid=6438, Unknown=0, NotChecked=0, Total=7482 [2018-09-28 10:07:34,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-28 10:07:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-28 10:07:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-28 10:07:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-09-28 10:07:34,516 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-09-28 10:07:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:07:34,516 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-09-28 10:07:34,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-28 10:07:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-09-28 10:07:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-28 10:07:34,517 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:07:34,517 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-09-28 10:07:34,517 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:07:34,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:07:34,517 INFO L82 PathProgramCache]: Analyzing trace with hash -801420281, now seen corresponding path program 40 times [2018-09-28 10:07:34,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:07:34,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:07:34,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:34,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:07:34,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:07:36,312 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-28 10:07:36,312 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:07:36,312 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:07:36,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:07:36,362 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:07:36,362 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:07:36,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:07:38,507 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-28 10:07:38,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:07:38,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:07:38,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:07:38,605 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-28 10:07:38,625 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:07:38,626 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 30] total 86 [2018-09-28 10:07:38,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-28 10:07:38,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-28 10:07:38,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=7088, Unknown=0, NotChecked=0, Total=7310 [2018-09-28 10:07:38,627 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 86 states. [2018-09-28 10:07:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:07:43,937 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2018-09-28 10:07:43,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-28 10:07:43,937 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 114 [2018-09-28 10:07:43,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:07:43,939 INFO L225 Difference]: With dead ends: 179 [2018-09-28 10:07:43,939 INFO L226 Difference]: Without dead ends: 119 [2018-09-28 10:07:43,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=494, Invalid=13312, Unknown=0, NotChecked=0, Total=13806 [2018-09-28 10:07:43,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-28 10:07:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-28 10:07:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-28 10:07:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-09-28 10:07:44,006 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2018-09-28 10:07:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:07:44,006 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-09-28 10:07:44,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-28 10:07:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-09-28 10:07:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-28 10:07:44,007 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:07:44,007 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-09-28 10:07:44,007 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:07:44,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:07:44,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2050868101, now seen corresponding path program 41 times [2018-09-28 10:07:44,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:07:44,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:07:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:44,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:07:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:07:45,905 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-28 10:07:45,906 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:07:45,906 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:07:45,913 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:07:46,219 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-09-28 10:07:46,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:07:46,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:07:49,959 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-28 10:07:49,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:07:49,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:07:49,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:07:50,072 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-28 10:07:50,093 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:07:50,093 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 115 [2018-09-28 10:07:50,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-28 10:07:50,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-28 10:07:50,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=12081, Unknown=0, NotChecked=0, Total=13340 [2018-09-28 10:07:50,095 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 116 states. [2018-09-28 10:07:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:07:58,154 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2018-09-28 10:07:58,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-28 10:07:58,155 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 118 [2018-09-28 10:07:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:07:58,156 INFO L225 Difference]: With dead ends: 185 [2018-09-28 10:07:58,156 INFO L226 Difference]: Without dead ends: 123 [2018-09-28 10:07:58,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5628 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=2539, Invalid=29681, Unknown=0, NotChecked=0, Total=32220 [2018-09-28 10:07:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-28 10:07:58,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-28 10:07:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-28 10:07:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-09-28 10:07:58,248 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 118 [2018-09-28 10:07:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:07:58,249 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-09-28 10:07:58,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-28 10:07:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-09-28 10:07:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-28 10:07:58,250 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:07:58,250 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-09-28 10:07:58,250 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:07:58,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:07:58,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1042320657, now seen corresponding path program 42 times [2018-09-28 10:07:58,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:07:58,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:07:58,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:58,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:07:58,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:07:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:08:00,402 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-28 10:08:00,402 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:08:00,402 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-28 10:08:00,410 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:08:00,610 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2018-09-28 10:08:00,610 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:08:00,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:08:02,998 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-28 10:08:02,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:08:03,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:08:03,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:08:03,115 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-28 10:08:03,136 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:08:03,136 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 32] total 92 [2018-09-28 10:08:03,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-28 10:08:03,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-28 10:08:03,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=8134, Unknown=0, NotChecked=0, Total=8372 [2018-09-28 10:08:03,138 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 92 states. [2018-09-28 10:08:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:08:09,070 INFO L93 Difference]: Finished difference Result 191 states and 195 transitions. [2018-09-28 10:08:09,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-28 10:08:09,070 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 122 [2018-09-28 10:08:09,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:08:09,072 INFO L225 Difference]: With dead ends: 191 [2018-09-28 10:08:09,072 INFO L226 Difference]: Without dead ends: 127 [2018-09-28 10:08:09,073 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-28 10:08:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-28 10:08:09,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-28 10:08:09,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-28 10:08:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-09-28 10:08:09,145 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2018-09-28 10:08:09,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:08:09,145 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-09-28 10:08:09,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-28 10:08:09,145 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-09-28 10:08:09,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-28 10:08:09,146 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:08:09,146 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-09-28 10:08:09,146 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:08:09,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:08:09,147 INFO L82 PathProgramCache]: Analyzing trace with hash -2020085917, now seen corresponding path program 43 times [2018-09-28 10:08:09,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:08:09,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:08:09,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:08:09,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:08:09,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:08:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:08:11,481 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-28 10:08:11,482 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:08:11,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 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-28 10:08:11,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:08:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:08:11,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:08:13,953 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-28 10:08:13,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:08:13,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:08:13,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:08:14,069 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-28 10:08:14,090 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:08:14,090 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 96 [2018-09-28 10:08:14,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-28 10:08:14,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-28 10:08:14,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=9026, Unknown=0, NotChecked=0, Total=9312 [2018-09-28 10:08:14,091 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 97 states. [2018-09-28 10:08:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:08:19,131 INFO L93 Difference]: Finished difference Result 193 states and 195 transitions. [2018-09-28 10:08:19,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-28 10:08:19,132 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 126 [2018-09-28 10:08:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:08:19,133 INFO L225 Difference]: With dead ends: 193 [2018-09-28 10:08:19,133 INFO L226 Difference]: Without dead ends: 129 [2018-09-28 10:08:19,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=605, Invalid=16165, Unknown=0, NotChecked=0, Total=16770 [2018-09-28 10:08:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-28 10:08:19,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-28 10:08:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-28 10:08:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-09-28 10:08:19,208 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-09-28 10:08:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:08:19,209 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-09-28 10:08:19,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-28 10:08:19,209 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-09-28 10:08:19,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-28 10:08:19,210 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:08:19,210 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1] [2018-09-28 10:08:19,210 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:08:19,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:08:19,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2012453021, now seen corresponding path program 44 times [2018-09-28 10:08:19,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:08:19,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:08:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:08:19,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:08:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:08:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:08:19,823 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-28 10:08:19,823 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:08:19,823 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-28 10:08:19,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:08:19,902 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:08:19,902 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:08:19,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:08:19,943 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-28 10:08:19,973 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:08:19,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 34 [2018-09-28 10:08:19,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-28 10:08:19,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-28 10:08:19,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-09-28 10:08:19,974 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 35 states. [2018-09-28 10:08:20,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:08:20,623 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-09-28 10:08:20,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-28 10:08:20,623 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 128 [2018-09-28 10:08:20,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:08:20,624 INFO L225 Difference]: With dead ends: 133 [2018-09-28 10:08:20,624 INFO L226 Difference]: Without dead ends: 131 [2018-09-28 10:08:20,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-28 10:08:20,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-28 10:08:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-28 10:08:20,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-28 10:08:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-09-28 10:08:20,699 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-09-28 10:08:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:08:20,700 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-09-28 10:08:20,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-28 10:08:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-09-28 10:08:20,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-28 10:08:20,700 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:08:20,700 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-09-28 10:08:20,701 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:08:20,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:08:20,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1232122327, now seen corresponding path program 45 times [2018-09-28 10:08:20,701 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:08:20,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:08:20,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:08:20,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:08:20,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:08:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:08:23,691 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-28 10:08:23,691 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:08:23,692 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-28 10:08:23,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:08:23,961 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-09-28 10:08:23,962 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:08:23,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:08:26,365 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-28 10:08:26,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:08:26,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:08:26,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:08:26,486 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-28 10:08:26,507 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:08:26,507 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 99 [2018-09-28 10:08:26,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-28 10:08:26,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-28 10:08:26,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2018-09-28 10:08:26,509 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 100 states. [2018-09-28 10:08:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:08:32,138 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-09-28 10:08:32,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-28 10:08:32,138 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 130 [2018-09-28 10:08:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:08:32,139 INFO L225 Difference]: With dead ends: 199 [2018-09-28 10:08:32,139 INFO L226 Difference]: Without dead ends: 133 [2018-09-28 10:08:32,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2018-09-28 10:08:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-28 10:08:32,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-28 10:08:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-28 10:08:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-09-28 10:08:32,214 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-09-28 10:08:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:08:32,214 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-09-28 10:08:32,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-28 10:08:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-09-28 10:08:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-28 10:08:32,215 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:08:32,215 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1] [2018-09-28 10:08:32,215 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:08:32,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:08:32,215 INFO L82 PathProgramCache]: Analyzing trace with hash -452907503, now seen corresponding path program 46 times [2018-09-28 10:08:32,215 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:08:32,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:08:32,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:08:32,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:08:32,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:08:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:08:33,646 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-28 10:08:33,646 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:08:33,646 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-28 10:08:33,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:08:33,706 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:08:33,707 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:08:33,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:08:34,825 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-28 10:08:34,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:08:34,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:08:34,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:08:34,911 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-28 10:08:34,931 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:08:34,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 68 [2018-09-28 10:08:34,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-28 10:08:34,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-28 10:08:34,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=662, Invalid=3894, Unknown=0, NotChecked=0, Total=4556 [2018-09-28 10:08:34,933 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 68 states. [2018-09-28 10:08:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:08:37,684 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-09-28 10:08:37,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-28 10:08:37,684 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-28 10:08:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:08:37,686 INFO L225 Difference]: With dead ends: 137 [2018-09-28 10:08:37,686 INFO L226 Difference]: Without dead ends: 135 [2018-09-28 10:08:37,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2143 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1394, Invalid=8908, Unknown=0, NotChecked=0, Total=10302 [2018-09-28 10:08:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-28 10:08:37,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-28 10:08:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-28 10:08:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-09-28 10:08:37,778 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-09-28 10:08:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:08:37,778 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-09-28 10:08:37,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-28 10:08:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-09-28 10:08:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-28 10:08:37,779 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:08:37,779 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-09-28 10:08:37,779 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:08:37,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:08:37,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1452361141, now seen corresponding path program 47 times [2018-09-28 10:08:37,780 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:08:37,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:08:37,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:08:37,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:08:37,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:08:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:08:40,570 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-28 10:08:40,570 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:08:40,570 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-28 10:08:40,578 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:08:41,088 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2018-09-28 10:08:41,088 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:08:41,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:08:45,961 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-28 10:08:45,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:08:45,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:08:45,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-28 10:08:46,088 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-28 10:08:46,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:08:46,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 131 [2018-09-28 10:08:46,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-28 10:08:46,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-28 10:08:46,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1629, Invalid=15663, Unknown=0, NotChecked=0, Total=17292 [2018-09-28 10:08:46,112 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 132 states. [2018-09-28 10:08:51,846 WARN L178 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-09-28 10:08:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:08:56,687 INFO L93 Difference]: Finished difference Result 209 states and 213 transitions. [2018-09-28 10:08:56,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-28 10:08:56,687 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 134 [2018-09-28 10:08:56,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:08:56,689 INFO L225 Difference]: With dead ends: 209 [2018-09-28 10:08:56,689 INFO L226 Difference]: Without dead ends: 139 [2018-09-28 10:08:56,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7266 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=3213, Invalid=38199, Unknown=0, NotChecked=0, Total=41412 [2018-09-28 10:08:56,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-28 10:08:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-28 10:08:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-28 10:08:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-09-28 10:08:56,774 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2018-09-28 10:08:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:08:56,774 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-09-28 10:08:56,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-28 10:08:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-09-28 10:08:56,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-28 10:08:56,775 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:08:56,775 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-09-28 10:08:56,775 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:08:56,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:08:56,775 INFO L82 PathProgramCache]: Analyzing trace with hash 957810879, now seen corresponding path program 48 times [2018-09-28 10:08:56,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:08:56,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:08:56,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:08:56,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:08:56,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:08:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:00,787 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-28 10:09:00,787 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:09:00,787 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-28 10:09:00,796 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:09:01,091 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-09-28 10:09:01,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:09:01,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:09:04,971 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-28 10:09:04,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:09:04,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:09:04,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:09:05,093 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-28 10:09:05,114 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:09:05,115 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 105 [2018-09-28 10:09:05,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-28 10:09:05,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-28 10:09:05,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2018-09-28 10:09:05,116 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 106 states. [2018-09-28 10:09:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:11,605 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2018-09-28 10:09:11,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-28 10:09:11,606 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 138 [2018-09-28 10:09:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:11,607 INFO L225 Difference]: With dead ends: 211 [2018-09-28 10:09:11,607 INFO L226 Difference]: Without dead ends: 141 [2018-09-28 10:09:11,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2355 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2018-09-28 10:09:11,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-28 10:09:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-28 10:09:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-28 10:09:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-09-28 10:09:11,693 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-09-28 10:09:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:11,693 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-09-28 10:09:11,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-28 10:09:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-09-28 10:09:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-28 10:09:11,694 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:11,694 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1] [2018-09-28 10:09:11,694 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:11,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:11,694 INFO L82 PathProgramCache]: Analyzing trace with hash 32287481, now seen corresponding path program 49 times [2018-09-28 10:09:11,695 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:11,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:11,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:11,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:09:11,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:13,036 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-28 10:09:13,037 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:09:13,037 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:09:13,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:13,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:09:13,155 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-28 10:09:13,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:09:13,189 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 37 [2018-09-28 10:09:13,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-28 10:09:13,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-28 10:09:13,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-09-28 10:09:13,190 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 38 states. [2018-09-28 10:09:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:14,499 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-09-28 10:09:14,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-28 10:09:14,500 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 140 [2018-09-28 10:09:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:14,501 INFO L225 Difference]: With dead ends: 145 [2018-09-28 10:09:14,501 INFO L226 Difference]: Without dead ends: 143 [2018-09-28 10:09:14,501 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-28 10:09:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-28 10:09:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-28 10:09:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-28 10:09:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-09-28 10:09:14,589 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-09-28 10:09:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:14,589 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-09-28 10:09:14,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-28 10:09:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-09-28 10:09:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-28 10:09:14,590 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:14,590 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-09-28 10:09:14,591 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:14,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:14,591 INFO L82 PathProgramCache]: Analyzing trace with hash 963550515, now seen corresponding path program 50 times [2018-09-28 10:09:14,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:14,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:14,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:14,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:14,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:17,162 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-28 10:09:17,162 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:09:17,162 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:09:17,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:09:17,247 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:09:17,248 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:09:17,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:09:20,321 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-28 10:09:20,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:09:20,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:09:20,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-28 10:09:20,456 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-28 10:09:20,476 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:09:20,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 108 [2018-09-28 10:09:20,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-28 10:09:20,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-28 10:09:20,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=11450, Unknown=0, NotChecked=0, Total=11772 [2018-09-28 10:09:20,478 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 109 states. Received shutdown request... [2018-09-28 10:09:23,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-28 10:09:23,374 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-28 10:09:23,378 WARN L206 ceAbstractionStarter]: Timeout [2018-09-28 10:09:23,378 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.09 10:09:23 BoogieIcfgContainer [2018-09-28 10:09:23,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-28 10:09:23,379 INFO L168 Benchmark]: Toolchain (without parser) took 240366.31 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 762.3 MB. Max. memory is 7.1 GB. [2018-09-28 10:09:23,380 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-28 10:09:23,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.55 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-28 10:09:23,381 INFO L168 Benchmark]: Boogie Preprocessor took 26.64 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-28 10:09:23,381 INFO L168 Benchmark]: RCFGBuilder took 277.95 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-28 10:09:23,381 INFO L168 Benchmark]: TraceAbstraction took 240010.00 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 741.2 MB. Max. memory is 7.1 GB. [2018-09-28 10:09:23,383 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.21 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 45.55 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 26.64 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 277.95 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 240010.00 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 741.2 MB. 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 (143states) and FLOYD_HOARE automaton (currently 47 states, 109 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 239.9s OverallTime, 52 OverallIterations, 35 TraceHistogramMax, 120.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1766 SDtfs, 5043 SDslu, 76567 SDs, 0 SdLazy, 81693 SolverSat, 5555 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6789 GetRequests, 3106 SyntacticMatches, 24 SemanticMatches, 3658 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50941 ImplicationChecksByTransitivity, 159.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 51 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 110.0s InterpolantComputationTime, 7566 NumberOfCodeBlocks, 7413 NumberOfCodeBlocksAsserted, 529 NumberOfCheckSat, 7463 ConstructedInterpolants, 0 QuantifiedInterpolants, 4137911 SizeOfPredicates, 297 NumberOfNonLiveVariables, 12745 ConjunctsInSsa, 3768 ConjunctsInUnsatCore, 103 InterpolantComputations, 1 PerfectInterpolantSequences, 18946/83904 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-28_10-09-23-391.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-28_10-09-23-391.csv Completed graceful shutdown