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/HOLA/42.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:45:33,976 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:45:33,978 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:45:33,993 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:45:33,994 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:45:33,995 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:45:33,997 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:45:34,000 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:45:34,002 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:45:34,004 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:45:34,005 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:45:34,005 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:45:34,006 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:45:34,007 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:45:34,011 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:45:34,012 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:45:34,015 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:45:34,016 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:45:34,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:45:34,028 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:45:34,029 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:45:34,030 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:45:34,033 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:45:34,033 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:45:34,034 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:45:34,034 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:45:34,035 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:45:34,036 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:45:34,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:45:34,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:45:34,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:45:34,038 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:45:34,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:45:34,039 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:45:34,040 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:45:34,041 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:45:34,041 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:45:34,056 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:45:34,058 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:45:34,058 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:45:34,058 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:45:34,060 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:45:34,060 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:45:34,060 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:45:34,060 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:45:34,060 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:45:34,061 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:45:34,061 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:45:34,061 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:45:34,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:45:34,061 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:45:34,061 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:45:34,062 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:45:34,062 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:45:34,062 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:45:34,062 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:45:34,062 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:45:34,063 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:45:34,064 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:45:34,064 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:45:34,121 INFO ]: Repository-Root is: /tmp [2018-06-26 17:45:34,137 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:45:34,141 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:45:34,142 INFO ]: Initializing SmtParser... [2018-06-26 17:45:34,142 INFO ]: SmtParser initialized [2018-06-26 17:45:34,145 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/42.c.smt2 [2018-06-26 17:45:34,146 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-26 17:45:34,244 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/42.c.smt2 unknown [2018-06-26 17:45:34,713 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/42.c.smt2 [2018-06-26 17:45:34,718 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:45:34,733 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:45:34,733 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:45:34,733 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:45:34,733 INFO ]: ChcToBoogie initialized [2018-06-26 17:45:34,742 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:45:34" (1/1) ... [2018-06-26 17:45:34,851 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:45:34 Unit [2018-06-26 17:45:34,851 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:45:34,852 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:45:34,852 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:45:34,852 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:45:34,874 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:45:34" (1/1) ... [2018-06-26 17:45:34,874 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:45:34" (1/1) ... [2018-06-26 17:45:34,896 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:45:34" (1/1) ... [2018-06-26 17:45:34,896 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:45:34" (1/1) ... [2018-06-26 17:45:34,907 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:45:34" (1/1) ... [2018-06-26 17:45:34,909 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:45:34" (1/1) ... [2018-06-26 17:45:34,911 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:45:34" (1/1) ... [2018-06-26 17:45:34,924 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:45:34,929 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:45:34,929 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:45:34,929 INFO ]: RCFGBuilder initialized [2018-06-26 17:45:34,930 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:45:34" (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-26 17:45:34,940 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:45:34,940 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:45:34,940 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:45:34,941 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:45:34,941 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:45:34,941 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-26 17:45:35,895 INFO ]: Using library mode [2018-06-26 17:45:35,895 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:45:35 BoogieIcfgContainer [2018-06-26 17:45:35,895 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:45:35,896 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:45:35,896 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:45:35,899 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:45:35,900 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:45:35" (1/1) ... [2018-06-26 17:45:35,940 INFO ]: Initial Icfg 48 locations, 58 edges [2018-06-26 17:45:35,942 INFO ]: Using Remove infeasible edges [2018-06-26 17:45:35,942 INFO ]: Using Maximize final states [2018-06-26 17:45:35,944 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:45:35,944 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:45:35,945 INFO ]: Using Remove sink states [2018-06-26 17:45:35,946 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:45:35,946 INFO ]: Using Use SBE [2018-06-26 17:45:35,960 INFO ]: SBE split 0 edges [2018-06-26 17:45:35,966 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 17:45:35,968 INFO ]: 0 new accepting states [2018-06-26 17:45:37,909 INFO ]: Removed 135 edges and 38 locations by large block encoding [2018-06-26 17:45:37,911 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:45:37,913 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:45:37,913 INFO ]: 0 new accepting states [2018-06-26 17:45:37,913 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:45:37,914 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:45:37,916 INFO ]: Encoded RCFG 8 locations, 20 edges [2018-06-26 17:45:37,917 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:45:37 BasicIcfg [2018-06-26 17:45:37,917 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:45:37,918 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:45:37,918 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:45:37,924 INFO ]: TraceAbstraction initialized [2018-06-26 17:45:37,925 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:45:34" (1/4) ... [2018-06-26 17:45:37,925 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d75ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:45:37, skipping insertion in model container [2018-06-26 17:45:37,926 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:45:34" (2/4) ... [2018-06-26 17:45:37,926 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d75ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:45:37, skipping insertion in model container [2018-06-26 17:45:37,926 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:45:35" (3/4) ... [2018-06-26 17:45:37,926 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d75ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:45:37, skipping insertion in model container [2018-06-26 17:45:37,926 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:45:37" (4/4) ... [2018-06-26 17:45:37,942 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:45:37,951 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:45:37,971 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:45:38,021 INFO ]: Using default assertion order modulation [2018-06-26 17:45:38,022 INFO ]: Interprodecural is true [2018-06-26 17:45:38,022 INFO ]: Hoare is false [2018-06-26 17:45:38,022 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:45:38,022 INFO ]: Backedges is TWOTRACK [2018-06-26 17:45:38,022 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:45:38,022 INFO ]: Difference is false [2018-06-26 17:45:38,022 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:45:38,022 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:45:38,036 INFO ]: Start isEmpty. Operand 8 states. [2018-06-26 17:45:38,060 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:45:38,060 INFO ]: Found error trace [2018-06-26 17:45:38,061 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:45:38,061 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:45:38,071 INFO ]: Analyzing trace with hash 41469932, now seen corresponding path program 1 times [2018-06-26 17:45:38,073 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:45:38,073 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:45:38,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:38,119 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:45:38,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:38,201 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:45:38,365 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:45:38,368 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:45:38,368 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:45:38,370 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:45:38,385 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:45:38,385 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:45:38,388 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-26 17:45:38,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:45:38,712 INFO ]: Finished difference Result 12 states and 31 transitions. [2018-06-26 17:45:38,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:45:38,714 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:45:38,714 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:45:38,725 INFO ]: With dead ends: 12 [2018-06-26 17:45:38,725 INFO ]: Without dead ends: 12 [2018-06-26 17:45:38,727 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-26 17:45:38,745 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 17:45:38,761 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-26 17:45:38,762 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 17:45:38,763 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2018-06-26 17:45:38,764 INFO ]: Start accepts. Automaton has 9 states and 25 transitions. Word has length 5 [2018-06-26 17:45:38,765 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:45:38,765 INFO ]: Abstraction has 9 states and 25 transitions. [2018-06-26 17:45:38,765 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:45:38,765 INFO ]: Start isEmpty. Operand 9 states and 25 transitions. [2018-06-26 17:45:38,765 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:45:38,765 INFO ]: Found error trace [2018-06-26 17:45:38,765 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:45:38,765 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:45:38,765 INFO ]: Analyzing trace with hash 41470893, now seen corresponding path program 1 times [2018-06-26 17:45:38,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:45:38,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:45:38,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:38,766 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:45:38,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:38,793 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:45:38,886 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:45:38,886 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:45:38,887 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:45:38,888 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:45:38,888 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:45:38,888 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:45:38,888 INFO ]: Start difference. First operand 9 states and 25 transitions. Second operand 3 states. [2018-06-26 17:45:38,972 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:45:38,972 INFO ]: Finished difference Result 13 states and 35 transitions. [2018-06-26 17:45:38,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:45:38,972 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:45:38,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:45:38,973 INFO ]: With dead ends: 13 [2018-06-26 17:45:38,973 INFO ]: Without dead ends: 13 [2018-06-26 17:45:38,974 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-26 17:45:38,974 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:45:38,976 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-26 17:45:38,976 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:45:38,976 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2018-06-26 17:45:38,976 INFO ]: Start accepts. Automaton has 10 states and 29 transitions. Word has length 5 [2018-06-26 17:45:38,976 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:45:38,976 INFO ]: Abstraction has 10 states and 29 transitions. [2018-06-26 17:45:38,976 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:45:38,976 INFO ]: Start isEmpty. Operand 10 states and 29 transitions. [2018-06-26 17:45:38,977 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:45:38,977 INFO ]: Found error trace [2018-06-26 17:45:38,977 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:45:38,977 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:45:38,977 INFO ]: Analyzing trace with hash 41471854, now seen corresponding path program 1 times [2018-06-26 17:45:38,977 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:45:38,977 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:45:38,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:38,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:45:38,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:39,002 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:45:39,094 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:45:39,094 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:45:39,094 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:45:39,094 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:45:39,094 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:45:39,094 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:45:39,094 INFO ]: Start difference. First operand 10 states and 29 transitions. Second operand 3 states. [2018-06-26 17:45:39,188 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:45:39,188 INFO ]: Finished difference Result 13 states and 32 transitions. [2018-06-26 17:45:39,188 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:45:39,188 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:45:39,188 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:45:39,189 INFO ]: With dead ends: 13 [2018-06-26 17:45:39,189 INFO ]: Without dead ends: 13 [2018-06-26 17:45:39,189 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-26 17:45:39,189 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:45:39,192 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-06-26 17:45:39,193 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 17:45:39,193 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-06-26 17:45:39,193 INFO ]: Start accepts. Automaton has 9 states and 23 transitions. Word has length 5 [2018-06-26 17:45:39,193 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:45:39,193 INFO ]: Abstraction has 9 states and 23 transitions. [2018-06-26 17:45:39,193 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:45:39,193 INFO ]: Start isEmpty. Operand 9 states and 23 transitions. [2018-06-26 17:45:39,193 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:45:39,193 INFO ]: Found error trace [2018-06-26 17:45:39,193 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:45:39,194 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:45:39,194 INFO ]: Analyzing trace with hash 41618887, now seen corresponding path program 1 times [2018-06-26 17:45:39,194 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:45:39,194 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:45:39,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:39,195 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:45:39,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:39,232 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:45:39,341 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:45:39,341 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:45:39,342 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:45:39,342 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:45:39,342 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:45:39,342 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:45:39,342 INFO ]: Start difference. First operand 9 states and 23 transitions. Second operand 3 states. [2018-06-26 17:45:39,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:45:39,463 INFO ]: Finished difference Result 13 states and 34 transitions. [2018-06-26 17:45:39,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:45:39,464 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:45:39,464 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:45:39,464 INFO ]: With dead ends: 13 [2018-06-26 17:45:39,464 INFO ]: Without dead ends: 13 [2018-06-26 17:45:39,465 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-26 17:45:39,465 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:45:39,466 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-26 17:45:39,466 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:45:39,467 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2018-06-26 17:45:39,467 INFO ]: Start accepts. Automaton has 10 states and 28 transitions. Word has length 5 [2018-06-26 17:45:39,467 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:45:39,467 INFO ]: Abstraction has 10 states and 28 transitions. [2018-06-26 17:45:39,467 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:45:39,467 INFO ]: Start isEmpty. Operand 10 states and 28 transitions. [2018-06-26 17:45:39,467 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:45:39,467 INFO ]: Found error trace [2018-06-26 17:45:39,467 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:45:39,467 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:45:39,467 INFO ]: Analyzing trace with hash 41619848, now seen corresponding path program 1 times [2018-06-26 17:45:39,467 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:45:39,467 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:45:39,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:39,468 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:45:39,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:39,480 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:45:39,511 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:45:39,511 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:45:39,511 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:45:39,512 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:45:39,512 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:45:39,512 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:45:39,512 INFO ]: Start difference. First operand 10 states and 28 transitions. Second operand 3 states. [2018-06-26 17:45:39,563 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:45:39,563 INFO ]: Finished difference Result 13 states and 32 transitions. [2018-06-26 17:45:39,564 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:45:39,564 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:45:39,564 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:45:39,564 INFO ]: With dead ends: 13 [2018-06-26 17:45:39,564 INFO ]: Without dead ends: 13 [2018-06-26 17:45:39,565 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-26 17:45:39,565 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:45:39,566 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-06-26 17:45:39,566 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 17:45:39,567 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-06-26 17:45:39,567 INFO ]: Start accepts. Automaton has 9 states and 23 transitions. Word has length 5 [2018-06-26 17:45:39,567 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:45:39,567 INFO ]: Abstraction has 9 states and 23 transitions. [2018-06-26 17:45:39,567 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:45:39,567 INFO ]: Start isEmpty. Operand 9 states and 23 transitions. [2018-06-26 17:45:39,567 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:45:39,567 INFO ]: Found error trace [2018-06-26 17:45:39,567 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:45:39,567 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:45:39,567 INFO ]: Analyzing trace with hash 2113145309, now seen corresponding path program 1 times [2018-06-26 17:45:39,567 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:45:39,567 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:45:39,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:39,568 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:45:39,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:39,582 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:45:39,645 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:45:39,645 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:45:39,645 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:45:39,645 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:45:39,645 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:45:39,645 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:45:39,646 INFO ]: Start difference. First operand 9 states and 23 transitions. Second operand 4 states. [2018-06-26 17:45:39,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:45:39,913 INFO ]: Finished difference Result 17 states and 41 transitions. [2018-06-26 17:45:39,914 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:45:39,914 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-26 17:45:39,914 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:45:39,914 INFO ]: With dead ends: 17 [2018-06-26 17:45:39,914 INFO ]: Without dead ends: 17 [2018-06-26 17:45:39,914 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:45:39,914 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 17:45:39,917 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 11. [2018-06-26 17:45:39,917 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:45:39,917 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2018-06-26 17:45:39,917 INFO ]: Start accepts. Automaton has 11 states and 28 transitions. Word has length 8 [2018-06-26 17:45:39,917 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:45:39,917 INFO ]: Abstraction has 11 states and 28 transitions. [2018-06-26 17:45:39,917 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:45:39,917 INFO ]: Start isEmpty. Operand 11 states and 28 transitions. [2018-06-26 17:45:39,918 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:45:39,918 INFO ]: Found error trace [2018-06-26 17:45:39,918 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:45:39,918 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:45:39,918 INFO ]: Analyzing trace with hash 2111298267, now seen corresponding path program 1 times [2018-06-26 17:45:39,918 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:45:39,918 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:45:39,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:39,919 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:45:39,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:39,949 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:45:40,009 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:45:40,010 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:45:40,010 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:45:40,010 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:45:40,010 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:45:40,010 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:45:40,010 INFO ]: Start difference. First operand 11 states and 28 transitions. Second operand 4 states. [2018-06-26 17:45:40,201 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:45:40,201 INFO ]: Finished difference Result 19 states and 45 transitions. [2018-06-26 17:45:40,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:45:40,210 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-26 17:45:40,210 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:45:40,210 INFO ]: With dead ends: 19 [2018-06-26 17:45:40,211 INFO ]: Without dead ends: 19 [2018-06-26 17:45:40,211 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:45:40,211 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 17:45:40,213 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-06-26 17:45:40,213 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:45:40,214 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 32 transitions. [2018-06-26 17:45:40,214 INFO ]: Start accepts. Automaton has 13 states and 32 transitions. Word has length 8 [2018-06-26 17:45:40,214 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:45:40,214 INFO ]: Abstraction has 13 states and 32 transitions. [2018-06-26 17:45:40,214 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:45:40,214 INFO ]: Start isEmpty. Operand 13 states and 32 transitions. [2018-06-26 17:45:40,214 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:45:40,214 INFO ]: Found error trace [2018-06-26 17:45:40,214 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:45:40,215 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:45:40,215 INFO ]: Analyzing trace with hash 2112221788, now seen corresponding path program 1 times [2018-06-26 17:45:40,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:45:40,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:45:40,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:40,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:45:40,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:45:40,246 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:45:40,426 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:45:40,426 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:45:40,426 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:45:40,426 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:45:40,426 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:45:40,426 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:45:40,426 INFO ]: Start difference. First operand 13 states and 32 transitions. Second operand 5 states. [2018-06-26 17:45:40,464 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:45:40,464 INFO ]: Finished difference Result 9 states and 22 transitions. [2018-06-26 17:45:40,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:45:40,464 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-26 17:45:40,464 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:45:40,464 INFO ]: With dead ends: 9 [2018-06-26 17:45:40,464 INFO ]: Without dead ends: 0 [2018-06-26 17:45:40,464 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:45:40,464 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 17:45:40,465 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 17:45:40,465 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 17:45:40,465 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 17:45:40,465 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2018-06-26 17:45:40,465 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:45:40,465 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 17:45:40,465 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:45:40,465 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 17:45:40,465 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 17:45:40,466 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:45:40,468 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:45:40 BasicIcfg [2018-06-26 17:45:40,468 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:45:40,468 INFO ]: Toolchain (without parser) took 5750.35 ms. Allocated memory was 302.5 MB in the beginning and 359.1 MB in the end (delta: 56.6 MB). Free memory was 236.9 MB in the beginning and 168.8 MB in the end (delta: 68.0 MB). Peak memory consumption was 124.7 MB. Max. memory is 3.6 GB. [2018-06-26 17:45:40,470 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 302.5 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:45:40,470 INFO ]: ChcToBoogie took 118.26 ms. Allocated memory is still 302.5 MB. Free memory was 234.9 MB in the beginning and 232.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:45:40,470 INFO ]: Boogie Preprocessor took 77.12 ms. Allocated memory is still 302.5 MB. Free memory was 232.9 MB in the beginning and 230.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:45:40,470 INFO ]: RCFGBuilder took 965.97 ms. Allocated memory is still 302.5 MB. Free memory was 230.9 MB in the beginning and 184.9 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:45:40,476 INFO ]: BlockEncodingV2 took 2021.15 ms. Allocated memory was 302.5 MB in the beginning and 359.1 MB in the end (delta: 56.6 MB). Free memory was 184.9 MB in the beginning and 285.8 MB in the end (delta: -100.9 MB). Peak memory consumption was 35.7 MB. Max. memory is 3.6 GB. [2018-06-26 17:45:40,477 INFO ]: TraceAbstraction took 2549.73 ms. Allocated memory is still 359.1 MB. Free memory was 285.8 MB in the beginning and 168.8 MB in the end (delta: 117.0 MB). Peak memory consumption was 117.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:45:40,480 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 48 locations, 58 edges - StatisticsResult: Encoded RCFG 8 locations, 20 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 302.5 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 118.26 ms. Allocated memory is still 302.5 MB. Free memory was 234.9 MB in the beginning and 232.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 77.12 ms. Allocated memory is still 302.5 MB. Free memory was 232.9 MB in the beginning and 230.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 965.97 ms. Allocated memory is still 302.5 MB. Free memory was 230.9 MB in the beginning and 184.9 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 2021.15 ms. Allocated memory was 302.5 MB in the beginning and 359.1 MB in the end (delta: 56.6 MB). Free memory was 184.9 MB in the beginning and 285.8 MB in the end (delta: -100.9 MB). Peak memory consumption was 35.7 MB. Max. memory is 3.6 GB. * TraceAbstraction took 2549.73 ms. Allocated memory is still 359.1 MB. Free memory was 285.8 MB in the beginning and 168.8 MB in the end (delta: 117.0 MB). Peak memory consumption was 117.0 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, 8 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 142 SDtfs, 68 SDslu, 89 SDs, 0 SdLazy, 128 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 29 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 3/3 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/42.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-45-40-500.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/42.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-45-40-500.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/42.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-45-40-500.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/42.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-45-40-500.csv Received shutdown request...