java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__simple-loop.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:42:40,774 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:42:40,776 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:42:40,788 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:42:40,789 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:42:40,789 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:42:40,791 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:42:40,793 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:42:40,795 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:42:40,797 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:42:40,798 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:42:40,798 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:42:40,799 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:42:40,802 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:42:40,803 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:42:40,803 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:42:40,805 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:42:40,818 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:42:40,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:42:40,820 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:42:40,821 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:42:40,824 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:42:40,824 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:42:40,824 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:42:40,828 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:42:40,829 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:42:40,832 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:42:40,833 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:42:40,834 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:42:40,834 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:42:40,839 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:42:40,840 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:42:40,840 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:42:40,841 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:42:40,842 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:42:40,842 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:42:40,868 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:42:40,868 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:42:40,869 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:42:40,869 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:42:40,870 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:42:40,870 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:42:40,870 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:42:40,870 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:42:40,871 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:42:40,871 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:42:40,872 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:42:40,872 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:42:40,872 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:42:40,872 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:42:40,872 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:42:40,873 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:42:40,873 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:42:40,873 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:42:40,873 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:42:40,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:42:40,873 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:42:40,876 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:42:40,876 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:42:40,925 INFO ]: Repository-Root is: /tmp [2018-06-24 21:42:40,942 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:42:40,947 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:42:40,949 INFO ]: Initializing SmtParser... [2018-06-24 21:42:40,949 INFO ]: SmtParser initialized [2018-06-24 21:42:40,950 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__simple-loop.smt2 [2018-06-24 21:42:40,951 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:42:41,037 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__simple-loop.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@7cd89f72 [2018-06-24 21:42:41,163 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__simple-loop.smt2 [2018-06-24 21:42:41,171 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:42:41,177 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:42:41,178 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:42:41,178 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:42:41,178 INFO ]: ChcToBoogie initialized [2018-06-24 21:42:41,181 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:42:41" (1/1) ... [2018-06-24 21:42:41,234 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:41 Unit [2018-06-24 21:42:41,234 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:42:41,234 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:42:41,235 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:42:41,235 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:42:41,255 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:41" (1/1) ... [2018-06-24 21:42:41,255 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:41" (1/1) ... [2018-06-24 21:42:41,261 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:41" (1/1) ... [2018-06-24 21:42:41,261 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:41" (1/1) ... [2018-06-24 21:42:41,263 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:41" (1/1) ... [2018-06-24 21:42:41,265 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:41" (1/1) ... [2018-06-24 21:42:41,266 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:41" (1/1) ... [2018-06-24 21:42:41,267 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:42:41,267 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:42:41,267 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:42:41,267 INFO ]: RCFGBuilder initialized [2018-06-24 21:42:41,268 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:41" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:42:41,282 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:42:41,282 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:42:41,282 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:42:41,282 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:42:41,282 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:42:41,282 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:42:41,413 INFO ]: Using library mode [2018-06-24 21:42:41,414 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:42:41 BoogieIcfgContainer [2018-06-24 21:42:41,414 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:42:41,414 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:42:41,414 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:42:41,415 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:42:41,416 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:42:41" (1/1) ... [2018-06-24 21:42:41,433 INFO ]: Initial Icfg 10 locations, 12 edges [2018-06-24 21:42:41,434 INFO ]: Using Remove infeasible edges [2018-06-24 21:42:41,435 INFO ]: Using Maximize final states [2018-06-24 21:42:41,435 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:42:41,435 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:42:41,437 INFO ]: Using Remove sink states [2018-06-24 21:42:41,438 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:42:41,438 INFO ]: Using Use SBE [2018-06-24 21:42:41,443 INFO ]: SBE split 0 edges [2018-06-24 21:42:41,448 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:42:41,449 INFO ]: 0 new accepting states [2018-06-24 21:42:41,475 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 21:42:41,477 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:42:41,480 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:42:41,480 INFO ]: 0 new accepting states [2018-06-24 21:42:41,481 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:42:41,481 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:42:41,481 INFO ]: Encoded RCFG 6 locations, 8 edges [2018-06-24 21:42:41,481 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:42:41 BasicIcfg [2018-06-24 21:42:41,481 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:42:41,483 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:42:41,483 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:42:41,486 INFO ]: TraceAbstraction initialized [2018-06-24 21:42:41,486 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:42:41" (1/4) ... [2018-06-24 21:42:41,487 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bea5c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:42:41, skipping insertion in model container [2018-06-24 21:42:41,487 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:41" (2/4) ... [2018-06-24 21:42:41,487 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bea5c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:42:41, skipping insertion in model container [2018-06-24 21:42:41,487 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:42:41" (3/4) ... [2018-06-24 21:42:41,487 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bea5c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:42:41, skipping insertion in model container [2018-06-24 21:42:41,487 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:42:41" (4/4) ... [2018-06-24 21:42:41,489 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:42:41,497 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:42:41,505 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:42:41,553 INFO ]: Using default assertion order modulation [2018-06-24 21:42:41,554 INFO ]: Interprodecural is true [2018-06-24 21:42:41,554 INFO ]: Hoare is false [2018-06-24 21:42:41,554 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:42:41,554 INFO ]: Backedges is TWOTRACK [2018-06-24 21:42:41,554 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:42:41,554 INFO ]: Difference is false [2018-06-24 21:42:41,554 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:42:41,554 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:42:41,568 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 21:42:41,589 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:42:41,589 INFO ]: Found error trace [2018-06-24 21:42:41,589 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:42:41,590 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:41,599 INFO ]: Analyzing trace with hash 37311172, now seen corresponding path program 1 times [2018-06-24 21:42:41,600 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:41,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:41,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:41,651 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:41,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:41,695 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:41,743 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:41,745 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:41,745 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:41,746 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:41,757 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:41,757 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:41,760 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 21:42:41,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:41,865 INFO ]: Finished difference Result 7 states and 11 transitions. [2018-06-24 21:42:41,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:41,874 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:42:41,874 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:41,884 INFO ]: With dead ends: 7 [2018-06-24 21:42:41,884 INFO ]: Without dead ends: 7 [2018-06-24 21:42:41,885 INFO ]: 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-06-24 21:42:41,903 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:42:41,926 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:42:41,927 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:42:41,928 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-24 21:42:41,929 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-06-24 21:42:41,929 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:41,929 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-24 21:42:41,929 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:41,929 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-24 21:42:41,929 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:42:41,929 INFO ]: Found error trace [2018-06-24 21:42:41,929 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:42:41,930 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:41,930 INFO ]: Analyzing trace with hash 1156290923, now seen corresponding path program 1 times [2018-06-24 21:42:41,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:41,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:41,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:41,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:41,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:41,940 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:42,006 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:42,007 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:42,007 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:42,008 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:42,008 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:42,008 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:42,008 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 3 states. [2018-06-24 21:42:42,120 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:42,120 INFO ]: Finished difference Result 9 states and 17 transitions. [2018-06-24 21:42:42,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:42,121 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:42:42,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:42,122 INFO ]: With dead ends: 9 [2018-06-24 21:42:42,122 INFO ]: Without dead ends: 9 [2018-06-24 21:42:42,122 INFO ]: 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-06-24 21:42:42,122 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:42:42,123 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-24 21:42:42,123 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:42:42,124 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-24 21:42:42,124 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 6 [2018-06-24 21:42:42,124 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:42,124 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-24 21:42:42,124 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:42,124 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-24 21:42:42,124 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:42:42,124 INFO ]: Found error trace [2018-06-24 21:42:42,124 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:42:42,124 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:42,124 INFO ]: Analyzing trace with hash 1156320714, now seen corresponding path program 1 times [2018-06-24 21:42:42,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:42,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:42,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:42,127 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:42,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:42,137 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:42,253 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:42,253 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:42,253 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 21:42:42,262 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:42,286 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:42,292 INFO ]: Computing forward predicates... [2018-06-24 21:42:42,313 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:42,332 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:42,332 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 21:42:42,333 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:42:42,333 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:42:42,333 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:42:42,333 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 4 states. [2018-06-24 21:42:42,388 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:42,388 INFO ]: Finished difference Result 10 states and 20 transitions. [2018-06-24 21:42:42,388 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:42:42,388 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:42:42,389 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:42,389 INFO ]: With dead ends: 10 [2018-06-24 21:42:42,389 INFO ]: Without dead ends: 10 [2018-06-24 21:42:42,389 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:42:42,389 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:42:42,390 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-24 21:42:42,390 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:42:42,391 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-06-24 21:42:42,391 INFO ]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 6 [2018-06-24 21:42:42,391 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:42,391 INFO ]: Abstraction has 8 states and 14 transitions. [2018-06-24 21:42:42,391 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:42:42,391 INFO ]: Start isEmpty. Operand 8 states and 14 transitions. [2018-06-24 21:42:42,391 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:42,391 INFO ]: Found error trace [2018-06-24 21:42:42,391 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:42,392 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:42,392 INFO ]: Analyzing trace with hash 1484954627, now seen corresponding path program 1 times [2018-06-24 21:42:42,392 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:42,392 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:42,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:42,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:42,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:42,400 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:42,496 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:42,496 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:42,496 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 21:42:42,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:42,526 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:42,527 INFO ]: Computing forward predicates... [2018-06-24 21:42:42,536 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:42,554 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:42,554 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 21:42:42,554 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:42:42,554 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:42:42,554 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:42:42,554 INFO ]: Start difference. First operand 8 states and 14 transitions. Second operand 5 states. [2018-06-24 21:42:42,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:42,689 INFO ]: Finished difference Result 11 states and 23 transitions. [2018-06-24 21:42:42,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:42:42,689 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 21:42:42,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:42,690 INFO ]: With dead ends: 11 [2018-06-24 21:42:42,690 INFO ]: Without dead ends: 11 [2018-06-24 21:42:42,690 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:42:42,690 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:42:42,691 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-24 21:42:42,691 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:42:42,692 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-06-24 21:42:42,692 INFO ]: Start accepts. Automaton has 9 states and 17 transitions. Word has length 7 [2018-06-24 21:42:42,692 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:42,692 INFO ]: Abstraction has 9 states and 17 transitions. [2018-06-24 21:42:42,692 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:42:42,692 INFO ]: Start isEmpty. Operand 9 states and 17 transitions. [2018-06-24 21:42:42,692 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:42:42,692 INFO ]: Found error trace [2018-06-24 21:42:42,692 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:42,692 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:42,693 INFO ]: Analyzing trace with hash -1212295958, now seen corresponding path program 2 times [2018-06-24 21:42:42,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:42,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:42,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:42,693 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:42,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:42,704 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:42,936 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:42,936 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:42,936 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 21:42:42,945 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:42:42,962 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:42:42,962 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:42,964 INFO ]: Computing forward predicates... [2018-06-24 21:42:42,971 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:43,002 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:43,002 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 21:42:43,003 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:42:43,003 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:42:43,003 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:42:43,003 INFO ]: Start difference. First operand 9 states and 17 transitions. Second operand 6 states. [2018-06-24 21:42:43,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:43,083 INFO ]: Finished difference Result 12 states and 26 transitions. [2018-06-24 21:42:43,084 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:42:43,084 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 21:42:43,084 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:43,084 INFO ]: With dead ends: 12 [2018-06-24 21:42:43,084 INFO ]: Without dead ends: 12 [2018-06-24 21:42:43,085 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:42:43,085 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:42:43,086 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-24 21:42:43,086 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:42:43,086 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2018-06-24 21:42:43,087 INFO ]: Start accepts. Automaton has 10 states and 20 transitions. Word has length 8 [2018-06-24 21:42:43,087 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:43,087 INFO ]: Abstraction has 10 states and 20 transitions. [2018-06-24 21:42:43,087 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:42:43,087 INFO ]: Start isEmpty. Operand 10 states and 20 transitions. [2018-06-24 21:42:43,087 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:42:43,087 INFO ]: Found error trace [2018-06-24 21:42:43,087 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:43,087 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:43,087 INFO ]: Analyzing trace with hash 1072281827, now seen corresponding path program 3 times [2018-06-24 21:42:43,087 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:43,087 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:43,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:43,089 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:43,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:43,102 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:43,141 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:42:43,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:43,141 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 21:42:43,151 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:42:43,181 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:42:43,181 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:43,183 INFO ]: Computing forward predicates... [2018-06-24 21:42:43,329 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:43,349 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:43,349 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2018-06-24 21:42:43,350 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:42:43,350 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:42:43,350 INFO ]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:42:43,351 INFO ]: Start difference. First operand 10 states and 20 transitions. Second operand 9 states. [2018-06-24 21:42:44,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:44,118 INFO ]: Finished difference Result 23 states and 59 transitions. [2018-06-24 21:42:44,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 21:42:44,119 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-24 21:42:44,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:44,120 INFO ]: With dead ends: 23 [2018-06-24 21:42:44,120 INFO ]: Without dead ends: 23 [2018-06-24 21:42:44,120 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:42:44,120 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 21:42:44,122 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 11. [2018-06-24 21:42:44,123 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:42:44,124 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-06-24 21:42:44,124 INFO ]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 9 [2018-06-24 21:42:44,124 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:44,124 INFO ]: Abstraction has 11 states and 23 transitions. [2018-06-24 21:42:44,124 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:42:44,124 INFO ]: Start isEmpty. Operand 11 states and 23 transitions. [2018-06-24 21:42:44,125 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:42:44,125 INFO ]: Found error trace [2018-06-24 21:42:44,125 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-24 21:42:44,125 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:44,125 INFO ]: Analyzing trace with hash -1119327349, now seen corresponding path program 4 times [2018-06-24 21:42:44,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:44,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:44,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:44,126 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:44,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:44,152 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:44,212 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:44,213 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:44,213 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 21:42:44,220 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:42:44,231 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:42:44,231 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:44,233 INFO ]: Computing forward predicates... [2018-06-24 21:42:44,241 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:44,267 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:44,267 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 21:42:44,267 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:42:44,268 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:42:44,268 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:42:44,268 INFO ]: Start difference. First operand 11 states and 23 transitions. Second operand 8 states. [2018-06-24 21:42:44,351 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:44,351 INFO ]: Finished difference Result 17 states and 41 transitions. [2018-06-24 21:42:44,351 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:42:44,351 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-24 21:42:44,352 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:44,352 INFO ]: With dead ends: 17 [2018-06-24 21:42:44,352 INFO ]: Without dead ends: 17 [2018-06-24 21:42:44,352 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:42:44,352 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:42:44,354 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-06-24 21:42:44,354 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:42:44,355 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2018-06-24 21:42:44,355 INFO ]: Start accepts. Automaton has 12 states and 26 transitions. Word has length 10 [2018-06-24 21:42:44,355 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:44,355 INFO ]: Abstraction has 12 states and 26 transitions. [2018-06-24 21:42:44,355 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:42:44,355 INFO ]: Start isEmpty. Operand 12 states and 26 transitions. [2018-06-24 21:42:44,355 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:42:44,355 INFO ]: Found error trace [2018-06-24 21:42:44,355 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2018-06-24 21:42:44,355 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:44,356 INFO ]: Analyzing trace with hash -368364220, now seen corresponding path program 5 times [2018-06-24 21:42:44,356 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:44,356 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:44,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:44,356 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:44,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:44,366 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:44,394 INFO ]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:42:44,394 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:44,394 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 21:42:44,400 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:42:44,428 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:42:44,428 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:44,429 INFO ]: Computing forward predicates... [2018-06-24 21:42:44,434 INFO ]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:42:44,468 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:44,468 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 21:42:44,469 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:42:44,469 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:42:44,469 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:42:44,469 INFO ]: Start difference. First operand 12 states and 26 transitions. Second operand 5 states. [2018-06-24 21:42:44,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:44,589 INFO ]: Finished difference Result 30 states and 80 transitions. [2018-06-24 21:42:44,590 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:42:44,590 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-24 21:42:44,590 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:44,591 INFO ]: With dead ends: 30 [2018-06-24 21:42:44,591 INFO ]: Without dead ends: 30 [2018-06-24 21:42:44,591 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:42:44,591 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 21:42:44,593 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 12. [2018-06-24 21:42:44,593 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:42:44,593 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2018-06-24 21:42:44,593 INFO ]: Start accepts. Automaton has 12 states and 26 transitions. Word has length 11 [2018-06-24 21:42:44,594 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:44,594 INFO ]: Abstraction has 12 states and 26 transitions. [2018-06-24 21:42:44,594 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:42:44,594 INFO ]: Start isEmpty. Operand 12 states and 26 transitions. [2018-06-24 21:42:44,594 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:42:44,594 INFO ]: Found error trace [2018-06-24 21:42:44,594 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2018-06-24 21:42:44,594 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:44,594 INFO ]: Analyzing trace with hash -339735069, now seen corresponding path program 6 times [2018-06-24 21:42:44,594 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:44,594 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:44,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:44,595 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:44,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:44,604 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:44,660 INFO ]: Checked inductivity of 21 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:42:44,660 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:44,660 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 21:42:44,666 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:42:44,716 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 21:42:44,716 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:44,717 INFO ]: Computing forward predicates... [2018-06-24 21:42:44,791 INFO ]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:42:44,812 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:44,812 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-06-24 21:42:44,812 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:42:44,812 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:42:44,812 INFO ]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:42:44,812 INFO ]: Start difference. First operand 12 states and 26 transitions. Second operand 8 states. [2018-06-24 21:42:44,962 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:44,962 INFO ]: Finished difference Result 34 states and 85 transitions. [2018-06-24 21:42:44,963 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:42:44,963 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-24 21:42:44,963 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:44,964 INFO ]: With dead ends: 34 [2018-06-24 21:42:44,964 INFO ]: Without dead ends: 31 [2018-06-24 21:42:44,964 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:42:44,964 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 21:42:44,966 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 13. [2018-06-24 21:42:44,966 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:42:44,967 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2018-06-24 21:42:44,967 INFO ]: Start accepts. Automaton has 13 states and 27 transitions. Word has length 11 [2018-06-24 21:42:44,969 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:44,969 INFO ]: Abstraction has 13 states and 27 transitions. [2018-06-24 21:42:44,969 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:42:44,969 INFO ]: Start isEmpty. Operand 13 states and 27 transitions. [2018-06-24 21:42:44,970 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:42:44,970 INFO ]: Found error trace [2018-06-24 21:42:44,970 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:44,970 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:44,970 INFO ]: Analyzing trace with hash -1745664660, now seen corresponding path program 1 times [2018-06-24 21:42:44,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:44,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:44,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:44,971 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:44,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:44,985 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:45,049 INFO ]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:42:45,049 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:45,049 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:45,049 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:45,049 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:45,050 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:45,050 INFO ]: Start difference. First operand 13 states and 27 transitions. Second operand 3 states. [2018-06-24 21:42:45,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:45,068 INFO ]: Finished difference Result 13 states and 20 transitions. [2018-06-24 21:42:45,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:45,068 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 21:42:45,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:45,068 INFO ]: With dead ends: 13 [2018-06-24 21:42:45,069 INFO ]: Without dead ends: 13 [2018-06-24 21:42:45,069 INFO ]: 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-06-24 21:42:45,069 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:42:45,070 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 21:42:45,070 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:42:45,070 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2018-06-24 21:42:45,070 INFO ]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 12 [2018-06-24 21:42:45,071 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:45,071 INFO ]: Abstraction has 13 states and 20 transitions. [2018-06-24 21:42:45,071 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:45,071 INFO ]: Start isEmpty. Operand 13 states and 20 transitions. [2018-06-24 21:42:45,071 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:42:45,071 INFO ]: Found error trace [2018-06-24 21:42:45,071 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:45,071 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:45,071 INFO ]: Analyzing trace with hash -1810308788, now seen corresponding path program 1 times [2018-06-24 21:42:45,071 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:45,071 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:45,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:45,072 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:45,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:45,088 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:45,177 INFO ]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:45,177 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:45,177 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 21:42:45,183 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:45,203 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:45,205 INFO ]: Computing forward predicates... [2018-06-24 21:42:45,213 INFO ]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:45,237 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:45,237 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 21:42:45,238 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:42:45,238 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:42:45,238 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:42:45,238 INFO ]: Start difference. First operand 13 states and 20 transitions. Second operand 9 states. [2018-06-24 21:42:45,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:45,259 INFO ]: Finished difference Result 14 states and 22 transitions. [2018-06-24 21:42:45,259 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:42:45,259 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-24 21:42:45,259 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:45,260 INFO ]: With dead ends: 14 [2018-06-24 21:42:45,260 INFO ]: Without dead ends: 14 [2018-06-24 21:42:45,260 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:42:45,260 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:42:45,261 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 21:42:45,261 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:42:45,262 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2018-06-24 21:42:45,262 INFO ]: Start accepts. Automaton has 14 states and 22 transitions. Word has length 12 [2018-06-24 21:42:45,262 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:45,262 INFO ]: Abstraction has 14 states and 22 transitions. [2018-06-24 21:42:45,262 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:42:45,262 INFO ]: Start isEmpty. Operand 14 states and 22 transitions. [2018-06-24 21:42:45,262 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:42:45,262 INFO ]: Found error trace [2018-06-24 21:42:45,262 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:45,262 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:45,263 INFO ]: Analyzing trace with hash -285323198, now seen corresponding path program 2 times [2018-06-24 21:42:45,263 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:45,263 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:45,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:45,263 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:45,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:45,280 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:45,386 INFO ]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:45,386 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:45,387 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 21:42:45,392 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:42:45,408 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:42:45,408 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:45,410 INFO ]: Computing forward predicates... [2018-06-24 21:42:45,420 INFO ]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:45,439 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:45,440 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 21:42:45,440 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:42:45,440 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:42:45,440 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:42:45,440 INFO ]: Start difference. First operand 14 states and 22 transitions. Second operand 10 states. [2018-06-24 21:42:45,523 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:45,523 INFO ]: Finished difference Result 15 states and 24 transitions. [2018-06-24 21:42:45,523 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:42:45,523 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-24 21:42:45,523 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:45,524 INFO ]: With dead ends: 15 [2018-06-24 21:42:45,524 INFO ]: Without dead ends: 15 [2018-06-24 21:42:45,524 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:42:45,524 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:42:45,525 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 21:42:45,525 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:42:45,526 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2018-06-24 21:42:45,526 INFO ]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 13 [2018-06-24 21:42:45,526 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:45,526 INFO ]: Abstraction has 15 states and 24 transitions. [2018-06-24 21:42:45,526 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:42:45,526 INFO ]: Start isEmpty. Operand 15 states and 24 transitions. [2018-06-24 21:42:45,528 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:42:45,528 INFO ]: Found error trace [2018-06-24 21:42:45,528 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:45,528 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:45,528 INFO ]: Analyzing trace with hash -255410164, now seen corresponding path program 3 times [2018-06-24 21:42:45,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:45,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:45,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:45,529 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:45,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:45,537 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:45,795 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:45,795 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:45,795 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 21:42:45,801 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:42:45,812 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:42:45,812 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:45,813 INFO ]: Computing forward predicates... [2018-06-24 21:42:45,867 INFO ]: Checked inductivity of 45 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 21:42:45,887 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:45,887 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2018-06-24 21:42:45,887 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:42:45,887 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:42:45,887 INFO ]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:42:45,888 INFO ]: Start difference. First operand 15 states and 24 transitions. Second operand 14 states. [2018-06-24 21:42:46,044 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:46,044 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-24 21:42:46,044 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:42:46,044 INFO ]: Start accepts. Automaton has 14 states. Word has length 14 [2018-06-24 21:42:46,044 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:46,044 INFO ]: With dead ends: 13 [2018-06-24 21:42:46,044 INFO ]: Without dead ends: 0 [2018-06-24 21:42:46,045 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=318, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:42:46,045 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:42:46,045 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:42:46,045 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:42:46,045 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:42:46,045 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-06-24 21:42:46,045 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:46,045 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:42:46,045 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:42:46,045 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:42:46,045 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:42:46,047 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:42:46,048 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:42:46 BasicIcfg [2018-06-24 21:42:46,048 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:42:46,049 INFO ]: Toolchain (without parser) took 4876.84 ms. Allocated memory was 307.2 MB in the beginning and 337.1 MB in the end (delta: 29.9 MB). Free memory was 263.6 MB in the beginning and 267.1 MB in the end (delta: -3.5 MB). Peak memory consumption was 26.4 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:46,050 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 307.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:42:46,050 INFO ]: ChcToBoogie took 56.47 ms. Allocated memory is still 307.2 MB. Free memory was 263.6 MB in the beginning and 261.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:46,051 INFO ]: Boogie Preprocessor took 32.26 ms. Allocated memory is still 307.2 MB. Free memory was 261.6 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:46,051 INFO ]: RCFGBuilder took 146.63 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 253.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:46,052 INFO ]: BlockEncodingV2 took 67.25 ms. Allocated memory is still 307.2 MB. Free memory was 253.6 MB in the beginning and 251.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:46,052 INFO ]: TraceAbstraction took 4565.39 ms. Allocated memory was 307.2 MB in the beginning and 337.1 MB in the end (delta: 29.9 MB). Free memory was 251.7 MB in the beginning and 267.1 MB in the end (delta: -15.5 MB). Peak memory consumption was 14.4 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:46,056 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 12 edges - StatisticsResult: Encoded RCFG 6 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 307.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.47 ms. Allocated memory is still 307.2 MB. Free memory was 263.6 MB in the beginning and 261.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 32.26 ms. Allocated memory is still 307.2 MB. Free memory was 261.6 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 146.63 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 253.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 67.25 ms. Allocated memory is still 307.2 MB. Free memory was 253.6 MB in the beginning and 251.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4565.39 ms. Allocated memory was 307.2 MB in the beginning and 337.1 MB in the end (delta: 29.9 MB). Free memory was 251.7 MB in the beginning and 267.1 MB in the end (delta: -15.5 MB). Peak memory consumption was 14.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 4.5s OverallTime, 13 OverallIterations, 8 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 1 SDslu, 123 SDs, 0 SdLazy, 178 SolverSat, 215 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=12, 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: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 61 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 225 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 4118 SizeOfPredicates, 8 NumberOfNonLiveVariables, 692 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 23 InterpolantComputations, 3 PerfectInterpolantSequences, 181/401 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__simple-loop.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-42-46-067.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__simple-loop.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-42-46-067.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__simple-loop.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-42-46-067.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__simple-loop.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-42-46-067.csv Received shutdown request...