java -Xss1g -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/a-init.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:38:56,692 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:38:56,695 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:38:56,709 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:38:56,709 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:38:56,710 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:38:56,711 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:38:56,715 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:38:56,716 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:38:56,717 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:38:56,719 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:38:56,719 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:38:56,720 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:38:56,721 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:38:56,722 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:38:56,722 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:38:56,726 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:38:56,736 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:38:56,737 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:38:56,738 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:38:56,739 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:38:56,741 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:38:56,741 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:38:56,741 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:38:56,747 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:38:56,748 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:38:56,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:38:56,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:38:56,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:38:56,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:38:56,751 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:38:56,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:38:56,756 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:38:56,756 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:38:56,757 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:38:56,757 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:38:56,773 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:38:56,773 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:38:56,774 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:38:56,774 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:38:56,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:38:56,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:38:56,775 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:38:56,775 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:38:56,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:38:56,776 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:38:56,776 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:38:56,776 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:38:56,776 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:38:56,776 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:38:56,777 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:38:56,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:38:56,777 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:38:56,779 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:38:56,779 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:38:56,822 INFO ]: Repository-Root is: /tmp [2018-06-22 01:38:56,835 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:38:56,838 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:38:56,839 INFO ]: Initializing SmtParser... [2018-06-22 01:38:56,840 INFO ]: SmtParser initialized [2018-06-22 01:38:56,840 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/a-init.smt2 [2018-06-22 01:38:56,842 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-22 01:38:56,930 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/a-init.smt2 unknown [2018-06-22 01:38:57,326 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/a-init.smt2 [2018-06-22 01:38:57,337 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:38:57,343 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:38:57,344 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:38:57,344 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:38:57,344 INFO ]: ChcToBoogie initialized [2018-06-22 01:38:57,348 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:38:57" (1/1) ... [2018-06-22 01:38:57,425 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:57 Unit [2018-06-22 01:38:57,425 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:38:57,426 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:38:57,426 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:38:57,426 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:38:57,448 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:57" (1/1) ... [2018-06-22 01:38:57,461 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:57" (1/1) ... [2018-06-22 01:38:57,469 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:57" (1/1) ... [2018-06-22 01:38:57,469 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:57" (1/1) ... [2018-06-22 01:38:57,483 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:57" (1/1) ... [2018-06-22 01:38:57,495 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:57" (1/1) ... [2018-06-22 01:38:57,496 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:57" (1/1) ... [2018-06-22 01:38:57,499 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:38:57,499 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:38:57,499 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:38:57,499 INFO ]: RCFGBuilder initialized [2018-06-22 01:38:57,508 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:57" (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-22 01:38:57,520 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:38:57,520 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:38:57,520 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:38:57,520 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:38:57,520 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:38:57,520 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-22 01:38:58,253 INFO ]: Using library mode [2018-06-22 01:38:58,254 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:38:58 BoogieIcfgContainer [2018-06-22 01:38:58,254 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:38:58,255 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:38:58,256 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:38:58,259 INFO ]: TraceAbstraction initialized [2018-06-22 01:38:58,259 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:38:57" (1/3) ... [2018-06-22 01:38:58,260 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e6e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:38:58, skipping insertion in model container [2018-06-22 01:38:58,260 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:57" (2/3) ... [2018-06-22 01:38:58,260 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e6e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:38:58, skipping insertion in model container [2018-06-22 01:38:58,260 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:38:58" (3/3) ... [2018-06-22 01:38:58,262 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:38:58,272 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:38:58,280 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:38:58,313 INFO ]: Using default assertion order modulation [2018-06-22 01:38:58,314 INFO ]: Interprodecural is true [2018-06-22 01:38:58,314 INFO ]: Hoare is false [2018-06-22 01:38:58,314 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:38:58,314 INFO ]: Backedges is TWOTRACK [2018-06-22 01:38:58,314 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:38:58,314 INFO ]: Difference is false [2018-06-22 01:38:58,314 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:38:58,314 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:38:58,327 INFO ]: Start isEmpty. Operand 37 states. [2018-06-22 01:38:58,336 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:38:58,336 INFO ]: Found error trace [2018-06-22 01:38:58,337 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:58,337 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:58,340 INFO ]: Analyzing trace with hash -1502330762, now seen corresponding path program 1 times [2018-06-22 01:38:58,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:58,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:58,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:58,374 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:58,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:58,420 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:58,504 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:38:58,506 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:38:58,506 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:38:58,508 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:38:58,519 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:38:58,519 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:38:58,521 INFO ]: Start difference. First operand 37 states. Second operand 4 states. [2018-06-22 01:38:59,282 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:59,282 INFO ]: Finished difference Result 67 states and 101 transitions. [2018-06-22 01:38:59,286 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:38:59,287 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-22 01:38:59,287 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:59,306 INFO ]: With dead ends: 67 [2018-06-22 01:38:59,306 INFO ]: Without dead ends: 67 [2018-06-22 01:38:59,309 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-22 01:38:59,331 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 01:38:59,381 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-06-22 01:38:59,382 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 01:38:59,385 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2018-06-22 01:38:59,387 INFO ]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 7 [2018-06-22 01:38:59,387 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:59,387 INFO ]: Abstraction has 67 states and 101 transitions. [2018-06-22 01:38:59,387 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:38:59,387 INFO ]: Start isEmpty. Operand 67 states and 101 transitions. [2018-06-22 01:38:59,389 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:38:59,389 INFO ]: Found error trace [2018-06-22 01:38:59,389 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:59,389 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:59,389 INFO ]: Analyzing trace with hash -1505024116, now seen corresponding path program 1 times [2018-06-22 01:38:59,389 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:59,389 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:59,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:59,390 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:59,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:59,395 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:59,506 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:38:59,506 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:38:59,506 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:38:59,507 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:38:59,507 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:38:59,508 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:38:59,509 INFO ]: Start difference. First operand 67 states and 101 transitions. Second operand 4 states. [2018-06-22 01:38:59,910 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:59,910 INFO ]: Finished difference Result 98 states and 149 transitions. [2018-06-22 01:38:59,910 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:38:59,910 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 01:38:59,911 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:59,915 INFO ]: With dead ends: 98 [2018-06-22 01:38:59,915 INFO ]: Without dead ends: 98 [2018-06-22 01:38:59,916 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-22 01:38:59,916 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 01:38:59,929 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-06-22 01:38:59,929 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-22 01:38:59,933 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 149 transitions. [2018-06-22 01:38:59,933 INFO ]: Start accepts. Automaton has 98 states and 149 transitions. Word has length 11 [2018-06-22 01:38:59,933 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:59,933 INFO ]: Abstraction has 98 states and 149 transitions. [2018-06-22 01:38:59,933 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:38:59,933 INFO ]: Start isEmpty. Operand 98 states and 149 transitions. [2018-06-22 01:38:59,934 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:38:59,934 INFO ]: Found error trace [2018-06-22 01:38:59,934 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:59,934 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:59,934 INFO ]: Analyzing trace with hash 1743554296, now seen corresponding path program 1 times [2018-06-22 01:38:59,935 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:59,935 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:59,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:59,939 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:59,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:59,954 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:59,993 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:38:59,993 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:38:59,993 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:38:59,993 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:38:59,993 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:38:59,993 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:38:59,993 INFO ]: Start difference. First operand 98 states and 149 transitions. Second operand 4 states. [2018-06-22 01:39:00,566 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:00,566 INFO ]: Finished difference Result 129 states and 197 transitions. [2018-06-22 01:39:00,567 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:00,567 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-22 01:39:00,567 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:00,570 INFO ]: With dead ends: 129 [2018-06-22 01:39:00,570 INFO ]: Without dead ends: 129 [2018-06-22 01:39:00,571 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-22 01:39:00,571 INFO ]: Start minimizeSevpa. Operand 129 states. [2018-06-22 01:39:00,583 INFO ]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-06-22 01:39:00,583 INFO ]: Start removeUnreachable. Operand 129 states. [2018-06-22 01:39:00,586 INFO ]: Finished removeUnreachable. Reduced from 129 states to 129 states and 197 transitions. [2018-06-22 01:39:00,586 INFO ]: Start accepts. Automaton has 129 states and 197 transitions. Word has length 12 [2018-06-22 01:39:00,586 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:00,586 INFO ]: Abstraction has 129 states and 197 transitions. [2018-06-22 01:39:00,586 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:00,586 INFO ]: Start isEmpty. Operand 129 states and 197 transitions. [2018-06-22 01:39:00,587 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:39:00,587 INFO ]: Found error trace [2018-06-22 01:39:00,587 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:00,588 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:00,589 INFO ]: Analyzing trace with hash -266479673, now seen corresponding path program 1 times [2018-06-22 01:39:00,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:00,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:00,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:00,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:00,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:00,603 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:00,651 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:00,651 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:00,651 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:39:00,651 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:00,651 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:00,651 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:00,651 INFO ]: Start difference. First operand 129 states and 197 transitions. Second operand 4 states. [2018-06-22 01:39:01,111 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:01,111 INFO ]: Finished difference Result 154 states and 236 transitions. [2018-06-22 01:39:01,112 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:01,112 INFO ]: Start accepts. Automaton has 4 states. Word has length 14 [2018-06-22 01:39:01,112 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:01,115 INFO ]: With dead ends: 154 [2018-06-22 01:39:01,115 INFO ]: Without dead ends: 154 [2018-06-22 01:39:01,115 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-22 01:39:01,115 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-22 01:39:01,130 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-06-22 01:39:01,130 INFO ]: Start removeUnreachable. Operand 154 states. [2018-06-22 01:39:01,134 INFO ]: Finished removeUnreachable. Reduced from 154 states to 154 states and 236 transitions. [2018-06-22 01:39:01,134 INFO ]: Start accepts. Automaton has 154 states and 236 transitions. Word has length 14 [2018-06-22 01:39:01,134 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:01,134 INFO ]: Abstraction has 154 states and 236 transitions. [2018-06-22 01:39:01,134 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:01,134 INFO ]: Start isEmpty. Operand 154 states and 236 transitions. [2018-06-22 01:39:01,137 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:39:01,137 INFO ]: Found error trace [2018-06-22 01:39:01,138 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:01,138 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:01,138 INFO ]: Analyzing trace with hash 401601156, now seen corresponding path program 1 times [2018-06-22 01:39:01,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:01,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:01,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:01,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:01,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:01,155 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:01,240 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:01,240 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:01,240 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:39:01,241 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:01,241 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:01,241 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:01,241 INFO ]: Start difference. First operand 154 states and 236 transitions. Second operand 4 states. [2018-06-22 01:39:01,285 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:01,314 INFO ]: Finished difference Result 174 states and 261 transitions. [2018-06-22 01:39:01,314 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:39:01,314 INFO ]: Start accepts. Automaton has 4 states. Word has length 15 [2018-06-22 01:39:01,314 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:01,317 INFO ]: With dead ends: 174 [2018-06-22 01:39:01,317 INFO ]: Without dead ends: 169 [2018-06-22 01:39:01,317 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-22 01:39:01,318 INFO ]: Start minimizeSevpa. Operand 169 states. [2018-06-22 01:39:01,336 INFO ]: Finished minimizeSevpa. Reduced states from 169 to 159. [2018-06-22 01:39:01,336 INFO ]: Start removeUnreachable. Operand 159 states. [2018-06-22 01:39:01,339 INFO ]: Finished removeUnreachable. Reduced from 159 states to 159 states and 241 transitions. [2018-06-22 01:39:01,339 INFO ]: Start accepts. Automaton has 159 states and 241 transitions. Word has length 15 [2018-06-22 01:39:01,339 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:01,339 INFO ]: Abstraction has 159 states and 241 transitions. [2018-06-22 01:39:01,339 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:01,339 INFO ]: Start isEmpty. Operand 159 states and 241 transitions. [2018-06-22 01:39:01,342 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:39:01,342 INFO ]: Found error trace [2018-06-22 01:39:01,342 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:01,342 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:01,342 INFO ]: Analyzing trace with hash 680004753, now seen corresponding path program 1 times [2018-06-22 01:39:01,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:01,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:01,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:01,343 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:01,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:01,358 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:01,394 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:39:01,394 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:01,394 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:39:01,394 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:39:01,394 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:39:01,394 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:39:01,395 INFO ]: Start difference. First operand 159 states and 241 transitions. Second operand 3 states. [2018-06-22 01:39:01,423 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:01,423 INFO ]: Finished difference Result 164 states and 246 transitions. [2018-06-22 01:39:01,424 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:39:01,424 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-22 01:39:01,424 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:01,426 INFO ]: With dead ends: 164 [2018-06-22 01:39:01,426 INFO ]: Without dead ends: 164 [2018-06-22 01:39:01,427 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-22 01:39:01,427 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-22 01:39:01,437 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-06-22 01:39:01,437 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-22 01:39:01,440 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 246 transitions. [2018-06-22 01:39:01,440 INFO ]: Start accepts. Automaton has 164 states and 246 transitions. Word has length 18 [2018-06-22 01:39:01,440 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:01,440 INFO ]: Abstraction has 164 states and 246 transitions. [2018-06-22 01:39:01,440 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:39:01,440 INFO ]: Start isEmpty. Operand 164 states and 246 transitions. [2018-06-22 01:39:01,442 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:39:01,442 INFO ]: Found error trace [2018-06-22 01:39:01,442 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:01,442 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:01,442 INFO ]: Analyzing trace with hash -393931261, now seen corresponding path program 1 times [2018-06-22 01:39:01,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:01,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:01,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:01,443 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:01,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:01,464 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:01,637 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:39:01,638 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:01,638 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-22 01:39:01,650 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:01,680 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:01,687 INFO ]: Computing forward predicates... [2018-06-22 01:39:02,455 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:39:02,477 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:02,477 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-22 01:39:02,477 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:39:02,477 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:39:02,477 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:39:02,477 INFO ]: Start difference. First operand 164 states and 246 transitions. Second operand 13 states. [2018-06-22 01:39:03,257 WARN ]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-06-22 01:39:03,487 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:03,487 INFO ]: Finished difference Result 252 states and 375 transitions. [2018-06-22 01:39:03,487 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:39:03,487 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-22 01:39:03,487 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:03,494 INFO ]: With dead ends: 252 [2018-06-22 01:39:03,494 INFO ]: Without dead ends: 238 [2018-06-22 01:39:03,494 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:39:03,494 INFO ]: Start minimizeSevpa. Operand 238 states. [2018-06-22 01:39:03,510 INFO ]: Finished minimizeSevpa. Reduced states from 238 to 179. [2018-06-22 01:39:03,510 INFO ]: Start removeUnreachable. Operand 179 states. [2018-06-22 01:39:03,513 INFO ]: Finished removeUnreachable. Reduced from 179 states to 179 states and 261 transitions. [2018-06-22 01:39:03,513 INFO ]: Start accepts. Automaton has 179 states and 261 transitions. Word has length 19 [2018-06-22 01:39:03,513 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:03,513 INFO ]: Abstraction has 179 states and 261 transitions. [2018-06-22 01:39:03,513 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:39:03,513 INFO ]: Start isEmpty. Operand 179 states and 261 transitions. [2018-06-22 01:39:03,516 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:39:03,516 INFO ]: Found error trace [2018-06-22 01:39:03,516 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:03,516 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:03,517 INFO ]: Analyzing trace with hash 1547133328, now seen corresponding path program 2 times [2018-06-22 01:39:03,517 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:03,517 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:03,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:03,517 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:03,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:03,538 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:03,651 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:03,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:03,651 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-22 01:39:03,659 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:39:03,707 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:39:03,707 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:03,710 INFO ]: Computing forward predicates... [2018-06-22 01:39:03,737 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:03,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:03,769 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 01:39:03,770 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:39:03,770 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:39:03,770 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:39:03,770 INFO ]: Start difference. First operand 179 states and 261 transitions. Second operand 11 states. [2018-06-22 01:39:04,160 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:04,160 INFO ]: Finished difference Result 224 states and 340 transitions. [2018-06-22 01:39:04,160 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:39:04,160 INFO ]: Start accepts. Automaton has 11 states. Word has length 22 [2018-06-22 01:39:04,161 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:04,168 INFO ]: With dead ends: 224 [2018-06-22 01:39:04,168 INFO ]: Without dead ends: 224 [2018-06-22 01:39:04,169 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:39:04,169 INFO ]: Start minimizeSevpa. Operand 224 states. [2018-06-22 01:39:04,193 INFO ]: Finished minimizeSevpa. Reduced states from 224 to 199. [2018-06-22 01:39:04,193 INFO ]: Start removeUnreachable. Operand 199 states. [2018-06-22 01:39:04,198 INFO ]: Finished removeUnreachable. Reduced from 199 states to 199 states and 286 transitions. [2018-06-22 01:39:04,198 INFO ]: Start accepts. Automaton has 199 states and 286 transitions. Word has length 22 [2018-06-22 01:39:04,198 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:04,198 INFO ]: Abstraction has 199 states and 286 transitions. [2018-06-22 01:39:04,199 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:39:04,199 INFO ]: Start isEmpty. Operand 199 states and 286 transitions. [2018-06-22 01:39:04,203 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:39:04,203 INFO ]: Found error trace [2018-06-22 01:39:04,203 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:04,203 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:04,203 INFO ]: Analyzing trace with hash 717250788, now seen corresponding path program 3 times [2018-06-22 01:39:04,203 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:04,203 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:04,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:04,204 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:39:04,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:04,246 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:04,408 INFO ]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 01:39:04,408 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:04,408 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-22 01:39:04,415 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:39:04,469 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:39:04,470 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:04,475 INFO ]: Computing forward predicates... [2018-06-22 01:39:04,798 INFO ]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:04,818 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:04,836 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2018-06-22 01:39:04,836 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:39:04,836 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:39:04,836 INFO ]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:39:04,836 INFO ]: Start difference. First operand 199 states and 286 transitions. Second operand 18 states. [2018-06-22 01:39:05,201 WARN ]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-06-22 01:39:05,328 WARN ]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-06-22 01:39:05,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:05,704 INFO ]: Finished difference Result 214 states and 301 transitions. [2018-06-22 01:39:05,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:39:05,704 INFO ]: Start accepts. Automaton has 18 states. Word has length 23 [2018-06-22 01:39:05,704 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:05,706 INFO ]: With dead ends: 214 [2018-06-22 01:39:05,706 INFO ]: Without dead ends: 152 [2018-06-22 01:39:05,706 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:39:05,706 INFO ]: Start minimizeSevpa. Operand 152 states. [2018-06-22 01:39:05,715 INFO ]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-06-22 01:39:05,715 INFO ]: Start removeUnreachable. Operand 152 states. [2018-06-22 01:39:05,717 INFO ]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2018-06-22 01:39:05,717 INFO ]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 23 [2018-06-22 01:39:05,717 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:05,717 INFO ]: Abstraction has 152 states and 224 transitions. [2018-06-22 01:39:05,717 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:39:05,717 INFO ]: Start isEmpty. Operand 152 states and 224 transitions. [2018-06-22 01:39:05,721 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:39:05,722 INFO ]: Found error trace [2018-06-22 01:39:05,723 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:05,723 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:05,723 INFO ]: Analyzing trace with hash -1433689062, now seen corresponding path program 1 times [2018-06-22 01:39:05,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:05,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:05,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:05,724 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:39:05,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:05,730 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:05,884 INFO ]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:39:05,884 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:05,884 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:39:05,890 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:05,920 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:05,922 INFO ]: Computing forward predicates... [2018-06-22 01:39:05,926 INFO ]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:39:05,949 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:05,949 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:39:05,949 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:05,949 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:05,949 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:05,949 INFO ]: Start difference. First operand 152 states and 224 transitions. Second operand 4 states. [2018-06-22 01:39:06,123 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:06,123 INFO ]: Finished difference Result 168 states and 248 transitions. [2018-06-22 01:39:06,123 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:06,123 INFO ]: Start accepts. Automaton has 4 states. Word has length 28 [2018-06-22 01:39:06,123 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:06,126 INFO ]: With dead ends: 168 [2018-06-22 01:39:06,126 INFO ]: Without dead ends: 168 [2018-06-22 01:39:06,126 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:06,126 INFO ]: Start minimizeSevpa. Operand 168 states. [2018-06-22 01:39:06,134 INFO ]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-06-22 01:39:06,134 INFO ]: Start removeUnreachable. Operand 168 states. [2018-06-22 01:39:06,136 INFO ]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2018-06-22 01:39:06,136 INFO ]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 28 [2018-06-22 01:39:06,136 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:06,136 INFO ]: Abstraction has 168 states and 248 transitions. [2018-06-22 01:39:06,136 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:06,136 INFO ]: Start isEmpty. Operand 168 states and 248 transitions. [2018-06-22 01:39:06,140 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:39:06,141 INFO ]: Found error trace [2018-06-22 01:39:06,141 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:06,141 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:06,141 INFO ]: Analyzing trace with hash 1538177281, now seen corresponding path program 1 times [2018-06-22 01:39:06,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:06,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:06,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:06,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:06,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:06,150 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:06,291 INFO ]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:39:06,291 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:06,291 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:39:06,291 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:06,291 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:06,291 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:06,292 INFO ]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2018-06-22 01:39:06,368 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:06,368 INFO ]: Finished difference Result 174 states and 254 transitions. [2018-06-22 01:39:06,369 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:06,369 INFO ]: Start accepts. Automaton has 4 states. Word has length 42 [2018-06-22 01:39:06,369 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:06,370 INFO ]: With dead ends: 174 [2018-06-22 01:39:06,370 INFO ]: Without dead ends: 138 [2018-06-22 01:39:06,371 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:06,371 INFO ]: Start minimizeSevpa. Operand 138 states. [2018-06-22 01:39:06,379 INFO ]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-06-22 01:39:06,379 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 01:39:06,380 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 192 transitions. [2018-06-22 01:39:06,381 INFO ]: Start accepts. Automaton has 138 states and 192 transitions. Word has length 42 [2018-06-22 01:39:06,381 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:06,381 INFO ]: Abstraction has 138 states and 192 transitions. [2018-06-22 01:39:06,381 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:06,381 INFO ]: Start isEmpty. Operand 138 states and 192 transitions. [2018-06-22 01:39:06,385 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:39:06,385 INFO ]: Found error trace [2018-06-22 01:39:06,385 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:06,385 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:06,385 INFO ]: Analyzing trace with hash -1324429550, now seen corresponding path program 1 times [2018-06-22 01:39:06,385 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:06,385 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:06,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:06,386 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:06,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:06,412 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:06,620 INFO ]: Checked inductivity of 36 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:39:06,620 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:06,620 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 01:39:06,620 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:39:06,620 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:39:06,620 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:39:06,620 INFO ]: Start difference. First operand 138 states and 192 transitions. Second operand 8 states. [2018-06-22 01:39:06,888 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:06,888 INFO ]: Finished difference Result 234 states and 390 transitions. [2018-06-22 01:39:06,888 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:39:06,888 INFO ]: Start accepts. Automaton has 8 states. Word has length 44 [2018-06-22 01:39:06,888 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:06,890 INFO ]: With dead ends: 234 [2018-06-22 01:39:06,890 INFO ]: Without dead ends: 230 [2018-06-22 01:39:06,890 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:39:06,891 INFO ]: Start minimizeSevpa. Operand 230 states. [2018-06-22 01:39:06,910 INFO ]: Finished minimizeSevpa. Reduced states from 230 to 161. [2018-06-22 01:39:06,910 INFO ]: Start removeUnreachable. Operand 161 states. [2018-06-22 01:39:06,911 INFO ]: Finished removeUnreachable. Reduced from 161 states to 161 states and 237 transitions. [2018-06-22 01:39:06,911 INFO ]: Start accepts. Automaton has 161 states and 237 transitions. Word has length 44 [2018-06-22 01:39:06,912 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:06,912 INFO ]: Abstraction has 161 states and 237 transitions. [2018-06-22 01:39:06,912 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:39:06,912 INFO ]: Start isEmpty. Operand 161 states and 237 transitions. [2018-06-22 01:39:06,917 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-22 01:39:06,917 INFO ]: Found error trace [2018-06-22 01:39:06,917 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:06,917 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:06,917 INFO ]: Analyzing trace with hash -2122913791, now seen corresponding path program 1 times [2018-06-22 01:39:06,917 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:06,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:06,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:06,918 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:06,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:06,944 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:07,080 INFO ]: Checked inductivity of 39 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:39:07,080 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:07,080 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-22 01:39:07,088 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:07,140 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:07,143 INFO ]: Computing forward predicates... [2018-06-22 01:39:07,176 INFO ]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 01:39:07,200 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:39:07,200 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-06-22 01:39:07,200 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:39:07,200 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:39:07,201 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:39:07,201 INFO ]: Start difference. First operand 161 states and 237 transitions. Second operand 7 states. [2018-06-22 01:39:07,535 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:07,535 INFO ]: Finished difference Result 209 states and 320 transitions. [2018-06-22 01:39:07,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:39:07,535 INFO ]: Start accepts. Automaton has 7 states. Word has length 47 [2018-06-22 01:39:07,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:07,537 INFO ]: With dead ends: 209 [2018-06-22 01:39:07,537 INFO ]: Without dead ends: 185 [2018-06-22 01:39:07,537 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:39:07,537 INFO ]: Start minimizeSevpa. Operand 185 states. [2018-06-22 01:39:07,561 INFO ]: Finished minimizeSevpa. Reduced states from 185 to 142. [2018-06-22 01:39:07,561 INFO ]: Start removeUnreachable. Operand 142 states. [2018-06-22 01:39:07,562 INFO ]: Finished removeUnreachable. Reduced from 142 states to 142 states and 194 transitions. [2018-06-22 01:39:07,562 INFO ]: Start accepts. Automaton has 142 states and 194 transitions. Word has length 47 [2018-06-22 01:39:07,562 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:07,562 INFO ]: Abstraction has 142 states and 194 transitions. [2018-06-22 01:39:07,562 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:39:07,563 INFO ]: Start isEmpty. Operand 142 states and 194 transitions. [2018-06-22 01:39:07,565 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-22 01:39:07,565 INFO ]: Found error trace [2018-06-22 01:39:07,565 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:07,565 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:07,565 INFO ]: Analyzing trace with hash -1146364631, now seen corresponding path program 1 times [2018-06-22 01:39:07,565 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:07,565 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:07,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:07,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:07,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:07,585 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:07,736 INFO ]: Checked inductivity of 54 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 01:39:07,736 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:07,736 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 01:39:07,737 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:39:07,737 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:39:07,737 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:39:07,738 INFO ]: Start difference. First operand 142 states and 194 transitions. Second operand 6 states. [2018-06-22 01:39:07,794 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:07,794 INFO ]: Finished difference Result 172 states and 255 transitions. [2018-06-22 01:39:07,794 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:39:07,794 INFO ]: Start accepts. Automaton has 6 states. Word has length 52 [2018-06-22 01:39:07,794 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:07,796 INFO ]: With dead ends: 172 [2018-06-22 01:39:07,796 INFO ]: Without dead ends: 172 [2018-06-22 01:39:07,796 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:39:07,796 INFO ]: Start minimizeSevpa. Operand 172 states. [2018-06-22 01:39:07,805 INFO ]: Finished minimizeSevpa. Reduced states from 172 to 145. [2018-06-22 01:39:07,805 INFO ]: Start removeUnreachable. Operand 145 states. [2018-06-22 01:39:07,806 INFO ]: Finished removeUnreachable. Reduced from 145 states to 145 states and 197 transitions. [2018-06-22 01:39:07,806 INFO ]: Start accepts. Automaton has 145 states and 197 transitions. Word has length 52 [2018-06-22 01:39:07,806 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:07,806 INFO ]: Abstraction has 145 states and 197 transitions. [2018-06-22 01:39:07,806 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:39:07,806 INFO ]: Start isEmpty. Operand 145 states and 197 transitions. [2018-06-22 01:39:07,808 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 01:39:07,808 INFO ]: Found error trace [2018-06-22 01:39:07,808 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:07,809 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:07,809 INFO ]: Analyzing trace with hash -1176807317, now seen corresponding path program 2 times [2018-06-22 01:39:07,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:07,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:07,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:07,809 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:07,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:07,827 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:07,939 INFO ]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:39:07,939 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:07,939 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 01:39:07,939 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:39:07,939 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:39:07,939 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:39:07,939 INFO ]: Start difference. First operand 145 states and 197 transitions. Second operand 7 states. [2018-06-22 01:39:08,166 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:08,166 INFO ]: Finished difference Result 222 states and 338 transitions. [2018-06-22 01:39:08,169 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:39:08,169 INFO ]: Start accepts. Automaton has 7 states. Word has length 53 [2018-06-22 01:39:08,169 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:08,171 INFO ]: With dead ends: 222 [2018-06-22 01:39:08,171 INFO ]: Without dead ends: 216 [2018-06-22 01:39:08,171 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:39:08,172 INFO ]: Start minimizeSevpa. Operand 216 states. [2018-06-22 01:39:08,180 INFO ]: Finished minimizeSevpa. Reduced states from 216 to 155. [2018-06-22 01:39:08,180 INFO ]: Start removeUnreachable. Operand 155 states. [2018-06-22 01:39:08,181 INFO ]: Finished removeUnreachable. Reduced from 155 states to 155 states and 215 transitions. [2018-06-22 01:39:08,181 INFO ]: Start accepts. Automaton has 155 states and 215 transitions. Word has length 53 [2018-06-22 01:39:08,181 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:08,181 INFO ]: Abstraction has 155 states and 215 transitions. [2018-06-22 01:39:08,181 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:39:08,181 INFO ]: Start isEmpty. Operand 155 states and 215 transitions. [2018-06-22 01:39:08,184 INFO ]: Finished isEmpty. Found accepting run of length 69 [2018-06-22 01:39:08,184 INFO ]: Found error trace [2018-06-22 01:39:08,184 INFO ]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:08,184 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:08,184 INFO ]: Analyzing trace with hash -222426898, now seen corresponding path program 1 times [2018-06-22 01:39:08,184 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:08,184 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:08,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:08,184 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:39:08,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:08,198 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:08,283 INFO ]: Checked inductivity of 107 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-22 01:39:08,283 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:08,283 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:39:08,284 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:08,284 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:08,284 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:08,284 INFO ]: Start difference. First operand 155 states and 215 transitions. Second operand 4 states. [2018-06-22 01:39:08,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:08,390 INFO ]: Finished difference Result 191 states and 263 transitions. [2018-06-22 01:39:08,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:08,390 INFO ]: Start accepts. Automaton has 4 states. Word has length 68 [2018-06-22 01:39:08,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:08,391 INFO ]: With dead ends: 191 [2018-06-22 01:39:08,391 INFO ]: Without dead ends: 181 [2018-06-22 01:39:08,391 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 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-22 01:39:08,391 INFO ]: Start minimizeSevpa. Operand 181 states. [2018-06-22 01:39:08,398 INFO ]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-06-22 01:39:08,398 INFO ]: Start removeUnreachable. Operand 181 states. [2018-06-22 01:39:08,404 INFO ]: Finished removeUnreachable. Reduced from 181 states to 181 states and 246 transitions. [2018-06-22 01:39:08,404 INFO ]: Start accepts. Automaton has 181 states and 246 transitions. Word has length 68 [2018-06-22 01:39:08,404 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:08,404 INFO ]: Abstraction has 181 states and 246 transitions. [2018-06-22 01:39:08,404 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:08,404 INFO ]: Start isEmpty. Operand 181 states and 246 transitions. [2018-06-22 01:39:08,407 INFO ]: Finished isEmpty. Found accepting run of length 81 [2018-06-22 01:39:08,407 INFO ]: Found error trace [2018-06-22 01:39:08,407 INFO ]: trace histogram [6, 6, 6, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:08,407 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:08,407 INFO ]: Analyzing trace with hash 184279841, now seen corresponding path program 1 times [2018-06-22 01:39:08,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:08,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:08,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:08,408 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:08,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:08,423 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:08,492 INFO ]: Checked inductivity of 156 backedges. 77 proven. 7 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 01:39:08,493 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:08,493 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-22 01:39:08,499 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:08,559 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:08,563 INFO ]: Computing forward predicates... [2018-06-22 01:39:08,574 INFO ]: Checked inductivity of 156 backedges. 77 proven. 7 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 01:39:08,599 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:08,599 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:39:08,599 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:08,599 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:08,599 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:08,599 INFO ]: Start difference. First operand 181 states and 246 transitions. Second operand 4 states. [2018-06-22 01:39:08,942 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:08,942 INFO ]: Finished difference Result 204 states and 277 transitions. [2018-06-22 01:39:08,942 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:08,942 INFO ]: Start accepts. Automaton has 4 states. Word has length 80 [2018-06-22 01:39:08,942 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:08,943 INFO ]: With dead ends: 204 [2018-06-22 01:39:08,944 INFO ]: Without dead ends: 176 [2018-06-22 01:39:08,944 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:08,944 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-22 01:39:08,949 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-06-22 01:39:08,950 INFO ]: Start removeUnreachable. Operand 176 states. [2018-06-22 01:39:08,952 INFO ]: Finished removeUnreachable. Reduced from 176 states to 176 states and 232 transitions. [2018-06-22 01:39:08,952 INFO ]: Start accepts. Automaton has 176 states and 232 transitions. Word has length 80 [2018-06-22 01:39:08,952 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:08,952 INFO ]: Abstraction has 176 states and 232 transitions. [2018-06-22 01:39:08,952 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:08,952 INFO ]: Start isEmpty. Operand 176 states and 232 transitions. [2018-06-22 01:39:08,954 INFO ]: Finished isEmpty. Found accepting run of length 96 [2018-06-22 01:39:08,954 INFO ]: Found error trace [2018-06-22 01:39:08,954 INFO ]: trace histogram [7, 7, 7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:08,954 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:08,955 INFO ]: Analyzing trace with hash 932285358, now seen corresponding path program 1 times [2018-06-22 01:39:08,955 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:08,955 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:08,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:08,955 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:08,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:08,986 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:10,168 WARN ]: Spent 252.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-06-22 01:39:10,204 INFO ]: Checked inductivity of 227 backedges. 103 proven. 1 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-06-22 01:39:10,204 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:10,204 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) [2018-06-22 01:39:10,225 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:39:10,319 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:10,327 INFO ]: Computing forward predicates... [2018-06-22 01:39:11,461 INFO ]: Checked inductivity of 227 backedges. 102 proven. 25 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-06-22 01:39:11,496 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:11,496 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 24 [2018-06-22 01:39:11,496 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:39:11,497 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:39:11,497 INFO ]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:39:11,497 INFO ]: Start difference. First operand 176 states and 232 transitions. Second operand 24 states. [2018-06-22 01:39:12,049 WARN ]: Spent 130.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-06-22 01:39:14,205 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:14,206 INFO ]: Finished difference Result 259 states and 353 transitions. [2018-06-22 01:39:14,206 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:39:14,206 INFO ]: Start accepts. Automaton has 24 states. Word has length 95 [2018-06-22 01:39:14,206 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:14,206 INFO ]: With dead ends: 259 [2018-06-22 01:39:14,206 INFO ]: Without dead ends: 0 [2018-06-22 01:39:14,207 INFO ]: 0 DeclaredPredicates, 148 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=392, Invalid=2914, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 01:39:14,207 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:39:14,207 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:39:14,207 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:39:14,207 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:39:14,207 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2018-06-22 01:39:14,207 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:14,207 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:39:14,207 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:39:14,207 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:39:14,207 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:39:14,212 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:39:14 BoogieIcfgContainer [2018-06-22 01:39:14,212 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:39:14,213 INFO ]: Toolchain (without parser) took 16875.16 ms. Allocated memory was 306.7 MB in the beginning and 436.7 MB in the end (delta: 130.0 MB). Free memory was 257.1 MB in the beginning and 272.4 MB in the end (delta: -15.3 MB). Peak memory consumption was 114.7 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:14,216 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 306.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:39:14,216 INFO ]: ChcToBoogie took 81.49 ms. Allocated memory is still 306.7 MB. Free memory was 257.1 MB in the beginning and 253.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:14,217 INFO ]: Boogie Preprocessor took 72.77 ms. Allocated memory is still 306.7 MB. Free memory is still 253.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:39:14,217 INFO ]: RCFGBuilder took 755.28 ms. Allocated memory is still 306.7 MB. Free memory was 253.1 MB in the beginning and 233.2 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:14,217 INFO ]: TraceAbstraction took 15956.51 ms. Allocated memory was 306.7 MB in the beginning and 436.7 MB in the end (delta: 130.0 MB). Free memory was 233.2 MB in the beginning and 272.4 MB in the end (delta: -39.3 MB). Peak memory consumption was 90.7 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:14,222 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 306.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 81.49 ms. Allocated memory is still 306.7 MB. Free memory was 257.1 MB in the beginning and 253.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 72.77 ms. Allocated memory is still 306.7 MB. Free memory is still 253.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 755.28 ms. Allocated memory is still 306.7 MB. Free memory was 253.1 MB in the beginning and 233.2 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 15956.51 ms. Allocated memory was 306.7 MB in the beginning and 436.7 MB in the end (delta: 130.0 MB). Free memory was 233.2 MB in the beginning and 272.4 MB in the end (delta: -39.3 MB). Peak memory consumption was 90.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. SAFE Result, 15.9s OverallTime, 18 OverallIterations, 7 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 941 SDtfs, 920 SDslu, 3424 SDs, 0 SdLazy, 2369 SolverSat, 415 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 294 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 964 NumberOfCodeBlocks, 964 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 939 ConstructedInterpolants, 0 QuantifiedInterpolants, 107239 SizeOfPredicates, 66 NumberOfNonLiveVariables, 1780 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 25 InterpolantComputations, 12 PerfectInterpolantSequences, 1128/1192 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/a-init.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-39-14-239.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/a-init.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-39-14-239.csv Received shutdown request...