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/sally-chc-benchmarks/misc/inc_cas_prop2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 22:22:22,892 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 22:22:22,894 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 22:22:22,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 22:22:22,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 22:22:22,911 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 22:22:22,914 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 22:22:22,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 22:22:22,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 22:22:22,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 22:22:22,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 22:22:22,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 22:22:22,920 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 22:22:22,921 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 22:22:22,922 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 22:22:22,923 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 22:22:22,925 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 22:22:22,926 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 22:22:22,928 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 22:22:22,929 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 22:22:22,930 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 22:22:22,932 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 22:22:22,933 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 22:22:22,933 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 22:22:22,934 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 22:22:22,935 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 22:22:22,935 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 22:22:22,936 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 22:22:22,937 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 22:22:22,938 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 22:22:22,938 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 22:22:22,939 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 22:22:22,939 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 22:22:22,940 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 22:22:22,940 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 22:22:22,941 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 22:22:22,954 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 22:22:22,955 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 22:22:22,955 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 22:22:22,955 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 22:22:22,956 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 22:22:22,956 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 22:22:22,957 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 22:22:22,957 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 22:22:22,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 22:22:22,957 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 22:22:22,958 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 22:22:22,958 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 22:22:22,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 22:22:22,958 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 22:22:22,958 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 22:22:22,959 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 22:22:22,959 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 22:22:22,959 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 22:22:22,959 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 22:22:22,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 22:22:22,959 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 22:22:22,961 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 22:22:22,961 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 22:22:23,002 INFO ]: Repository-Root is: /tmp [2018-06-24 22:22:23,019 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 22:22:23,026 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 22:22:23,027 INFO ]: Initializing SmtParser... [2018-06-24 22:22:23,028 INFO ]: SmtParser initialized [2018-06-24 22:22:23,028 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/sally-chc-benchmarks/misc/inc_cas_prop2.smt2 [2018-06-24 22:22:23,029 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 22:22:23,118 INFO ]: Executing SMT file /storage/chc-comp/sally-chc-benchmarks/misc/inc_cas_prop2.smt2 unknown [2018-06-24 22:22:23,326 INFO ]: Succesfully executed SMT file /storage/chc-comp/sally-chc-benchmarks/misc/inc_cas_prop2.smt2 [2018-06-24 22:22:23,332 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 22:22:23,338 INFO ]: Walking toolchain with 5 elements. [2018-06-24 22:22:23,338 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 22:22:23,338 INFO ]: Initializing ChcToBoogie... [2018-06-24 22:22:23,339 INFO ]: ChcToBoogie initialized [2018-06-24 22:22:23,342 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 10:22:23" (1/1) ... [2018-06-24 22:22:23,398 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:23 Unit [2018-06-24 22:22:23,398 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 22:22:23,399 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 22:22:23,399 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 22:22:23,399 INFO ]: Boogie Preprocessor initialized [2018-06-24 22:22:23,414 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:23" (1/1) ... [2018-06-24 22:22:23,414 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:23" (1/1) ... [2018-06-24 22:22:23,418 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:23" (1/1) ... [2018-06-24 22:22:23,418 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:23" (1/1) ... [2018-06-24 22:22:23,421 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:23" (1/1) ... [2018-06-24 22:22:23,423 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:23" (1/1) ... [2018-06-24 22:22:23,424 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:23" (1/1) ... [2018-06-24 22:22:23,426 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 22:22:23,427 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 22:22:23,427 INFO ]: Initializing RCFGBuilder... [2018-06-24 22:22:23,427 INFO ]: RCFGBuilder initialized [2018-06-24 22:22:23,427 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:23" (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 22:22:23,439 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 22:22:23,439 INFO ]: Found specification of procedure gotoProc [2018-06-24 22:22:23,439 INFO ]: Found implementation of procedure gotoProc [2018-06-24 22:22:23,439 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 22:22:23,439 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 22:22:23,439 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 22:22:23,665 INFO ]: Using library mode [2018-06-24 22:22:23,665 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:22:23 BoogieIcfgContainer [2018-06-24 22:22:23,666 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 22:22:23,666 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 22:22:23,666 INFO ]: Initializing BlockEncodingV2... [2018-06-24 22:22:23,667 INFO ]: BlockEncodingV2 initialized [2018-06-24 22:22:23,668 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:22:23" (1/1) ... [2018-06-24 22:22:23,681 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-24 22:22:23,682 INFO ]: Using Remove infeasible edges [2018-06-24 22:22:23,683 INFO ]: Using Maximize final states [2018-06-24 22:22:23,683 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 22:22:23,683 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 22:22:23,686 INFO ]: Using Remove sink states [2018-06-24 22:22:23,687 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 22:22:23,687 INFO ]: Using Use SBE [2018-06-24 22:22:23,768 INFO ]: SBE split 1 edges [2018-06-24 22:22:23,777 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 22:22:23,779 INFO ]: 0 new accepting states [2018-06-24 22:22:23,837 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 22:22:23,839 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 22:22:23,841 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 22:22:23,842 INFO ]: 0 new accepting states [2018-06-24 22:22:23,842 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 22:22:23,842 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 22:22:23,843 INFO ]: Encoded RCFG 6 locations, 37 edges [2018-06-24 22:22:23,843 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 10:22:23 BasicIcfg [2018-06-24 22:22:23,843 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 22:22:23,844 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 22:22:23,844 INFO ]: Initializing TraceAbstraction... [2018-06-24 22:22:23,847 INFO ]: TraceAbstraction initialized [2018-06-24 22:22:23,848 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 10:22:23" (1/4) ... [2018-06-24 22:22:23,848 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bba5a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 10:22:23, skipping insertion in model container [2018-06-24 22:22:23,849 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:22:23" (2/4) ... [2018-06-24 22:22:23,849 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bba5a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 10:22:23, skipping insertion in model container [2018-06-24 22:22:23,849 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:22:23" (3/4) ... [2018-06-24 22:22:23,849 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bba5a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 10:22:23, skipping insertion in model container [2018-06-24 22:22:23,849 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 10:22:23" (4/4) ... [2018-06-24 22:22:23,851 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 22:22:23,859 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 22:22:23,865 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 22:22:23,918 INFO ]: Using default assertion order modulation [2018-06-24 22:22:23,919 INFO ]: Interprodecural is true [2018-06-24 22:22:23,919 INFO ]: Hoare is false [2018-06-24 22:22:23,919 INFO ]: Compute interpolants for FPandBP [2018-06-24 22:22:23,919 INFO ]: Backedges is TWOTRACK [2018-06-24 22:22:23,919 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 22:22:23,919 INFO ]: Difference is false [2018-06-24 22:22:23,919 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 22:22:23,919 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 22:22:23,928 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 22:22:23,938 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 22:22:23,938 INFO ]: Found error trace [2018-06-24 22:22:23,938 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 22:22:23,938 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:23,942 INFO ]: Analyzing trace with hash 36386626, now seen corresponding path program 1 times [2018-06-24 22:22:23,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:23,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:23,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:23,981 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:23,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:24,020 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:24,068 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:24,070 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:22:24,070 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:22:24,071 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:22:24,081 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:22:24,082 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:22:24,084 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 22:22:24,706 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:24,706 INFO ]: Finished difference Result 7 states and 53 transitions. [2018-06-24 22:22:24,706 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:22:24,707 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 22:22:24,708 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:24,716 INFO ]: With dead ends: 7 [2018-06-24 22:22:24,716 INFO ]: Without dead ends: 7 [2018-06-24 22:22:24,718 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 22:22:24,733 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 22:22:24,751 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 22:22:24,753 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 22:22:24,753 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2018-06-24 22:22:24,755 INFO ]: Start accepts. Automaton has 7 states and 53 transitions. Word has length 5 [2018-06-24 22:22:24,756 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:24,756 INFO ]: Abstraction has 7 states and 53 transitions. [2018-06-24 22:22:24,756 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:22:24,756 INFO ]: Start isEmpty. Operand 7 states and 53 transitions. [2018-06-24 22:22:24,756 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:22:24,756 INFO ]: Found error trace [2018-06-24 22:22:24,756 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:22:24,756 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:24,756 INFO ]: Analyzing trace with hash 1127720329, now seen corresponding path program 1 times [2018-06-24 22:22:24,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:24,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:24,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:24,758 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:24,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:24,780 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:24,866 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:24,867 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:22:24,867 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:22:24,868 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:22:24,868 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:22:24,868 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:22:24,868 INFO ]: Start difference. First operand 7 states and 53 transitions. Second operand 3 states. [2018-06-24 22:22:25,441 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:25,441 INFO ]: Finished difference Result 9 states and 101 transitions. [2018-06-24 22:22:25,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:22:25,441 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 22:22:25,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:25,442 INFO ]: With dead ends: 9 [2018-06-24 22:22:25,442 INFO ]: Without dead ends: 9 [2018-06-24 22:22:25,443 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 22:22:25,443 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 22:22:25,446 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-24 22:22:25,446 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 22:22:25,446 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2018-06-24 22:22:25,446 INFO ]: Start accepts. Automaton has 8 states and 85 transitions. Word has length 6 [2018-06-24 22:22:25,446 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:25,447 INFO ]: Abstraction has 8 states and 85 transitions. [2018-06-24 22:22:25,447 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:22:25,447 INFO ]: Start isEmpty. Operand 8 states and 85 transitions. [2018-06-24 22:22:25,447 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 22:22:25,447 INFO ]: Found error trace [2018-06-24 22:22:25,447 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:22:25,447 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:25,447 INFO ]: Analyzing trace with hash 599118217, now seen corresponding path program 1 times [2018-06-24 22:22:25,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:25,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:25,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:25,448 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:25,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:25,464 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:25,487 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:25,487 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:22:25,487 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:22:25,487 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:22:25,487 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:22:25,487 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:22:25,488 INFO ]: Start difference. First operand 8 states and 85 transitions. Second operand 3 states. [2018-06-24 22:22:25,816 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:25,816 INFO ]: Finished difference Result 11 states and 126 transitions. [2018-06-24 22:22:25,816 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:22:25,816 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 22:22:25,816 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:25,817 INFO ]: With dead ends: 11 [2018-06-24 22:22:25,817 INFO ]: Without dead ends: 11 [2018-06-24 22:22:25,817 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 22:22:25,817 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 22:22:25,820 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 22:22:25,820 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 22:22:25,821 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2018-06-24 22:22:25,821 INFO ]: Start accepts. Automaton has 11 states and 126 transitions. Word has length 7 [2018-06-24 22:22:25,821 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:25,821 INFO ]: Abstraction has 11 states and 126 transitions. [2018-06-24 22:22:25,822 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:22:25,822 INFO ]: Start isEmpty. Operand 11 states and 126 transitions. [2018-06-24 22:22:25,822 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 22:22:25,822 INFO ]: Found error trace [2018-06-24 22:22:25,822 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:22:25,822 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:25,822 INFO ]: Analyzing trace with hash 599416127, now seen corresponding path program 1 times [2018-06-24 22:22:25,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:25,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:25,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:25,823 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:25,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:25,835 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:25,896 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:22:25,896 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:22:25,896 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:22:25,897 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:22:25,897 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:22:25,897 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:22:25,897 INFO ]: Start difference. First operand 11 states and 126 transitions. Second operand 3 states. [2018-06-24 22:22:26,152 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:26,152 INFO ]: Finished difference Result 11 states and 85 transitions. [2018-06-24 22:22:26,152 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:22:26,152 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 22:22:26,152 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:26,153 INFO ]: With dead ends: 11 [2018-06-24 22:22:26,153 INFO ]: Without dead ends: 11 [2018-06-24 22:22:26,153 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 22:22:26,153 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 22:22:26,155 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 22:22:26,155 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 22:22:26,156 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-06-24 22:22:26,156 INFO ]: Start accepts. Automaton has 11 states and 85 transitions. Word has length 7 [2018-06-24 22:22:26,156 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:26,156 INFO ]: Abstraction has 11 states and 85 transitions. [2018-06-24 22:22:26,156 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:22:26,156 INFO ]: Start isEmpty. Operand 11 states and 85 transitions. [2018-06-24 22:22:26,157 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 22:22:26,157 INFO ]: Found error trace [2018-06-24 22:22:26,157 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:22:26,157 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:26,157 INFO ]: Analyzing trace with hash 1609647274, now seen corresponding path program 1 times [2018-06-24 22:22:26,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:26,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:26,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:26,158 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:26,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:26,177 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:26,240 INFO ]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:22:26,241 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:22:26,241 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 22:22:26,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:26,278 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:26,285 INFO ]: Computing forward predicates... [2018-06-24 22:22:26,331 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 22:22:26,353 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 22:22:26,353 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-24 22:22:26,353 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:22:26,353 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:22:26,353 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:22:26,353 INFO ]: Start difference. First operand 11 states and 85 transitions. Second operand 5 states. [2018-06-24 22:22:26,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:26,614 INFO ]: Finished difference Result 23 states and 215 transitions. [2018-06-24 22:22:26,615 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 22:22:26,615 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 22:22:26,615 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:26,616 INFO ]: With dead ends: 23 [2018-06-24 22:22:26,616 INFO ]: Without dead ends: 23 [2018-06-24 22:22:26,617 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 22:22:26,617 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 22:22:26,620 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-06-24 22:22:26,621 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 22:22:26,622 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 175 transitions. [2018-06-24 22:22:26,622 INFO ]: Start accepts. Automaton has 20 states and 175 transitions. Word has length 8 [2018-06-24 22:22:26,622 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:26,622 INFO ]: Abstraction has 20 states and 175 transitions. [2018-06-24 22:22:26,622 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:22:26,622 INFO ]: Start isEmpty. Operand 20 states and 175 transitions. [2018-06-24 22:22:26,622 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 22:22:26,622 INFO ]: Found error trace [2018-06-24 22:22:26,622 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:22:26,623 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:26,623 INFO ]: Analyzing trace with hash -1641462537, now seen corresponding path program 1 times [2018-06-24 22:22:26,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:26,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:26,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:26,624 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:26,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:26,645 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:26,730 INFO ]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:26,730 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:22:26,730 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 22:22:26,737 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:26,792 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:26,796 INFO ]: Computing forward predicates... [2018-06-24 22:22:26,860 INFO ]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:26,888 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:22:26,888 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 22:22:26,889 INFO ]: Interpolant automaton has 8 states [2018-06-24 22:22:26,889 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 22:22:26,889 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-24 22:22:26,889 INFO ]: Start difference. First operand 20 states and 175 transitions. Second operand 8 states. [2018-06-24 22:22:28,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:28,463 INFO ]: Finished difference Result 74 states and 589 transitions. [2018-06-24 22:22:28,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 22:22:28,464 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 22:22:28,464 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:28,466 INFO ]: With dead ends: 74 [2018-06-24 22:22:28,466 INFO ]: Without dead ends: 58 [2018-06-24 22:22:28,467 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-06-24 22:22:28,467 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 22:22:28,478 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-06-24 22:22:28,478 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-24 22:22:28,481 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 467 transitions. [2018-06-24 22:22:28,481 INFO ]: Start accepts. Automaton has 56 states and 467 transitions. Word has length 9 [2018-06-24 22:22:28,481 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:28,481 INFO ]: Abstraction has 56 states and 467 transitions. [2018-06-24 22:22:28,481 INFO ]: Interpolant automaton has 8 states. [2018-06-24 22:22:28,481 INFO ]: Start isEmpty. Operand 56 states and 467 transitions. [2018-06-24 22:22:28,482 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 22:22:28,482 INFO ]: Found error trace [2018-06-24 22:22:28,482 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:22:28,482 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:28,482 INFO ]: Analyzing trace with hash -1663805787, now seen corresponding path program 2 times [2018-06-24 22:22:28,482 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:28,483 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:28,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:28,483 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:28,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:28,497 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:28,572 INFO ]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:28,572 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:22:28,572 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 22:22:28,581 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 22:22:28,609 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 22:22:28,609 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:28,612 INFO ]: Computing forward predicates... [2018-06-24 22:22:28,665 INFO ]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:28,688 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:22:28,688 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 22:22:28,688 INFO ]: Interpolant automaton has 8 states [2018-06-24 22:22:28,688 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 22:22:28,688 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 22:22:28,688 INFO ]: Start difference. First operand 56 states and 467 transitions. Second operand 8 states. [2018-06-24 22:22:29,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:29,259 INFO ]: Finished difference Result 82 states and 625 transitions. [2018-06-24 22:22:29,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 22:22:29,260 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 22:22:29,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:29,262 INFO ]: With dead ends: 82 [2018-06-24 22:22:29,262 INFO ]: Without dead ends: 82 [2018-06-24 22:22:29,262 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-06-24 22:22:29,262 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-24 22:22:29,274 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 70. [2018-06-24 22:22:29,274 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-24 22:22:29,277 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 557 transitions. [2018-06-24 22:22:29,277 INFO ]: Start accepts. Automaton has 70 states and 557 transitions. Word has length 9 [2018-06-24 22:22:29,277 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:29,277 INFO ]: Abstraction has 70 states and 557 transitions. [2018-06-24 22:22:29,277 INFO ]: Interpolant automaton has 8 states. [2018-06-24 22:22:29,277 INFO ]: Start isEmpty. Operand 70 states and 557 transitions. [2018-06-24 22:22:29,278 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 22:22:29,278 INFO ]: Found error trace [2018-06-24 22:22:29,278 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:22:29,278 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:29,278 INFO ]: Analyzing trace with hash -1290524557, now seen corresponding path program 1 times [2018-06-24 22:22:29,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:29,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:29,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:29,279 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:22:29,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:29,291 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:29,342 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:29,342 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:22:29,342 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 22:22:29,348 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:29,386 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:29,389 INFO ]: Computing forward predicates... [2018-06-24 22:22:29,583 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:29,603 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:22:29,603 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 22:22:29,603 INFO ]: Interpolant automaton has 7 states [2018-06-24 22:22:29,603 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 22:22:29,603 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 22:22:29,603 INFO ]: Start difference. First operand 70 states and 557 transitions. Second operand 7 states. [2018-06-24 22:22:30,179 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:30,179 INFO ]: Finished difference Result 185 states and 1567 transitions. [2018-06-24 22:22:30,182 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 22:22:30,182 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 22:22:30,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:30,186 INFO ]: With dead ends: 185 [2018-06-24 22:22:30,186 INFO ]: Without dead ends: 185 [2018-06-24 22:22:30,187 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 22:22:30,187 INFO ]: Start minimizeSevpa. Operand 185 states. [2018-06-24 22:22:30,206 INFO ]: Finished minimizeSevpa. Reduced states from 185 to 140. [2018-06-24 22:22:30,206 INFO ]: Start removeUnreachable. Operand 140 states. [2018-06-24 22:22:30,210 INFO ]: Finished removeUnreachable. Reduced from 140 states to 140 states and 1226 transitions. [2018-06-24 22:22:30,210 INFO ]: Start accepts. Automaton has 140 states and 1226 transitions. Word has length 9 [2018-06-24 22:22:30,210 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:30,210 INFO ]: Abstraction has 140 states and 1226 transitions. [2018-06-24 22:22:30,210 INFO ]: Interpolant automaton has 7 states. [2018-06-24 22:22:30,210 INFO ]: Start isEmpty. Operand 140 states and 1226 transitions. [2018-06-24 22:22:30,212 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 22:22:30,212 INFO ]: Found error trace [2018-06-24 22:22:30,212 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:22:30,212 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:30,213 INFO ]: Analyzing trace with hash 1483277444, now seen corresponding path program 1 times [2018-06-24 22:22:30,213 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:30,213 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:30,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:30,213 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:30,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:30,223 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:30,260 INFO ]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:30,260 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:22:30,260 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 22:22:30,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:30,304 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:30,307 INFO ]: Computing forward predicates... [2018-06-24 22:22:30,380 INFO ]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:30,399 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:22:30,399 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 22:22:30,400 INFO ]: Interpolant automaton has 8 states [2018-06-24 22:22:30,400 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 22:22:30,400 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 22:22:30,400 INFO ]: Start difference. First operand 140 states and 1226 transitions. Second operand 8 states. [2018-06-24 22:22:31,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:31,121 INFO ]: Finished difference Result 211 states and 1632 transitions. [2018-06-24 22:22:31,124 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 22:22:31,124 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 22:22:31,124 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:31,128 INFO ]: With dead ends: 211 [2018-06-24 22:22:31,128 INFO ]: Without dead ends: 211 [2018-06-24 22:22:31,128 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-24 22:22:31,129 INFO ]: Start minimizeSevpa. Operand 211 states. [2018-06-24 22:22:31,144 INFO ]: Finished minimizeSevpa. Reduced states from 211 to 140. [2018-06-24 22:22:31,144 INFO ]: Start removeUnreachable. Operand 140 states. [2018-06-24 22:22:31,147 INFO ]: Finished removeUnreachable. Reduced from 140 states to 140 states and 1098 transitions. [2018-06-24 22:22:31,147 INFO ]: Start accepts. Automaton has 140 states and 1098 transitions. Word has length 9 [2018-06-24 22:22:31,147 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:31,147 INFO ]: Abstraction has 140 states and 1098 transitions. [2018-06-24 22:22:31,147 INFO ]: Interpolant automaton has 8 states. [2018-06-24 22:22:31,147 INFO ]: Start isEmpty. Operand 140 states and 1098 transitions. [2018-06-24 22:22:31,149 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 22:22:31,149 INFO ]: Found error trace [2018-06-24 22:22:31,149 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:22:31,149 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:31,149 INFO ]: Analyzing trace with hash 1460934194, now seen corresponding path program 2 times [2018-06-24 22:22:31,149 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:31,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:31,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:31,150 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:31,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:31,158 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:31,219 INFO ]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:31,219 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:22:31,219 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 22:22:31,226 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 22:22:31,280 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 22:22:31,280 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:31,282 INFO ]: Computing forward predicates... [2018-06-24 22:22:31,362 INFO ]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:31,381 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:22:31,381 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 22:22:31,381 INFO ]: Interpolant automaton has 8 states [2018-06-24 22:22:31,381 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 22:22:31,381 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-24 22:22:31,381 INFO ]: Start difference. First operand 140 states and 1098 transitions. Second operand 8 states. [2018-06-24 22:22:31,943 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:31,943 INFO ]: Finished difference Result 212 states and 1548 transitions. [2018-06-24 22:22:31,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 22:22:31,943 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 22:22:31,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:31,946 INFO ]: With dead ends: 212 [2018-06-24 22:22:31,946 INFO ]: Without dead ends: 164 [2018-06-24 22:22:31,946 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-24 22:22:31,946 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-24 22:22:31,976 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 137. [2018-06-24 22:22:31,977 INFO ]: Start removeUnreachable. Operand 137 states. [2018-06-24 22:22:31,979 INFO ]: Finished removeUnreachable. Reduced from 137 states to 137 states and 1068 transitions. [2018-06-24 22:22:31,979 INFO ]: Start accepts. Automaton has 137 states and 1068 transitions. Word has length 9 [2018-06-24 22:22:31,979 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:31,979 INFO ]: Abstraction has 137 states and 1068 transitions. [2018-06-24 22:22:31,979 INFO ]: Interpolant automaton has 8 states. [2018-06-24 22:22:31,979 INFO ]: Start isEmpty. Operand 137 states and 1068 transitions. [2018-06-24 22:22:31,981 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 22:22:31,981 INFO ]: Found error trace [2018-06-24 22:22:31,981 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:22:31,981 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:31,981 INFO ]: Analyzing trace with hash 937297787, now seen corresponding path program 1 times [2018-06-24 22:22:31,981 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:31,981 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:31,982 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:31,982 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:22:31,982 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:31,990 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:32,055 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:32,055 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:22:32,055 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 22:22:32,067 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:32,102 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:32,104 INFO ]: Computing forward predicates... [2018-06-24 22:22:32,204 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:22:32,223 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:22:32,223 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 22:22:32,223 INFO ]: Interpolant automaton has 7 states [2018-06-24 22:22:32,224 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 22:22:32,224 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 22:22:32,224 INFO ]: Start difference. First operand 137 states and 1068 transitions. Second operand 7 states. [2018-06-24 22:22:32,722 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:32,722 INFO ]: Finished difference Result 255 states and 1903 transitions. [2018-06-24 22:22:32,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 22:22:32,723 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 22:22:32,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:32,726 INFO ]: With dead ends: 255 [2018-06-24 22:22:32,726 INFO ]: Without dead ends: 255 [2018-06-24 22:22:32,727 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 22:22:32,727 INFO ]: Start minimizeSevpa. Operand 255 states. [2018-06-24 22:22:32,743 INFO ]: Finished minimizeSevpa. Reduced states from 255 to 199. [2018-06-24 22:22:32,743 INFO ]: Start removeUnreachable. Operand 199 states. [2018-06-24 22:22:32,745 INFO ]: Finished removeUnreachable. Reduced from 199 states to 199 states and 1498 transitions. [2018-06-24 22:22:32,746 INFO ]: Start accepts. Automaton has 199 states and 1498 transitions. Word has length 9 [2018-06-24 22:22:32,746 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:32,746 INFO ]: Abstraction has 199 states and 1498 transitions. [2018-06-24 22:22:32,746 INFO ]: Interpolant automaton has 7 states. [2018-06-24 22:22:32,746 INFO ]: Start isEmpty. Operand 199 states and 1498 transitions. [2018-06-24 22:22:32,747 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 22:22:32,748 INFO ]: Found error trace [2018-06-24 22:22:32,748 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:22:32,748 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:32,748 INFO ]: Analyzing trace with hash 1677025594, now seen corresponding path program 1 times [2018-06-24 22:22:32,748 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:32,748 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:32,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:32,748 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:32,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:32,754 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:32,811 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 22:22:32,811 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:22:32,811 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:22:32,812 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:22:32,812 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:22:32,812 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:22:32,812 INFO ]: Start difference. First operand 199 states and 1498 transitions. Second operand 3 states. [2018-06-24 22:22:32,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:32,935 INFO ]: Finished difference Result 199 states and 935 transitions. [2018-06-24 22:22:32,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:22:32,935 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 22:22:32,935 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:32,936 INFO ]: With dead ends: 199 [2018-06-24 22:22:32,936 INFO ]: Without dead ends: 191 [2018-06-24 22:22:32,937 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 22:22:32,937 INFO ]: Start minimizeSevpa. Operand 191 states. [2018-06-24 22:22:32,946 INFO ]: Finished minimizeSevpa. Reduced states from 191 to 181. [2018-06-24 22:22:32,946 INFO ]: Start removeUnreachable. Operand 181 states. [2018-06-24 22:22:32,948 INFO ]: Finished removeUnreachable. Reduced from 181 states to 181 states and 877 transitions. [2018-06-24 22:22:32,948 INFO ]: Start accepts. Automaton has 181 states and 877 transitions. Word has length 10 [2018-06-24 22:22:32,948 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:32,948 INFO ]: Abstraction has 181 states and 877 transitions. [2018-06-24 22:22:32,948 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:22:32,948 INFO ]: Start isEmpty. Operand 181 states and 877 transitions. [2018-06-24 22:22:32,950 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 22:22:32,950 INFO ]: Found error trace [2018-06-24 22:22:32,950 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:22:32,950 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:32,950 INFO ]: Analyzing trace with hash -438135990, now seen corresponding path program 1 times [2018-06-24 22:22:32,950 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:32,950 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:32,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:32,951 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:32,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:32,960 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:33,015 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 22:22:33,015 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:22:33,016 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:22:33,016 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:22:33,016 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:22:33,016 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:22:33,016 INFO ]: Start difference. First operand 181 states and 877 transitions. Second operand 3 states. [2018-06-24 22:22:33,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:33,093 INFO ]: Finished difference Result 148 states and 398 transitions. [2018-06-24 22:22:33,094 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:22:33,094 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 22:22:33,094 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:33,094 INFO ]: With dead ends: 148 [2018-06-24 22:22:33,094 INFO ]: Without dead ends: 35 [2018-06-24 22:22:33,094 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 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 22:22:33,094 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 22:22:33,096 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-06-24 22:22:33,096 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 22:22:33,096 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 78 transitions. [2018-06-24 22:22:33,096 INFO ]: Start accepts. Automaton has 27 states and 78 transitions. Word has length 10 [2018-06-24 22:22:33,097 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:33,097 INFO ]: Abstraction has 27 states and 78 transitions. [2018-06-24 22:22:33,097 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:22:33,097 INFO ]: Start isEmpty. Operand 27 states and 78 transitions. [2018-06-24 22:22:33,097 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 22:22:33,097 INFO ]: Found error trace [2018-06-24 22:22:33,097 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:22:33,097 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:22:33,097 INFO ]: Analyzing trace with hash -1630714655, now seen corresponding path program 1 times [2018-06-24 22:22:33,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:22:33,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:22:33,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:33,099 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:22:33,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:22:33,115 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:22:33,199 INFO ]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 22:22:33,199 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:22:33,199 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:22:33,199 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:22:33,199 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:22:33,199 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:22:33,199 INFO ]: Start difference. First operand 27 states and 78 transitions. Second operand 3 states. [2018-06-24 22:22:33,227 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:22:33,227 INFO ]: Finished difference Result 15 states and 30 transitions. [2018-06-24 22:22:33,227 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:22:33,227 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 22:22:33,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:22:33,227 INFO ]: With dead ends: 15 [2018-06-24 22:22:33,227 INFO ]: Without dead ends: 0 [2018-06-24 22:22:33,227 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 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 22:22:33,227 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 22:22:33,227 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 22:22:33,227 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 22:22:33,227 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 22:22:33,227 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-06-24 22:22:33,227 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:22:33,227 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 22:22:33,227 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:22:33,227 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 22:22:33,227 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 22:22:33,229 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 22:22:33,231 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 10:22:33 BasicIcfg [2018-06-24 22:22:33,231 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 22:22:33,232 INFO ]: Toolchain (without parser) took 9899.36 ms. Allocated memory was 307.2 MB in the beginning and 413.1 MB in the end (delta: 105.9 MB). Free memory was 262.6 MB in the beginning and 217.2 MB in the end (delta: 45.4 MB). Peak memory consumption was 151.4 MB. Max. memory is 3.6 GB. [2018-06-24 22:22:33,233 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 22:22:33,234 INFO ]: ChcToBoogie took 59.83 ms. Allocated memory is still 307.2 MB. Free memory was 262.6 MB in the beginning and 260.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 22:22:33,234 INFO ]: Boogie Preprocessor took 27.50 ms. Allocated memory is still 307.2 MB. Free memory was 260.6 MB in the beginning and 259.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-24 22:22:33,235 INFO ]: RCFGBuilder took 238.98 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 250.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:22:33,235 INFO ]: BlockEncodingV2 took 177.49 ms. Allocated memory is still 307.2 MB. Free memory was 250.5 MB in the beginning and 244.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 22:22:33,236 INFO ]: TraceAbstraction took 9386.72 ms. Allocated memory was 307.2 MB in the beginning and 413.1 MB in the end (delta: 105.9 MB). Free memory was 244.6 MB in the beginning and 217.2 MB in the end (delta: 27.4 MB). Peak memory consumption was 133.3 MB. Max. memory is 3.6 GB. [2018-06-24 22:22:33,242 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 37 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.83 ms. Allocated memory is still 307.2 MB. Free memory was 262.6 MB in the beginning and 260.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 27.50 ms. Allocated memory is still 307.2 MB. Free memory was 260.6 MB in the beginning and 259.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 238.98 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 250.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 177.49 ms. Allocated memory is still 307.2 MB. Free memory was 250.5 MB in the beginning and 244.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 9386.72 ms. Allocated memory was 307.2 MB in the beginning and 413.1 MB in the end (delta: 105.9 MB). Free memory was 244.6 MB in the beginning and 217.2 MB in the end (delta: 27.4 MB). Peak memory consumption was 133.3 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, 9.3s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 6.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 64 SDtfs, 3 SDslu, 100 SDs, 0 SdLazy, 3577 SolverSat, 1286 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=11, 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 235 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2838 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1427 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 21 InterpolantComputations, 8 PerfectInterpolantSequences, 127/190 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/inc_cas_prop2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_22-22-33-266.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/inc_cas_prop2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_22-22-33-266.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/inc_cas_prop2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_22-22-33-266.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/inc_cas_prop2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_22-22-33-266.csv Received shutdown request...