java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.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/gib.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:29:49,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:29:49,075 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:29:49,086 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:29:49,086 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:29:49,087 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:29:49,088 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:29:49,090 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:29:49,091 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:29:49,092 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:29:49,093 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:29:49,093 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:29:49,094 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:29:49,095 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:29:49,096 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:29:49,096 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:29:49,098 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:29:49,100 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:29:49,102 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:29:49,103 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:29:49,104 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:29:49,106 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:29:49,106 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:29:49,106 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:29:49,107 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:29:49,108 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:29:49,109 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:29:49,110 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:29:49,111 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:29:49,111 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:29:49,112 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:29:49,112 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:29:49,113 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:29:49,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:29:49,114 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:29:49,114 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:29:49,128 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:29:49,128 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:29:49,128 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:29:49,129 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:29:49,130 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:29:49,130 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:29:49,130 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:29:49,130 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:29:49,131 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:29:49,131 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:29:49,131 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:29:49,131 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:29:49,132 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:29:49,132 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:29:49,132 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:29:49,132 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:29:49,133 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:29:49,133 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:29:49,133 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:29:49,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:29:49,133 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:29:49,135 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:29:49,135 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:29:49,178 INFO ]: Repository-Root is: /tmp [2018-06-25 09:29:49,193 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:29:49,197 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:29:49,198 INFO ]: Initializing SmtParser... [2018-06-25 09:29:49,198 INFO ]: SmtParser initialized [2018-06-25 09:29:49,199 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/gib.smt2 [2018-06-25 09:29:49,200 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-25 09:29:49,294 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/gib.smt2 unknown [2018-06-25 09:29:49,480 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/gib.smt2 [2018-06-25 09:29:49,488 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:29:49,494 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:29:49,495 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:29:49,495 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:29:49,495 INFO ]: ChcToBoogie initialized [2018-06-25 09:29:49,498 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:29:49" (1/1) ... [2018-06-25 09:29:49,558 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:29:49 Unit [2018-06-25 09:29:49,558 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:29:49,558 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:29:49,559 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:29:49,559 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:29:49,579 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:29:49" (1/1) ... [2018-06-25 09:29:49,579 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:29:49" (1/1) ... [2018-06-25 09:29:49,584 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:29:49" (1/1) ... [2018-06-25 09:29:49,584 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:29:49" (1/1) ... [2018-06-25 09:29:49,587 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:29:49" (1/1) ... [2018-06-25 09:29:49,591 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:29:49" (1/1) ... [2018-06-25 09:29:49,592 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:29:49" (1/1) ... [2018-06-25 09:29:49,593 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:29:49,593 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:29:49,593 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:29:49,593 INFO ]: RCFGBuilder initialized [2018-06-25 09:29:49,601 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:29:49" (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-25 09:29:49,619 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:29:49,619 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:29:49,619 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:29:49,620 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:29:49,620 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:29:49,620 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-25 09:29:49,877 INFO ]: Using library mode [2018-06-25 09:29:49,878 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:29:49 BoogieIcfgContainer [2018-06-25 09:29:49,878 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:29:49,879 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:29:49,879 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:29:49,882 INFO ]: TraceAbstraction initialized [2018-06-25 09:29:49,883 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:29:49" (1/3) ... [2018-06-25 09:29:49,883 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b5c1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:29:49, skipping insertion in model container [2018-06-25 09:29:49,883 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:29:49" (2/3) ... [2018-06-25 09:29:49,884 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b5c1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:29:49, skipping insertion in model container [2018-06-25 09:29:49,884 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:29:49" (3/3) ... [2018-06-25 09:29:49,886 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:29:49,894 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:29:49,902 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:29:49,941 INFO ]: Using default assertion order modulation [2018-06-25 09:29:49,942 INFO ]: Interprodecural is true [2018-06-25 09:29:49,942 INFO ]: Hoare is false [2018-06-25 09:29:49,942 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:29:49,942 INFO ]: Backedges is TWOTRACK [2018-06-25 09:29:49,942 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:29:49,942 INFO ]: Difference is false [2018-06-25 09:29:49,942 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:29:49,942 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:29:49,958 INFO ]: Start isEmpty. Operand 13 states. [2018-06-25 09:29:49,973 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:29:49,973 INFO ]: Found error trace [2018-06-25 09:29:49,976 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:29:49,976 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:29:49,980 INFO ]: Analyzing trace with hash 1714031578, now seen corresponding path program 1 times [2018-06-25 09:29:49,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:29:49,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:29:50,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:50,020 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:29:50,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:50,051 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:50,141 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:29:50,143 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:29:50,143 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:29:50,144 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:29:50,156 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:29:50,157 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:29:50,159 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-25 09:29:50,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:29:50,309 INFO ]: Finished difference Result 19 states and 25 transitions. [2018-06-25 09:29:50,309 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:29:50,310 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-25 09:29:50,310 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:29:50,318 INFO ]: With dead ends: 19 [2018-06-25 09:29:50,318 INFO ]: Without dead ends: 19 [2018-06-25 09:29:50,320 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-25 09:29:50,335 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:29:50,357 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-25 09:29:50,359 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:29:50,360 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-06-25 09:29:50,361 INFO ]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 7 [2018-06-25 09:29:50,363 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:29:50,363 INFO ]: Abstraction has 19 states and 25 transitions. [2018-06-25 09:29:50,363 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:29:50,363 INFO ]: Start isEmpty. Operand 19 states and 25 transitions. [2018-06-25 09:29:50,364 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:29:50,364 INFO ]: Found error trace [2018-06-25 09:29:50,364 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:29:50,364 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:29:50,364 INFO ]: Analyzing trace with hash 1641510147, now seen corresponding path program 1 times [2018-06-25 09:29:50,364 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:29:50,365 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:29:50,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:50,365 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:29:50,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:50,388 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:50,440 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:29:50,440 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:29:50,440 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:29:50,442 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:29:50,442 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:29:50,442 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:29:50,442 INFO ]: Start difference. First operand 19 states and 25 transitions. Second operand 3 states. [2018-06-25 09:29:50,499 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:29:50,499 INFO ]: Finished difference Result 29 states and 42 transitions. [2018-06-25 09:29:50,499 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:29:50,499 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:29:50,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:29:50,502 INFO ]: With dead ends: 29 [2018-06-25 09:29:50,502 INFO ]: Without dead ends: 29 [2018-06-25 09:29:50,503 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-25 09:29:50,503 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:29:50,510 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-06-25 09:29:50,510 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:29:50,511 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2018-06-25 09:29:50,511 INFO ]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 8 [2018-06-25 09:29:50,511 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:29:50,511 INFO ]: Abstraction has 21 states and 29 transitions. [2018-06-25 09:29:50,511 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:29:50,512 INFO ]: Start isEmpty. Operand 21 states and 29 transitions. [2018-06-25 09:29:50,512 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:29:50,512 INFO ]: Found error trace [2018-06-25 09:29:50,512 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:29:50,512 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:29:50,512 INFO ]: Analyzing trace with hash 1641301610, now seen corresponding path program 1 times [2018-06-25 09:29:50,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:29:50,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:29:50,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:50,513 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:29:50,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:50,521 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:50,554 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:29:50,554 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:29:50,554 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:29:50,554 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:29:50,554 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:29:50,554 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:29:50,554 INFO ]: Start difference. First operand 21 states and 29 transitions. Second operand 3 states. [2018-06-25 09:29:50,606 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:29:50,606 INFO ]: Finished difference Result 25 states and 33 transitions. [2018-06-25 09:29:50,607 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:29:50,607 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:29:50,607 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:29:50,607 INFO ]: With dead ends: 25 [2018-06-25 09:29:50,607 INFO ]: Without dead ends: 25 [2018-06-25 09:29:50,608 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-25 09:29:50,608 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:29:50,612 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-25 09:29:50,612 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:29:50,613 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-25 09:29:50,613 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 8 [2018-06-25 09:29:50,613 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:29:50,613 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-25 09:29:50,613 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:29:50,613 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-25 09:29:50,614 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:29:50,614 INFO ]: Found error trace [2018-06-25 09:29:50,614 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:29:50,614 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:29:50,614 INFO ]: Analyzing trace with hash -537434744, now seen corresponding path program 1 times [2018-06-25 09:29:50,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:29:50,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:29:50,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:50,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:29:50,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:50,632 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:50,871 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:29:50,871 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:29:50,871 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-25 09:29:50,878 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:29:50,932 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:50,941 INFO ]: Computing forward predicates... [2018-06-25 09:29:51,002 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:29:51,038 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:29:51,038 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-25 09:29:51,039 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:29:51,039 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:29:51,039 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:29:51,040 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 7 states. [2018-06-25 09:29:52,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:29:52,190 INFO ]: Finished difference Result 48 states and 80 transitions. [2018-06-25 09:29:52,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:29:52,191 INFO ]: Start accepts. Automaton has 7 states. Word has length 16 [2018-06-25 09:29:52,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:29:52,192 INFO ]: With dead ends: 48 [2018-06-25 09:29:52,192 INFO ]: Without dead ends: 26 [2018-06-25 09:29:52,192 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:29:52,192 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 09:29:52,196 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-06-25 09:29:52,196 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 09:29:52,197 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-06-25 09:29:52,197 INFO ]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 16 [2018-06-25 09:29:52,197 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:29:52,197 INFO ]: Abstraction has 22 states and 28 transitions. [2018-06-25 09:29:52,197 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:29:52,197 INFO ]: Start isEmpty. Operand 22 states and 28 transitions. [2018-06-25 09:29:52,197 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:29:52,197 INFO ]: Found error trace [2018-06-25 09:29:52,198 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:29:52,198 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:29:52,198 INFO ]: Analyzing trace with hash 147794799, now seen corresponding path program 1 times [2018-06-25 09:29:52,198 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:29:52,198 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:29:52,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:52,199 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:29:52,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:52,219 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:52,328 INFO ]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:29:52,329 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:29:52,329 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-25 09:29:52,335 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:29:52,363 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:52,366 INFO ]: Computing forward predicates... [2018-06-25 09:29:52,578 INFO ]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:29:52,599 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:29:52,599 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-25 09:29:52,599 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:29:52,600 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:29:52,600 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:29:52,600 INFO ]: Start difference. First operand 22 states and 28 transitions. Second operand 14 states. [2018-06-25 09:29:53,320 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:29:53,320 INFO ]: Finished difference Result 40 states and 57 transitions. [2018-06-25 09:29:53,320 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:29:53,320 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-25 09:29:53,320 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:29:53,321 INFO ]: With dead ends: 40 [2018-06-25 09:29:53,321 INFO ]: Without dead ends: 40 [2018-06-25 09:29:53,322 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:29:53,322 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-25 09:29:53,328 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 28. [2018-06-25 09:29:53,328 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-25 09:29:53,329 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-06-25 09:29:53,329 INFO ]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2018-06-25 09:29:53,329 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:29:53,329 INFO ]: Abstraction has 28 states and 39 transitions. [2018-06-25 09:29:53,329 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:29:53,330 INFO ]: Start isEmpty. Operand 28 states and 39 transitions. [2018-06-25 09:29:53,331 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:29:53,331 INFO ]: Found error trace [2018-06-25 09:29:53,331 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-25 09:29:53,331 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:29:53,331 INFO ]: Analyzing trace with hash -1710814988, now seen corresponding path program 2 times [2018-06-25 09:29:53,331 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:29:53,331 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:29:53,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:53,332 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:29:53,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:53,357 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:53,434 INFO ]: Checked inductivity of 24 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:29:53,434 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:29:53,434 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-25 09:29:53,447 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:29:53,485 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:29:53,485 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:53,488 INFO ]: Computing forward predicates... [2018-06-25 09:29:53,701 INFO ]: Checked inductivity of 24 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:29:53,721 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:29:53,721 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-25 09:29:53,721 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:29:53,721 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:29:53,722 INFO ]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:29:53,722 INFO ]: Start difference. First operand 28 states and 39 transitions. Second operand 16 states. [2018-06-25 09:29:54,916 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:29:54,916 INFO ]: Finished difference Result 84 states and 184 transitions. [2018-06-25 09:29:54,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-25 09:29:54,916 INFO ]: Start accepts. Automaton has 16 states. Word has length 24 [2018-06-25 09:29:54,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:29:54,921 INFO ]: With dead ends: 84 [2018-06-25 09:29:54,921 INFO ]: Without dead ends: 84 [2018-06-25 09:29:54,922 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=365, Invalid=1357, Unknown=0, NotChecked=0, Total=1722 [2018-06-25 09:29:54,922 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-25 09:29:54,943 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 56. [2018-06-25 09:29:54,943 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-25 09:29:54,945 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 103 transitions. [2018-06-25 09:29:54,945 INFO ]: Start accepts. Automaton has 56 states and 103 transitions. Word has length 24 [2018-06-25 09:29:54,945 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:29:54,945 INFO ]: Abstraction has 56 states and 103 transitions. [2018-06-25 09:29:54,945 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:29:54,945 INFO ]: Start isEmpty. Operand 56 states and 103 transitions. [2018-06-25 09:29:54,947 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:29:54,947 INFO ]: Found error trace [2018-06-25 09:29:54,947 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-25 09:29:54,947 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:29:54,947 INFO ]: Analyzing trace with hash -1711023525, now seen corresponding path program 3 times [2018-06-25 09:29:54,947 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:29:54,947 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:29:54,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:54,948 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:29:54,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:54,967 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:55,295 INFO ]: Checked inductivity of 24 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:29:55,295 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:29:55,295 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) [2018-06-25 09:29:55,312 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:29:55,334 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:29:55,334 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:55,337 INFO ]: Computing forward predicates... [2018-06-25 09:29:55,570 INFO ]: Checked inductivity of 24 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:29:55,589 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:29:55,589 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-25 09:29:55,590 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:29:55,590 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:29:55,590 INFO ]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:29:55,590 INFO ]: Start difference. First operand 56 states and 103 transitions. Second operand 24 states. [2018-06-25 09:29:56,851 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:29:56,851 INFO ]: Finished difference Result 94 states and 170 transitions. [2018-06-25 09:29:56,852 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:29:56,852 INFO ]: Start accepts. Automaton has 24 states. Word has length 24 [2018-06-25 09:29:56,852 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:29:56,854 INFO ]: With dead ends: 94 [2018-06-25 09:29:56,854 INFO ]: Without dead ends: 88 [2018-06-25 09:29:56,855 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=295, Invalid=1597, Unknown=0, NotChecked=0, Total=1892 [2018-06-25 09:29:56,855 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-25 09:29:56,870 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 60. [2018-06-25 09:29:56,870 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-25 09:29:56,872 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 113 transitions. [2018-06-25 09:29:56,872 INFO ]: Start accepts. Automaton has 60 states and 113 transitions. Word has length 24 [2018-06-25 09:29:56,872 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:29:56,872 INFO ]: Abstraction has 60 states and 113 transitions. [2018-06-25 09:29:56,872 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:29:56,872 INFO ]: Start isEmpty. Operand 60 states and 113 transitions. [2018-06-25 09:29:56,875 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:29:56,875 INFO ]: Found error trace [2018-06-25 09:29:56,875 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-06-25 09:29:56,875 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:29:56,875 INFO ]: Analyzing trace with hash -1025793982, now seen corresponding path program 1 times [2018-06-25 09:29:56,875 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:29:56,875 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:29:56,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:56,876 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:29:56,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:56,899 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:56,955 INFO ]: Checked inductivity of 24 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:29:56,955 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:29:56,955 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-25 09:29:56,962 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:29:56,983 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:56,985 INFO ]: Computing forward predicates... [2018-06-25 09:29:56,993 INFO ]: Checked inductivity of 24 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:29:57,012 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:29:57,012 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-25 09:29:57,012 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:29:57,012 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:29:57,012 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:29:57,013 INFO ]: Start difference. First operand 60 states and 113 transitions. Second operand 7 states. [2018-06-25 09:29:57,176 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:29:57,177 INFO ]: Finished difference Result 100 states and 202 transitions. [2018-06-25 09:29:57,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:29:57,181 INFO ]: Start accepts. Automaton has 7 states. Word has length 24 [2018-06-25 09:29:57,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:29:57,183 INFO ]: With dead ends: 100 [2018-06-25 09:29:57,183 INFO ]: Without dead ends: 94 [2018-06-25 09:29:57,183 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:29:57,184 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-25 09:29:57,200 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 79. [2018-06-25 09:29:57,200 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-25 09:29:57,202 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 153 transitions. [2018-06-25 09:29:57,202 INFO ]: Start accepts. Automaton has 79 states and 153 transitions. Word has length 24 [2018-06-25 09:29:57,202 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:29:57,202 INFO ]: Abstraction has 79 states and 153 transitions. [2018-06-25 09:29:57,202 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:29:57,203 INFO ]: Start isEmpty. Operand 79 states and 153 transitions. [2018-06-25 09:29:57,206 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-25 09:29:57,206 INFO ]: Found error trace [2018-06-25 09:29:57,206 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-06-25 09:29:57,206 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:29:57,206 INFO ]: Analyzing trace with hash -1167247801, now seen corresponding path program 4 times [2018-06-25 09:29:57,206 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:29:57,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:29:57,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:57,207 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:29:57,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:57,222 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:57,586 INFO ]: Checked inductivity of 51 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-25 09:29:57,587 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:29:57,587 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-25 09:29:57,594 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:29:57,617 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:29:57,617 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:57,620 INFO ]: Computing forward predicates... [2018-06-25 09:29:57,667 INFO ]: Checked inductivity of 51 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:29:57,698 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:29:57,698 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12 [2018-06-25 09:29:57,698 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:29:57,698 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:29:57,698 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:29:57,698 INFO ]: Start difference. First operand 79 states and 153 transitions. Second operand 12 states. [2018-06-25 09:29:58,319 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:29:58,319 INFO ]: Finished difference Result 180 states and 384 transitions. [2018-06-25 09:29:58,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:29:58,321 INFO ]: Start accepts. Automaton has 12 states. Word has length 32 [2018-06-25 09:29:58,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:29:58,325 INFO ]: With dead ends: 180 [2018-06-25 09:29:58,325 INFO ]: Without dead ends: 160 [2018-06-25 09:29:58,326 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=586, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:29:58,326 INFO ]: Start minimizeSevpa. Operand 160 states. [2018-06-25 09:29:58,343 INFO ]: Finished minimizeSevpa. Reduced states from 160 to 90. [2018-06-25 09:29:58,343 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-25 09:29:58,345 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 180 transitions. [2018-06-25 09:29:58,345 INFO ]: Start accepts. Automaton has 90 states and 180 transitions. Word has length 32 [2018-06-25 09:29:58,345 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:29:58,345 INFO ]: Abstraction has 90 states and 180 transitions. [2018-06-25 09:29:58,345 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:29:58,345 INFO ]: Start isEmpty. Operand 90 states and 180 transitions. [2018-06-25 09:29:58,348 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-25 09:29:58,348 INFO ]: Found error trace [2018-06-25 09:29:58,348 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-06-25 09:29:58,348 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:29:58,348 INFO ]: Analyzing trace with hash -190885433, now seen corresponding path program 5 times [2018-06-25 09:29:58,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:29:58,348 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:29:58,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:58,349 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:29:58,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:58,363 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:58,438 INFO ]: Checked inductivity of 51 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-25 09:29:58,438 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:29:58,438 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-25 09:29:58,447 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:29:58,469 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 09:29:58,469 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:58,471 INFO ]: Computing forward predicates... [2018-06-25 09:29:58,564 INFO ]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-25 09:29:58,583 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:29:58,583 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2018-06-25 09:29:58,584 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:29:58,584 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:29:58,584 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:29:58,584 INFO ]: Start difference. First operand 90 states and 180 transitions. Second operand 12 states. [2018-06-25 09:29:58,943 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:29:58,943 INFO ]: Finished difference Result 145 states and 261 transitions. [2018-06-25 09:29:58,949 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-25 09:29:58,949 INFO ]: Start accepts. Automaton has 12 states. Word has length 32 [2018-06-25 09:29:58,949 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:29:58,950 INFO ]: With dead ends: 145 [2018-06-25 09:29:58,950 INFO ]: Without dead ends: 80 [2018-06-25 09:29:58,951 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:29:58,951 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-25 09:29:58,966 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 69. [2018-06-25 09:29:58,967 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-25 09:29:58,968 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 113 transitions. [2018-06-25 09:29:58,968 INFO ]: Start accepts. Automaton has 69 states and 113 transitions. Word has length 32 [2018-06-25 09:29:58,968 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:29:58,968 INFO ]: Abstraction has 69 states and 113 transitions. [2018-06-25 09:29:58,968 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:29:58,968 INFO ]: Start isEmpty. Operand 69 states and 113 transitions. [2018-06-25 09:29:58,972 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-25 09:29:58,972 INFO ]: Found error trace [2018-06-25 09:29:58,972 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1] [2018-06-25 09:29:58,972 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:29:58,972 INFO ]: Analyzing trace with hash 740093516, now seen corresponding path program 6 times [2018-06-25 09:29:58,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:29:58,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:29:58,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:58,972 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:29:58,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:29:59,005 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:59,400 INFO ]: Checked inductivity of 88 backedges. 10 proven. 53 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-25 09:29:59,400 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:29:59,400 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-25 09:29:59,406 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:29:59,455 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-25 09:29:59,455 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:29:59,459 INFO ]: Computing forward predicates... [2018-06-25 09:30:00,430 INFO ]: Checked inductivity of 88 backedges. 10 proven. 53 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-25 09:30:00,450 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:30:00,450 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-06-25 09:30:00,450 INFO ]: Interpolant automaton has 36 states [2018-06-25 09:30:00,450 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 09:30:00,451 INFO ]: CoverageRelationStatistics Valid=81, Invalid=1179, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:30:00,451 INFO ]: Start difference. First operand 69 states and 113 transitions. Second operand 36 states. [2018-06-25 09:30:03,767 WARN ]: Spent 259.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 31 [2018-06-25 09:30:04,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:30:04,009 INFO ]: Finished difference Result 153 states and 254 transitions. [2018-06-25 09:30:04,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-25 09:30:04,010 INFO ]: Start accepts. Automaton has 36 states. Word has length 40 [2018-06-25 09:30:04,010 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:30:04,012 INFO ]: With dead ends: 153 [2018-06-25 09:30:04,012 INFO ]: Without dead ends: 141 [2018-06-25 09:30:04,013 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=732, Invalid=4380, Unknown=0, NotChecked=0, Total=5112 [2018-06-25 09:30:04,013 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-25 09:30:04,035 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 75. [2018-06-25 09:30:04,035 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-25 09:30:04,036 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 125 transitions. [2018-06-25 09:30:04,036 INFO ]: Start accepts. Automaton has 75 states and 125 transitions. Word has length 40 [2018-06-25 09:30:04,036 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:30:04,036 INFO ]: Abstraction has 75 states and 125 transitions. [2018-06-25 09:30:04,036 INFO ]: Interpolant automaton has 36 states. [2018-06-25 09:30:04,036 INFO ]: Start isEmpty. Operand 75 states and 125 transitions. [2018-06-25 09:30:04,038 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-25 09:30:04,038 INFO ]: Found error trace [2018-06-25 09:30:04,038 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1] [2018-06-25 09:30:04,038 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:30:04,038 INFO ]: Analyzing trace with hash -326654275, now seen corresponding path program 7 times [2018-06-25 09:30:04,044 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:30:04,044 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:30:04,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:04,045 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:30:04,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:04,074 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:30:04,198 INFO ]: Checked inductivity of 192 backedges. 80 proven. 51 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-25 09:30:04,198 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:30:04,198 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 09:30:04,212 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:30:04,253 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:30:04,257 INFO ]: Computing forward predicates... [2018-06-25 09:30:04,317 INFO ]: Checked inductivity of 192 backedges. 68 proven. 70 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-06-25 09:30:04,336 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:30:04,336 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2018-06-25 09:30:04,336 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:30:04,336 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:30:04,336 INFO ]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:30:04,337 INFO ]: Start difference. First operand 75 states and 125 transitions. Second operand 16 states. [2018-06-25 09:30:05,545 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 09:30:06,290 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:30:06,290 INFO ]: Finished difference Result 169 states and 318 transitions. [2018-06-25 09:30:06,290 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-25 09:30:06,290 INFO ]: Start accepts. Automaton has 16 states. Word has length 56 [2018-06-25 09:30:06,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:30:06,293 INFO ]: With dead ends: 169 [2018-06-25 09:30:06,293 INFO ]: Without dead ends: 169 [2018-06-25 09:30:06,295 INFO ]: 0 DeclaredPredicates, 113 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=599, Invalid=2823, Unknown=0, NotChecked=0, Total=3422 [2018-06-25 09:30:06,295 INFO ]: Start minimizeSevpa. Operand 169 states. [2018-06-25 09:30:06,309 INFO ]: Finished minimizeSevpa. Reduced states from 169 to 118. [2018-06-25 09:30:06,309 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-25 09:30:06,311 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 230 transitions. [2018-06-25 09:30:06,311 INFO ]: Start accepts. Automaton has 118 states and 230 transitions. Word has length 56 [2018-06-25 09:30:06,311 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:30:06,311 INFO ]: Abstraction has 118 states and 230 transitions. [2018-06-25 09:30:06,311 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:30:06,312 INFO ]: Start isEmpty. Operand 118 states and 230 transitions. [2018-06-25 09:30:06,316 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-25 09:30:06,316 INFO ]: Found error trace [2018-06-25 09:30:06,316 INFO ]: trace histogram [8, 8, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1] [2018-06-25 09:30:06,316 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:30:06,316 INFO ]: Analyzing trace with hash 1407920041, now seen corresponding path program 8 times [2018-06-25 09:30:06,316 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:30:06,316 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:30:06,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:06,317 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:30:06,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:06,360 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:30:07,430 INFO ]: Checked inductivity of 259 backedges. 16 proven. 168 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-06-25 09:30:07,430 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:30:07,430 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:30:07,436 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:30:07,515 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:30:07,515 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:30:07,522 INFO ]: Computing forward predicates... [2018-06-25 09:30:08,800 INFO ]: Checked inductivity of 259 backedges. 18 proven. 160 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-25 09:30:08,818 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:30:08,819 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 50 [2018-06-25 09:30:08,819 INFO ]: Interpolant automaton has 50 states [2018-06-25 09:30:08,819 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-25 09:30:08,820 INFO ]: CoverageRelationStatistics Valid=111, Invalid=2339, Unknown=0, NotChecked=0, Total=2450 [2018-06-25 09:30:08,820 INFO ]: Start difference. First operand 118 states and 230 transitions. Second operand 50 states. [2018-06-25 09:30:11,433 WARN ]: Spent 138.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2018-06-25 09:30:12,782 WARN ]: Spent 261.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 40 [2018-06-25 09:30:15,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:30:15,098 INFO ]: Finished difference Result 237 states and 468 transitions. [2018-06-25 09:30:15,100 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-25 09:30:15,100 INFO ]: Start accepts. Automaton has 50 states. Word has length 64 [2018-06-25 09:30:15,100 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:30:15,104 INFO ]: With dead ends: 237 [2018-06-25 09:30:15,104 INFO ]: Without dead ends: 222 [2018-06-25 09:30:15,106 INFO ]: 0 DeclaredPredicates, 143 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=912, Invalid=7460, Unknown=0, NotChecked=0, Total=8372 [2018-06-25 09:30:15,106 INFO ]: Start minimizeSevpa. Operand 222 states. [2018-06-25 09:30:15,126 INFO ]: Finished minimizeSevpa. Reduced states from 222 to 149. [2018-06-25 09:30:15,126 INFO ]: Start removeUnreachable. Operand 149 states. [2018-06-25 09:30:15,130 INFO ]: Finished removeUnreachable. Reduced from 149 states to 149 states and 346 transitions. [2018-06-25 09:30:15,130 INFO ]: Start accepts. Automaton has 149 states and 346 transitions. Word has length 64 [2018-06-25 09:30:15,137 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:30:15,137 INFO ]: Abstraction has 149 states and 346 transitions. [2018-06-25 09:30:15,137 INFO ]: Interpolant automaton has 50 states. [2018-06-25 09:30:15,137 INFO ]: Start isEmpty. Operand 149 states and 346 transitions. [2018-06-25 09:30:15,142 INFO ]: Finished isEmpty. Found accepting run of length 89 [2018-06-25 09:30:15,142 INFO ]: Found error trace [2018-06-25 09:30:15,142 INFO ]: trace histogram [11, 11, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1] [2018-06-25 09:30:15,142 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:30:15,143 INFO ]: Analyzing trace with hash -1447633786, now seen corresponding path program 9 times [2018-06-25 09:30:15,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:30:15,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:30:15,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:15,143 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:30:15,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:15,175 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:30:15,420 INFO ]: Checked inductivity of 520 backedges. 88 proven. 100 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2018-06-25 09:30:15,420 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:30:15,420 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:30:15,428 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:30:15,538 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-25 09:30:15,538 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:30:15,550 INFO ]: Computing forward predicates... [2018-06-25 09:30:16,109 INFO ]: Checked inductivity of 520 backedges. 135 proven. 193 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-06-25 09:30:16,131 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:30:16,131 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 21 [2018-06-25 09:30:16,131 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:30:16,131 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:30:16,131 INFO ]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:30:16,131 INFO ]: Start difference. First operand 149 states and 346 transitions. Second operand 21 states. [2018-06-25 09:30:16,593 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 09:30:19,443 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:30:19,443 INFO ]: Finished difference Result 859 states and 3075 transitions. [2018-06-25 09:30:19,444 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-06-25 09:30:19,444 INFO ]: Start accepts. Automaton has 21 states. Word has length 88 [2018-06-25 09:30:19,444 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:30:19,468 INFO ]: With dead ends: 859 [2018-06-25 09:30:19,468 INFO ]: Without dead ends: 539 [2018-06-25 09:30:19,473 INFO ]: 0 DeclaredPredicates, 208 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6096 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2167, Invalid=14345, Unknown=0, NotChecked=0, Total=16512 [2018-06-25 09:30:19,473 INFO ]: Start minimizeSevpa. Operand 539 states. [2018-06-25 09:30:19,537 INFO ]: Finished minimizeSevpa. Reduced states from 539 to 359. [2018-06-25 09:30:19,537 INFO ]: Start removeUnreachable. Operand 359 states. [2018-06-25 09:30:19,546 INFO ]: Finished removeUnreachable. Reduced from 359 states to 359 states and 897 transitions. [2018-06-25 09:30:19,546 INFO ]: Start accepts. Automaton has 359 states and 897 transitions. Word has length 88 [2018-06-25 09:30:19,546 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:30:19,546 INFO ]: Abstraction has 359 states and 897 transitions. [2018-06-25 09:30:19,546 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:30:19,546 INFO ]: Start isEmpty. Operand 359 states and 897 transitions. [2018-06-25 09:30:19,553 INFO ]: Finished isEmpty. Found accepting run of length 129 [2018-06-25 09:30:19,553 INFO ]: Found error trace [2018-06-25 09:30:19,553 INFO ]: trace histogram [16, 16, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1] [2018-06-25 09:30:19,553 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:30:19,553 INFO ]: Analyzing trace with hash -1972504876, now seen corresponding path program 10 times [2018-06-25 09:30:19,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:30:19,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:30:19,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:19,554 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:30:19,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:19,593 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:30:20,133 INFO ]: Checked inductivity of 1155 backedges. 141 proven. 290 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2018-06-25 09:30:20,134 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:30:20,134 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:30:20,140 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:30:20,225 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:30:20,225 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:30:20,233 INFO ]: Computing forward predicates... [2018-06-25 09:30:20,453 INFO ]: Checked inductivity of 1155 backedges. 433 proven. 460 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-06-25 09:30:20,473 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:30:20,473 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 25 [2018-06-25 09:30:20,474 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:30:20,474 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:30:20,474 INFO ]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:30:20,475 INFO ]: Start difference. First operand 359 states and 897 transitions. Second operand 25 states. [2018-06-25 09:30:23,633 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:30:23,633 INFO ]: Finished difference Result 931 states and 2447 transitions. [2018-06-25 09:30:23,633 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-06-25 09:30:23,633 INFO ]: Start accepts. Automaton has 25 states. Word has length 128 [2018-06-25 09:30:23,633 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:30:23,653 INFO ]: With dead ends: 931 [2018-06-25 09:30:23,653 INFO ]: Without dead ends: 647 [2018-06-25 09:30:23,662 INFO ]: 0 DeclaredPredicates, 273 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9119 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2938, Invalid=20932, Unknown=0, NotChecked=0, Total=23870 [2018-06-25 09:30:23,664 INFO ]: Start minimizeSevpa. Operand 647 states. [2018-06-25 09:30:23,725 INFO ]: Finished minimizeSevpa. Reduced states from 647 to 374. [2018-06-25 09:30:23,725 INFO ]: Start removeUnreachable. Operand 374 states. [2018-06-25 09:30:23,735 INFO ]: Finished removeUnreachable. Reduced from 374 states to 374 states and 827 transitions. [2018-06-25 09:30:23,735 INFO ]: Start accepts. Automaton has 374 states and 827 transitions. Word has length 128 [2018-06-25 09:30:23,735 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:30:23,735 INFO ]: Abstraction has 374 states and 827 transitions. [2018-06-25 09:30:23,735 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:30:23,735 INFO ]: Start isEmpty. Operand 374 states and 827 transitions. [2018-06-25 09:30:23,739 INFO ]: Finished isEmpty. Found accepting run of length 89 [2018-06-25 09:30:23,739 INFO ]: Found error trace [2018-06-25 09:30:23,739 INFO ]: trace histogram [11, 11, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1] [2018-06-25 09:30:23,739 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:30:23,739 INFO ]: Analyzing trace with hash 1092098438, now seen corresponding path program 11 times [2018-06-25 09:30:23,739 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:30:23,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:30:23,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:23,740 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:30:23,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:23,762 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:30:23,913 INFO ]: Checked inductivity of 520 backedges. 121 proven. 178 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-06-25 09:30:23,913 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:30:23,913 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:30:23,919 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:30:23,980 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-25 09:30:23,980 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:30:23,985 INFO ]: Computing forward predicates... [2018-06-25 09:30:24,167 INFO ]: Checked inductivity of 520 backedges. 121 proven. 226 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-06-25 09:30:24,197 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:30:24,197 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-25 09:30:24,197 INFO ]: Interpolant automaton has 26 states [2018-06-25 09:30:24,197 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-25 09:30:24,198 INFO ]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:30:24,198 INFO ]: Start difference. First operand 374 states and 827 transitions. Second operand 26 states. [2018-06-25 09:30:27,770 WARN ]: Spent 246.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-06-25 09:30:28,091 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-25 09:30:30,079 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:30:30,079 INFO ]: Finished difference Result 1539 states and 4028 transitions. [2018-06-25 09:30:30,080 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-06-25 09:30:30,080 INFO ]: Start accepts. Automaton has 26 states. Word has length 88 [2018-06-25 09:30:30,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:30:30,126 INFO ]: With dead ends: 1539 [2018-06-25 09:30:30,126 INFO ]: Without dead ends: 1523 [2018-06-25 09:30:30,130 INFO ]: 0 DeclaredPredicates, 259 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12719 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3715, Invalid=28865, Unknown=0, NotChecked=0, Total=32580 [2018-06-25 09:30:30,131 INFO ]: Start minimizeSevpa. Operand 1523 states. [2018-06-25 09:30:30,235 INFO ]: Finished minimizeSevpa. Reduced states from 1523 to 669. [2018-06-25 09:30:30,235 INFO ]: Start removeUnreachable. Operand 669 states. [2018-06-25 09:30:30,246 INFO ]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1822 transitions. [2018-06-25 09:30:30,246 INFO ]: Start accepts. Automaton has 669 states and 1822 transitions. Word has length 88 [2018-06-25 09:30:30,247 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:30:30,247 INFO ]: Abstraction has 669 states and 1822 transitions. [2018-06-25 09:30:30,247 INFO ]: Interpolant automaton has 26 states. [2018-06-25 09:30:30,247 INFO ]: Start isEmpty. Operand 669 states and 1822 transitions. [2018-06-25 09:30:30,252 INFO ]: Finished isEmpty. Found accepting run of length 105 [2018-06-25 09:30:30,252 INFO ]: Found error trace [2018-06-25 09:30:30,252 INFO ]: trace histogram [13, 13, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1] [2018-06-25 09:30:30,253 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:30:30,253 INFO ]: Analyzing trace with hash -2057603209, now seen corresponding path program 12 times [2018-06-25 09:30:30,253 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:30:30,253 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:30:30,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:30,253 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:30:30,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:30,306 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:30:31,505 INFO ]: Checked inductivity of 744 backedges. 32 proven. 492 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-06-25 09:30:31,505 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:30:31,505 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:30:31,511 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:30:31,599 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-25 09:30:31,599 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:30:31,606 INFO ]: Computing forward predicates... [2018-06-25 09:30:33,830 INFO ]: Checked inductivity of 744 backedges. 38 proven. 462 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-06-25 09:30:33,850 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:30:33,850 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 34] total 72 [2018-06-25 09:30:33,850 INFO ]: Interpolant automaton has 72 states [2018-06-25 09:30:33,850 INFO ]: Constructing interpolant automaton starting with 72 interpolants. [2018-06-25 09:30:33,851 INFO ]: CoverageRelationStatistics Valid=163, Invalid=4949, Unknown=0, NotChecked=0, Total=5112 [2018-06-25 09:30:33,851 INFO ]: Start difference. First operand 669 states and 1822 transitions. Second operand 72 states. [2018-06-25 09:30:39,794 WARN ]: Spent 158.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 49 [2018-06-25 09:30:41,774 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2018-06-25 09:30:43,438 WARN ]: Spent 534.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 49 [2018-06-25 09:30:46,174 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:30:46,174 INFO ]: Finished difference Result 963 states and 2315 transitions. [2018-06-25 09:30:46,174 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-25 09:30:46,174 INFO ]: Start accepts. Automaton has 72 states. Word has length 104 [2018-06-25 09:30:46,175 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:30:46,192 INFO ]: With dead ends: 963 [2018-06-25 09:30:46,192 INFO ]: Without dead ends: 941 [2018-06-25 09:30:46,193 INFO ]: 0 DeclaredPredicates, 216 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1080, Invalid=13682, Unknown=0, NotChecked=0, Total=14762 [2018-06-25 09:30:46,194 INFO ]: Start minimizeSevpa. Operand 941 states. [2018-06-25 09:30:46,260 INFO ]: Finished minimizeSevpa. Reduced states from 941 to 709. [2018-06-25 09:30:46,260 INFO ]: Start removeUnreachable. Operand 709 states. [2018-06-25 09:30:46,270 INFO ]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1958 transitions. [2018-06-25 09:30:46,271 INFO ]: Start accepts. Automaton has 709 states and 1958 transitions. Word has length 104 [2018-06-25 09:30:46,271 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:30:46,271 INFO ]: Abstraction has 709 states and 1958 transitions. [2018-06-25 09:30:46,271 INFO ]: Interpolant automaton has 72 states. [2018-06-25 09:30:46,271 INFO ]: Start isEmpty. Operand 709 states and 1958 transitions. [2018-06-25 09:30:46,282 INFO ]: Finished isEmpty. Found accepting run of length 145 [2018-06-25 09:30:46,282 INFO ]: Found error trace [2018-06-25 09:30:46,282 INFO ]: trace histogram [18, 18, 17, 17, 17, 17, 17, 11, 7, 1, 1, 1, 1, 1] [2018-06-25 09:30:46,282 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:30:46,282 INFO ]: Analyzing trace with hash 1180600133, now seen corresponding path program 13 times [2018-06-25 09:30:46,282 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:30:46,282 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:30:46,283 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:46,283 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:30:46,283 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:46,316 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:30:46,616 INFO ]: Checked inductivity of 1479 backedges. 424 proven. 248 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-06-25 09:30:46,616 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:30:46,616 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:30:46,622 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:30:46,744 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:30:46,753 INFO ]: Computing forward predicates... [2018-06-25 09:30:47,497 INFO ]: Checked inductivity of 1479 backedges. 541 proven. 517 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2018-06-25 09:30:47,516 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:30:47,517 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 25 [2018-06-25 09:30:47,517 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:30:47,517 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:30:47,517 INFO ]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:30:47,517 INFO ]: Start difference. First operand 709 states and 1958 transitions. Second operand 25 states. [2018-06-25 09:30:50,062 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:30:50,063 INFO ]: Finished difference Result 1818 states and 5434 transitions. [2018-06-25 09:30:50,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-06-25 09:30:50,150 INFO ]: Start accepts. Automaton has 25 states. Word has length 144 [2018-06-25 09:30:50,151 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:30:50,202 INFO ]: With dead ends: 1818 [2018-06-25 09:30:50,202 INFO ]: Without dead ends: 1738 [2018-06-25 09:30:50,203 INFO ]: 0 DeclaredPredicates, 256 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4818 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1878, Invalid=12164, Unknown=0, NotChecked=0, Total=14042 [2018-06-25 09:30:50,204 INFO ]: Start minimizeSevpa. Operand 1738 states. [2018-06-25 09:30:50,339 INFO ]: Finished minimizeSevpa. Reduced states from 1738 to 1135. [2018-06-25 09:30:50,339 INFO ]: Start removeUnreachable. Operand 1135 states. [2018-06-25 09:30:50,358 INFO ]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 3357 transitions. [2018-06-25 09:30:50,358 INFO ]: Start accepts. Automaton has 1135 states and 3357 transitions. Word has length 144 [2018-06-25 09:30:50,358 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:30:50,358 INFO ]: Abstraction has 1135 states and 3357 transitions. [2018-06-25 09:30:50,358 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:30:50,358 INFO ]: Start isEmpty. Operand 1135 states and 3357 transitions. [2018-06-25 09:30:50,370 INFO ]: Finished isEmpty. Found accepting run of length 169 [2018-06-25 09:30:50,370 INFO ]: Found error trace [2018-06-25 09:30:50,370 INFO ]: trace histogram [21, 21, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1] [2018-06-25 09:30:50,370 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:30:50,371 INFO ]: Analyzing trace with hash 1004512674, now seen corresponding path program 14 times [2018-06-25 09:30:50,371 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:30:50,371 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:30:50,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:50,372 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:30:50,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:30:50,468 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-25 09:30:51,616 WARN ]: Removed 3 from assertion stack [2018-06-25 09:30:51,617 WARN ]: Verification canceled [2018-06-25 09:30:51,620 WARN ]: Timeout [2018-06-25 09:30:51,620 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:30:51 BoogieIcfgContainer [2018-06-25 09:30:51,620 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:30:51,621 INFO ]: Toolchain (without parser) took 62133.22 ms. Allocated memory was 308.8 MB in the beginning and 694.2 MB in the end (delta: 385.4 MB). Free memory was 264.3 MB in the beginning and 226.6 MB in the end (delta: 37.7 MB). Peak memory consumption was 423.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:30:51,622 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:30:51,622 INFO ]: ChcToBoogie took 63.00 ms. Allocated memory is still 308.8 MB. Free memory was 264.3 MB in the beginning and 262.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:30:51,623 INFO ]: Boogie Preprocessor took 34.43 ms. Allocated memory is still 308.8 MB. Free memory was 262.3 MB in the beginning and 261.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 09:30:51,623 INFO ]: RCFGBuilder took 284.82 ms. Allocated memory is still 308.8 MB. Free memory was 261.3 MB in the beginning and 252.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:30:51,624 INFO ]: TraceAbstraction took 61741.04 ms. Allocated memory was 308.8 MB in the beginning and 694.2 MB in the end (delta: 385.4 MB). Free memory was 252.3 MB in the beginning and 226.6 MB in the end (delta: 25.7 MB). Peak memory consumption was 411.1 MB. Max. memory is 3.6 GB. [2018-06-25 09:30:51,625 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.00 ms. Allocated memory is still 308.8 MB. Free memory was 264.3 MB in the beginning and 262.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 34.43 ms. Allocated memory is still 308.8 MB. Free memory was 262.3 MB in the beginning and 261.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 284.82 ms. Allocated memory is still 308.8 MB. Free memory was 261.3 MB in the beginning and 252.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 61741.04 ms. Allocated memory was 308.8 MB in the beginning and 694.2 MB in the end (delta: 385.4 MB). Free memory was 252.3 MB in the beginning and 226.6 MB in the end (delta: 25.7 MB). Peak memory consumption was 411.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 169 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. TIMEOUT Result, 61.6s OverallTime, 19 OverallIterations, 21 TraceHistogramMax, 45.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 346 SDtfs, 1170 SDslu, 2740 SDs, 0 SdLazy, 20630 SolverSat, 4665 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1927 GetRequests, 818 SyntacticMatches, 0 SemanticMatches, 1109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38748 ImplicationChecksByTransitivity, 36.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1135occurred in iteration=18, 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.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 2512 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 1783 NumberOfCodeBlocks, 1761 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 1750 ConstructedInterpolants, 39 QuantifiedInterpolants, 511162 SizeOfPredicates, 259 NumberOfNonLiveVariables, 5500 ConjunctsInSsa, 508 ConjunctsInUnsatCore, 33 InterpolantComputations, 3 PerfectInterpolantSequences, 6478/10290 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/gib.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-30-51-735.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/gib.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-30-51-735.csv Completed graceful shutdown