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/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b2fde6a [2018-09-28 10:15:31,770 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-28 10:15:31,773 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-28 10:15:31,786 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-28 10:15:31,786 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-28 10:15:31,787 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-28 10:15:31,788 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-28 10:15:31,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-28 10:15:31,791 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-28 10:15:31,792 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-28 10:15:31,793 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-28 10:15:31,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-28 10:15:31,794 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-28 10:15:31,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-28 10:15:31,796 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-28 10:15:31,797 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-28 10:15:31,798 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-28 10:15:31,800 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-28 10:15:31,804 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-28 10:15:31,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-28 10:15:31,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-28 10:15:31,812 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-28 10:15:31,814 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-28 10:15:31,815 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-28 10:15:31,815 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-28 10:15:31,816 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-28 10:15:31,817 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-28 10:15:31,817 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-28 10:15:31,818 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-28 10:15:31,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-28 10:15:31,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-28 10:15:31,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-28 10:15:31,820 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-28 10:15:31,820 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-28 10:15:31,821 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-28 10:15:31,822 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-28 10:15:31,822 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:15:31,849 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-28 10:15:31,851 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-28 10:15:31,852 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-28 10:15:31,853 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-28 10:15:31,853 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-28 10:15:31,853 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-28 10:15:31,854 INFO L133 SettingsManager]: * Use SBE=true [2018-09-28 10:15:31,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-28 10:15:31,854 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-28 10:15:31,854 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-28 10:15:31,855 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-28 10:15:31,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-28 10:15:31,856 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-28 10:15:31,856 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-28 10:15:31,856 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-28 10:15:31,856 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-28 10:15:31,856 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-28 10:15:31,857 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-28 10:15:31,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-28 10:15:31,857 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-28 10:15:31,857 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-28 10:15:31,858 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-28 10:15:31,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 10:15:31,859 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-28 10:15:31,859 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-28 10:15:31,859 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-28 10:15:31,860 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-28 10:15:31,860 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-28 10:15:31,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-28 10:15:31,860 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-28 10:15:31,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-28 10:15:31,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-28 10:15:31,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-28 10:15:31,925 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-28 10:15:31,925 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-28 10:15:31,926 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2018-09-28 10:15:31,927 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2018-09-28 10:15:31,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-28 10:15:31,994 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-28 10:15:31,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-28 10:15:31,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-28 10:15:31,996 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-28 10:15:32,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:31" (1/1) ... [2018-09-28 10:15:32,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:31" (1/1) ... [2018-09-28 10:15:32,041 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-28 10:15:32,042 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-28 10:15:32,042 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-28 10:15:32,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-28 10:15:32,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-28 10:15:32,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-28 10:15:32,065 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-28 10:15:32,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:31" (1/1) ... [2018-09-28 10:15:32,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:31" (1/1) ... [2018-09-28 10:15:32,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:31" (1/1) ... [2018-09-28 10:15:32,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:31" (1/1) ... [2018-09-28 10:15:32,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:31" (1/1) ... [2018-09-28 10:15:32,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:31" (1/1) ... [2018-09-28 10:15:32,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:31" (1/1) ... [2018-09-28 10:15:32,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-28 10:15:32,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-28 10:15:32,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-28 10:15:32,106 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-28 10:15:32,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:31" (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:15:32,183 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-28 10:15:32,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-28 10:15:32,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-28 10:15:32,184 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-28 10:15:32,450 INFO L350 CfgBuilder]: Using library mode [2018-09-28 10:15:32,451 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:15:32 BoogieIcfgContainer [2018-09-28 10:15:32,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-28 10:15:32,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-28 10:15:32,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-28 10:15:32,456 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-28 10:15:32,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:15:31" (1/2) ... [2018-09-28 10:15:32,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12dcae08 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.09 10:15:32, skipping insertion in model container [2018-09-28 10:15:32,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:15:32" (2/2) ... [2018-09-28 10:15:32,461 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2018-09-28 10:15:32,471 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-28 10:15:32,483 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-28 10:15:32,541 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-28 10:15:32,542 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-28 10:15:32,542 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-28 10:15:32,542 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-28 10:15:32,542 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-28 10:15:32,543 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-28 10:15:32,543 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-28 10:15:32,543 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-28 10:15:32,543 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-28 10:15:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-09-28 10:15:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-28 10:15:32,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:32,579 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-28 10:15:32,581 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:32,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:32,589 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-28 10:15:32,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:32,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:32,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:32,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:32,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:32,880 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:15:32,883 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:15:32,884 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:15:32,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-28 10:15:32,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-28 10:15:32,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-28 10:15:32,909 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2018-09-28 10:15:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:33,033 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-09-28 10:15:33,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-28 10:15:33,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-28 10:15:33,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:33,054 INFO L225 Difference]: With dead ends: 20 [2018-09-28 10:15:33,054 INFO L226 Difference]: Without dead ends: 10 [2018-09-28 10:15:33,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:15:33,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-28 10:15:33,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2018-09-28 10:15:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-28 10:15:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-09-28 10:15:33,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-09-28 10:15:33,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:33,093 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-09-28 10:15:33,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-28 10:15:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-09-28 10:15:33,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-28 10:15:33,094 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:33,094 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-28 10:15:33,094 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:33,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:33,095 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2018-09-28 10:15:33,095 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:33,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:33,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:33,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:33,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:33,205 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:15:33,205 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:15:33,206 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:15:33,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-28 10:15:33,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-28 10:15:33,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-28 10:15:33,209 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-09-28 10:15:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:33,383 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-09-28 10:15:33,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-28 10:15:33,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-28 10:15:33,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:33,385 INFO L225 Difference]: With dead ends: 17 [2018-09-28 10:15:33,386 INFO L226 Difference]: Without dead ends: 16 [2018-09-28 10:15:33,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-28 10:15:33,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-28 10:15:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-09-28 10:15:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-28 10:15:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-09-28 10:15:33,393 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2018-09-28 10:15:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:33,393 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-09-28 10:15:33,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-28 10:15:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-09-28 10:15:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-28 10:15:33,394 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:33,395 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-28 10:15:33,395 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:33,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:33,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2018-09-28 10:15:33,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:33,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:33,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:33,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:33,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:33,468 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:15:33,468 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:15:33,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:15:33,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:15:33,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:15:33,470 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2018-09-28 10:15:33,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:33,533 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-09-28 10:15:33,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:15:33,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-09-28 10:15:33,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:33,535 INFO L225 Difference]: With dead ends: 18 [2018-09-28 10:15:33,535 INFO L226 Difference]: Without dead ends: 11 [2018-09-28 10:15:33,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:15:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-28 10:15:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-28 10:15:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-28 10:15:33,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-28 10:15:33,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-28 10:15:33,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:33,544 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-28 10:15:33,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:15:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-28 10:15:33,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-28 10:15:33,545 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:33,545 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2018-09-28 10:15:33,546 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:33,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:33,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2018-09-28 10:15:33,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:33,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:33,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:33,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:33,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:33,699 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:15:33,699 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:33,699 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:15:33,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:33,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:33,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-28 10:15:33,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:33,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:33,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:34,093 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:15:34,115 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:34,115 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-09-28 10:15:34,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 10:15:34,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 10:15:34,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-28 10:15:34,116 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-09-28 10:15:34,239 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-09-28 10:15:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:34,504 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-28 10:15:34,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-28 10:15:34,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-28 10:15:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:34,506 INFO L225 Difference]: With dead ends: 20 [2018-09-28 10:15:34,507 INFO L226 Difference]: Without dead ends: 19 [2018-09-28 10:15:34,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-09-28 10:15:34,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-28 10:15:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-09-28 10:15:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-28 10:15:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-28 10:15:34,515 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-09-28 10:15:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:34,515 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-28 10:15:34,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 10:15:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-28 10:15:34,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-28 10:15:34,516 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:34,516 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2018-09-28 10:15:34,517 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:34,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:34,517 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2018-09-28 10:15:34,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:34,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:34,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:34,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:34,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:34,714 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:34,715 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:15:34,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:15:34,762 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:15:34,763 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:34,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:34,779 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 6 treesize of output 5 [2018-09-28 10:15:34,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:34,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:34,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:35,208 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:35,209 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-28 10:15:35,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-28 10:15:35,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-28 10:15:35,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-09-28 10:15:35,210 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2018-09-28 10:15:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:35,463 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-28 10:15:35,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-28 10:15:35,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-28 10:15:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:35,465 INFO L225 Difference]: With dead ends: 25 [2018-09-28 10:15:35,465 INFO L226 Difference]: Without dead ends: 24 [2018-09-28 10:15:35,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-28 10:15:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-28 10:15:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-09-28 10:15:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-28 10:15:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-28 10:15:35,472 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-09-28 10:15:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:35,472 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-28 10:15:35,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-28 10:15:35,473 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-28 10:15:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-28 10:15:35,473 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:35,474 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2018-09-28 10:15:35,474 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:35,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:35,475 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2018-09-28 10:15:35,475 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:35,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:35,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:35,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:35,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:35,603 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:35,604 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:15:35,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:15:35,650 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-28 10:15:35,651 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:35,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:35,674 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 6 treesize of output 5 [2018-09-28 10:15:35,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:35,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:35,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:35,823 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:35,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-28 10:15:35,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-28 10:15:35,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-28 10:15:35,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-09-28 10:15:35,825 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-28 10:15:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:36,138 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-28 10:15:36,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-28 10:15:36,138 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-28 10:15:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:36,139 INFO L225 Difference]: With dead ends: 30 [2018-09-28 10:15:36,140 INFO L226 Difference]: Without dead ends: 29 [2018-09-28 10:15:36,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-09-28 10:15:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-28 10:15:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-09-28 10:15:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-28 10:15:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-28 10:15:36,146 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-09-28 10:15:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:36,147 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-28 10:15:36,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-28 10:15:36,147 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-28 10:15:36,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-28 10:15:36,148 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:36,148 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2018-09-28 10:15:36,149 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:36,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:36,149 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2018-09-28 10:15:36,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:36,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:36,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:36,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:36,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:36,289 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:36,289 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:15:36,299 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:15:36,344 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:15:36,344 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:36,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:36,362 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 6 treesize of output 5 [2018-09-28 10:15:36,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:36,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:36,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:36,490 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:36,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-28 10:15:36,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-28 10:15:36,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-28 10:15:36,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-09-28 10:15:36,492 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2018-09-28 10:15:36,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:36,779 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-28 10:15:36,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-28 10:15:36,781 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-09-28 10:15:36,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:36,783 INFO L225 Difference]: With dead ends: 35 [2018-09-28 10:15:36,783 INFO L226 Difference]: Without dead ends: 34 [2018-09-28 10:15:36,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2018-09-28 10:15:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-28 10:15:36,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-09-28 10:15:36,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-28 10:15:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-28 10:15:36,791 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-09-28 10:15:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:36,791 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-28 10:15:36,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-28 10:15:36,791 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-28 10:15:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-28 10:15:36,792 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:36,792 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2018-09-28 10:15:36,793 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:36,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2018-09-28 10:15:36,793 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:36,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:36,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:36,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:36,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:37,045 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:37,045 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:15:37,053 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:15:37,082 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-28 10:15:37,083 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:37,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:37,092 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 6 treesize of output 5 [2018-09-28 10:15:37,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:37,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:37,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:37,340 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:37,340 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-28 10:15:37,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-28 10:15:37,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-28 10:15:37,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-09-28 10:15:37,341 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-09-28 10:15:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:37,818 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-28 10:15:37,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-28 10:15:37,822 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-09-28 10:15:37,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:37,823 INFO L225 Difference]: With dead ends: 40 [2018-09-28 10:15:37,824 INFO L226 Difference]: Without dead ends: 39 [2018-09-28 10:15:37,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2018-09-28 10:15:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-28 10:15:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-09-28 10:15:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-28 10:15:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-28 10:15:37,834 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-09-28 10:15:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:37,834 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-28 10:15:37,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-28 10:15:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-28 10:15:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-28 10:15:37,836 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:37,836 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2018-09-28 10:15:37,836 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:37,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:37,837 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2018-09-28 10:15:37,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:37,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:37,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:37,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:37,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:38,316 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:38,317 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:15:38,325 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:15:38,367 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-28 10:15:38,368 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:38,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:38,377 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 6 treesize of output 5 [2018-09-28 10:15:38,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:38,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:38,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:38,692 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:38,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-28 10:15:38,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-28 10:15:38,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-28 10:15:38,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-28 10:15:38,694 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2018-09-28 10:15:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:39,027 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-28 10:15:39,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-28 10:15:39,029 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-09-28 10:15:39,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:39,031 INFO L225 Difference]: With dead ends: 45 [2018-09-28 10:15:39,031 INFO L226 Difference]: Without dead ends: 44 [2018-09-28 10:15:39,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2018-09-28 10:15:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-28 10:15:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-09-28 10:15:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-28 10:15:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-28 10:15:39,040 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-09-28 10:15:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:39,040 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-28 10:15:39,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-28 10:15:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-28 10:15:39,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-28 10:15:39,042 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:39,042 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2018-09-28 10:15:39,042 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:39,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:39,043 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2018-09-28 10:15:39,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:39,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:39,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:39,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:39,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:39,263 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:39,263 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:15:39,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:39,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:39,353 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 6 treesize of output 5 [2018-09-28 10:15:39,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:39,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:39,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:39,696 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:39,696 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-28 10:15:39,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-28 10:15:39,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-28 10:15:39,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-09-28 10:15:39,698 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2018-09-28 10:15:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:40,001 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-28 10:15:40,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-28 10:15:40,002 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-09-28 10:15:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:40,003 INFO L225 Difference]: With dead ends: 50 [2018-09-28 10:15:40,003 INFO L226 Difference]: Without dead ends: 49 [2018-09-28 10:15:40,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=280, Invalid=532, Unknown=0, NotChecked=0, Total=812 [2018-09-28 10:15:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-28 10:15:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-09-28 10:15:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-28 10:15:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-28 10:15:40,012 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2018-09-28 10:15:40,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:40,012 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-28 10:15:40,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-28 10:15:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-28 10:15:40,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-28 10:15:40,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:40,013 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2018-09-28 10:15:40,014 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:40,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:40,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2018-09-28 10:15:40,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:40,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:40,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:40,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:40,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:40,873 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:40,873 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:15:40,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:15:40,918 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:15:40,919 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:40,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:40,936 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 6 treesize of output 5 [2018-09-28 10:15:40,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:40,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:40,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:41,276 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:41,276 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-28 10:15:41,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-28 10:15:41,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-28 10:15:41,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2018-09-28 10:15:41,279 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2018-09-28 10:15:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:41,767 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-28 10:15:41,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-28 10:15:41,768 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-09-28 10:15:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:41,769 INFO L225 Difference]: With dead ends: 55 [2018-09-28 10:15:41,769 INFO L226 Difference]: Without dead ends: 54 [2018-09-28 10:15:41,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=341, Invalid=651, Unknown=0, NotChecked=0, Total=992 [2018-09-28 10:15:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-28 10:15:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-28 10:15:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-28 10:15:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-28 10:15:41,779 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2018-09-28 10:15:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:41,780 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-28 10:15:41,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-28 10:15:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-28 10:15:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-28 10:15:41,781 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:41,781 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2018-09-28 10:15:41,781 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:41,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:41,781 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2018-09-28 10:15:41,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:41,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:41,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:41,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:41,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:42,153 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:42,153 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:15:42,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:15:42,310 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-28 10:15:42,311 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:42,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:42,340 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 6 treesize of output 5 [2018-09-28 10:15:42,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:42,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:42,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:42,860 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:42,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-09-28 10:15:42,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-28 10:15:42,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-28 10:15:42,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-09-28 10:15:42,861 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2018-09-28 10:15:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:43,399 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-28 10:15:43,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-28 10:15:43,402 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-09-28 10:15:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:43,404 INFO L225 Difference]: With dead ends: 60 [2018-09-28 10:15:43,404 INFO L226 Difference]: Without dead ends: 59 [2018-09-28 10:15:43,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=408, Invalid=782, Unknown=0, NotChecked=0, Total=1190 [2018-09-28 10:15:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-28 10:15:43,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-09-28 10:15:43,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-28 10:15:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-28 10:15:43,416 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2018-09-28 10:15:43,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:43,417 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-28 10:15:43,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-28 10:15:43,417 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-28 10:15:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-28 10:15:43,418 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:43,418 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2018-09-28 10:15:43,418 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:43,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:43,419 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2018-09-28 10:15:43,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:43,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:43,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:43,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:43,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:43,701 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:43,701 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:43,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:15:43,746 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:15:43,747 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:43,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:43,756 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 6 treesize of output 5 [2018-09-28 10:15:43,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:43,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:43,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:44,022 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:44,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-09-28 10:15:44,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-28 10:15:44,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-28 10:15:44,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2018-09-28 10:15:44,024 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2018-09-28 10:15:44,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:44,474 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-28 10:15:44,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-28 10:15:44,475 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-09-28 10:15:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:44,476 INFO L225 Difference]: With dead ends: 65 [2018-09-28 10:15:44,476 INFO L226 Difference]: Without dead ends: 64 [2018-09-28 10:15:44,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=481, Invalid=925, Unknown=0, NotChecked=0, Total=1406 [2018-09-28 10:15:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-28 10:15:44,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-09-28 10:15:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-28 10:15:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-28 10:15:44,487 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2018-09-28 10:15:44,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:44,488 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-28 10:15:44,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-28 10:15:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-28 10:15:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-28 10:15:44,489 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:44,489 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2018-09-28 10:15:44,489 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:44,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:44,490 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2018-09-28 10:15:44,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:44,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:44,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:44,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:44,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:44,744 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:44,744 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:15:44,752 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:15:44,829 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-28 10:15:44,829 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:44,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:44,856 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 6 treesize of output 5 [2018-09-28 10:15:44,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:44,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:44,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:45,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:45,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-09-28 10:15:45,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-28 10:15:45,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-28 10:15:45,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=493, Unknown=0, NotChecked=0, Total=756 [2018-09-28 10:15:45,134 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2018-09-28 10:15:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:45,635 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-28 10:15:45,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-28 10:15:45,635 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-09-28 10:15:45,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:45,636 INFO L225 Difference]: With dead ends: 70 [2018-09-28 10:15:45,636 INFO L226 Difference]: Without dead ends: 69 [2018-09-28 10:15:45,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=560, Invalid=1080, Unknown=0, NotChecked=0, Total=1640 [2018-09-28 10:15:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-28 10:15:45,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-09-28 10:15:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-28 10:15:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-28 10:15:45,647 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2018-09-28 10:15:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:45,648 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-28 10:15:45,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-28 10:15:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-28 10:15:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-28 10:15:45,649 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:45,649 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2018-09-28 10:15:45,649 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:45,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:45,650 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2018-09-28 10:15:45,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:45,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:45,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:45,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:45,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:46,022 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:46,022 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:15:46,033 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:15:46,097 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-28 10:15:46,097 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:46,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:46,118 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 6 treesize of output 5 [2018-09-28 10:15:46,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:46,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:46,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:46,412 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:46,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-28 10:15:46,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-28 10:15:46,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-28 10:15:46,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2018-09-28 10:15:46,414 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2018-09-28 10:15:46,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:46,931 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-28 10:15:46,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-28 10:15:46,931 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-09-28 10:15:46,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:46,932 INFO L225 Difference]: With dead ends: 75 [2018-09-28 10:15:46,932 INFO L226 Difference]: Without dead ends: 74 [2018-09-28 10:15:46,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=645, Invalid=1247, Unknown=0, NotChecked=0, Total=1892 [2018-09-28 10:15:46,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-28 10:15:46,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-09-28 10:15:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-28 10:15:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-28 10:15:46,945 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2018-09-28 10:15:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:46,945 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-28 10:15:46,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-28 10:15:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-28 10:15:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-28 10:15:46,947 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:46,947 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2018-09-28 10:15:46,947 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:46,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:46,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2018-09-28 10:15:46,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:46,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:46,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:46,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:47,406 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:47,406 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:15:47,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:47,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:47,490 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 6 treesize of output 5 [2018-09-28 10:15:47,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:47,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:47,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:47,795 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:47,795 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-09-28 10:15:47,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-28 10:15:47,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-28 10:15:47,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=644, Unknown=0, NotChecked=0, Total=992 [2018-09-28 10:15:47,797 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2018-09-28 10:15:48,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:48,725 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-28 10:15:48,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-28 10:15:48,725 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2018-09-28 10:15:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:48,726 INFO L225 Difference]: With dead ends: 80 [2018-09-28 10:15:48,726 INFO L226 Difference]: Without dead ends: 79 [2018-09-28 10:15:48,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=736, Invalid=1426, Unknown=0, NotChecked=0, Total=2162 [2018-09-28 10:15:48,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-28 10:15:48,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-09-28 10:15:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-28 10:15:48,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-28 10:15:48,739 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2018-09-28 10:15:48,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:48,739 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-28 10:15:48,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-28 10:15:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-28 10:15:48,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-28 10:15:48,740 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:48,740 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2018-09-28 10:15:48,741 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:48,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:48,741 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2018-09-28 10:15:48,741 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:48,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:48,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:48,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:48,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:49,376 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:49,376 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:15:49,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:15:49,444 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:15:49,445 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:49,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:49,466 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 6 treesize of output 5 [2018-09-28 10:15:49,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:49,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:49,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:49,779 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:49,779 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-09-28 10:15:49,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-28 10:15:49,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-28 10:15:49,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2018-09-28 10:15:49,780 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2018-09-28 10:15:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:50,305 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-28 10:15:50,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-28 10:15:50,306 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-09-28 10:15:50,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:50,307 INFO L225 Difference]: With dead ends: 85 [2018-09-28 10:15:50,307 INFO L226 Difference]: Without dead ends: 84 [2018-09-28 10:15:50,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=833, Invalid=1617, Unknown=0, NotChecked=0, Total=2450 [2018-09-28 10:15:50,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-28 10:15:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-09-28 10:15:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-28 10:15:50,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-28 10:15:50,322 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2018-09-28 10:15:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:50,322 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-28 10:15:50,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-28 10:15:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-28 10:15:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-28 10:15:50,323 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:50,324 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2018-09-28 10:15:50,324 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:50,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:50,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2018-09-28 10:15:50,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:50,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:50,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:50,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:50,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:51,147 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:51,147 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:15:51,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:15:51,242 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-28 10:15:51,243 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:51,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:51,276 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 6 treesize of output 5 [2018-09-28 10:15:51,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:51,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:51,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:51,648 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:51,648 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-09-28 10:15:51,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-28 10:15:51,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-28 10:15:51,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=815, Unknown=0, NotChecked=0, Total=1260 [2018-09-28 10:15:51,650 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2018-09-28 10:15:52,583 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 10:15:52,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:52,851 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-28 10:15:52,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-28 10:15:52,852 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2018-09-28 10:15:52,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:52,853 INFO L225 Difference]: With dead ends: 90 [2018-09-28 10:15:52,853 INFO L226 Difference]: Without dead ends: 89 [2018-09-28 10:15:52,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=936, Invalid=1820, Unknown=0, NotChecked=0, Total=2756 [2018-09-28 10:15:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-28 10:15:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-09-28 10:15:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-28 10:15:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-28 10:15:52,869 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2018-09-28 10:15:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:52,869 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-28 10:15:52,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-28 10:15:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-28 10:15:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-28 10:15:52,870 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:52,870 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2018-09-28 10:15:52,871 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:52,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:52,871 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2018-09-28 10:15:52,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:52,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:52,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:52,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:52,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:53,806 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:53,806 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:15:53,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:15:53,873 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:15:53,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:53,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:53,881 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 6 treesize of output 5 [2018-09-28 10:15:53,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:53,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:53,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:54,272 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:54,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-09-28 10:15:54,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-28 10:15:54,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-28 10:15:54,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=908, Unknown=0, NotChecked=0, Total=1406 [2018-09-28 10:15:54,274 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2018-09-28 10:15:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:54,887 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-28 10:15:54,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-28 10:15:54,888 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2018-09-28 10:15:54,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:54,889 INFO L225 Difference]: With dead ends: 95 [2018-09-28 10:15:54,889 INFO L226 Difference]: Without dead ends: 94 [2018-09-28 10:15:54,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1045, Invalid=2035, Unknown=0, NotChecked=0, Total=3080 [2018-09-28 10:15:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-28 10:15:54,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-09-28 10:15:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-28 10:15:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-28 10:15:54,902 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2018-09-28 10:15:54,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:54,902 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-28 10:15:54,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-28 10:15:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-28 10:15:54,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-28 10:15:54,903 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:54,903 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2018-09-28 10:15:54,904 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:54,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:54,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2018-09-28 10:15:54,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:54,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:54,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:54,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:54,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:55,320 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:55,320 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:15:55,327 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:15:55,411 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-28 10:15:55,411 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:55,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:55,419 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 6 treesize of output 5 [2018-09-28 10:15:55,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:55,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:55,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:55,829 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:55,829 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-09-28 10:15:55,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-28 10:15:55,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-28 10:15:55,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=1006, Unknown=0, NotChecked=0, Total=1560 [2018-09-28 10:15:55,830 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2018-09-28 10:15:56,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:56,461 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-28 10:15:56,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-28 10:15:56,463 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2018-09-28 10:15:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:56,464 INFO L225 Difference]: With dead ends: 100 [2018-09-28 10:15:56,464 INFO L226 Difference]: Without dead ends: 99 [2018-09-28 10:15:56,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1160, Invalid=2262, Unknown=0, NotChecked=0, Total=3422 [2018-09-28 10:15:56,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-28 10:15:56,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-09-28 10:15:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-28 10:15:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-28 10:15:56,475 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2018-09-28 10:15:56,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:56,475 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-28 10:15:56,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-28 10:15:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-28 10:15:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-28 10:15:56,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:56,477 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2018-09-28 10:15:56,477 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:56,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:56,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2018-09-28 10:15:56,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:56,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:56,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:56,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:56,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:56,912 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:56,912 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:15:56,919 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:15:57,023 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-28 10:15:57,023 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:15:57,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:57,040 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 6 treesize of output 5 [2018-09-28 10:15:57,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:57,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:57,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:57,461 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:57,461 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-09-28 10:15:57,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-28 10:15:57,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-28 10:15:57,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=1109, Unknown=0, NotChecked=0, Total=1722 [2018-09-28 10:15:57,462 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2018-09-28 10:15:58,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:15:58,250 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-28 10:15:58,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-28 10:15:58,251 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2018-09-28 10:15:58,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:15:58,252 INFO L225 Difference]: With dead ends: 105 [2018-09-28 10:15:58,252 INFO L226 Difference]: Without dead ends: 104 [2018-09-28 10:15:58,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1281, Invalid=2501, Unknown=0, NotChecked=0, Total=3782 [2018-09-28 10:15:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-28 10:15:58,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-09-28 10:15:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-28 10:15:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-28 10:15:58,264 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2018-09-28 10:15:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:15:58,264 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-28 10:15:58,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-28 10:15:58,265 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-28 10:15:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-28 10:15:58,265 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:15:58,265 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2018-09-28 10:15:58,265 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:15:58,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:15:58,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2018-09-28 10:15:58,266 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:15:58,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:15:58,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:58,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:15:58,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:15:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:58,978 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:15:58,978 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:15:58,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:15:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:15:59,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:15:59,054 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 6 treesize of output 5 [2018-09-28 10:15:59,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:15:59,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:15:59,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:15:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:15:59,446 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:15:59,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-09-28 10:15:59,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-28 10:15:59,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-28 10:15:59,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1217, Unknown=0, NotChecked=0, Total=1892 [2018-09-28 10:15:59,448 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2018-09-28 10:16:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:00,217 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-28 10:16:00,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-28 10:16:00,219 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2018-09-28 10:16:00,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:00,220 INFO L225 Difference]: With dead ends: 110 [2018-09-28 10:16:00,220 INFO L226 Difference]: Without dead ends: 109 [2018-09-28 10:16:00,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1408, Invalid=2752, Unknown=0, NotChecked=0, Total=4160 [2018-09-28 10:16:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-28 10:16:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-09-28 10:16:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-28 10:16:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-28 10:16:00,234 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2018-09-28 10:16:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:00,234 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-28 10:16:00,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-28 10:16:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-28 10:16:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-28 10:16:00,235 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:00,235 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2018-09-28 10:16:00,235 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:00,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:00,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2018-09-28 10:16:00,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:00,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:00,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:00,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:16:00,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:01,229 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:01,229 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:16:01,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:16:01,309 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:16:01,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:01,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:01,316 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 6 treesize of output 5 [2018-09-28 10:16:01,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:01,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:01,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:03,014 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:03,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-09-28 10:16:03,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-28 10:16:03,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-28 10:16:03,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=1330, Unknown=0, NotChecked=0, Total=2070 [2018-09-28 10:16:03,015 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2018-09-28 10:16:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:04,032 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-28 10:16:04,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-28 10:16:04,032 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2018-09-28 10:16:04,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:04,033 INFO L225 Difference]: With dead ends: 115 [2018-09-28 10:16:04,033 INFO L226 Difference]: Without dead ends: 114 [2018-09-28 10:16:04,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1541, Invalid=3015, Unknown=0, NotChecked=0, Total=4556 [2018-09-28 10:16:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-28 10:16:04,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-09-28 10:16:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-28 10:16:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-28 10:16:04,049 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2018-09-28 10:16:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:04,049 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-28 10:16:04,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-28 10:16:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-28 10:16:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-28 10:16:04,050 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:04,051 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2018-09-28 10:16:04,051 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:04,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:04,051 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2018-09-28 10:16:04,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:04,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:04,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:04,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:04,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:04,568 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:04,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 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:16:04,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:16:04,694 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-28 10:16:04,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:04,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:04,704 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 6 treesize of output 5 [2018-09-28 10:16:04,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:04,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:04,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:05,175 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:05,175 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-09-28 10:16:05,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-28 10:16:05,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-28 10:16:05,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=808, Invalid=1448, Unknown=0, NotChecked=0, Total=2256 [2018-09-28 10:16:05,177 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2018-09-28 10:16:06,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:06,042 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-28 10:16:06,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-28 10:16:06,043 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2018-09-28 10:16:06,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:06,044 INFO L225 Difference]: With dead ends: 120 [2018-09-28 10:16:06,044 INFO L226 Difference]: Without dead ends: 119 [2018-09-28 10:16:06,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1680, Invalid=3290, Unknown=0, NotChecked=0, Total=4970 [2018-09-28 10:16:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-28 10:16:06,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-09-28 10:16:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-28 10:16:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-28 10:16:06,062 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2018-09-28 10:16:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:06,063 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-28 10:16:06,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-28 10:16:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-28 10:16:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-28 10:16:06,063 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:06,064 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2018-09-28 10:16:06,064 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:06,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:06,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2018-09-28 10:16:06,064 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:06,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:06,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:06,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:06,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:06,550 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:06,550 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:16:06,557 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:16:06,635 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:16:06,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:06,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:06,659 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 6 treesize of output 5 [2018-09-28 10:16:06,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:06,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:06,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:07,308 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:07,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-09-28 10:16:07,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-28 10:16:07,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-28 10:16:07,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=1571, Unknown=0, NotChecked=0, Total=2450 [2018-09-28 10:16:07,310 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2018-09-28 10:16:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:08,206 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-28 10:16:08,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-28 10:16:08,207 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2018-09-28 10:16:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:08,207 INFO L225 Difference]: With dead ends: 125 [2018-09-28 10:16:08,207 INFO L226 Difference]: Without dead ends: 124 [2018-09-28 10:16:08,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1825, Invalid=3577, Unknown=0, NotChecked=0, Total=5402 [2018-09-28 10:16:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-28 10:16:08,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-09-28 10:16:08,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-28 10:16:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-28 10:16:08,224 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2018-09-28 10:16:08,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:08,224 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-28 10:16:08,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-28 10:16:08,224 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-28 10:16:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-28 10:16:08,225 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:08,225 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2018-09-28 10:16:08,225 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:08,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:08,225 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2018-09-28 10:16:08,225 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:08,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:08,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:08,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:08,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:09,191 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:09,191 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:16:09,198 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:16:09,320 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-28 10:16:09,320 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:09,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:09,328 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 6 treesize of output 5 [2018-09-28 10:16:09,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:09,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:09,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:09,904 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:09,904 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-09-28 10:16:09,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-28 10:16:09,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-28 10:16:09,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1699, Unknown=0, NotChecked=0, Total=2652 [2018-09-28 10:16:09,905 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2018-09-28 10:16:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:11,015 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-28 10:16:11,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-28 10:16:11,015 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2018-09-28 10:16:11,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:11,016 INFO L225 Difference]: With dead ends: 130 [2018-09-28 10:16:11,017 INFO L226 Difference]: Without dead ends: 129 [2018-09-28 10:16:11,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1976, Invalid=3876, Unknown=0, NotChecked=0, Total=5852 [2018-09-28 10:16:11,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-28 10:16:11,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-09-28 10:16:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-28 10:16:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-09-28 10:16:11,033 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2018-09-28 10:16:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:11,033 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-09-28 10:16:11,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-28 10:16:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-09-28 10:16:11,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-28 10:16:11,034 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:11,034 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2018-09-28 10:16:11,034 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:11,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:11,034 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2018-09-28 10:16:11,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:11,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:11,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:11,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:11,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:11,692 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:11,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 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:16:11,702 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:16:11,825 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-28 10:16:11,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:11,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:11,854 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 6 treesize of output 5 [2018-09-28 10:16:11,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:11,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:11,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:12,400 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:12,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-09-28 10:16:12,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-28 10:16:12,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-28 10:16:12,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1030, Invalid=1832, Unknown=0, NotChecked=0, Total=2862 [2018-09-28 10:16:12,402 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2018-09-28 10:16:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:13,382 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-28 10:16:13,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-28 10:16:13,382 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2018-09-28 10:16:13,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:13,383 INFO L225 Difference]: With dead ends: 135 [2018-09-28 10:16:13,384 INFO L226 Difference]: Without dead ends: 134 [2018-09-28 10:16:13,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1919 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2133, Invalid=4187, Unknown=0, NotChecked=0, Total=6320 [2018-09-28 10:16:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-28 10:16:13,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-09-28 10:16:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-28 10:16:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-28 10:16:13,407 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2018-09-28 10:16:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:13,407 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-28 10:16:13,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-28 10:16:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-28 10:16:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-28 10:16:13,408 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:13,408 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2018-09-28 10:16:13,409 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:13,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:13,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2018-09-28 10:16:13,409 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:13,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:13,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:13,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:13,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:14,514 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:14,514 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:16:14,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:16:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:14,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:14,632 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 6 treesize of output 5 [2018-09-28 10:16:14,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:14,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:14,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:15,246 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:15,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-09-28 10:16:15,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-28 10:16:15,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-28 10:16:15,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1110, Invalid=1970, Unknown=0, NotChecked=0, Total=3080 [2018-09-28 10:16:15,247 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2018-09-28 10:16:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:16,321 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-28 10:16:16,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-28 10:16:16,321 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2018-09-28 10:16:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:16,323 INFO L225 Difference]: With dead ends: 140 [2018-09-28 10:16:16,323 INFO L226 Difference]: Without dead ends: 139 [2018-09-28 10:16:16,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2296, Invalid=4510, Unknown=0, NotChecked=0, Total=6806 [2018-09-28 10:16:16,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-28 10:16:16,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-09-28 10:16:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-28 10:16:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-09-28 10:16:16,345 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2018-09-28 10:16:16,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:16,346 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-09-28 10:16:16,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-28 10:16:16,346 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-09-28 10:16:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-28 10:16:16,346 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:16,347 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2018-09-28 10:16:16,347 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:16,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:16,347 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2018-09-28 10:16:16,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:16,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:16,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:16,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:16:16,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:16,944 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:16,944 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:16:16,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:16:17,049 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:16:17,050 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:17,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:17,072 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 6 treesize of output 5 [2018-09-28 10:16:17,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:17,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:17,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:18,421 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:18,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-09-28 10:16:18,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-28 10:16:18,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-28 10:16:18,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1193, Invalid=2113, Unknown=0, NotChecked=0, Total=3306 [2018-09-28 10:16:18,423 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2018-09-28 10:16:19,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:19,628 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-28 10:16:19,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-28 10:16:19,628 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2018-09-28 10:16:19,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:19,629 INFO L225 Difference]: With dead ends: 145 [2018-09-28 10:16:19,629 INFO L226 Difference]: Without dead ends: 144 [2018-09-28 10:16:19,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2465, Invalid=4845, Unknown=0, NotChecked=0, Total=7310 [2018-09-28 10:16:19,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-28 10:16:19,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-09-28 10:16:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-28 10:16:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-28 10:16:19,656 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2018-09-28 10:16:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:19,656 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-28 10:16:19,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-28 10:16:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-28 10:16:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-28 10:16:19,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:19,657 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2018-09-28 10:16:19,658 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:19,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:19,658 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2018-09-28 10:16:19,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:19,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:19,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:19,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:19,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:20,301 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:20,301 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:16:20,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:16:20,457 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-28 10:16:20,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:20,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:20,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 6 treesize of output 5 [2018-09-28 10:16:20,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:20,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:20,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:21,356 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:21,356 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-09-28 10:16:21,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-28 10:16:21,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-28 10:16:21,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=2261, Unknown=0, NotChecked=0, Total=3540 [2018-09-28 10:16:21,358 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2018-09-28 10:16:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:22,669 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-28 10:16:22,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-28 10:16:22,670 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2018-09-28 10:16:22,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:22,671 INFO L225 Difference]: With dead ends: 150 [2018-09-28 10:16:22,671 INFO L226 Difference]: Without dead ends: 149 [2018-09-28 10:16:22,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2640, Invalid=5192, Unknown=0, NotChecked=0, Total=7832 [2018-09-28 10:16:22,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-28 10:16:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-09-28 10:16:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-28 10:16:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-28 10:16:22,694 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2018-09-28 10:16:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:22,695 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-28 10:16:22,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-28 10:16:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-28 10:16:22,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-28 10:16:22,695 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:22,696 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2018-09-28 10:16:22,696 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:22,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:22,696 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2018-09-28 10:16:22,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:22,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:22,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:22,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:22,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:23,620 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:23,620 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:16:23,629 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:16:23,736 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:16:23,737 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:23,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:23,755 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 6 treesize of output 5 [2018-09-28 10:16:23,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:23,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:23,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:24,662 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:24,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-09-28 10:16:24,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-28 10:16:24,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-28 10:16:24,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=2414, Unknown=0, NotChecked=0, Total=3782 [2018-09-28 10:16:24,663 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2018-09-28 10:16:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:26,002 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-28 10:16:26,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-28 10:16:26,002 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2018-09-28 10:16:26,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:26,004 INFO L225 Difference]: With dead ends: 155 [2018-09-28 10:16:26,004 INFO L226 Difference]: Without dead ends: 154 [2018-09-28 10:16:26,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2575 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2821, Invalid=5551, Unknown=0, NotChecked=0, Total=8372 [2018-09-28 10:16:26,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-28 10:16:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-09-28 10:16:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-28 10:16:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-28 10:16:26,033 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2018-09-28 10:16:26,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:26,034 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-28 10:16:26,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-28 10:16:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-28 10:16:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-28 10:16:26,035 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:26,035 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2018-09-28 10:16:26,035 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:26,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:26,036 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2018-09-28 10:16:26,036 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:26,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:26,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:26,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:26,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:26,889 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:26,889 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:16:26,898 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:16:27,040 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-28 10:16:27,041 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:27,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:27,081 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 6 treesize of output 5 [2018-09-28 10:16:27,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:27,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:27,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:27,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:28,013 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:28,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-09-28 10:16:28,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-28 10:16:28,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-28 10:16:28,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1460, Invalid=2572, Unknown=0, NotChecked=0, Total=4032 [2018-09-28 10:16:28,014 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2018-09-28 10:16:29,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:29,369 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-09-28 10:16:29,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-28 10:16:29,369 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2018-09-28 10:16:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:29,370 INFO L225 Difference]: With dead ends: 160 [2018-09-28 10:16:29,370 INFO L226 Difference]: Without dead ends: 159 [2018-09-28 10:16:29,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2754 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3008, Invalid=5922, Unknown=0, NotChecked=0, Total=8930 [2018-09-28 10:16:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-28 10:16:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-09-28 10:16:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-28 10:16:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-09-28 10:16:29,396 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2018-09-28 10:16:29,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:29,396 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-09-28 10:16:29,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-28 10:16:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-09-28 10:16:29,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-28 10:16:29,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:29,397 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2018-09-28 10:16:29,397 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:29,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:29,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2018-09-28 10:16:29,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:29,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:29,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:29,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:29,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:30,161 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:30,161 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:16:30,169 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:16:30,338 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-28 10:16:30,338 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:30,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:30,346 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 6 treesize of output 5 [2018-09-28 10:16:30,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:30,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:30,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:31,104 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:31,104 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-09-28 10:16:31,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-28 10:16:31,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-28 10:16:31,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1555, Invalid=2735, Unknown=0, NotChecked=0, Total=4290 [2018-09-28 10:16:31,106 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2018-09-28 10:16:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:32,557 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-28 10:16:32,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-28 10:16:32,558 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2018-09-28 10:16:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:32,559 INFO L225 Difference]: With dead ends: 165 [2018-09-28 10:16:32,559 INFO L226 Difference]: Without dead ends: 164 [2018-09-28 10:16:32,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2939 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3201, Invalid=6305, Unknown=0, NotChecked=0, Total=9506 [2018-09-28 10:16:32,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-28 10:16:32,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-09-28 10:16:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-28 10:16:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-28 10:16:32,587 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2018-09-28 10:16:32,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:32,588 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-28 10:16:32,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-28 10:16:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-28 10:16:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-28 10:16:32,589 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:32,589 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2018-09-28 10:16:32,589 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:32,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:32,589 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2018-09-28 10:16:32,589 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:32,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:32,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:32,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:32,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:33,382 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:33,382 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:16:33,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:16:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:33,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:33,510 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 6 treesize of output 5 [2018-09-28 10:16:33,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:33,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:33,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:34,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:34,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:34,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-09-28 10:16:34,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-28 10:16:34,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-28 10:16:34,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=2903, Unknown=0, NotChecked=0, Total=4556 [2018-09-28 10:16:34,298 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2018-09-28 10:16:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:35,757 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-28 10:16:35,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-28 10:16:35,757 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2018-09-28 10:16:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:35,759 INFO L225 Difference]: With dead ends: 170 [2018-09-28 10:16:35,759 INFO L226 Difference]: Without dead ends: 169 [2018-09-28 10:16:35,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3130 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3400, Invalid=6700, Unknown=0, NotChecked=0, Total=10100 [2018-09-28 10:16:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-28 10:16:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-09-28 10:16:35,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-28 10:16:35,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-09-28 10:16:35,793 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2018-09-28 10:16:35,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:35,793 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-09-28 10:16:35,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-28 10:16:35,793 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-09-28 10:16:35,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-28 10:16:35,794 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:35,794 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2018-09-28 10:16:35,795 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:35,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:35,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2018-09-28 10:16:35,795 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:35,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:35,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:35,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:16:35,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:37,042 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:37,042 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:16:37,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:16:37,154 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:16:37,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:37,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:37,176 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 6 treesize of output 5 [2018-09-28 10:16:37,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:37,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:37,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:38,045 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:38,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-09-28 10:16:38,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-28 10:16:38,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-28 10:16:38,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1754, Invalid=3076, Unknown=0, NotChecked=0, Total=4830 [2018-09-28 10:16:38,046 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2018-09-28 10:16:39,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:39,803 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-28 10:16:39,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-28 10:16:39,803 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2018-09-28 10:16:39,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:39,805 INFO L225 Difference]: With dead ends: 175 [2018-09-28 10:16:39,806 INFO L226 Difference]: Without dead ends: 174 [2018-09-28 10:16:39,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3327 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3605, Invalid=7107, Unknown=0, NotChecked=0, Total=10712 [2018-09-28 10:16:39,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-28 10:16:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-09-28 10:16:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-28 10:16:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-28 10:16:39,841 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2018-09-28 10:16:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:39,842 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-28 10:16:39,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-28 10:16:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-28 10:16:39,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-28 10:16:39,843 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:39,843 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2018-09-28 10:16:39,843 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:39,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:39,843 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2018-09-28 10:16:39,844 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:39,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:39,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:39,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:39,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:40,981 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:40,981 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:16:40,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:16:41,175 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-28 10:16:41,175 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:41,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:41,223 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 6 treesize of output 5 [2018-09-28 10:16:41,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:41,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:41,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:42,199 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:42,199 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-09-28 10:16:42,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-28 10:16:42,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-28 10:16:42,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=3254, Unknown=0, NotChecked=0, Total=5112 [2018-09-28 10:16:42,200 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2018-09-28 10:16:43,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:43,701 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-09-28 10:16:43,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-28 10:16:43,701 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2018-09-28 10:16:43,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:43,702 INFO L225 Difference]: With dead ends: 180 [2018-09-28 10:16:43,702 INFO L226 Difference]: Without dead ends: 179 [2018-09-28 10:16:43,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3530 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3816, Invalid=7526, Unknown=0, NotChecked=0, Total=11342 [2018-09-28 10:16:43,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-28 10:16:43,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-09-28 10:16:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-28 10:16:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-09-28 10:16:43,732 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2018-09-28 10:16:43,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:43,732 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-09-28 10:16:43,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-28 10:16:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-09-28 10:16:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-28 10:16:43,733 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:43,734 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2018-09-28 10:16:43,734 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:43,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:43,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2018-09-28 10:16:43,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:43,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:43,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:43,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:43,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:44,787 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:44,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 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:16:44,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:16:44,913 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:16:44,914 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:44,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:44,923 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 6 treesize of output 5 [2018-09-28 10:16:44,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:44,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:44,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:45,894 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:45,895 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-09-28 10:16:45,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-28 10:16:45,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-28 10:16:45,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1965, Invalid=3437, Unknown=0, NotChecked=0, Total=5402 [2018-09-28 10:16:45,897 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2018-09-28 10:16:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:47,866 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-09-28 10:16:47,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-28 10:16:47,867 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2018-09-28 10:16:47,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:47,868 INFO L225 Difference]: With dead ends: 185 [2018-09-28 10:16:47,868 INFO L226 Difference]: Without dead ends: 184 [2018-09-28 10:16:47,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4033, Invalid=7957, Unknown=0, NotChecked=0, Total=11990 [2018-09-28 10:16:47,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-28 10:16:47,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-09-28 10:16:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-28 10:16:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-28 10:16:47,900 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2018-09-28 10:16:47,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:47,900 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-28 10:16:47,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-28 10:16:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-28 10:16:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-28 10:16:47,901 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:47,901 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2018-09-28 10:16:47,902 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:47,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:47,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2018-09-28 10:16:47,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:47,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:47,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:47,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:47,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:48,863 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:48,863 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:16:48,869 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:16:49,051 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-28 10:16:49,051 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:49,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:49,075 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 6 treesize of output 5 [2018-09-28 10:16:49,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:49,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:49,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:50,460 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:50,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-09-28 10:16:50,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-28 10:16:50,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-28 10:16:50,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2075, Invalid=3625, Unknown=0, NotChecked=0, Total=5700 [2018-09-28 10:16:50,462 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2018-09-28 10:16:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:52,163 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-09-28 10:16:52,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-28 10:16:52,163 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2018-09-28 10:16:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:52,164 INFO L225 Difference]: With dead ends: 190 [2018-09-28 10:16:52,165 INFO L226 Difference]: Without dead ends: 189 [2018-09-28 10:16:52,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3954 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4256, Invalid=8400, Unknown=0, NotChecked=0, Total=12656 [2018-09-28 10:16:52,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-28 10:16:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-09-28 10:16:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-28 10:16:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-09-28 10:16:52,200 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2018-09-28 10:16:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:52,200 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-09-28 10:16:52,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-28 10:16:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-09-28 10:16:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-28 10:16:52,202 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:52,202 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2018-09-28 10:16:52,202 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:52,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:52,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2018-09-28 10:16:52,203 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:52,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:52,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:52,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:52,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:53,191 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:53,191 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:16:53,199 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:16:53,414 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-28 10:16:53,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:16:53,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16: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 6 treesize of output 5 [2018-09-28 10:16:53,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:53,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:53,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:55,697 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:55,697 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-09-28 10:16:55,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-28 10:16:55,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-28 10:16:55,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2188, Invalid=3818, Unknown=0, NotChecked=0, Total=6006 [2018-09-28 10:16:55,698 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2018-09-28 10:16:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:16:57,383 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-28 10:16:57,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-28 10:16:57,384 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2018-09-28 10:16:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:16:57,385 INFO L225 Difference]: With dead ends: 195 [2018-09-28 10:16:57,385 INFO L226 Difference]: Without dead ends: 194 [2018-09-28 10:16:57,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4175 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4485, Invalid=8855, Unknown=0, NotChecked=0, Total=13340 [2018-09-28 10:16:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-28 10:16:57,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-09-28 10:16:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-28 10:16:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-28 10:16:57,420 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2018-09-28 10:16:57,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:16:57,421 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-28 10:16:57,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-28 10:16:57,421 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-28 10:16:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-28 10:16:57,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:16:57,422 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2018-09-28 10:16:57,422 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:16:57,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:16:57,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2018-09-28 10:16:57,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:16:57,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:16:57,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:57,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:16:57,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:16:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:58,344 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:16:58,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 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:16:58,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:16:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:16:58,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:16:58,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-28 10:16:58,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:16:58,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:16:58,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:16:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:16:59,647 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:16:59,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-09-28 10:16:59,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-28 10:16:59,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-28 10:16:59,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2304, Invalid=4016, Unknown=0, NotChecked=0, Total=6320 [2018-09-28 10:16:59,649 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2018-09-28 10:17:01,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:01,650 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-09-28 10:17:01,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-28 10:17:01,650 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2018-09-28 10:17:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:01,651 INFO L225 Difference]: With dead ends: 200 [2018-09-28 10:17:01,651 INFO L226 Difference]: Without dead ends: 199 [2018-09-28 10:17:01,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4720, Invalid=9322, Unknown=0, NotChecked=0, Total=14042 [2018-09-28 10:17:01,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-28 10:17:01,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2018-09-28 10:17:01,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-28 10:17:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-09-28 10:17:01,683 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2018-09-28 10:17:01,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:01,683 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-09-28 10:17:01,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-28 10:17:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-09-28 10:17:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-28 10:17:01,684 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:01,684 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2018-09-28 10:17:01,684 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:17:01,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:01,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2018-09-28 10:17:01,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:01,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:01,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:01,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:17:01,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:03,133 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:03,133 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) [2018-09-28 10:17:03,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:17:03,280 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:17:03,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:03,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:03,288 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 6 treesize of output 5 [2018-09-28 10:17:03,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:03,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:03,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:04,410 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:04,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-09-28 10:17:04,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-28 10:17:04,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-28 10:17:04,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2423, Invalid=4219, Unknown=0, NotChecked=0, Total=6642 [2018-09-28 10:17:04,412 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2018-09-28 10:17:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:06,528 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-09-28 10:17:06,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-28 10:17:06,528 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2018-09-28 10:17:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:06,529 INFO L225 Difference]: With dead ends: 205 [2018-09-28 10:17:06,529 INFO L226 Difference]: Without dead ends: 204 [2018-09-28 10:17:06,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4635 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4961, Invalid=9801, Unknown=0, NotChecked=0, Total=14762 [2018-09-28 10:17:06,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-28 10:17:06,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-09-28 10:17:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-28 10:17:06,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-28 10:17:06,563 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2018-09-28 10:17:06,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:06,564 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-28 10:17:06,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-28 10:17:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-28 10:17:06,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-28 10:17:06,565 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:06,565 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2018-09-28 10:17:06,565 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:17:06,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:06,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2018-09-28 10:17:06,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:06,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:06,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:06,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:07,631 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:07,631 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:17:07,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:17:07,919 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-28 10:17:07,920 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:07,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:07,932 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 6 treesize of output 5 [2018-09-28 10:17:07,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:07,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:07,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:09,081 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:09,081 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-09-28 10:17:09,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-28 10:17:09,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-28 10:17:09,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2545, Invalid=4427, Unknown=0, NotChecked=0, Total=6972 [2018-09-28 10:17:09,083 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2018-09-28 10:17:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:11,238 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-09-28 10:17:11,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-28 10:17:11,238 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2018-09-28 10:17:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:11,239 INFO L225 Difference]: With dead ends: 210 [2018-09-28 10:17:11,239 INFO L226 Difference]: Without dead ends: 209 [2018-09-28 10:17:11,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4874 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5208, Invalid=10292, Unknown=0, NotChecked=0, Total=15500 [2018-09-28 10:17:11,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-28 10:17:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-09-28 10:17:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-28 10:17:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-09-28 10:17:11,272 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2018-09-28 10:17:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:11,272 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-09-28 10:17:11,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-28 10:17:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-09-28 10:17:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-28 10:17:11,274 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:11,274 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2018-09-28 10:17:11,274 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:17:11,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:11,274 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2018-09-28 10:17:11,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:11,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:11,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:11,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:11,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:12,328 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:12,329 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) [2018-09-28 10:17:12,338 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:17:12,472 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:17:12,473 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:12,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:12,484 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 6 treesize of output 5 [2018-09-28 10:17:12,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:12,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:12,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:13,689 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:13,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-09-28 10:17:13,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-28 10:17:13,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-28 10:17:13,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2670, Invalid=4640, Unknown=0, NotChecked=0, Total=7310 [2018-09-28 10:17:13,691 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2018-09-28 10:17:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:15,899 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-28 10:17:15,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-28 10:17:15,900 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2018-09-28 10:17:15,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:15,901 INFO L225 Difference]: With dead ends: 215 [2018-09-28 10:17:15,901 INFO L226 Difference]: Without dead ends: 214 [2018-09-28 10:17:15,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5119 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5461, Invalid=10795, Unknown=0, NotChecked=0, Total=16256 [2018-09-28 10:17:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-28 10:17:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2018-09-28 10:17:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-28 10:17:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-09-28 10:17:16,045 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2018-09-28 10:17:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:16,045 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-09-28 10:17:16,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-28 10:17:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-09-28 10:17:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-28 10:17:16,046 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:16,046 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2018-09-28 10:17:16,047 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:17:16,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:16,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2018-09-28 10:17:16,047 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:16,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:16,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:16,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:16,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:17,133 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:17,133 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:17:17,140 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:17:17,517 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-28 10:17:17,517 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:17,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:17,541 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 6 treesize of output 5 [2018-09-28 10:17:17,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:17,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:17,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:18,866 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:18,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-09-28 10:17:18,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-28 10:17:18,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-28 10:17:18,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2798, Invalid=4858, Unknown=0, NotChecked=0, Total=7656 [2018-09-28 10:17:18,868 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2018-09-28 10:17:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:21,137 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-09-28 10:17:21,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-28 10:17:21,138 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2018-09-28 10:17:21,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:21,139 INFO L225 Difference]: With dead ends: 220 [2018-09-28 10:17:21,139 INFO L226 Difference]: Without dead ends: 219 [2018-09-28 10:17:21,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5370 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5720, Invalid=11310, Unknown=0, NotChecked=0, Total=17030 [2018-09-28 10:17:21,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-28 10:17:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-09-28 10:17:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-09-28 10:17:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-09-28 10:17:21,178 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2018-09-28 10:17:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:21,178 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-09-28 10:17:21,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-28 10:17:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-09-28 10:17:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-28 10:17:21,179 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:21,179 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2018-09-28 10:17:21,180 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:17:21,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:21,180 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2018-09-28 10:17:21,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:21,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:21,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:21,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:21,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:22,409 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:22,409 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:17:22,418 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:17:22,687 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-28 10:17:22,687 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:22,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:22,703 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 6 treesize of output 5 [2018-09-28 10:17:22,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:22,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:22,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:24,016 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:24,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-09-28 10:17:24,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-28 10:17:24,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-28 10:17:24,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=5081, Unknown=0, NotChecked=0, Total=8010 [2018-09-28 10:17:24,018 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2018-09-28 10:17:24,378 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 10:17:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:26,858 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-09-28 10:17:26,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-28 10:17:26,858 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2018-09-28 10:17:26,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:26,859 INFO L225 Difference]: With dead ends: 225 [2018-09-28 10:17:26,859 INFO L226 Difference]: Without dead ends: 224 [2018-09-28 10:17:26,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5627 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5985, Invalid=11837, Unknown=0, NotChecked=0, Total=17822 [2018-09-28 10:17:26,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-28 10:17:26,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-09-28 10:17:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-28 10:17:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-28 10:17:26,900 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2018-09-28 10:17:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:26,900 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-28 10:17:26,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-28 10:17:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-28 10:17:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-28 10:17:26,901 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:26,901 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2018-09-28 10:17:26,902 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:17:26,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:26,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2018-09-28 10:17:26,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:26,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:26,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:26,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:26,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:28,420 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:28,421 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:17:28,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:17:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:28,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:28,584 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 6 treesize of output 5 [2018-09-28 10:17:28,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:28,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:28,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:30,006 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:30,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-09-28 10:17:30,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-28 10:17:30,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-28 10:17:30,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3063, Invalid=5309, Unknown=0, NotChecked=0, Total=8372 [2018-09-28 10:17:30,008 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2018-09-28 10:17:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:32,412 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-09-28 10:17:32,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-28 10:17:32,412 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2018-09-28 10:17:32,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:32,413 INFO L225 Difference]: With dead ends: 230 [2018-09-28 10:17:32,413 INFO L226 Difference]: Without dead ends: 229 [2018-09-28 10:17:32,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5890 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6256, Invalid=12376, Unknown=0, NotChecked=0, Total=18632 [2018-09-28 10:17:32,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-28 10:17:32,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-09-28 10:17:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-09-28 10:17:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-09-28 10:17:32,463 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2018-09-28 10:17:32,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:32,464 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-09-28 10:17:32,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-28 10:17:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-09-28 10:17:32,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-28 10:17:32,465 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:32,465 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2018-09-28 10:17:32,465 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:17:32,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:32,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2018-09-28 10:17:32,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:32,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:32,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:32,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:17:32,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:33,826 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:33,826 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:17:33,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:17:33,981 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:17:33,981 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:33,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:33,993 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 6 treesize of output 5 [2018-09-28 10:17:33,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:34,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:34,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:35,527 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:35,527 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-09-28 10:17:35,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-28 10:17:35,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-28 10:17:35,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3200, Invalid=5542, Unknown=0, NotChecked=0, Total=8742 [2018-09-28 10:17:35,528 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2018-09-28 10:17:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:38,139 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-28 10:17:38,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-28 10:17:38,139 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2018-09-28 10:17:38,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:38,140 INFO L225 Difference]: With dead ends: 235 [2018-09-28 10:17:38,140 INFO L226 Difference]: Without dead ends: 234 [2018-09-28 10:17:38,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6159 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6533, Invalid=12927, Unknown=0, NotChecked=0, Total=19460 [2018-09-28 10:17:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-28 10:17:38,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-09-28 10:17:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-28 10:17:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-09-28 10:17:38,204 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2018-09-28 10:17:38,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:38,204 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-09-28 10:17:38,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-28 10:17:38,204 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-09-28 10:17:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-28 10:17:38,205 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:38,206 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2018-09-28 10:17:38,206 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:17:38,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:38,206 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2018-09-28 10:17:38,206 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:38,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:38,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:38,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:38,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:39,614 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:39,614 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:17:39,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:17:39,945 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-28 10:17:39,946 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:39,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:39,956 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 6 treesize of output 5 [2018-09-28 10:17:39,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:39,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:39,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:41,704 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:41,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-09-28 10:17:41,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-28 10:17:41,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-28 10:17:41,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3340, Invalid=5780, Unknown=0, NotChecked=0, Total=9120 [2018-09-28 10:17:41,706 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2018-09-28 10:17:44,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:44,061 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-09-28 10:17:44,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-28 10:17:44,061 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2018-09-28 10:17:44,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:44,063 INFO L225 Difference]: With dead ends: 240 [2018-09-28 10:17:44,063 INFO L226 Difference]: Without dead ends: 239 [2018-09-28 10:17:44,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6434 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6816, Invalid=13490, Unknown=0, NotChecked=0, Total=20306 [2018-09-28 10:17:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-28 10:17:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-09-28 10:17:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-28 10:17:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-09-28 10:17:44,121 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2018-09-28 10:17:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:44,121 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-09-28 10:17:44,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-28 10:17:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-09-28 10:17:44,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-28 10:17:44,122 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:44,123 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2018-09-28 10:17:44,123 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:17:44,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:44,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2018-09-28 10:17:44,123 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:44,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:44,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:44,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:44,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:45,463 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:45,463 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:17:45,470 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:17:45,633 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:17:45,634 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:45,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:45,654 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 6 treesize of output 5 [2018-09-28 10:17:45,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:45,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:45,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:47,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:47,492 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-09-28 10:17:47,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-28 10:17:47,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-28 10:17:47,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3483, Invalid=6023, Unknown=0, NotChecked=0, Total=9506 [2018-09-28 10:17:47,493 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2018-09-28 10:17:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:49,974 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-09-28 10:17:49,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-28 10:17:49,975 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2018-09-28 10:17:49,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:49,976 INFO L225 Difference]: With dead ends: 245 [2018-09-28 10:17:49,976 INFO L226 Difference]: Without dead ends: 244 [2018-09-28 10:17:49,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6715 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7105, Invalid=14065, Unknown=0, NotChecked=0, Total=21170 [2018-09-28 10:17:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-09-28 10:17:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-09-28 10:17:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-28 10:17:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-28 10:17:50,036 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2018-09-28 10:17:50,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:50,036 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-28 10:17:50,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-28 10:17:50,037 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-28 10:17:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-28 10:17:50,037 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:50,037 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2018-09-28 10:17:50,038 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:17:50,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:50,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2018-09-28 10:17:50,038 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:50,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:50,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:50,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:50,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:51,761 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:51,761 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:17:51,768 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:17:52,062 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-28 10:17:52,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:52,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:52,082 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 6 treesize of output 5 [2018-09-28 10:17:52,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:52,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:52,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:17:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:53,688 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:17:53,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-09-28 10:17:53,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-28 10:17:53,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-28 10:17:53,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3629, Invalid=6271, Unknown=0, NotChecked=0, Total=9900 [2018-09-28 10:17:53,690 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2018-09-28 10:17:56,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:17:56,432 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-09-28 10:17:56,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-28 10:17:56,433 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2018-09-28 10:17:56,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:17:56,434 INFO L225 Difference]: With dead ends: 250 [2018-09-28 10:17:56,434 INFO L226 Difference]: Without dead ends: 249 [2018-09-28 10:17:56,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7002 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7400, Invalid=14652, Unknown=0, NotChecked=0, Total=22052 [2018-09-28 10:17:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-28 10:17:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2018-09-28 10:17:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-09-28 10:17:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-09-28 10:17:56,482 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2018-09-28 10:17:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:17:56,482 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-09-28 10:17:56,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-28 10:17:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-09-28 10:17:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-28 10:17:56,483 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:17:56,483 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2018-09-28 10:17:56,484 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:17:56,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:17:56,484 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2018-09-28 10:17:56,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:17:56,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:17:56,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:56,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:17:56,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:17:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:17:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:17:57,992 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:17:57,992 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:17:57,999 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:17:58,350 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-28 10:17:58,350 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:17:58,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:17:58,362 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 6 treesize of output 5 [2018-09-28 10:17:58,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:17:58,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:17:58,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:00,258 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:00,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-09-28 10:18:00,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-28 10:18:00,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-28 10:18:00,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3778, Invalid=6524, Unknown=0, NotChecked=0, Total=10302 [2018-09-28 10:18:00,260 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2018-09-28 10:18:03,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:03,209 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-28 10:18:03,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-28 10:18:03,210 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2018-09-28 10:18:03,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:03,211 INFO L225 Difference]: With dead ends: 255 [2018-09-28 10:18:03,211 INFO L226 Difference]: Without dead ends: 254 [2018-09-28 10:18:03,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7295 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7701, Invalid=15251, Unknown=0, NotChecked=0, Total=22952 [2018-09-28 10:18:03,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-28 10:18:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-09-28 10:18:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-28 10:18:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-09-28 10:18:03,263 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2018-09-28 10:18:03,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:03,263 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-09-28 10:18:03,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-28 10:18:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-09-28 10:18:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-28 10:18:03,264 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:03,265 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2018-09-28 10:18:03,265 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:18:03,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:03,265 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2018-09-28 10:18:03,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:03,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:03,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:03,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:18:03,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:04,648 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:04,648 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:18:04,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:18:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:04,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:04,828 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 6 treesize of output 5 [2018-09-28 10:18:04,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:04,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:04,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:06,730 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:06,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-09-28 10:18:06,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-28 10:18:06,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-28 10:18:06,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3930, Invalid=6782, Unknown=0, NotChecked=0, Total=10712 [2018-09-28 10:18:06,733 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2018-09-28 10:18:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:09,616 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-09-28 10:18:09,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-28 10:18:09,617 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2018-09-28 10:18:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:09,618 INFO L225 Difference]: With dead ends: 260 [2018-09-28 10:18:09,618 INFO L226 Difference]: Without dead ends: 259 [2018-09-28 10:18:09,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7594 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8008, Invalid=15862, Unknown=0, NotChecked=0, Total=23870 [2018-09-28 10:18:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-28 10:18:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2018-09-28 10:18:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-09-28 10:18:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-09-28 10:18:09,676 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2018-09-28 10:18:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:09,677 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-09-28 10:18:09,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-28 10:18:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-09-28 10:18:09,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-28 10:18:09,678 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:09,678 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2018-09-28 10:18:09,678 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:18:09,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:09,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2018-09-28 10:18:09,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:09,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:09,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:09,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:18:09,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:11,067 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:11,067 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:18:11,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:18:11,249 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:18:11,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:18:11,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:11,275 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 6 treesize of output 5 [2018-09-28 10:18:11,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:11,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:11,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:13,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:13,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-09-28 10:18:13,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-28 10:18:13,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-28 10:18:13,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4085, Invalid=7045, Unknown=0, NotChecked=0, Total=11130 [2018-09-28 10:18:13,269 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2018-09-28 10:18:16,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:16,072 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-09-28 10:18:16,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-28 10:18:16,072 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2018-09-28 10:18:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:16,073 INFO L225 Difference]: With dead ends: 265 [2018-09-28 10:18:16,073 INFO L226 Difference]: Without dead ends: 264 [2018-09-28 10:18:16,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7899 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8321, Invalid=16485, Unknown=0, NotChecked=0, Total=24806 [2018-09-28 10:18:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-09-28 10:18:16,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-09-28 10:18:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-28 10:18:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-28 10:18:16,131 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2018-09-28 10:18:16,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:16,131 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-28 10:18:16,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-28 10:18:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-28 10:18:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-28 10:18:16,132 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:16,132 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2018-09-28 10:18:16,133 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:18:16,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:16,133 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2018-09-28 10:18:16,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:16,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:16,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:16,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:18:16,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:17,899 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:17,899 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:18:17,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:18:18,285 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-28 10:18:18,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:18:18,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:18,300 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 6 treesize of output 5 [2018-09-28 10:18:18,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:18,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:18,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:20,096 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:20,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-09-28 10:18:20,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-28 10:18:20,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-28 10:18:20,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4243, Invalid=7313, Unknown=0, NotChecked=0, Total=11556 [2018-09-28 10:18:20,099 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2018-09-28 10:18:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:23,160 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-09-28 10:18:23,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-28 10:18:23,164 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2018-09-28 10:18:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:23,165 INFO L225 Difference]: With dead ends: 270 [2018-09-28 10:18:23,165 INFO L226 Difference]: Without dead ends: 269 [2018-09-28 10:18:23,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8210 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8640, Invalid=17120, Unknown=0, NotChecked=0, Total=25760 [2018-09-28 10:18:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-09-28 10:18:23,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-09-28 10:18:23,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-09-28 10:18:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-09-28 10:18:23,228 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2018-09-28 10:18:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:23,228 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-09-28 10:18:23,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-28 10:18:23,228 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-09-28 10:18:23,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-28 10:18:23,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:23,229 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2018-09-28 10:18:23,229 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:18:23,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:23,230 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2018-09-28 10:18:23,230 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:23,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:23,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:23,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:18:23,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:24,779 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:24,779 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:18:24,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:18:24,970 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:18:24,970 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:18:24,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:24,983 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 6 treesize of output 5 [2018-09-28 10:18:24,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:24,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:24,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:26,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:26,846 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:26,847 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-09-28 10:18:26,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-28 10:18:26,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-28 10:18:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4404, Invalid=7586, Unknown=0, NotChecked=0, Total=11990 [2018-09-28 10:18:26,849 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2018-09-28 10:18:30,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:30,017 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-28 10:18:30,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-28 10:18:30,017 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2018-09-28 10:18:30,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:30,018 INFO L225 Difference]: With dead ends: 275 [2018-09-28 10:18:30,018 INFO L226 Difference]: Without dead ends: 274 [2018-09-28 10:18:30,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8527 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8965, Invalid=17767, Unknown=0, NotChecked=0, Total=26732 [2018-09-28 10:18:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-28 10:18:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-09-28 10:18:30,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-28 10:18:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-09-28 10:18:30,076 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2018-09-28 10:18:30,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:30,077 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-09-28 10:18:30,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-28 10:18:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-09-28 10:18:30,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-28 10:18:30,078 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:30,078 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2018-09-28 10:18:30,078 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:18:30,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:30,079 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2018-09-28 10:18:30,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:30,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:30,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:30,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:18:30,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:31,820 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:31,820 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:18:31,827 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:18:32,181 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-28 10:18:32,181 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:18:32,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:32,192 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 6 treesize of output 5 [2018-09-28 10:18:32,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:32,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:32,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:34,232 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:34,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-09-28 10:18:34,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-28 10:18:34,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-28 10:18:34,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4568, Invalid=7864, Unknown=0, NotChecked=0, Total=12432 [2018-09-28 10:18:34,235 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2018-09-28 10:18:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:37,444 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-09-28 10:18:37,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-28 10:18:37,445 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2018-09-28 10:18:37,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:37,446 INFO L225 Difference]: With dead ends: 280 [2018-09-28 10:18:37,446 INFO L226 Difference]: Without dead ends: 279 [2018-09-28 10:18:37,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8850 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9296, Invalid=18426, Unknown=0, NotChecked=0, Total=27722 [2018-09-28 10:18:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-28 10:18:37,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2018-09-28 10:18:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-09-28 10:18:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-09-28 10:18:37,512 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2018-09-28 10:18:37,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:37,512 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-09-28 10:18:37,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-28 10:18:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-09-28 10:18:37,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-09-28 10:18:37,514 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:37,514 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2018-09-28 10:18:37,514 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:18:37,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:37,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2018-09-28 10:18:37,515 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:37,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:37,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:37,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:18:37,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:39,102 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:39,102 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:18:39,111 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:18:39,507 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-28 10:18:39,508 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:18:39,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:39,525 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 6 treesize of output 5 [2018-09-28 10:18:39,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:39,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:39,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:41,647 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:41,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-09-28 10:18:41,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-28 10:18:41,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-28 10:18:41,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4735, Invalid=8147, Unknown=0, NotChecked=0, Total=12882 [2018-09-28 10:18:41,650 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2018-09-28 10:18:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:45,070 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-09-28 10:18:45,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-28 10:18:45,070 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2018-09-28 10:18:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:45,071 INFO L225 Difference]: With dead ends: 285 [2018-09-28 10:18:45,071 INFO L226 Difference]: Without dead ends: 284 [2018-09-28 10:18:45,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9179 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9633, Invalid=19097, Unknown=0, NotChecked=0, Total=28730 [2018-09-28 10:18:45,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-09-28 10:18:45,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2018-09-28 10:18:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-28 10:18:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-28 10:18:45,134 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2018-09-28 10:18:45,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:45,134 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-28 10:18:45,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-28 10:18:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-28 10:18:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-28 10:18:45,135 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:45,135 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2018-09-28 10:18:45,135 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:18:45,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:45,136 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2018-09-28 10:18:45,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:45,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:45,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:45,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:18:45,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:46,791 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:46,791 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:18:46,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:18:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:46,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:46,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 6 treesize of output 5 [2018-09-28 10:18:46,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:47,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:47,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:49,375 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:49,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-09-28 10:18:49,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-28 10:18:49,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-28 10:18:49,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4905, Invalid=8435, Unknown=0, NotChecked=0, Total=13340 [2018-09-28 10:18:49,377 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2018-09-28 10:18:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:18:52,800 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-09-28 10:18:52,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-28 10:18:52,801 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2018-09-28 10:18:52,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:18:52,802 INFO L225 Difference]: With dead ends: 290 [2018-09-28 10:18:52,802 INFO L226 Difference]: Without dead ends: 289 [2018-09-28 10:18:52,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9514 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9976, Invalid=19780, Unknown=0, NotChecked=0, Total=29756 [2018-09-28 10:18:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-09-28 10:18:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2018-09-28 10:18:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-28 10:18:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-09-28 10:18:52,866 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2018-09-28 10:18:52,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:18:52,866 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-09-28 10:18:52,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-28 10:18:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-09-28 10:18:52,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-09-28 10:18:52,867 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:18:52,868 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2018-09-28 10:18:52,868 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:18:52,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:18:52,868 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2018-09-28 10:18:52,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:18:52,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:18:52,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:52,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:18:52,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:18:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:18:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:54,594 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:18:54,594 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:18:54,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 10:18:54,779 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 10:18:54,780 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:18:54,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:18:54,791 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 6 treesize of output 5 [2018-09-28 10:18:54,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:18:54,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:18:54,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:18:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:18:56,922 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:18:56,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-09-28 10:18:56,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-28 10:18:56,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-28 10:18:56,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5078, Invalid=8728, Unknown=0, NotChecked=0, Total=13806 [2018-09-28 10:18:56,924 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2018-09-28 10:19:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:19:00,321 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-28 10:19:00,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-28 10:19:00,321 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2018-09-28 10:19:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:19:00,322 INFO L225 Difference]: With dead ends: 295 [2018-09-28 10:19:00,322 INFO L226 Difference]: Without dead ends: 294 [2018-09-28 10:19:00,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9855 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=10325, Invalid=20475, Unknown=0, NotChecked=0, Total=30800 [2018-09-28 10:19:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-28 10:19:00,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2018-09-28 10:19:00,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-09-28 10:19:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-09-28 10:19:00,386 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2018-09-28 10:19:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:19:00,386 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-09-28 10:19:00,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-28 10:19:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-09-28 10:19:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-28 10:19:00,387 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:19:00,387 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2018-09-28 10:19:00,387 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:19:00,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:19:00,388 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2018-09-28 10:19:00,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:19:00,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:19:00,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:00,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:19:00,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:19:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:02,142 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:19:02,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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:19:02,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 10:19:02,582 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-28 10:19:02,582 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:19:02,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:19:02,594 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 6 treesize of output 5 [2018-09-28 10:19:02,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:19:02,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:19:02,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:19:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:05,051 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:19:05,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-09-28 10:19:05,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-28 10:19:05,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-28 10:19:05,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5254, Invalid=9026, Unknown=0, NotChecked=0, Total=14280 [2018-09-28 10:19:05,053 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2018-09-28 10:19:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:19:08,491 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-09-28 10:19:08,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-28 10:19:08,492 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2018-09-28 10:19:08,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:19:08,493 INFO L225 Difference]: With dead ends: 300 [2018-09-28 10:19:08,493 INFO L226 Difference]: Without dead ends: 299 [2018-09-28 10:19:08,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10202 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10680, Invalid=21182, Unknown=0, NotChecked=0, Total=31862 [2018-09-28 10:19:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-09-28 10:19:08,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-09-28 10:19:08,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-09-28 10:19:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-09-28 10:19:08,563 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2018-09-28 10:19:08,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:19:08,564 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-09-28 10:19:08,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-28 10:19:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-09-28 10:19:08,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-28 10:19:08,565 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:19:08,565 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2018-09-28 10:19:08,565 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:19:08,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:19:08,566 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2018-09-28 10:19:08,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:19:08,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:19:08,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:08,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:19:08,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:19:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:10,345 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:19:10,345 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:19:10,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 10:19:10,551 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 10:19:10,552 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:19:10,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:19:10,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-28 10:19:10,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:19:10,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:19:10,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:19:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:12,822 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:19:12,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-09-28 10:19:12,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-28 10:19:12,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-28 10:19:12,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5433, Invalid=9329, Unknown=0, NotChecked=0, Total=14762 [2018-09-28 10:19:12,824 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2018-09-28 10:19:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:19:16,410 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-09-28 10:19:16,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-28 10:19:16,410 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2018-09-28 10:19:16,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:19:16,411 INFO L225 Difference]: With dead ends: 305 [2018-09-28 10:19:16,411 INFO L226 Difference]: Without dead ends: 304 [2018-09-28 10:19:16,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10555 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=11041, Invalid=21901, Unknown=0, NotChecked=0, Total=32942 [2018-09-28 10:19:16,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-09-28 10:19:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2018-09-28 10:19:16,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-28 10:19:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-28 10:19:16,482 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2018-09-28 10:19:16,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:19:16,482 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-28 10:19:16,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-28 10:19:16,482 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-28 10:19:16,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-28 10:19:16,483 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:19:16,483 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2018-09-28 10:19:16,484 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:19:16,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:19:16,484 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2018-09-28 10:19:16,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:19:16,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:19:16,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:16,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:19:16,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:19:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:18,331 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:19:18,331 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:19:18,338 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 10:19:18,737 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-28 10:19:18,737 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:19:18,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:19:18,750 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 6 treesize of output 5 [2018-09-28 10:19:18,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:19:18,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:19:18,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:19:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:21,032 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:19:21,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-09-28 10:19:21,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-28 10:19:21,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-28 10:19:21,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5615, Invalid=9637, Unknown=0, NotChecked=0, Total=15252 [2018-09-28 10:19:21,035 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2018-09-28 10:19:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:19:24,670 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-09-28 10:19:24,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-28 10:19:24,671 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2018-09-28 10:19:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:19:24,672 INFO L225 Difference]: With dead ends: 310 [2018-09-28 10:19:24,672 INFO L226 Difference]: Without dead ends: 309 [2018-09-28 10:19:24,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10914 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=11408, Invalid=22632, Unknown=0, NotChecked=0, Total=34040 [2018-09-28 10:19:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-28 10:19:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2018-09-28 10:19:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-09-28 10:19:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-09-28 10:19:24,742 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2018-09-28 10:19:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:19:24,742 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-09-28 10:19:24,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-28 10:19:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-09-28 10:19:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-09-28 10:19:24,744 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:19:24,744 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2018-09-28 10:19:24,744 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-28 10:19:24,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:19:24,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2018-09-28 10:19:24,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:19:24,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:19:24,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:24,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:19:24,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:19:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:19:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:26,623 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:19:26,623 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:19:26,630 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 10:19:27,137 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-09-28 10:19:27,138 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 10:19:27,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:19:27,183 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 6 treesize of output 5 [2018-09-28 10:19:27,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 10:19:27,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 10:19:27,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-28 10:19:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:19:29,594 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:19:29,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-09-28 10:19:29,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-28 10:19:29,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-28 10:19:29,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5800, Invalid=9950, Unknown=0, NotChecked=0, Total=15750 [2018-09-28 10:19:29,597 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. Received shutdown request... [2018-09-28 10:19:31,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-28 10:19:31,923 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-28 10:19:31,928 WARN L206 ceAbstractionStarter]: Timeout [2018-09-28 10:19:31,929 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.09 10:19:31 BoogieIcfgContainer [2018-09-28 10:19:31,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-28 10:19:31,930 INFO L168 Benchmark]: Toolchain (without parser) took 239937.75 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -937.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-28 10:19:31,931 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:19:31,931 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:19:31,931 INFO L168 Benchmark]: Boogie Preprocessor took 39.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:19:31,931 INFO L168 Benchmark]: RCFGBuilder took 346.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-28 10:19:31,932 INFO L168 Benchmark]: TraceAbstraction took 239476.55 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -958.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-28 10:19:31,933 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 346.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239476.55 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -958.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 41). Cancelled while BasicCegarLoop was constructing difference of abstraction (306states) and FLOYD_HOARE automaton (currently 51 states, 126 states before enhancement), while ReachableStatesComputation was computing reachable states (240 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 41). Cancelled while BasicCegarLoop was constructing difference of abstraction (306states) and FLOYD_HOARE automaton (currently 51 states, 126 states before enhancement), while ReachableStatesComputation was computing reachable states (240 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 2 error locations. TIMEOUT Result, 239.3s OverallTime, 63 OverallIterations, 61 TraceHistogramMax, 101.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 144 SDtfs, 10857 SDslu, 197 SDs, 0 SdLazy, 16958 SolverSat, 5448 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13287 GetRequests, 7442 SyntacticMatches, 0 SemanticMatches, 5845 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234594 ImplicationChecksByTransitivity, 179.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=62, 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.9s AutomataMinimizationTime, 62 MinimizatonAttempts, 185 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.6s SsaConstructionTime, 9.9s SatisfiabilityAnalysisTime, 119.5s InterpolantComputationTime, 18917 NumberOfCodeBlocks, 18917 NumberOfCodeBlocksAsserted, 1093 NumberOfCheckSat, 18794 ConstructedInterpolants, 0 QuantifiedInterpolants, 30973699 SizeOfPredicates, 651 NumberOfNonLiveVariables, 40470 ConjunctsInSsa, 6612 ConjunctsInUnsatCore, 123 InterpolantComputations, 3 PerfectInterpolantSequences, 2/374542 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/PointerIncrement-simplified01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-28_10-19-31-946.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-28_10-19-31-946.csv Completed graceful shutdown