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/hopv/lia/mochi/bcopy.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:13:41,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:13:41,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:13:41,741 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:13:41,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:13:41,743 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:13:41,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:13:41,748 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:13:41,749 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:13:41,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:13:41,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:13:41,752 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:13:41,753 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:13:41,756 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:13:41,757 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:13:41,758 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:13:41,772 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:13:41,774 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:13:41,775 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:13:41,776 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:13:41,777 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:13:41,779 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:13:41,780 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:13:41,780 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:13:41,784 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:13:41,785 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:13:41,786 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:13:41,786 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:13:41,788 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:13:41,792 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:13:41,793 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:13:41,794 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:13:41,794 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:13:41,795 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:13:41,796 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:13:41,797 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:13:41,817 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:13:41,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:13:41,820 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:13:41,820 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:13:41,821 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:13:41,821 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:13:41,821 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:13:41,822 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:13:41,822 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:13:41,822 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:13:41,822 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:13:41,822 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:13:41,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:13:41,824 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:13:41,824 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:13:41,824 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:13:41,824 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:13:41,824 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:13:41,825 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:13:41,825 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:13:41,825 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:13:41,826 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:13:41,827 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:13:41,868 INFO ]: Repository-Root is: /tmp [2018-06-24 21:13:41,886 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:13:41,891 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:13:41,892 INFO ]: Initializing SmtParser... [2018-06-24 21:13:41,893 INFO ]: SmtParser initialized [2018-06-24 21:13:41,893 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/bcopy.smt2 [2018-06-24 21:13:41,894 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:13:41,983 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/bcopy.smt2 unknown [2018-06-24 21:13:42,222 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/bcopy.smt2 [2018-06-24 21:13:42,227 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:13:42,234 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:13:42,234 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:13:42,234 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:13:42,234 INFO ]: ChcToBoogie initialized [2018-06-24 21:13:42,238 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:13:42" (1/1) ... [2018-06-24 21:13:42,297 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:42 Unit [2018-06-24 21:13:42,298 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:13:42,298 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:13:42,298 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:13:42,298 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:13:42,320 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:42" (1/1) ... [2018-06-24 21:13:42,320 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:42" (1/1) ... [2018-06-24 21:13:42,332 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:42" (1/1) ... [2018-06-24 21:13:42,332 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:42" (1/1) ... [2018-06-24 21:13:42,337 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:42" (1/1) ... [2018-06-24 21:13:42,348 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:42" (1/1) ... [2018-06-24 21:13:42,349 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:42" (1/1) ... [2018-06-24 21:13:42,351 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:13:42,358 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:13:42,358 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:13:42,358 INFO ]: RCFGBuilder initialized [2018-06-24 21:13:42,359 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:42" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:13:42,372 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:13:42,372 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:13:42,373 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:13:42,373 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:13:42,373 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:13:42,373 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 21:13:42,749 INFO ]: Using library mode [2018-06-24 21:13:42,749 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:13:42 BoogieIcfgContainer [2018-06-24 21:13:42,749 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:13:42,754 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:13:42,754 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:13:42,755 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:13:42,756 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:13:42" (1/1) ... [2018-06-24 21:13:42,772 INFO ]: Initial Icfg 30 locations, 41 edges [2018-06-24 21:13:42,773 INFO ]: Using Remove infeasible edges [2018-06-24 21:13:42,774 INFO ]: Using Maximize final states [2018-06-24 21:13:42,774 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:13:42,775 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:13:42,776 INFO ]: Using Remove sink states [2018-06-24 21:13:42,777 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:13:42,777 INFO ]: Using Use SBE [2018-06-24 21:13:42,805 INFO ]: SBE split 2 edges [2018-06-24 21:13:42,810 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 21:13:42,811 INFO ]: 0 new accepting states [2018-06-24 21:13:43,191 INFO ]: Removed 52 edges and 13 locations by large block encoding [2018-06-24 21:13:43,192 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:13:43,193 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:13:43,194 INFO ]: 0 new accepting states [2018-06-24 21:13:43,194 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:13:43,194 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:13:43,194 INFO ]: Encoded RCFG 15 locations, 30 edges [2018-06-24 21:13:43,195 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:13:43 BasicIcfg [2018-06-24 21:13:43,195 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:13:43,196 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:13:43,196 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:13:43,199 INFO ]: TraceAbstraction initialized [2018-06-24 21:13:43,199 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:13:42" (1/4) ... [2018-06-24 21:13:43,200 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af87d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:13:43, skipping insertion in model container [2018-06-24 21:13:43,200 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:42" (2/4) ... [2018-06-24 21:13:43,200 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af87d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:13:43, skipping insertion in model container [2018-06-24 21:13:43,200 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:13:42" (3/4) ... [2018-06-24 21:13:43,200 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af87d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:13:43, skipping insertion in model container [2018-06-24 21:13:43,201 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:13:43" (4/4) ... [2018-06-24 21:13:43,203 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:13:43,214 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:13:43,219 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:13:43,259 INFO ]: Using default assertion order modulation [2018-06-24 21:13:43,259 INFO ]: Interprodecural is true [2018-06-24 21:13:43,260 INFO ]: Hoare is false [2018-06-24 21:13:43,260 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:13:43,260 INFO ]: Backedges is TWOTRACK [2018-06-24 21:13:43,260 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:13:43,260 INFO ]: Difference is false [2018-06-24 21:13:43,260 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:13:43,260 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:13:43,268 INFO ]: Start isEmpty. Operand 15 states. [2018-06-24 21:13:43,284 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 21:13:43,284 INFO ]: Found error trace [2018-06-24 21:13:43,285 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 21:13:43,285 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:43,290 INFO ]: Analyzing trace with hash 1258229, now seen corresponding path program 1 times [2018-06-24 21:13:43,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:43,293 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:43,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:43,327 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:43,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:43,363 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:43,428 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:43,430 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:43,430 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:13:43,431 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:43,444 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:43,444 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:43,446 INFO ]: Start difference. First operand 15 states. Second operand 3 states. [2018-06-24 21:13:43,927 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:43,927 INFO ]: Finished difference Result 25 states and 52 transitions. [2018-06-24 21:13:43,928 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:43,930 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 21:13:43,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:43,943 INFO ]: With dead ends: 25 [2018-06-24 21:13:43,943 INFO ]: Without dead ends: 25 [2018-06-24 21:13:43,945 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:43,959 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 21:13:43,993 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 21:13:43,995 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 21:13:43,996 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2018-06-24 21:13:43,999 INFO ]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 4 [2018-06-24 21:13:44,000 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:44,000 INFO ]: Abstraction has 25 states and 52 transitions. [2018-06-24 21:13:44,000 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:44,000 INFO ]: Start isEmpty. Operand 25 states and 52 transitions. [2018-06-24 21:13:44,009 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:13:44,009 INFO ]: Found error trace [2018-06-24 21:13:44,009 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:44,009 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:44,009 INFO ]: Analyzing trace with hash -1816118173, now seen corresponding path program 1 times [2018-06-24 21:13:44,010 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:44,010 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:44,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:44,010 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:44,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:44,020 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:44,090 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:13:44,090 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:44,090 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:13:44,092 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:44,092 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:44,092 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:44,092 INFO ]: Start difference. First operand 25 states and 52 transitions. Second operand 3 states. [2018-06-24 21:13:44,436 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:44,436 INFO ]: Finished difference Result 35 states and 75 transitions. [2018-06-24 21:13:44,436 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:44,436 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 21:13:44,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:44,439 INFO ]: With dead ends: 35 [2018-06-24 21:13:44,439 INFO ]: Without dead ends: 35 [2018-06-24 21:13:44,440 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:44,440 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:13:44,449 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 21:13:44,449 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 21:13:44,451 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 75 transitions. [2018-06-24 21:13:44,451 INFO ]: Start accepts. Automaton has 35 states and 75 transitions. Word has length 8 [2018-06-24 21:13:44,451 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:44,451 INFO ]: Abstraction has 35 states and 75 transitions. [2018-06-24 21:13:44,451 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:44,451 INFO ]: Start isEmpty. Operand 35 states and 75 transitions. [2018-06-24 21:13:44,454 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:13:44,454 INFO ]: Found error trace [2018-06-24 21:13:44,454 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:44,454 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:44,455 INFO ]: Analyzing trace with hash -158038167, now seen corresponding path program 1 times [2018-06-24 21:13:44,455 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:44,455 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:44,455 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:44,456 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:44,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:44,461 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:44,505 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:13:44,505 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:44,505 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:13:44,505 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:44,505 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:44,505 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:44,505 INFO ]: Start difference. First operand 35 states and 75 transitions. Second operand 3 states. [2018-06-24 21:13:44,765 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:44,765 INFO ]: Finished difference Result 45 states and 99 transitions. [2018-06-24 21:13:44,765 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:44,765 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-24 21:13:44,765 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:44,768 INFO ]: With dead ends: 45 [2018-06-24 21:13:44,768 INFO ]: Without dead ends: 45 [2018-06-24 21:13:44,768 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:44,768 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 21:13:44,776 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-24 21:13:44,776 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 21:13:44,778 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 99 transitions. [2018-06-24 21:13:44,778 INFO ]: Start accepts. Automaton has 45 states and 99 transitions. Word has length 13 [2018-06-24 21:13:44,778 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:44,779 INFO ]: Abstraction has 45 states and 99 transitions. [2018-06-24 21:13:44,779 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:44,779 INFO ]: Start isEmpty. Operand 45 states and 99 transitions. [2018-06-24 21:13:44,782 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:13:44,782 INFO ]: Found error trace [2018-06-24 21:13:44,782 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:44,782 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:44,782 INFO ]: Analyzing trace with hash -28955448, now seen corresponding path program 1 times [2018-06-24 21:13:44,782 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:44,782 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:44,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:44,783 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:44,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:44,798 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:44,857 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:13:44,857 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:44,857 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:13:44,857 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:44,857 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:44,857 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:44,858 INFO ]: Start difference. First operand 45 states and 99 transitions. Second operand 3 states. [2018-06-24 21:13:44,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:44,875 INFO ]: Finished difference Result 69 states and 135 transitions. [2018-06-24 21:13:44,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:44,875 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-24 21:13:44,875 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:44,878 INFO ]: With dead ends: 69 [2018-06-24 21:13:44,878 INFO ]: Without dead ends: 69 [2018-06-24 21:13:44,878 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:44,879 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-24 21:13:44,888 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 49. [2018-06-24 21:13:44,888 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 21:13:44,889 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 103 transitions. [2018-06-24 21:13:44,890 INFO ]: Start accepts. Automaton has 49 states and 103 transitions. Word has length 13 [2018-06-24 21:13:44,890 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:44,890 INFO ]: Abstraction has 49 states and 103 transitions. [2018-06-24 21:13:44,890 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:44,890 INFO ]: Start isEmpty. Operand 49 states and 103 transitions. [2018-06-24 21:13:44,892 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:13:44,892 INFO ]: Found error trace [2018-06-24 21:13:44,892 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:44,893 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:44,893 INFO ]: Analyzing trace with hash 100127271, now seen corresponding path program 1 times [2018-06-24 21:13:44,893 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:44,893 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:44,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:44,893 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:44,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:44,908 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:44,974 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:13:44,974 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:44,974 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:13:44,974 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:44,974 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:44,974 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:44,974 INFO ]: Start difference. First operand 49 states and 103 transitions. Second operand 3 states. [2018-06-24 21:13:45,050 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:45,050 INFO ]: Finished difference Result 85 states and 155 transitions. [2018-06-24 21:13:45,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:45,054 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-24 21:13:45,054 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:45,056 INFO ]: With dead ends: 85 [2018-06-24 21:13:45,056 INFO ]: Without dead ends: 77 [2018-06-24 21:13:45,057 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:45,057 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-24 21:13:45,076 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 49. [2018-06-24 21:13:45,076 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 21:13:45,078 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 103 transitions. [2018-06-24 21:13:45,078 INFO ]: Start accepts. Automaton has 49 states and 103 transitions. Word has length 13 [2018-06-24 21:13:45,078 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:45,078 INFO ]: Abstraction has 49 states and 103 transitions. [2018-06-24 21:13:45,078 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:45,078 INFO ]: Start isEmpty. Operand 49 states and 103 transitions. [2018-06-24 21:13:45,080 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:13:45,081 INFO ]: Found error trace [2018-06-24 21:13:45,081 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:45,081 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:45,081 INFO ]: Analyzing trace with hash -691650376, now seen corresponding path program 1 times [2018-06-24 21:13:45,081 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:45,081 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:45,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:45,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:45,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:45,101 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:45,185 INFO ]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:13:45,185 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:45,185 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:45,201 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:45,250 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:45,258 INFO ]: Computing forward predicates... [2018-06-24 21:13:45,280 INFO ]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:13:45,312 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:13:45,312 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:13:45,313 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:45,313 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:45,313 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:45,313 INFO ]: Start difference. First operand 49 states and 103 transitions. Second operand 3 states. [2018-06-24 21:13:45,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:45,617 INFO ]: Finished difference Result 60 states and 122 transitions. [2018-06-24 21:13:45,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:45,620 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 21:13:45,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:45,621 INFO ]: With dead ends: 60 [2018-06-24 21:13:45,621 INFO ]: Without dead ends: 60 [2018-06-24 21:13:45,622 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:45,622 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-24 21:13:45,629 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-24 21:13:45,629 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-24 21:13:45,630 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 122 transitions. [2018-06-24 21:13:45,630 INFO ]: Start accepts. Automaton has 60 states and 122 transitions. Word has length 17 [2018-06-24 21:13:45,630 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:45,631 INFO ]: Abstraction has 60 states and 122 transitions. [2018-06-24 21:13:45,631 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:45,631 INFO ]: Start isEmpty. Operand 60 states and 122 transitions. [2018-06-24 21:13:45,632 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:13:45,632 INFO ]: Found error trace [2018-06-24 21:13:45,632 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:45,633 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:45,633 INFO ]: Analyzing trace with hash 1272310722, now seen corresponding path program 1 times [2018-06-24 21:13:45,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:45,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:45,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:45,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:45,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:45,655 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:45,733 INFO ]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-24 21:13:45,733 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:45,733 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:13:45,734 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:13:45,734 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:13:45,734 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:13:45,734 INFO ]: Start difference. First operand 60 states and 122 transitions. Second operand 4 states. [2018-06-24 21:13:45,802 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:45,802 INFO ]: Finished difference Result 120 states and 212 transitions. [2018-06-24 21:13:45,802 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:13:45,802 INFO ]: Start accepts. Automaton has 4 states. Word has length 26 [2018-06-24 21:13:45,803 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:45,805 INFO ]: With dead ends: 120 [2018-06-24 21:13:45,805 INFO ]: Without dead ends: 120 [2018-06-24 21:13:45,805 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-24 21:13:45,805 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-24 21:13:45,816 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 70. [2018-06-24 21:13:45,816 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-24 21:13:45,818 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 137 transitions. [2018-06-24 21:13:45,818 INFO ]: Start accepts. Automaton has 70 states and 137 transitions. Word has length 26 [2018-06-24 21:13:45,818 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:45,818 INFO ]: Abstraction has 70 states and 137 transitions. [2018-06-24 21:13:45,818 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:13:45,818 INFO ]: Start isEmpty. Operand 70 states and 137 transitions. [2018-06-24 21:13:45,820 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:13:45,820 INFO ]: Found error trace [2018-06-24 21:13:45,820 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:45,820 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:45,821 INFO ]: Analyzing trace with hash 1553407942, now seen corresponding path program 1 times [2018-06-24 21:13:45,821 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:45,821 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:45,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:45,821 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:45,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:45,842 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:45,956 INFO ]: Checked inductivity of 35 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 21:13:45,956 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:45,956 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:45,965 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:46,002 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:46,005 INFO ]: Computing forward predicates... [2018-06-24 21:13:46,283 INFO ]: Checked inductivity of 35 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 21:13:46,309 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:46,309 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-06-24 21:13:46,309 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:13:46,309 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:13:46,309 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:13:46,310 INFO ]: Start difference. First operand 70 states and 137 transitions. Second operand 16 states. [2018-06-24 21:13:48,719 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:48,719 INFO ]: Finished difference Result 303 states and 675 transitions. [2018-06-24 21:13:48,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 21:13:48,720 INFO ]: Start accepts. Automaton has 16 states. Word has length 26 [2018-06-24 21:13:48,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:48,734 INFO ]: With dead ends: 303 [2018-06-24 21:13:48,734 INFO ]: Without dead ends: 283 [2018-06-24 21:13:48,735 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=270, Invalid=1710, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 21:13:48,735 INFO ]: Start minimizeSevpa. Operand 283 states. [2018-06-24 21:13:48,811 INFO ]: Finished minimizeSevpa. Reduced states from 283 to 139. [2018-06-24 21:13:48,811 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-24 21:13:48,817 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 284 transitions. [2018-06-24 21:13:48,817 INFO ]: Start accepts. Automaton has 139 states and 284 transitions. Word has length 26 [2018-06-24 21:13:48,817 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:48,817 INFO ]: Abstraction has 139 states and 284 transitions. [2018-06-24 21:13:48,817 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:13:48,817 INFO ]: Start isEmpty. Operand 139 states and 284 transitions. [2018-06-24 21:13:48,824 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-24 21:13:48,824 INFO ]: Found error trace [2018-06-24 21:13:48,824 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:48,825 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:48,826 INFO ]: Analyzing trace with hash -1800659280, now seen corresponding path program 1 times [2018-06-24 21:13:48,826 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:48,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:48,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:48,827 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:48,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:48,865 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:48,988 INFO ]: Checked inductivity of 166 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-06-24 21:13:48,988 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:48,988 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:49,000 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:49,069 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:49,074 INFO ]: Computing forward predicates... [2018-06-24 21:13:49,202 INFO ]: Checked inductivity of 166 backedges. 79 proven. 1 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-06-24 21:13:49,235 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:49,235 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2018-06-24 21:13:49,235 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:13:49,235 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:13:49,235 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:13:49,235 INFO ]: Start difference. First operand 139 states and 284 transitions. Second operand 5 states. [2018-06-24 21:13:49,656 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:49,656 INFO ]: Finished difference Result 164 states and 314 transitions. [2018-06-24 21:13:49,657 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:13:49,657 INFO ]: Start accepts. Automaton has 5 states. Word has length 52 [2018-06-24 21:13:49,657 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:49,659 INFO ]: With dead ends: 164 [2018-06-24 21:13:49,660 INFO ]: Without dead ends: 139 [2018-06-24 21:13:49,660 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:13:49,660 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-24 21:13:49,678 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-06-24 21:13:49,678 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-24 21:13:49,681 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 271 transitions. [2018-06-24 21:13:49,681 INFO ]: Start accepts. Automaton has 139 states and 271 transitions. Word has length 52 [2018-06-24 21:13:49,681 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:49,681 INFO ]: Abstraction has 139 states and 271 transitions. [2018-06-24 21:13:49,681 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:13:49,682 INFO ]: Start isEmpty. Operand 139 states and 271 transitions. [2018-06-24 21:13:49,687 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-24 21:13:49,687 INFO ]: Found error trace [2018-06-24 21:13:49,687 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:49,687 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:49,687 INFO ]: Analyzing trace with hash -667468687, now seen corresponding path program 1 times [2018-06-24 21:13:49,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:49,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:49,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:49,688 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:49,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:49,716 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:49,816 INFO ]: Checked inductivity of 166 backedges. 29 proven. 11 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-06-24 21:13:49,817 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:49,817 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:49,828 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:49,886 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:49,891 INFO ]: Computing forward predicates... [2018-06-24 21:13:49,927 INFO ]: Checked inductivity of 166 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-24 21:13:49,959 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:49,959 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 21:13:49,959 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:13:49,959 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:13:49,959 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:13:49,959 INFO ]: Start difference. First operand 139 states and 271 transitions. Second operand 6 states. [2018-06-24 21:13:50,719 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:50,719 INFO ]: Finished difference Result 196 states and 392 transitions. [2018-06-24 21:13:50,719 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:13:50,719 INFO ]: Start accepts. Automaton has 6 states. Word has length 52 [2018-06-24 21:13:50,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:50,723 INFO ]: With dead ends: 196 [2018-06-24 21:13:50,723 INFO ]: Without dead ends: 196 [2018-06-24 21:13:50,723 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:13:50,723 INFO ]: Start minimizeSevpa. Operand 196 states. [2018-06-24 21:13:50,742 INFO ]: Finished minimizeSevpa. Reduced states from 196 to 169. [2018-06-24 21:13:50,742 INFO ]: Start removeUnreachable. Operand 169 states. [2018-06-24 21:13:50,745 INFO ]: Finished removeUnreachable. Reduced from 169 states to 169 states and 339 transitions. [2018-06-24 21:13:50,745 INFO ]: Start accepts. Automaton has 169 states and 339 transitions. Word has length 52 [2018-06-24 21:13:50,745 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:50,745 INFO ]: Abstraction has 169 states and 339 transitions. [2018-06-24 21:13:50,745 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:13:50,745 INFO ]: Start isEmpty. Operand 169 states and 339 transitions. [2018-06-24 21:13:50,751 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-24 21:13:50,751 INFO ]: Found error trace [2018-06-24 21:13:50,751 INFO ]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:50,751 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:50,751 INFO ]: Analyzing trace with hash -2143298954, now seen corresponding path program 1 times [2018-06-24 21:13:50,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:50,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:50,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:50,752 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:50,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:50,776 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:50,890 INFO ]: Checked inductivity of 267 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-06-24 21:13:50,890 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:50,890 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:50,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:50,958 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:50,963 INFO ]: Computing forward predicates... [2018-06-24 21:13:51,101 INFO ]: Checked inductivity of 267 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-06-24 21:13:51,122 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:13:51,122 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-06-24 21:13:51,122 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:13:51,122 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:13:51,122 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:13:51,122 INFO ]: Start difference. First operand 169 states and 339 transitions. Second operand 6 states. [2018-06-24 21:13:51,441 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:51,441 INFO ]: Finished difference Result 223 states and 435 transitions. [2018-06-24 21:13:51,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:13:51,441 INFO ]: Start accepts. Automaton has 6 states. Word has length 65 [2018-06-24 21:13:51,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:51,445 INFO ]: With dead ends: 223 [2018-06-24 21:13:51,445 INFO ]: Without dead ends: 187 [2018-06-24 21:13:51,446 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:13:51,446 INFO ]: Start minimizeSevpa. Operand 187 states. [2018-06-24 21:13:51,461 INFO ]: Finished minimizeSevpa. Reduced states from 187 to 169. [2018-06-24 21:13:51,462 INFO ]: Start removeUnreachable. Operand 169 states. [2018-06-24 21:13:51,464 INFO ]: Finished removeUnreachable. Reduced from 169 states to 169 states and 321 transitions. [2018-06-24 21:13:51,464 INFO ]: Start accepts. Automaton has 169 states and 321 transitions. Word has length 65 [2018-06-24 21:13:51,464 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:51,464 INFO ]: Abstraction has 169 states and 321 transitions. [2018-06-24 21:13:51,464 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:13:51,464 INFO ]: Start isEmpty. Operand 169 states and 321 transitions. [2018-06-24 21:13:51,470 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-24 21:13:51,470 INFO ]: Found error trace [2018-06-24 21:13:51,470 INFO ]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:51,470 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:51,470 INFO ]: Analyzing trace with hash 2042882546, now seen corresponding path program 1 times [2018-06-24 21:13:51,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:51,470 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:51,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:51,471 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:51,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:51,496 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:51,666 INFO ]: Checked inductivity of 267 backedges. 53 proven. 49 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-06-24 21:13:51,666 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:51,666 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:51,674 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:51,738 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:51,743 INFO ]: Computing forward predicates... [2018-06-24 21:13:52,088 INFO ]: Checked inductivity of 267 backedges. 151 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-06-24 21:13:52,120 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:52,120 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-06-24 21:13:52,120 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:13:52,120 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:13:52,120 INFO ]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:13:52,121 INFO ]: Start difference. First operand 169 states and 321 transitions. Second operand 18 states. [2018-06-24 21:13:54,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:54,032 INFO ]: Finished difference Result 171 states and 314 transitions. [2018-06-24 21:13:54,032 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-06-24 21:13:54,032 INFO ]: Start accepts. Automaton has 18 states. Word has length 65 [2018-06-24 21:13:54,032 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:54,032 INFO ]: With dead ends: 171 [2018-06-24 21:13:54,032 INFO ]: Without dead ends: 0 [2018-06-24 21:13:54,034 INFO ]: 0 DeclaredPredicates, 140 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1675 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=683, Invalid=5169, Unknown=0, NotChecked=0, Total=5852 [2018-06-24 21:13:54,034 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:13:54,034 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:13:54,034 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:13:54,034 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:13:54,034 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2018-06-24 21:13:54,034 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:54,034 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:13:54,034 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:13:54,034 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:13:54,034 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:13:54,036 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:13:54,037 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:13:54 BasicIcfg [2018-06-24 21:13:54,037 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:13:54,038 INFO ]: Toolchain (without parser) took 11810.35 ms. Allocated memory was 308.8 MB in the beginning and 583.5 MB in the end (delta: 274.7 MB). Free memory was 261.2 MB in the beginning and 497.6 MB in the end (delta: -236.4 MB). Peak memory consumption was 38.3 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:54,039 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:13:54,040 INFO ]: ChcToBoogie took 63.62 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 258.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:54,040 INFO ]: Boogie Preprocessor took 52.37 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 257.2 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. [2018-06-24 21:13:54,041 INFO ]: RCFGBuilder took 391.32 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 244.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:54,041 INFO ]: BlockEncodingV2 took 440.54 ms. Allocated memory is still 308.8 MB. Free memory was 244.2 MB in the beginning and 227.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:54,041 INFO ]: TraceAbstraction took 10841.57 ms. Allocated memory was 308.8 MB in the beginning and 583.5 MB in the end (delta: 274.7 MB). Free memory was 227.2 MB in the beginning and 497.6 MB in the end (delta: -270.4 MB). Peak memory consumption was 4.3 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:54,046 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 30 locations, 41 edges - StatisticsResult: Encoded RCFG 15 locations, 30 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.62 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 258.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 52.37 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 257.2 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. * RCFGBuilder took 391.32 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 244.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 440.54 ms. Allocated memory is still 308.8 MB. Free memory was 244.2 MB in the beginning and 227.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 10841.57 ms. Allocated memory was 308.8 MB in the beginning and 583.5 MB in the end (delta: 274.7 MB). Free memory was 227.2 MB in the beginning and 497.6 MB in the end (delta: -270.4 MB). Peak memory consumption was 4.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. SAFE Result, 10.7s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 7.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 506 SDtfs, 286 SDslu, 1071 SDs, 0 SdLazy, 3134 SolverSat, 520 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2109 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=10, 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.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 287 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 631 NumberOfCodeBlocks, 631 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 613 ConstructedInterpolants, 0 QuantifiedInterpolants, 45806 SizeOfPredicates, 36 NumberOfNonLiveVariables, 2383 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 1796/1881 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/bcopy.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-13-54-056.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bcopy.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-13-54-056.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bcopy.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-13-54-056.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bcopy.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-13-54-056.csv Received shutdown request...