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/eldarica-misc/LIA/Consistency/point-location.46.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:35:38,797 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:35:38,799 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:35:38,810 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:35:38,810 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:35:38,811 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:35:38,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:35:38,819 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:35:38,821 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:35:38,822 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:35:38,823 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:35:38,827 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:35:38,828 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:35:38,829 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:35:38,830 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:35:38,833 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:35:38,835 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:35:38,837 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:35:38,848 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:35:38,849 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:35:38,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:35:38,852 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:35:38,853 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:35:38,853 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:35:38,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:35:38,854 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:35:38,855 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:35:38,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:35:38,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:35:38,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:35:38,863 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:35:38,863 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:35:38,863 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:35:38,864 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:35:38,865 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:35:38,865 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:35:38,891 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:35:38,891 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:35:38,891 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:35:38,892 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:35:38,892 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:35:38,893 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:35:38,893 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:35:38,893 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:35:38,893 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:35:38,893 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:35:38,894 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:35:38,894 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:35:38,894 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:35:38,894 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:35:38,894 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:35:38,895 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:35:38,895 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:35:38,895 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:35:38,895 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:35:38,895 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:35:38,895 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:35:38,898 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:35:38,898 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:35:38,941 INFO ]: Repository-Root is: /tmp [2018-06-24 20:35:38,960 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:35:38,965 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:35:38,967 INFO ]: Initializing SmtParser... [2018-06-24 20:35:38,967 INFO ]: SmtParser initialized [2018-06-24 20:35:38,967 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.46.smt2 [2018-06-24 20:35:38,969 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 20:35:39,055 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.46.smt2 unknown [2018-06-24 20:35:39,454 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/point-location.46.smt2 [2018-06-24 20:35:39,458 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:35:39,464 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:35:39,464 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:35:39,464 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:35:39,464 INFO ]: ChcToBoogie initialized [2018-06-24 20:35:39,467 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:35:39" (1/1) ... [2018-06-24 20:35:39,559 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:35:39 Unit [2018-06-24 20:35:39,559 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:35:39,561 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:35:39,562 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:35:39,562 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:35:39,581 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:35:39" (1/1) ... [2018-06-24 20:35:39,581 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:35:39" (1/1) ... [2018-06-24 20:35:39,592 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:35:39" (1/1) ... [2018-06-24 20:35:39,593 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:35:39" (1/1) ... [2018-06-24 20:35:39,624 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:35:39" (1/1) ... [2018-06-24 20:35:39,627 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:35:39" (1/1) ... [2018-06-24 20:35:39,630 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:35:39" (1/1) ... [2018-06-24 20:35:39,642 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:35:39,643 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:35:39,643 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:35:39,643 INFO ]: RCFGBuilder initialized [2018-06-24 20:35:39,644 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:35:39" (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 20:35:39,667 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:35:39,667 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:35:39,667 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:35:39,667 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:35:39,667 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:35:39,667 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 20:35:41,109 INFO ]: Using library mode [2018-06-24 20:35:41,110 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:35:41 BoogieIcfgContainer [2018-06-24 20:35:41,110 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:35:41,111 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:35:41,111 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:35:41,112 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:35:41,112 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:35:41" (1/1) ... [2018-06-24 20:35:41,153 INFO ]: Initial Icfg 147 locations, 281 edges [2018-06-24 20:35:41,155 INFO ]: Using Remove infeasible edges [2018-06-24 20:35:41,155 INFO ]: Using Maximize final states [2018-06-24 20:35:41,156 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:35:41,156 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:35:41,158 INFO ]: Using Remove sink states [2018-06-24 20:35:41,158 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:35:41,158 INFO ]: Using Use SBE [2018-06-24 20:35:41,171 INFO ]: SBE split 0 edges [2018-06-24 20:35:41,177 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:35:41,179 INFO ]: 0 new accepting states [2018-06-24 20:35:41,765 INFO ]: Removed 52 edges and 9 locations by large block encoding [2018-06-24 20:35:41,769 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-24 20:35:41,772 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:35:41,773 INFO ]: 0 new accepting states [2018-06-24 20:35:41,775 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:35:41,776 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:35:41,778 INFO ]: Encoded RCFG 135 locations, 268 edges [2018-06-24 20:35:41,779 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:35:41 BasicIcfg [2018-06-24 20:35:41,779 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:35:41,780 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:35:41,780 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:35:41,784 INFO ]: TraceAbstraction initialized [2018-06-24 20:35:41,785 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:35:39" (1/4) ... [2018-06-24 20:35:41,786 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2784f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:35:41, skipping insertion in model container [2018-06-24 20:35:41,786 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:35:39" (2/4) ... [2018-06-24 20:35:41,786 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2784f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:35:41, skipping insertion in model container [2018-06-24 20:35:41,786 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:35:41" (3/4) ... [2018-06-24 20:35:41,786 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2784f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:35:41, skipping insertion in model container [2018-06-24 20:35:41,786 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:35:41" (4/4) ... [2018-06-24 20:35:41,788 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:35:41,800 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:35:41,808 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:35:41,852 INFO ]: Using default assertion order modulation [2018-06-24 20:35:41,852 INFO ]: Interprodecural is true [2018-06-24 20:35:41,852 INFO ]: Hoare is false [2018-06-24 20:35:41,853 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:35:41,853 INFO ]: Backedges is TWOTRACK [2018-06-24 20:35:41,853 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:35:41,853 INFO ]: Difference is false [2018-06-24 20:35:41,853 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:35:41,853 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:35:41,871 INFO ]: Start isEmpty. Operand 135 states. [2018-06-24 20:35:41,914 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 20:35:41,914 INFO ]: Found error trace [2018-06-24 20:35:41,916 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 20:35:41,916 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:35:41,922 INFO ]: Analyzing trace with hash 5691243, now seen corresponding path program 1 times [2018-06-24 20:35:41,924 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:35:41,925 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:35:41,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:41,962 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:41,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:42,052 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:42,260 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:35:42,263 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:35:42,263 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:35:42,264 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:35:42,274 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:35:42,274 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:35:42,276 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-24 20:35:44,509 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:35:44,509 INFO ]: Finished difference Result 136 states and 366 transitions. [2018-06-24 20:35:44,510 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:35:44,511 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 20:35:44,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:35:44,546 INFO ]: With dead ends: 136 [2018-06-24 20:35:44,546 INFO ]: Without dead ends: 136 [2018-06-24 20:35:44,547 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 20:35:44,567 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-24 20:35:44,680 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-06-24 20:35:44,681 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-24 20:35:44,693 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 366 transitions. [2018-06-24 20:35:44,694 INFO ]: Start accepts. Automaton has 136 states and 366 transitions. Word has length 4 [2018-06-24 20:35:44,695 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:35:44,695 INFO ]: Abstraction has 136 states and 366 transitions. [2018-06-24 20:35:44,695 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:35:44,695 INFO ]: Start isEmpty. Operand 136 states and 366 transitions. [2018-06-24 20:35:44,706 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:35:44,706 INFO ]: Found error trace [2018-06-24 20:35:44,706 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:35:44,706 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:35:44,706 INFO ]: Analyzing trace with hash 176452294, now seen corresponding path program 1 times [2018-06-24 20:35:44,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:35:44,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:35:44,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:44,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:44,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:44,752 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:44,880 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:35:44,880 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:35:44,880 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:35:44,881 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:35:44,881 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:35:44,881 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:35:44,882 INFO ]: Start difference. First operand 136 states and 366 transitions. Second operand 3 states. [2018-06-24 20:35:46,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:35:46,645 INFO ]: Finished difference Result 269 states and 728 transitions. [2018-06-24 20:35:46,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:35:46,645 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:35:46,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:35:46,664 INFO ]: With dead ends: 269 [2018-06-24 20:35:46,664 INFO ]: Without dead ends: 269 [2018-06-24 20:35:46,665 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 20:35:46,666 INFO ]: Start minimizeSevpa. Operand 269 states. [2018-06-24 20:35:46,768 INFO ]: Finished minimizeSevpa. Reduced states from 269 to 268. [2018-06-24 20:35:46,768 INFO ]: Start removeUnreachable. Operand 268 states. [2018-06-24 20:35:46,777 INFO ]: Finished removeUnreachable. Reduced from 268 states to 268 states and 534 transitions. [2018-06-24 20:35:46,777 INFO ]: Start accepts. Automaton has 268 states and 534 transitions. Word has length 5 [2018-06-24 20:35:46,777 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:35:46,777 INFO ]: Abstraction has 268 states and 534 transitions. [2018-06-24 20:35:46,777 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:35:46,778 INFO ]: Start isEmpty. Operand 268 states and 534 transitions. [2018-06-24 20:35:46,804 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:35:46,804 INFO ]: Found error trace [2018-06-24 20:35:46,804 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:35:46,804 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:35:46,804 INFO ]: Analyzing trace with hash 1568026642, now seen corresponding path program 1 times [2018-06-24 20:35:46,804 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:35:46,804 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:35:46,805 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:46,805 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:46,805 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:46,831 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:46,916 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:35:46,916 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:35:46,916 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:35:46,916 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:35:46,916 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:35:46,916 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:35:46,916 INFO ]: Start difference. First operand 268 states and 534 transitions. Second operand 3 states. [2018-06-24 20:35:48,119 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:35:48,119 INFO ]: Finished difference Result 400 states and 797 transitions. [2018-06-24 20:35:48,120 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:35:48,120 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 20:35:48,120 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:35:48,131 INFO ]: With dead ends: 400 [2018-06-24 20:35:48,131 INFO ]: Without dead ends: 400 [2018-06-24 20:35:48,132 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 20:35:48,132 INFO ]: Start minimizeSevpa. Operand 400 states. [2018-06-24 20:35:48,198 INFO ]: Finished minimizeSevpa. Reduced states from 400 to 400. [2018-06-24 20:35:48,198 INFO ]: Start removeUnreachable. Operand 400 states. [2018-06-24 20:35:48,211 INFO ]: Finished removeUnreachable. Reduced from 400 states to 400 states and 797 transitions. [2018-06-24 20:35:48,211 INFO ]: Start accepts. Automaton has 400 states and 797 transitions. Word has length 9 [2018-06-24 20:35:48,211 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:35:48,211 INFO ]: Abstraction has 400 states and 797 transitions. [2018-06-24 20:35:48,211 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:35:48,211 INFO ]: Start isEmpty. Operand 400 states and 797 transitions. [2018-06-24 20:35:48,229 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:35:48,229 INFO ]: Found error trace [2018-06-24 20:35:48,229 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:35:48,229 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:35:48,229 INFO ]: Analyzing trace with hash 1975520270, now seen corresponding path program 1 times [2018-06-24 20:35:48,229 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:35:48,229 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:35:48,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:48,230 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:48,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:48,258 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:48,528 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:35:48,528 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:35:48,528 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:35:48,528 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:35:48,528 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:35:48,528 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:35:48,529 INFO ]: Start difference. First operand 400 states and 797 transitions. Second operand 5 states. [2018-06-24 20:35:50,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:35:50,031 INFO ]: Finished difference Result 1030 states and 2794 transitions. [2018-06-24 20:35:50,082 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:35:50,082 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:35:50,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:35:50,163 INFO ]: With dead ends: 1030 [2018-06-24 20:35:50,164 INFO ]: Without dead ends: 1030 [2018-06-24 20:35:50,164 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:35:50,165 INFO ]: Start minimizeSevpa. Operand 1030 states. [2018-06-24 20:35:50,409 INFO ]: Finished minimizeSevpa. Reduced states from 1030 to 799. [2018-06-24 20:35:50,409 INFO ]: Start removeUnreachable. Operand 799 states. [2018-06-24 20:35:50,491 INFO ]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1623 transitions. [2018-06-24 20:35:50,491 INFO ]: Start accepts. Automaton has 799 states and 1623 transitions. Word has length 9 [2018-06-24 20:35:50,491 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:35:50,491 INFO ]: Abstraction has 799 states and 1623 transitions. [2018-06-24 20:35:50,491 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:35:50,491 INFO ]: Start isEmpty. Operand 799 states and 1623 transitions. [2018-06-24 20:35:50,529 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:35:50,530 INFO ]: Found error trace [2018-06-24 20:35:50,530 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:35:50,530 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:35:50,530 INFO ]: Analyzing trace with hash -1246460750, now seen corresponding path program 1 times [2018-06-24 20:35:50,530 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:35:50,530 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:35:50,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:50,531 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:50,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:50,564 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:50,761 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:35:50,761 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:35:50,761 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:35:50,761 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:35:50,761 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:35:50,761 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:35:50,761 INFO ]: Start difference. First operand 799 states and 1623 transitions. Second operand 5 states. [2018-06-24 20:35:52,165 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:35:52,165 INFO ]: Finished difference Result 1160 states and 3204 transitions. [2018-06-24 20:35:52,165 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:35:52,165 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:35:52,165 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:35:52,248 INFO ]: With dead ends: 1160 [2018-06-24 20:35:52,248 INFO ]: Without dead ends: 1160 [2018-06-24 20:35:52,249 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:35:52,249 INFO ]: Start minimizeSevpa. Operand 1160 states. [2018-06-24 20:35:52,491 INFO ]: Finished minimizeSevpa. Reduced states from 1160 to 810. [2018-06-24 20:35:52,491 INFO ]: Start removeUnreachable. Operand 810 states. [2018-06-24 20:35:52,596 INFO ]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1683 transitions. [2018-06-24 20:35:52,596 INFO ]: Start accepts. Automaton has 810 states and 1683 transitions. Word has length 9 [2018-06-24 20:35:52,596 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:35:52,597 INFO ]: Abstraction has 810 states and 1683 transitions. [2018-06-24 20:35:52,597 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:35:52,597 INFO ]: Start isEmpty. Operand 810 states and 1683 transitions. [2018-06-24 20:35:52,637 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:35:52,637 INFO ]: Found error trace [2018-06-24 20:35:52,637 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:35:52,638 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:35:52,639 INFO ]: Analyzing trace with hash -298128393, now seen corresponding path program 1 times [2018-06-24 20:35:52,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:35:52,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:35:52,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:52,639 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:52,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:52,667 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:52,747 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:35:52,748 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:35:52,748 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:35:52,748 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:35:52,748 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:35:52,748 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:35:52,748 INFO ]: Start difference. First operand 810 states and 1683 transitions. Second operand 3 states. [2018-06-24 20:35:54,518 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:35:54,518 INFO ]: Finished difference Result 1132 states and 2347 transitions. [2018-06-24 20:35:54,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:35:54,518 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 20:35:54,519 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:35:54,581 INFO ]: With dead ends: 1132 [2018-06-24 20:35:54,581 INFO ]: Without dead ends: 1132 [2018-06-24 20:35:54,582 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 20:35:54,583 INFO ]: Start minimizeSevpa. Operand 1132 states. [2018-06-24 20:35:54,719 INFO ]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2018-06-24 20:35:54,720 INFO ]: Start removeUnreachable. Operand 1132 states. [2018-06-24 20:35:54,773 INFO ]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2347 transitions. [2018-06-24 20:35:54,773 INFO ]: Start accepts. Automaton has 1132 states and 2347 transitions. Word has length 10 [2018-06-24 20:35:54,773 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:35:54,773 INFO ]: Abstraction has 1132 states and 2347 transitions. [2018-06-24 20:35:54,773 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:35:54,773 INFO ]: Start isEmpty. Operand 1132 states and 2347 transitions. [2018-06-24 20:35:54,950 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:35:54,950 INFO ]: Found error trace [2018-06-24 20:35:54,950 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:35:54,951 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:35:54,952 INFO ]: Analyzing trace with hash 76429154, now seen corresponding path program 1 times [2018-06-24 20:35:54,952 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:35:54,952 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:35:54,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:54,953 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:35:54,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:35:54,976 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:35:55,201 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:35:55,201 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:35:55,248 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:35:55,249 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:35:55,249 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:35:55,249 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:35:55,249 INFO ]: Start difference. First operand 1132 states and 2347 transitions. Second operand 6 states. [2018-06-24 20:36:00,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:36:00,630 INFO ]: Finished difference Result 3128 states and 12241 transitions. [2018-06-24 20:36:00,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:36:00,630 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:36:00,631 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:36:01,083 INFO ]: With dead ends: 3128 [2018-06-24 20:36:01,084 INFO ]: Without dead ends: 2934 [2018-06-24 20:36:01,084 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:36:01,086 INFO ]: Start minimizeSevpa. Operand 2934 states. [2018-06-24 20:36:02,133 INFO ]: Finished minimizeSevpa. Reduced states from 2934 to 2036. [2018-06-24 20:36:02,133 INFO ]: Start removeUnreachable. Operand 2036 states. [2018-06-24 20:36:02,398 INFO ]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 5474 transitions. [2018-06-24 20:36:02,398 INFO ]: Start accepts. Automaton has 2036 states and 5474 transitions. Word has length 10 [2018-06-24 20:36:02,398 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:36:02,398 INFO ]: Abstraction has 2036 states and 5474 transitions. [2018-06-24 20:36:02,398 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:36:02,398 INFO ]: Start isEmpty. Operand 2036 states and 5474 transitions. [2018-06-24 20:36:02,421 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:36:02,421 INFO ]: Found error trace [2018-06-24 20:36:02,421 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:36:02,421 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:02,422 INFO ]: Analyzing trace with hash -1459092533, now seen corresponding path program 1 times [2018-06-24 20:36:02,422 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:02,422 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:02,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:02,423 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:02,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:02,447 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:02,822 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:36:02,822 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:36:02,822 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:36:02,823 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:36:02,823 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:36:02,823 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:36:02,823 INFO ]: Start difference. First operand 2036 states and 5474 transitions. Second operand 6 states. [2018-06-24 20:36:05,930 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:36:05,931 INFO ]: Finished difference Result 4097 states and 15668 transitions. [2018-06-24 20:36:05,949 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:36:05,949 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:36:05,949 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:36:06,496 INFO ]: With dead ends: 4097 [2018-06-24 20:36:06,496 INFO ]: Without dead ends: 3818 [2018-06-24 20:36:06,496 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:36:06,498 INFO ]: Start minimizeSevpa. Operand 3818 states. [2018-06-24 20:36:09,152 INFO ]: Finished minimizeSevpa. Reduced states from 3818 to 2408. [2018-06-24 20:36:09,152 INFO ]: Start removeUnreachable. Operand 2408 states. [2018-06-24 20:36:09,332 INFO ]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 6707 transitions. [2018-06-24 20:36:09,332 INFO ]: Start accepts. Automaton has 2408 states and 6707 transitions. Word has length 10 [2018-06-24 20:36:09,332 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:36:09,333 INFO ]: Abstraction has 2408 states and 6707 transitions. [2018-06-24 20:36:09,333 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:36:09,333 INFO ]: Start isEmpty. Operand 2408 states and 6707 transitions. [2018-06-24 20:36:09,391 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:36:09,391 INFO ]: Found error trace [2018-06-24 20:36:09,391 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:36:09,391 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:36:09,392 INFO ]: Analyzing trace with hash 1104966594, now seen corresponding path program 1 times [2018-06-24 20:36:09,392 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:36:09,392 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:36:09,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:09,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:09,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:36:09,415 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:09,784 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:36:09,784 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:36:09,784 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 20:36:09,797 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:36:09,891 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:36:09,901 INFO ]: Computing forward predicates... [2018-06-24 20:36:10,208 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:36:10,237 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:36:10,237 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 20:36:10,237 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:36:10,238 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:36:10,238 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:36:10,238 INFO ]: Start difference. First operand 2408 states and 6707 transitions. Second operand 10 states. [2018-06-24 20:36:21,798 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:36:21,798 INFO ]: Finished difference Result 8054 states and 60690 transitions. [2018-06-24 20:36:21,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:36:21,799 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:36:21,799 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:36:24,158 INFO ]: With dead ends: 8054 [2018-06-24 20:36:24,158 INFO ]: Without dead ends: 8054 [2018-06-24 20:36:24,158 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:36:24,163 INFO ]: Start minimizeSevpa. Operand 8054 states. Received shutdown request... [2018-06-24 20:36:30,956 WARN ]: Verification canceled [2018-06-24 20:36:30,958 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:36:30,960 WARN ]: Timeout [2018-06-24 20:36:30,960 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:36:30 BasicIcfg [2018-06-24 20:36:30,960 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:36:30,961 INFO ]: Toolchain (without parser) took 51501.89 ms. Allocated memory was 309.3 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 252.7 MB in the beginning and 1.1 GB in the end (delta: -808.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 3.6 GB. [2018-06-24 20:36:30,963 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:36:30,963 INFO ]: ChcToBoogie took 96.87 ms. Allocated memory is still 309.3 MB. Free memory was 252.7 MB in the beginning and 248.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:36:30,964 INFO ]: Boogie Preprocessor took 81.06 ms. Allocated memory is still 309.3 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:36:30,965 INFO ]: RCFGBuilder took 1467.47 ms. Allocated memory was 309.3 MB in the beginning and 326.6 MB in the end (delta: 17.3 MB). Free memory was 246.8 MB in the beginning and 292.7 MB in the end (delta: -46.0 MB). Peak memory consumption was 65.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:36:30,969 INFO ]: BlockEncodingV2 took 667.90 ms. Allocated memory is still 326.6 MB. Free memory was 292.7 MB in the beginning and 249.3 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 3.6 GB. [2018-06-24 20:36:30,969 INFO ]: TraceAbstraction took 49180.16 ms. Allocated memory was 326.6 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 247.8 MB in the beginning and 1.1 GB in the end (delta: -813.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 3.6 GB. [2018-06-24 20:36:30,978 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 147 locations, 281 edges - StatisticsResult: Encoded RCFG 135 locations, 268 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 96.87 ms. Allocated memory is still 309.3 MB. Free memory was 252.7 MB in the beginning and 248.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 81.06 ms. Allocated memory is still 309.3 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1467.47 ms. Allocated memory was 309.3 MB in the beginning and 326.6 MB in the end (delta: 17.3 MB). Free memory was 246.8 MB in the beginning and 292.7 MB in the end (delta: -46.0 MB). Peak memory consumption was 65.3 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 667.90 ms. Allocated memory is still 326.6 MB. Free memory was 292.7 MB in the beginning and 249.3 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 3.6 GB. * TraceAbstraction took 49180.16 ms. Allocated memory was 326.6 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 247.8 MB in the beginning and 1.1 GB in the end (delta: -813.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. TIMEOUT Result, 49.1s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 33.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7711 SDtfs, 1042 SDslu, 23474 SDs, 0 SdLazy, 12905 SolverSat, 3114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2408occurred in iteration=8, 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: 12.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 2890 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 1080 SizeOfPredicates, 4 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 17/19 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.46.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-36-30-991.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.46.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-36-30-991.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.46.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-36-30-991.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/point-location.46.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-36-30-991.csv Completed graceful shutdown