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-62c3406-m [2018-06-26 18:17:10,328 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:17:10,330 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:17:10,341 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:17:10,341 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:17:10,342 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:17:10,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:17:10,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:17:10,351 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:17:10,352 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:17:10,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:17:10,355 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:17:10,356 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:17:10,357 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:17:10,358 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:17:10,358 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:17:10,359 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:17:10,370 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:17:10,372 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:17:10,374 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:17:10,375 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:17:10,376 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:17:10,378 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:17:10,378 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:17:10,379 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:17:10,383 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:17:10,384 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:17:10,385 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:17:10,386 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:17:10,392 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:17:10,393 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:17:10,394 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:17:10,394 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:17:10,394 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:17:10,395 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:17:10,395 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:17:10,396 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:17:10,422 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:17:10,422 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:17:10,422 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:17:10,422 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:17:10,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:17:10,428 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:17:10,428 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:17:10,428 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:17:10,428 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:17:10,428 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:17:10,429 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:17:10,429 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:17:10,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:17:10,429 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:17:10,429 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:17:10,429 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:17:10,430 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:17:10,430 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:17:10,430 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:17:10,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:17:10,430 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:17:10,432 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:17:10,432 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:17:10,475 INFO ]: Repository-Root is: /tmp [2018-06-26 18:17:10,491 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:17:10,495 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:17:10,497 INFO ]: Initializing SmtParser... [2018-06-26 18:17:10,497 INFO ]: SmtParser initialized [2018-06-26 18:17:10,497 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/bcopy.smt2 [2018-06-26 18:17:10,499 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 18:17:10,582 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/bcopy.smt2 unknown [2018-06-26 18:17:10,929 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/bcopy.smt2 [2018-06-26 18:17:10,933 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:17:10,940 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:17:10,942 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:17:10,942 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:17:10,943 INFO ]: ChcToBoogie initialized [2018-06-26 18:17:10,947 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:17:10" (1/1) ... [2018-06-26 18:17:11,004 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:17:11 Unit [2018-06-26 18:17:11,004 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:17:11,005 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:17:11,005 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:17:11,005 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:17:11,025 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:17:11" (1/1) ... [2018-06-26 18:17:11,025 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:17:11" (1/1) ... [2018-06-26 18:17:11,034 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:17:11" (1/1) ... [2018-06-26 18:17:11,034 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:17:11" (1/1) ... [2018-06-26 18:17:11,040 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:17:11" (1/1) ... [2018-06-26 18:17:11,042 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:17:11" (1/1) ... [2018-06-26 18:17:11,043 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:17:11" (1/1) ... [2018-06-26 18:17:11,045 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:17:11,046 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:17:11,046 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:17:11,046 INFO ]: RCFGBuilder initialized [2018-06-26 18:17:11,046 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:17: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 18:17:11,062 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:17:11,062 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:17:11,062 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:17:11,062 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:17:11,062 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:17:11,062 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 18:17:11,439 INFO ]: Using library mode [2018-06-26 18:17:11,445 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:17:11 BoogieIcfgContainer [2018-06-26 18:17:11,445 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:17:11,446 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:17:11,446 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:17:11,447 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:17:11,447 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:17:11" (1/1) ... [2018-06-26 18:17:11,465 INFO ]: Initial Icfg 30 locations, 41 edges [2018-06-26 18:17:11,466 INFO ]: Using Remove infeasible edges [2018-06-26 18:17:11,466 INFO ]: Using Maximize final states [2018-06-26 18:17:11,466 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:17:11,467 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:17:11,469 INFO ]: Using Remove sink states [2018-06-26 18:17:11,469 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:17:11,469 INFO ]: Using Use SBE [2018-06-26 18:17:11,494 INFO ]: SBE split 2 edges [2018-06-26 18:17:11,499 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-26 18:17:11,501 INFO ]: 0 new accepting states [2018-06-26 18:17:11,853 INFO ]: Removed 52 edges and 13 locations by large block encoding [2018-06-26 18:17:11,855 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:17:11,856 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:17:11,856 INFO ]: 0 new accepting states [2018-06-26 18:17:11,856 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:17:11,857 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:17:11,857 INFO ]: Encoded RCFG 15 locations, 30 edges [2018-06-26 18:17:11,857 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:17:11 BasicIcfg [2018-06-26 18:17:11,857 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:17:11,858 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:17:11,858 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:17:11,861 INFO ]: TraceAbstraction initialized [2018-06-26 18:17:11,861 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:17:10" (1/4) ... [2018-06-26 18:17:11,862 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed8ea95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:17:11, skipping insertion in model container [2018-06-26 18:17:11,862 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:17:11" (2/4) ... [2018-06-26 18:17:11,862 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed8ea95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:17:11, skipping insertion in model container [2018-06-26 18:17:11,863 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:17:11" (3/4) ... [2018-06-26 18:17:11,863 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed8ea95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:17:11, skipping insertion in model container [2018-06-26 18:17:11,863 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:17:11" (4/4) ... [2018-06-26 18:17:11,864 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:17:11,873 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:17:11,879 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:17:11,914 INFO ]: Using default assertion order modulation [2018-06-26 18:17:11,915 INFO ]: Interprodecural is true [2018-06-26 18:17:11,915 INFO ]: Hoare is false [2018-06-26 18:17:11,915 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:17:11,915 INFO ]: Backedges is TWOTRACK [2018-06-26 18:17:11,915 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:17:11,915 INFO ]: Difference is false [2018-06-26 18:17:11,915 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:17:11,915 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:17:11,924 INFO ]: Start isEmpty. Operand 15 states. [2018-06-26 18:17:11,933 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-26 18:17:11,933 INFO ]: Found error trace [2018-06-26 18:17:11,934 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-26 18:17:11,934 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:17:11,938 INFO ]: Analyzing trace with hash 1259190, now seen corresponding path program 1 times [2018-06-26 18:17:11,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:17:11,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:17:11,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:11,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:11,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:12,013 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:12,063 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:17:12,064 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:17:12,065 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:17:12,066 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:17:12,077 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:17:12,077 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:17:12,079 INFO ]: Start difference. First operand 15 states. Second operand 3 states. [2018-06-26 18:17:12,366 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:17:12,366 INFO ]: Finished difference Result 25 states and 52 transitions. [2018-06-26 18:17:12,367 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:17:12,368 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-26 18:17:12,368 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:17:12,379 INFO ]: With dead ends: 25 [2018-06-26 18:17:12,379 INFO ]: Without dead ends: 25 [2018-06-26 18:17:12,382 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:17:12,396 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 18:17:12,432 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-26 18:17:12,433 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 18:17:12,436 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2018-06-26 18:17:12,438 INFO ]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 4 [2018-06-26 18:17:12,440 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:17:12,440 INFO ]: Abstraction has 25 states and 52 transitions. [2018-06-26 18:17:12,440 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:17:12,441 INFO ]: Start isEmpty. Operand 25 states and 52 transitions. [2018-06-26 18:17:12,449 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:17:12,449 INFO ]: Found error trace [2018-06-26 18:17:12,449 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:17:12,449 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:17:12,450 INFO ]: Analyzing trace with hash -1815193691, now seen corresponding path program 1 times [2018-06-26 18:17:12,450 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:17:12,450 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:17:12,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:12,450 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:12,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:12,461 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:12,548 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:17:12,548 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:17:12,548 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:17:12,550 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:17:12,550 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:17:12,550 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:17:12,550 INFO ]: Start difference. First operand 25 states and 52 transitions. Second operand 3 states. [2018-06-26 18:17:12,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:17:12,971 INFO ]: Finished difference Result 35 states and 75 transitions. [2018-06-26 18:17:12,971 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:17:12,971 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 18:17:12,971 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:17:12,974 INFO ]: With dead ends: 35 [2018-06-26 18:17:12,974 INFO ]: Without dead ends: 35 [2018-06-26 18:17:12,975 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:17:12,975 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 18:17:12,982 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 18:17:12,982 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 18:17:12,985 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 75 transitions. [2018-06-26 18:17:12,985 INFO ]: Start accepts. Automaton has 35 states and 75 transitions. Word has length 8 [2018-06-26 18:17:12,985 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:17:12,985 INFO ]: Abstraction has 35 states and 75 transitions. [2018-06-26 18:17:12,985 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:17:12,985 INFO ]: Start isEmpty. Operand 35 states and 75 transitions. [2018-06-26 18:17:12,988 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:17:12,988 INFO ]: Found error trace [2018-06-26 18:17:12,988 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:17:12,988 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:17:12,988 INFO ]: Analyzing trace with hash 730389035, now seen corresponding path program 1 times [2018-06-26 18:17:12,988 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:17:12,988 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:17:12,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:12,989 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:12,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:12,997 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:13,041 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:17:13,041 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:17:13,041 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:17:13,041 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:17:13,041 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:17:13,041 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:17:13,041 INFO ]: Start difference. First operand 35 states and 75 transitions. Second operand 3 states. [2018-06-26 18:17:13,084 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:17:13,085 INFO ]: Finished difference Result 53 states and 102 transitions. [2018-06-26 18:17:13,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:17:13,085 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 18:17:13,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:17:13,088 INFO ]: With dead ends: 53 [2018-06-26 18:17:13,088 INFO ]: Without dead ends: 53 [2018-06-26 18:17:13,088 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:17:13,088 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 18:17:13,095 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 38. [2018-06-26 18:17:13,095 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 18:17:13,097 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2018-06-26 18:17:13,097 INFO ]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 13 [2018-06-26 18:17:13,097 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:17:13,097 INFO ]: Abstraction has 38 states and 78 transitions. [2018-06-26 18:17:13,097 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:17:13,097 INFO ]: Start isEmpty. Operand 38 states and 78 transitions. [2018-06-26 18:17:13,100 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:17:13,100 INFO ]: Found error trace [2018-06-26 18:17:13,101 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:17:13,101 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:17:13,101 INFO ]: Analyzing trace with hash 1246719911, now seen corresponding path program 1 times [2018-06-26 18:17:13,101 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:17:13,101 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:17:13,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:13,102 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:13,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:13,107 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:13,182 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:17:13,182 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:17:13,182 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:17:13,182 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:17:13,183 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:17:13,183 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:17:13,183 INFO ]: Start difference. First operand 38 states and 78 transitions. Second operand 3 states. [2018-06-26 18:17:13,469 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:17:13,469 INFO ]: Finished difference Result 49 states and 103 transitions. [2018-06-26 18:17:13,469 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:17:13,469 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 18:17:13,470 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:17:13,472 INFO ]: With dead ends: 49 [2018-06-26 18:17:13,472 INFO ]: Without dead ends: 49 [2018-06-26 18:17:13,472 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:17:13,472 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-26 18:17:13,480 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-26 18:17:13,480 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-26 18:17:13,481 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 103 transitions. [2018-06-26 18:17:13,481 INFO ]: Start accepts. Automaton has 49 states and 103 transitions. Word has length 13 [2018-06-26 18:17:13,481 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:17:13,481 INFO ]: Abstraction has 49 states and 103 transitions. [2018-06-26 18:17:13,481 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:17:13,481 INFO ]: Start isEmpty. Operand 49 states and 103 transitions. [2018-06-26 18:17:13,484 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:17:13,484 INFO ]: Found error trace [2018-06-26 18:17:13,484 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:17:13,484 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:17:13,484 INFO ]: Analyzing trace with hash 1375802630, now seen corresponding path program 1 times [2018-06-26 18:17:13,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:17:13,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:17:13,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:13,484 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:13,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:13,503 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:13,589 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:17:13,589 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:17:13,589 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:17:13,589 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:17:13,589 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:17:13,589 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:17:13,589 INFO ]: Start difference. First operand 49 states and 103 transitions. Second operand 3 states. [2018-06-26 18:17:13,696 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:17:13,696 INFO ]: Finished difference Result 85 states and 155 transitions. [2018-06-26 18:17:13,697 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:17:13,697 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 18:17:13,697 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:17:13,699 INFO ]: With dead ends: 85 [2018-06-26 18:17:13,699 INFO ]: Without dead ends: 77 [2018-06-26 18:17:13,700 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:17:13,700 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-26 18:17:13,720 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 49. [2018-06-26 18:17:13,720 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-26 18:17:13,722 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 103 transitions. [2018-06-26 18:17:13,722 INFO ]: Start accepts. Automaton has 49 states and 103 transitions. Word has length 13 [2018-06-26 18:17:13,722 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:17:13,722 INFO ]: Abstraction has 49 states and 103 transitions. [2018-06-26 18:17:13,722 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:17:13,722 INFO ]: Start isEmpty. Operand 49 states and 103 transitions. [2018-06-26 18:17:13,724 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:17:13,724 INFO ]: Found error trace [2018-06-26 18:17:13,725 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:17:13,725 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:17:13,728 INFO ]: Analyzing trace with hash -308781799, now seen corresponding path program 1 times [2018-06-26 18:17:13,728 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:17:13,728 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:17:13,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:13,729 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:13,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:13,747 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:13,832 INFO ]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:17:13,832 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:17:13,832 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 18:17:13,849 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:13,897 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:13,904 INFO ]: Computing forward predicates... [2018-06-26 18:17:13,926 INFO ]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 18:17:13,951 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:17:13,951 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-26 18:17:13,951 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:17:13,951 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:17:13,951 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:17:13,951 INFO ]: Start difference. First operand 49 states and 103 transitions. Second operand 3 states. [2018-06-26 18:17:14,016 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:17:14,016 INFO ]: Finished difference Result 60 states and 122 transitions. [2018-06-26 18:17:14,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:17:14,017 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 18:17:14,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:17:14,019 INFO ]: With dead ends: 60 [2018-06-26 18:17:14,019 INFO ]: Without dead ends: 60 [2018-06-26 18:17:14,019 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-26 18:17:14,019 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-26 18:17:14,027 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-26 18:17:14,027 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-26 18:17:14,028 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 122 transitions. [2018-06-26 18:17:14,028 INFO ]: Start accepts. Automaton has 60 states and 122 transitions. Word has length 17 [2018-06-26 18:17:14,028 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:17:14,028 INFO ]: Abstraction has 60 states and 122 transitions. [2018-06-26 18:17:14,028 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:17:14,028 INFO ]: Start isEmpty. Operand 60 states and 122 transitions. [2018-06-26 18:17:14,030 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 18:17:14,030 INFO ]: Found error trace [2018-06-26 18:17:14,030 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:17:14,030 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:17:14,031 INFO ]: Analyzing trace with hash -591633087, now seen corresponding path program 1 times [2018-06-26 18:17:14,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:17:14,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:17:14,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:14,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:14,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:14,052 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:14,104 INFO ]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-26 18:17:14,104 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:17:14,105 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:17:14,105 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:17:14,105 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:17:14,105 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:17:14,105 INFO ]: Start difference. First operand 60 states and 122 transitions. Second operand 4 states. [2018-06-26 18:17:14,188 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:17:14,188 INFO ]: Finished difference Result 120 states and 212 transitions. [2018-06-26 18:17:14,189 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:17:14,189 INFO ]: Start accepts. Automaton has 4 states. Word has length 26 [2018-06-26 18:17:14,189 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:17:14,192 INFO ]: With dead ends: 120 [2018-06-26 18:17:14,192 INFO ]: Without dead ends: 120 [2018-06-26 18:17:14,192 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 18:17:14,192 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-26 18:17:14,206 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 70. [2018-06-26 18:17:14,206 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-26 18:17:14,208 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 137 transitions. [2018-06-26 18:17:14,208 INFO ]: Start accepts. Automaton has 70 states and 137 transitions. Word has length 26 [2018-06-26 18:17:14,209 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:17:14,209 INFO ]: Abstraction has 70 states and 137 transitions. [2018-06-26 18:17:14,209 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:17:14,209 INFO ]: Start isEmpty. Operand 70 states and 137 transitions. [2018-06-26 18:17:14,211 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 18:17:14,211 INFO ]: Found error trace [2018-06-26 18:17:14,211 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:17:14,211 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:17:14,211 INFO ]: Analyzing trace with hash -451084477, now seen corresponding path program 1 times [2018-06-26 18:17:14,211 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:17:14,211 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:17:14,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:14,212 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:14,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:14,234 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:14,393 INFO ]: Checked inductivity of 35 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-26 18:17:14,393 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:17:14,393 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-26 18:17:14,400 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:14,430 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:14,435 INFO ]: Computing forward predicates... [2018-06-26 18:17:14,701 INFO ]: Checked inductivity of 35 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 18:17:14,726 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:17:14,727 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-06-26 18:17:14,727 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:17:14,727 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:17:14,727 INFO ]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:17:14,727 INFO ]: Start difference. First operand 70 states and 137 transitions. Second operand 16 states. [2018-06-26 18:17:17,400 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:17:17,400 INFO ]: Finished difference Result 303 states and 675 transitions. [2018-06-26 18:17:17,401 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 18:17:17,401 INFO ]: Start accepts. Automaton has 16 states. Word has length 26 [2018-06-26 18:17:17,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:17:17,418 INFO ]: With dead ends: 303 [2018-06-26 18:17:17,418 INFO ]: Without dead ends: 283 [2018-06-26 18:17:17,419 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=262, Invalid=1630, Unknown=0, NotChecked=0, Total=1892 [2018-06-26 18:17:17,419 INFO ]: Start minimizeSevpa. Operand 283 states. [2018-06-26 18:17:17,506 INFO ]: Finished minimizeSevpa. Reduced states from 283 to 139. [2018-06-26 18:17:17,506 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-26 18:17:17,509 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 284 transitions. [2018-06-26 18:17:17,509 INFO ]: Start accepts. Automaton has 139 states and 284 transitions. Word has length 26 [2018-06-26 18:17:17,510 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:17:17,510 INFO ]: Abstraction has 139 states and 284 transitions. [2018-06-26 18:17:17,510 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:17:17,510 INFO ]: Start isEmpty. Operand 139 states and 284 transitions. [2018-06-26 18:17:17,515 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-26 18:17:17,515 INFO ]: Found error trace [2018-06-26 18:17:17,515 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-26 18:17:17,515 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:17:17,515 INFO ]: Analyzing trace with hash 693371023, now seen corresponding path program 1 times [2018-06-26 18:17:17,515 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:17:17,515 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:17:17,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:17,516 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:17,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:17,550 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:17,738 INFO ]: Checked inductivity of 166 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-06-26 18:17:17,738 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:17:17,738 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) [2018-06-26 18:17:17,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:17:17,836 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:17,841 INFO ]: Computing forward predicates... [2018-06-26 18:17:17,870 INFO ]: Checked inductivity of 166 backedges. 79 proven. 1 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-06-26 18:17:17,901 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:17:17,901 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 18:17:17,901 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:17:17,901 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:17:17,901 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:17:17,902 INFO ]: Start difference. First operand 139 states and 284 transitions. Second operand 4 states. [2018-06-26 18:17:18,119 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:17:18,119 INFO ]: Finished difference Result 175 states and 344 transitions. [2018-06-26 18:17:18,120 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:17:18,120 INFO ]: Start accepts. Automaton has 4 states. Word has length 52 [2018-06-26 18:17:18,120 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:17:18,124 INFO ]: With dead ends: 175 [2018-06-26 18:17:18,125 INFO ]: Without dead ends: 175 [2018-06-26 18:17:18,125 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:17:18,125 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-26 18:17:18,157 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 151. [2018-06-26 18:17:18,157 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-26 18:17:18,160 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 302 transitions. [2018-06-26 18:17:18,160 INFO ]: Start accepts. Automaton has 151 states and 302 transitions. Word has length 52 [2018-06-26 18:17:18,160 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:17:18,160 INFO ]: Abstraction has 151 states and 302 transitions. [2018-06-26 18:17:18,160 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:17:18,160 INFO ]: Start isEmpty. Operand 151 states and 302 transitions. [2018-06-26 18:17:18,167 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-26 18:17:18,167 INFO ]: Found error trace [2018-06-26 18:17:18,167 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-26 18:17:18,167 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:17:18,167 INFO ]: Analyzing trace with hash -1335215087, now seen corresponding path program 1 times [2018-06-26 18:17:18,167 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:17:18,167 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:17:18,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:18,169 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:18,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:18,198 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:18,269 INFO ]: Checked inductivity of 166 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-06-26 18:17:18,269 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:17:18,269 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 18:17:18,279 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:18,354 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:18,359 INFO ]: Computing forward predicates... [2018-06-26 18:17:18,384 INFO ]: Checked inductivity of 166 backedges. 79 proven. 1 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-06-26 18:17:18,404 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:17:18,404 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2018-06-26 18:17:18,404 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:17:18,404 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:17:18,404 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:17:18,404 INFO ]: Start difference. First operand 151 states and 302 transitions. Second operand 5 states. [2018-06-26 18:17:18,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:17:18,684 INFO ]: Finished difference Result 176 states and 332 transitions. [2018-06-26 18:17:18,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:17:18,684 INFO ]: Start accepts. Automaton has 5 states. Word has length 52 [2018-06-26 18:17:18,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:17:18,687 INFO ]: With dead ends: 176 [2018-06-26 18:17:18,687 INFO ]: Without dead ends: 139 [2018-06-26 18:17:18,687 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:17:18,687 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-26 18:17:18,700 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-06-26 18:17:18,700 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-26 18:17:18,702 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 271 transitions. [2018-06-26 18:17:18,702 INFO ]: Start accepts. Automaton has 139 states and 271 transitions. Word has length 52 [2018-06-26 18:17:18,702 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:17:18,702 INFO ]: Abstraction has 139 states and 271 transitions. [2018-06-26 18:17:18,703 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:17:18,703 INFO ]: Start isEmpty. Operand 139 states and 271 transitions. [2018-06-26 18:17:18,707 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-26 18:17:18,707 INFO ]: Found error trace [2018-06-26 18:17:18,707 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-26 18:17:18,707 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:17:18,707 INFO ]: Analyzing trace with hash 2064356692, now seen corresponding path program 1 times [2018-06-26 18:17:18,707 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:17:18,707 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:17:18,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:18,708 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:18,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:18,733 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:18,832 INFO ]: Checked inductivity of 166 backedges. 29 proven. 11 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-06-26 18:17:18,832 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:17:18,832 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 18:17:18,838 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:18,905 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:18,910 INFO ]: Computing forward predicates... [2018-06-26 18:17:19,117 INFO ]: Checked inductivity of 166 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-26 18:17:19,137 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:17:19,137 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 18:17:19,137 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:17:19,137 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:17:19,137 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:17:19,137 INFO ]: Start difference. First operand 139 states and 271 transitions. Second operand 6 states. [2018-06-26 18:17:19,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:17:19,361 INFO ]: Finished difference Result 196 states and 392 transitions. [2018-06-26 18:17:19,362 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:17:19,362 INFO ]: Start accepts. Automaton has 6 states. Word has length 52 [2018-06-26 18:17:19,362 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:17:19,366 INFO ]: With dead ends: 196 [2018-06-26 18:17:19,366 INFO ]: Without dead ends: 196 [2018-06-26 18:17:19,366 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:17:19,366 INFO ]: Start minimizeSevpa. Operand 196 states. [2018-06-26 18:17:19,385 INFO ]: Finished minimizeSevpa. Reduced states from 196 to 169. [2018-06-26 18:17:19,385 INFO ]: Start removeUnreachable. Operand 169 states. [2018-06-26 18:17:19,387 INFO ]: Finished removeUnreachable. Reduced from 169 states to 169 states and 339 transitions. [2018-06-26 18:17:19,388 INFO ]: Start accepts. Automaton has 169 states and 339 transitions. Word has length 52 [2018-06-26 18:17:19,388 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:17:19,388 INFO ]: Abstraction has 169 states and 339 transitions. [2018-06-26 18:17:19,388 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:17:19,388 INFO ]: Start isEmpty. Operand 169 states and 339 transitions. [2018-06-26 18:17:19,394 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-26 18:17:19,394 INFO ]: Found error trace [2018-06-26 18:17:19,394 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-26 18:17:19,394 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:17:19,394 INFO ]: Analyzing trace with hash 320653497, now seen corresponding path program 1 times [2018-06-26 18:17:19,394 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:17:19,394 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:17:19,395 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:19,395 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:19,395 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:19,420 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:19,497 INFO ]: Checked inductivity of 267 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-06-26 18:17:19,497 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:17:19,497 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 18:17:19,505 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:19,580 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:19,585 INFO ]: Computing forward predicates... [2018-06-26 18:17:19,728 INFO ]: Checked inductivity of 267 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-06-26 18:17:19,748 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:17:19,748 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-06-26 18:17:19,748 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:17:19,748 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:17:19,748 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:17:19,748 INFO ]: Start difference. First operand 169 states and 339 transitions. Second operand 6 states. [2018-06-26 18:17:20,212 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-26 18:17:20,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:17:20,333 INFO ]: Finished difference Result 223 states and 435 transitions. [2018-06-26 18:17:20,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:17:20,333 INFO ]: Start accepts. Automaton has 6 states. Word has length 65 [2018-06-26 18:17:20,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:17:20,337 INFO ]: With dead ends: 223 [2018-06-26 18:17:20,337 INFO ]: Without dead ends: 187 [2018-06-26 18:17:20,337 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:17:20,337 INFO ]: Start minimizeSevpa. Operand 187 states. [2018-06-26 18:17:20,355 INFO ]: Finished minimizeSevpa. Reduced states from 187 to 169. [2018-06-26 18:17:20,355 INFO ]: Start removeUnreachable. Operand 169 states. [2018-06-26 18:17:20,358 INFO ]: Finished removeUnreachable. Reduced from 169 states to 169 states and 321 transitions. [2018-06-26 18:17:20,359 INFO ]: Start accepts. Automaton has 169 states and 321 transitions. Word has length 65 [2018-06-26 18:17:20,359 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:17:20,359 INFO ]: Abstraction has 169 states and 321 transitions. [2018-06-26 18:17:20,359 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:17:20,359 INFO ]: Start isEmpty. Operand 169 states and 321 transitions. [2018-06-26 18:17:20,366 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-26 18:17:20,366 INFO ]: Found error trace [2018-06-26 18:17:20,366 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-26 18:17:20,366 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:17:20,367 INFO ]: Analyzing trace with hash 266260599, now seen corresponding path program 1 times [2018-06-26 18:17:20,367 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:17:20,367 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:17:20,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:20,368 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:20,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:20,405 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:20,685 INFO ]: Checked inductivity of 267 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-06-26 18:17:20,685 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:17:20,685 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:17:20,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:20,751 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:20,757 INFO ]: Computing forward predicates... [2018-06-26 18:17:20,801 INFO ]: Checked inductivity of 267 backedges. 151 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-06-26 18:17:20,827 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:17:20,827 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-06-26 18:17:20,827 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:17:20,828 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:17:20,828 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:17:20,828 INFO ]: Start difference. First operand 169 states and 321 transitions. Second operand 8 states. [2018-06-26 18:17:21,500 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:17:21,500 INFO ]: Finished difference Result 369 states and 947 transitions. [2018-06-26 18:17:21,548 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-26 18:17:21,548 INFO ]: Start accepts. Automaton has 8 states. Word has length 65 [2018-06-26 18:17:21,548 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:17:21,554 INFO ]: With dead ends: 369 [2018-06-26 18:17:21,554 INFO ]: Without dead ends: 236 [2018-06-26 18:17:21,554 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 18:17:21,554 INFO ]: Start minimizeSevpa. Operand 236 states. [2018-06-26 18:17:21,582 INFO ]: Finished minimizeSevpa. Reduced states from 236 to 183. [2018-06-26 18:17:21,582 INFO ]: Start removeUnreachable. Operand 183 states. [2018-06-26 18:17:21,586 INFO ]: Finished removeUnreachable. Reduced from 183 states to 183 states and 354 transitions. [2018-06-26 18:17:21,586 INFO ]: Start accepts. Automaton has 183 states and 354 transitions. Word has length 65 [2018-06-26 18:17:21,586 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:17:21,586 INFO ]: Abstraction has 183 states and 354 transitions. [2018-06-26 18:17:21,586 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:17:21,586 INFO ]: Start isEmpty. Operand 183 states and 354 transitions. [2018-06-26 18:17:21,593 INFO ]: Finished isEmpty. Found accepting run of length 105 [2018-06-26 18:17:21,593 INFO ]: Found error trace [2018-06-26 18:17:21,593 INFO ]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-06-26 18:17:21,593 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:17:21,593 INFO ]: Analyzing trace with hash -1466475921, now seen corresponding path program 2 times [2018-06-26 18:17:21,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:17:21,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:17:21,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:21,594 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:17:21,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:17:21,629 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:21,785 INFO ]: Checked inductivity of 718 backedges. 130 proven. 29 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2018-06-26 18:17:21,785 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:17:21,785 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:17:21,795 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:17:21,933 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:17:21,933 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:17:21,941 INFO ]: Computing forward predicates... [2018-06-26 18:17:22,144 INFO ]: Checked inductivity of 718 backedges. 359 proven. 28 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2018-06-26 18:17:22,166 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:17:22,166 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-06-26 18:17:22,166 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:17:22,166 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:17:22,166 INFO ]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:17:22,166 INFO ]: Start difference. First operand 183 states and 354 transitions. Second operand 20 states. [2018-06-26 18:17:23,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:17:23,183 INFO ]: Finished difference Result 118 states and 196 transitions. [2018-06-26 18:17:23,183 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 18:17:23,183 INFO ]: Start accepts. Automaton has 20 states. Word has length 104 [2018-06-26 18:17:23,183 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:17:23,184 INFO ]: With dead ends: 118 [2018-06-26 18:17:23,184 INFO ]: Without dead ends: 0 [2018-06-26 18:17:23,184 INFO ]: 0 DeclaredPredicates, 142 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=1645, Unknown=0, NotChecked=0, Total=1892 [2018-06-26 18:17:23,184 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 18:17:23,184 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 18:17:23,184 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 18:17:23,184 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 18:17:23,184 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2018-06-26 18:17:23,184 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:17:23,184 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 18:17:23,185 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:17:23,185 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 18:17:23,185 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 18:17:23,187 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:17:23,188 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:17:23 BasicIcfg [2018-06-26 18:17:23,188 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:17:23,189 INFO ]: Toolchain (without parser) took 12255.65 ms. Allocated memory was 307.8 MB in the beginning and 587.2 MB in the end (delta: 279.4 MB). Free memory was 260.1 MB in the beginning and 382.6 MB in the end (delta: -122.5 MB). Peak memory consumption was 156.9 MB. Max. memory is 3.6 GB. [2018-06-26 18:17:23,190 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:17:23,190 INFO ]: ChcToBoogie took 62.03 ms. Allocated memory is still 307.8 MB. Free memory was 260.1 MB in the beginning and 257.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:17:23,191 INFO ]: Boogie Preprocessor took 40.05 ms. Allocated memory is still 307.8 MB. Free memory was 257.1 MB in the beginning and 256.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 18:17:23,191 INFO ]: RCFGBuilder took 399.72 ms. Allocated memory is still 307.8 MB. Free memory was 256.1 MB in the beginning and 243.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:17:23,192 INFO ]: BlockEncodingV2 took 411.52 ms. Allocated memory is still 307.8 MB. Free memory was 243.1 MB in the beginning and 226.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:17:23,192 INFO ]: TraceAbstraction took 11329.93 ms. Allocated memory was 307.8 MB in the beginning and 587.2 MB in the end (delta: 279.4 MB). Free memory was 226.1 MB in the beginning and 382.6 MB in the end (delta: -156.5 MB). Peak memory consumption was 122.9 MB. Max. memory is 3.6 GB. [2018-06-26 18:17:23,195 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 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.03 ms. Allocated memory is still 307.8 MB. Free memory was 260.1 MB in the beginning and 257.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 40.05 ms. Allocated memory is still 307.8 MB. Free memory was 257.1 MB in the beginning and 256.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 399.72 ms. Allocated memory is still 307.8 MB. Free memory was 256.1 MB in the beginning and 243.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 411.52 ms. Allocated memory is still 307.8 MB. Free memory was 243.1 MB in the beginning and 226.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 11329.93 ms. Allocated memory was 307.8 MB in the beginning and 587.2 MB in the end (delta: 279.4 MB). Free memory was 226.1 MB in the beginning and 382.6 MB in the end (delta: -156.5 MB). Peak memory consumption was 122.9 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, 11.2s OverallTime, 14 OverallIterations, 8 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 618 SDtfs, 307 SDslu, 1334 SDs, 0 SdLazy, 3086 SolverSat, 595 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 598 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=13, 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.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 359 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 943 NumberOfCodeBlocks, 943 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 921 ConstructedInterpolants, 0 QuantifiedInterpolants, 87563 SizeOfPredicates, 56 NumberOfNonLiveVariables, 3744 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 22 InterpolantComputations, 8 PerfectInterpolantSequences, 3514/3649 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-26_18-17-23-205.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-26_18-17-23-205.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-26_18-17-23-205.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-26_18-17-23-205.csv Received shutdown request...