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/llreve/cube_square_unsafe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:49:10,835 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:49:10,837 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:49:10,850 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:49:10,850 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:49:10,851 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:49:10,854 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:49:10,859 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:49:10,862 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:49:10,863 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:49:10,864 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:49:10,864 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:49:10,865 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:49:10,866 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:49:10,868 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:49:10,869 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:49:10,870 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:49:10,879 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:49:10,881 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:49:10,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:49:10,883 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:49:10,886 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:49:10,888 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:49:10,888 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:49:10,888 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:49:10,889 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:49:10,889 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:49:10,893 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:49:10,894 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:49:10,895 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:49:10,895 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:49:10,896 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:49:10,896 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:49:10,896 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:49:10,899 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:49:10,900 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:49:10,900 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:49:10,918 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:49:10,918 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:49:10,918 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:49:10,919 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:49:10,920 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:49:10,920 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:49:10,920 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:49:10,920 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:49:10,920 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:49:10,921 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:49:10,921 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:49:10,921 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:49:10,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:49:10,921 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:49:10,921 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:49:10,922 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:49:10,922 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:49:10,922 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:49:10,922 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:49:10,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:49:10,922 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:49:10,924 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:49:10,924 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:49:10,982 INFO ]: Repository-Root is: /tmp [2018-06-26 17:49:10,995 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:49:11,000 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:49:11,002 INFO ]: Initializing SmtParser... [2018-06-26 17:49:11,002 INFO ]: SmtParser initialized [2018-06-26 17:49:11,003 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2 [2018-06-26 17:49:11,004 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:49:11,087 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2 unknown [2018-06-26 17:49:11,245 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2 [2018-06-26 17:49:11,249 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:49:11,255 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:49:11,255 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:49:11,255 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:49:11,255 INFO ]: ChcToBoogie initialized [2018-06-26 17:49:11,258 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:49:11" (1/1) ... [2018-06-26 17:49:11,308 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:49:11 Unit [2018-06-26 17:49:11,309 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:49:11,309 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:49:11,309 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:49:11,309 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:49:11,330 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:49:11" (1/1) ... [2018-06-26 17:49:11,330 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:49:11" (1/1) ... [2018-06-26 17:49:11,337 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:49:11" (1/1) ... [2018-06-26 17:49:11,337 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:49:11" (1/1) ... [2018-06-26 17:49:11,340 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:49:11" (1/1) ... [2018-06-26 17:49:11,342 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:49:11" (1/1) ... [2018-06-26 17:49:11,343 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:49:11" (1/1) ... [2018-06-26 17:49:11,344 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:49:11,345 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:49:11,345 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:49:11,345 INFO ]: RCFGBuilder initialized [2018-06-26 17:49:11,346 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:49:11" (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:49:11,360 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:49:11,360 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:49:11,361 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:49:11,361 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:49:11,361 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:49:11,361 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:49:11,591 INFO ]: Using library mode [2018-06-26 17:49:11,591 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:49:11 BoogieIcfgContainer [2018-06-26 17:49:11,591 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:49:11,592 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:49:11,592 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:49:11,592 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:49:11,593 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:49:11" (1/1) ... [2018-06-26 17:49:11,607 INFO ]: Initial Icfg 14 locations, 16 edges [2018-06-26 17:49:11,608 INFO ]: Using Remove infeasible edges [2018-06-26 17:49:11,609 INFO ]: Using Maximize final states [2018-06-26 17:49:11,609 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:49:11,609 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:49:11,613 INFO ]: Using Remove sink states [2018-06-26 17:49:11,614 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:49:11,614 INFO ]: Using Use SBE [2018-06-26 17:49:11,620 INFO ]: SBE split 0 edges [2018-06-26 17:49:11,625 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 17:49:11,626 INFO ]: 0 new accepting states [2018-06-26 17:49:11,703 INFO ]: Removed 8 edges and 4 locations by large block encoding [2018-06-26 17:49:11,705 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:49:11,710 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:49:11,710 INFO ]: 0 new accepting states [2018-06-26 17:49:11,711 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:49:11,711 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:49:11,711 INFO ]: Encoded RCFG 8 locations, 10 edges [2018-06-26 17:49:11,711 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:49:11 BasicIcfg [2018-06-26 17:49:11,711 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:49:11,714 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:49:11,714 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:49:11,724 INFO ]: TraceAbstraction initialized [2018-06-26 17:49:11,724 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:49:11" (1/4) ... [2018-06-26 17:49:11,725 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6886cf2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:49:11, skipping insertion in model container [2018-06-26 17:49:11,725 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:49:11" (2/4) ... [2018-06-26 17:49:11,726 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6886cf2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:49:11, skipping insertion in model container [2018-06-26 17:49:11,726 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:49:11" (3/4) ... [2018-06-26 17:49:11,726 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6886cf2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:49:11, skipping insertion in model container [2018-06-26 17:49:11,726 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:49:11" (4/4) ... [2018-06-26 17:49:11,727 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:49:11,737 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:49:11,743 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:49:11,781 INFO ]: Using default assertion order modulation [2018-06-26 17:49:11,781 INFO ]: Interprodecural is true [2018-06-26 17:49:11,781 INFO ]: Hoare is false [2018-06-26 17:49:11,781 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:49:11,781 INFO ]: Backedges is TWOTRACK [2018-06-26 17:49:11,781 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:49:11,781 INFO ]: Difference is false [2018-06-26 17:49:11,782 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:49:11,782 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:49:11,791 INFO ]: Start isEmpty. Operand 8 states. [2018-06-26 17:49:11,800 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:49:11,800 INFO ]: Found error trace [2018-06-26 17:49:11,801 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:49:11,801 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:49:11,806 INFO ]: Analyzing trace with hash -1172159523, now seen corresponding path program 1 times [2018-06-26 17:49:11,808 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:49:11,808 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:49:11,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:11,839 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:49:11,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:11,884 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:11,953 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:49:11,955 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:49:11,955 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:49:11,957 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:49:11,970 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:49:11,970 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:49:11,972 INFO ]: Start difference. First operand 8 states. Second operand 4 states. [2018-06-26 17:49:12,108 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:49:12,109 INFO ]: Finished difference Result 13 states and 18 transitions. [2018-06-26 17:49:12,109 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:49:12,110 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-26 17:49:12,110 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:49:12,120 INFO ]: With dead ends: 13 [2018-06-26 17:49:12,120 INFO ]: Without dead ends: 13 [2018-06-26 17:49:12,122 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:49:12,135 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:49:12,148 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-26 17:49:12,157 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:49:12,158 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-26 17:49:12,159 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-06-26 17:49:12,159 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:49:12,159 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-26 17:49:12,159 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:49:12,159 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-26 17:49:12,159 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:49:12,159 INFO ]: Found error trace [2018-06-26 17:49:12,160 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:49:12,160 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:49:12,160 INFO ]: Analyzing trace with hash -2008006790, now seen corresponding path program 1 times [2018-06-26 17:49:12,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:49:12,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:49:12,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:12,161 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:49:12,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:12,181 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:12,248 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:49:12,248 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:49:12,248 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:49:12,250 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:49:12,250 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:49:12,250 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:49:12,250 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 5 states. [2018-06-26 17:49:12,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:49:12,419 INFO ]: Finished difference Result 15 states and 21 transitions. [2018-06-26 17:49:12,419 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:49:12,419 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-26 17:49:12,420 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:49:12,420 INFO ]: With dead ends: 15 [2018-06-26 17:49:12,420 INFO ]: Without dead ends: 14 [2018-06-26 17:49:12,421 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:49:12,421 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:49:12,422 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 9. [2018-06-26 17:49:12,422 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 17:49:12,423 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-26 17:49:12,423 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 8 [2018-06-26 17:49:12,423 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:49:12,423 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-26 17:49:12,423 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:49:12,423 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-26 17:49:12,423 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:49:12,423 INFO ]: Found error trace [2018-06-26 17:49:12,423 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:49:12,423 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:49:12,423 INFO ]: Analyzing trace with hash -1978454118, now seen corresponding path program 1 times [2018-06-26 17:49:12,423 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:49:12,423 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:49:12,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:12,424 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:49:12,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:12,437 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:12,685 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:49:12,685 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:49:12,685 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-26 17:49:12,693 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:49:12,718 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:12,724 INFO ]: Computing forward predicates... [2018-06-26 17:49:13,089 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:49:13,110 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:49:13,110 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2018-06-26 17:49:13,110 INFO ]: Interpolant automaton has 8 states [2018-06-26 17:49:13,110 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 17:49:13,110 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:49:13,110 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 8 states. [2018-06-26 17:49:13,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:49:13,287 INFO ]: Finished difference Result 13 states and 17 transitions. [2018-06-26 17:49:13,287 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:49:13,287 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-26 17:49:13,287 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:49:13,287 INFO ]: With dead ends: 13 [2018-06-26 17:49:13,287 INFO ]: Without dead ends: 10 [2018-06-26 17:49:13,288 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:49:13,288 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 17:49:13,289 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 17:49:13,289 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:49:13,290 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-26 17:49:13,290 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-06-26 17:49:13,290 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:49:13,290 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-26 17:49:13,290 INFO ]: Interpolant automaton has 8 states. [2018-06-26 17:49:13,290 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-26 17:49:13,290 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:49:13,290 INFO ]: Found error trace [2018-06-26 17:49:13,290 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:49:13,290 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:49:13,291 INFO ]: Analyzing trace with hash -2119915619, now seen corresponding path program 1 times [2018-06-26 17:49:13,291 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:49:13,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:49:13,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:13,291 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:49:13,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:13,304 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:13,367 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:49:13,368 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:49:13,368 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:49:13,368 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:49:13,368 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:49:13,368 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:49:13,368 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-06-26 17:49:13,445 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:49:13,445 INFO ]: Finished difference Result 11 states and 13 transitions. [2018-06-26 17:49:13,446 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:49:13,446 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:49:13,446 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:49:13,446 INFO ]: With dead ends: 11 [2018-06-26 17:49:13,446 INFO ]: Without dead ends: 11 [2018-06-26 17:49:13,446 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:49:13,446 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 17:49:13,448 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 17:49:13,448 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:49:13,448 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-26 17:49:13,448 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-06-26 17:49:13,448 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:49:13,448 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-26 17:49:13,448 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:49:13,448 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-26 17:49:13,449 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:49:13,449 INFO ]: Found error trace [2018-06-26 17:49:13,449 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:49:13,449 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:49:13,449 INFO ]: Analyzing trace with hash -1293109128, now seen corresponding path program 1 times [2018-06-26 17:49:13,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:49:13,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:49:13,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:13,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:49:13,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:13,475 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:13,772 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:49:13,772 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:49:13,772 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 17:49:13,788 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:49:13,829 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:13,832 INFO ]: Computing forward predicates... [2018-06-26 17:49:14,175 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:49:14,198 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:49:14,198 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-26 17:49:14,198 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:49:14,199 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:49:14,199 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:49:14,199 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 11 states. [2018-06-26 17:49:14,402 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:49:14,403 INFO ]: Finished difference Result 22 states and 29 transitions. [2018-06-26 17:49:14,403 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:49:14,403 INFO ]: Start accepts. Automaton has 11 states. Word has length 10 [2018-06-26 17:49:14,403 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:49:14,403 INFO ]: With dead ends: 22 [2018-06-26 17:49:14,403 INFO ]: Without dead ends: 22 [2018-06-26 17:49:14,404 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:49:14,404 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 17:49:14,406 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-06-26 17:49:14,406 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 17:49:14,406 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-06-26 17:49:14,406 INFO ]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 10 [2018-06-26 17:49:14,406 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:49:14,406 INFO ]: Abstraction has 15 states and 19 transitions. [2018-06-26 17:49:14,406 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:49:14,406 INFO ]: Start isEmpty. Operand 15 states and 19 transitions. [2018-06-26 17:49:14,407 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:49:14,407 INFO ]: Found error trace [2018-06-26 17:49:14,407 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:49:14,407 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:49:14,407 INFO ]: Analyzing trace with hash 201341883, now seen corresponding path program 2 times [2018-06-26 17:49:14,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:49:14,407 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:49:14,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:14,408 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:49:14,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:14,421 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:14,490 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:49:14,490 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:49:14,490 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:49:14,496 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:49:14,543 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:49:14,543 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:14,545 INFO ]: Computing forward predicates... [2018-06-26 17:49:14,597 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:49:14,616 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:49:14,616 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-26 17:49:14,617 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:49:14,617 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:49:14,617 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:49:14,617 INFO ]: Start difference. First operand 15 states and 19 transitions. Second operand 9 states. [2018-06-26 17:49:14,707 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:49:14,707 INFO ]: Finished difference Result 20 states and 26 transitions. [2018-06-26 17:49:14,708 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:49:14,708 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-26 17:49:14,708 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:49:14,708 INFO ]: With dead ends: 20 [2018-06-26 17:49:14,708 INFO ]: Without dead ends: 20 [2018-06-26 17:49:14,709 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:49:14,709 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 17:49:14,711 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-06-26 17:49:14,711 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:49:14,711 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-06-26 17:49:14,711 INFO ]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 11 [2018-06-26 17:49:14,711 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:49:14,711 INFO ]: Abstraction has 16 states and 21 transitions. [2018-06-26 17:49:14,711 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:49:14,712 INFO ]: Start isEmpty. Operand 16 states and 21 transitions. [2018-06-26 17:49:14,712 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:49:14,712 INFO ]: Found error trace [2018-06-26 17:49:14,712 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:49:14,712 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:49:14,712 INFO ]: Analyzing trace with hash -1463311397, now seen corresponding path program 3 times [2018-06-26 17:49:14,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:49:14,712 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:49:14,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:14,713 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:49:14,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:14,724 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:14,823 INFO ]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:49:14,823 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:49:14,823 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:49:14,830 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:49:14,868 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-26 17:49:14,868 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:14,870 INFO ]: Computing forward predicates... [2018-06-26 17:49:15,054 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:49:15,076 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:49:15,076 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-06-26 17:49:15,076 INFO ]: Interpolant automaton has 13 states [2018-06-26 17:49:15,076 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 17:49:15,076 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:49:15,076 INFO ]: Start difference. First operand 16 states and 21 transitions. Second operand 13 states. [2018-06-26 17:49:15,354 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:49:15,355 INFO ]: Finished difference Result 28 states and 36 transitions. [2018-06-26 17:49:15,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 17:49:15,355 INFO ]: Start accepts. Automaton has 13 states. Word has length 11 [2018-06-26 17:49:15,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:49:15,356 INFO ]: With dead ends: 28 [2018-06-26 17:49:15,356 INFO ]: Without dead ends: 24 [2018-06-26 17:49:15,356 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:49:15,356 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 17:49:15,358 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 15. [2018-06-26 17:49:15,358 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 17:49:15,359 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-06-26 17:49:15,359 INFO ]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2018-06-26 17:49:15,359 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:49:15,359 INFO ]: Abstraction has 15 states and 18 transitions. [2018-06-26 17:49:15,359 INFO ]: Interpolant automaton has 13 states. [2018-06-26 17:49:15,359 INFO ]: Start isEmpty. Operand 15 states and 18 transitions. [2018-06-26 17:49:15,359 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:49:15,359 INFO ]: Found error trace [2018-06-26 17:49:15,359 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:49:15,359 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:49:15,359 INFO ]: Analyzing trace with hash -1431911683, now seen corresponding path program 4 times [2018-06-26 17:49:15,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:49:15,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:49:15,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:15,360 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:49:15,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:15,368 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:15,436 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:49:15,436 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:49:15,436 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:49:15,441 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:49:15,458 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:49:15,458 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:15,461 INFO ]: Computing forward predicates... [2018-06-26 17:49:15,494 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:49:15,513 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:49:15,513 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-26 17:49:15,513 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:49:15,513 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:49:15,513 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:49:15,513 INFO ]: Start difference. First operand 15 states and 18 transitions. Second operand 10 states. [2018-06-26 17:49:15,594 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:49:15,595 INFO ]: Finished difference Result 18 states and 21 transitions. [2018-06-26 17:49:15,595 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:49:15,595 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-26 17:49:15,595 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:49:15,595 INFO ]: With dead ends: 18 [2018-06-26 17:49:15,595 INFO ]: Without dead ends: 13 [2018-06-26 17:49:15,596 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:49:15,596 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:49:15,597 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 17:49:15,597 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:49:15,597 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-26 17:49:15,597 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2018-06-26 17:49:15,597 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:49:15,597 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-26 17:49:15,597 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:49:15,597 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-26 17:49:15,598 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:49:15,598 INFO ]: Found error trace [2018-06-26 17:49:15,598 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:49:15,598 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:49:15,598 INFO ]: Analyzing trace with hash 1946396698, now seen corresponding path program 5 times [2018-06-26 17:49:15,598 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:49:15,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:49:15,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:15,598 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:49:15,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:15,608 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:15,665 INFO ]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:49:15,665 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:49:15,665 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:49:15,672 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:49:15,714 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:49:15,714 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:15,716 INFO ]: Computing forward predicates... [2018-06-26 17:49:15,840 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:49:15,860 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:49:15,860 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-06-26 17:49:15,860 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:49:15,860 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:49:15,860 INFO ]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:49:15,860 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 11 states. [2018-06-26 17:49:16,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:49:16,215 INFO ]: Finished difference Result 17 states and 20 transitions. [2018-06-26 17:49:16,219 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:49:16,219 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-26 17:49:16,219 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:49:16,219 INFO ]: With dead ends: 17 [2018-06-26 17:49:16,219 INFO ]: Without dead ends: 14 [2018-06-26 17:49:16,220 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:49:16,220 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:49:16,222 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 17:49:16,222 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:49:16,222 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-26 17:49:16,222 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2018-06-26 17:49:16,222 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:49:16,222 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-26 17:49:16,222 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:49:16,222 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-26 17:49:16,223 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:49:16,223 INFO ]: Found error trace [2018-06-26 17:49:16,223 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:49:16,223 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:49:16,223 INFO ]: Analyzing trace with hash -764870019, now seen corresponding path program 6 times [2018-06-26 17:49:16,223 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:49:16,223 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:49:16,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:16,224 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:49:16,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:16,236 INFO ]: Conjunction of SSA is sat [2018-06-26 17:49:16,240 INFO ]: Counterexample might be feasible [2018-06-26 17:49:16,254 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:49:16,256 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:49:16 BasicIcfg [2018-06-26 17:49:16,256 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:49:16,256 INFO ]: Toolchain (without parser) took 5006.74 ms. Allocated memory was 307.2 MB in the beginning and 337.1 MB in the end (delta: 29.9 MB). Free memory was 261.5 MB in the beginning and 245.3 MB in the end (delta: 16.3 MB). Peak memory consumption was 46.2 MB. Max. memory is 3.6 GB. [2018-06-26 17:49:16,258 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:49:16,259 INFO ]: ChcToBoogie took 53.73 ms. Allocated memory is still 307.2 MB. Free memory was 260.6 MB in the beginning and 258.6 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:49:16,259 INFO ]: Boogie Preprocessor took 34.95 ms. Allocated memory is still 307.2 MB. Free memory was 258.6 MB in the beginning and 257.6 MB in the end (delta: 996.5 kB). Peak memory consumption was 996.5 kB. Max. memory is 3.6 GB. [2018-06-26 17:49:16,260 INFO ]: RCFGBuilder took 245.95 ms. Allocated memory is still 307.2 MB. Free memory was 257.6 MB in the beginning and 248.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. [2018-06-26 17:49:16,260 INFO ]: BlockEncodingV2 took 119.94 ms. Allocated memory is still 307.2 MB. Free memory was 248.5 MB in the beginning and 245.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:49:16,261 INFO ]: TraceAbstraction took 4541.91 ms. Allocated memory was 307.2 MB in the beginning and 337.1 MB in the end (delta: 29.9 MB). Free memory was 245.5 MB in the beginning and 245.3 MB in the end (delta: 225.9 kB). Peak memory consumption was 30.1 MB. Max. memory is 3.6 GB. [2018-06-26 17:49:16,264 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 14 locations, 16 edges - StatisticsResult: Encoded RCFG 8 locations, 10 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 53.73 ms. Allocated memory is still 307.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 34.95 ms. Allocated memory is still 307.2 MB. Free memory was 258.6 MB in the beginning and 257.6 MB in the end (delta: 996.5 kB). Peak memory consumption was 996.5 kB. Max. memory is 3.6 GB. * RCFGBuilder took 245.95 ms. Allocated memory is still 307.2 MB. Free memory was 257.6 MB in the beginning and 248.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 119.94 ms. Allocated memory is still 307.2 MB. Free memory was 248.5 MB in the beginning and 245.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4541.91 ms. Allocated memory was 307.2 MB in the beginning and 337.1 MB in the end (delta: 29.9 MB). Free memory was 245.5 MB in the beginning and 245.3 MB in the end (delta: 225.9 kB). Peak memory consumption was 30.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0); [L0] assume !(0 <= hbv_inv_main27_1_Int + -1); [L0] hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hhv_inv_main23_3_Int, hhv_inv_main23_4_Int := hhv_inv_main27_0_Int, hhv_inv_main27_1_Int, hbv_inv_main27_2_Int, hhv_inv_main27_2_Int, hbv_inv_main27_1_Int; [L0] havoc hbv_inv_main27_2_Int, hbv_inv_main27_1_Int; [L0] assume (hhv_inv_main23_3_Int == hbv_inv_main23_2_Int + hhv_inv_main23_2_Int && hhv_inv_main23_4_Int == hbv_inv_main23_1_Int + -1) && 0 <= hbv_inv_main23_1_Int + -1; [L0] hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hhv_inv_main23_3_Int, hhv_inv_main23_4_Int := hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hbv_inv_main23_2_Int, hbv_inv_main23_1_Int; [L0] havoc hbv_inv_main23_2_Int, hbv_inv_main23_1_Int; [L0] assume (hhv_inv_main23_3_Int == hbv_inv_main23_2_Int + hhv_inv_main23_2_Int && hhv_inv_main23_4_Int == hbv_inv_main23_1_Int + -1) && 0 <= hbv_inv_main23_1_Int + -1; [L0] hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hhv_inv_main23_3_Int, hhv_inv_main23_4_Int := hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hbv_inv_main23_2_Int, hbv_inv_main23_1_Int; [L0] havoc hbv_inv_main23_2_Int, hbv_inv_main23_1_Int; [L0] assume ((hhv_inv_main23_2_Int == hhv_inv_main23_0_Int && hhv_inv_main23_3_Int == 0) && hhv_inv_main23_4_Int == hhv_inv_main23_0_Int) && !(0 <= hbv_inv_main23_1_Int + -1); [L0] hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hhv_inv_main14_2_Int, hhv_inv_main14_3_Int := hhv_inv_main23_0_Int, hbv_inv_main23_2_Int, hhv_inv_main23_1_Int, hbv_inv_main23_1_Int; [L0] havoc hbv_inv_main23_2_Int, hbv_inv_main23_1_Int; [L0] assume (0 <= hbv_inv_main14_2_Int + -1 && hhv_inv_main14_2_Int == hbv_inv_main14_1_Int + hhv_inv_main14_1_Int) && hhv_inv_main14_3_Int == hbv_inv_main14_2_Int + -1; [L0] hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hhv_inv_main14_2_Int, hhv_inv_main14_3_Int := hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int, hbv_inv_main14_2_Int; [L0] havoc hbv_inv_main14_2_Int, hbv_inv_main14_1_Int; [L0] assume (0 <= hbv_inv_main14_2_Int + -1 && hhv_inv_main14_2_Int == hbv_inv_main14_1_Int + hhv_inv_main14_1_Int) && hhv_inv_main14_3_Int == hbv_inv_main14_2_Int + -1; [L0] hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hhv_inv_main14_2_Int, hhv_inv_main14_3_Int := hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int, hbv_inv_main14_2_Int; [L0] havoc hbv_inv_main14_2_Int, hbv_inv_main14_1_Int; [L0] assume hhv_inv_main14_2_Int == 0 && !(0 <= hbv_inv_main14_1_Int + -1); [L0] hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hhv_inv_main8_2_Int, hhv_inv_main8_3_Int := hhv_inv_main14_0_Int, hhv_inv_main14_3_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int; [L0] havoc hbv_inv_main14_1_Int; [L0] assume (hhv_inv_main8_3_Int == hbv_inv_main8_1_Int + -1 && 0 <= hbv_inv_main8_1_Int + -1) && hhv_inv_main8_2_Int == hbv_inv_main8_2_Int + hhv_inv_main8_1_Int; [L0] hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hhv_inv_main8_2_Int, hhv_inv_main8_3_Int := hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hbv_inv_main8_2_Int, hbv_inv_main8_1_Int; [L0] havoc hbv_inv_main8_1_Int, hbv_inv_main8_2_Int; [L0] assume (hhv_inv_main8_3_Int == hbv_inv_main8_1_Int + -1 && 0 <= hbv_inv_main8_1_Int + -1) && hhv_inv_main8_2_Int == hbv_inv_main8_2_Int + hhv_inv_main8_1_Int; [L0] hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hhv_inv_main8_2_Int, hhv_inv_main8_3_Int := hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hbv_inv_main8_2_Int, hbv_inv_main8_1_Int; [L0] havoc hbv_inv_main8_1_Int, hbv_inv_main8_2_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. UNSAFE Result, 4.4s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 71 SDtfs, 84 SDslu, 306 SDs, 0 SdLazy, 357 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=6, 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, 9 MinimizatonAttempts, 28 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 4174 SizeOfPredicates, 40 NumberOfNonLiveVariables, 719 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 32/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cube_square_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-49-16-275.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cube_square_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-49-16-275.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cube_square_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-49-16-275.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cube_square_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-49-16-275.csv Received shutdown request...