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/eldarica-misc/LIA/reve/003c-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:19:48,465 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:19:48,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:19:48,483 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:19:48,483 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:19:48,484 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:19:48,485 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:19:48,487 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:19:48,488 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:19:48,489 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:19:48,489 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:19:48,490 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:19:48,490 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:19:48,491 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:19:48,492 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:19:48,493 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:19:48,494 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:19:48,496 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:19:48,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:19:48,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:19:48,508 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:19:48,511 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:19:48,511 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:19:48,511 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:19:48,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:19:48,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:19:48,513 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:19:48,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:19:48,515 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:19:48,515 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:19:48,516 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:19:48,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:19:48,517 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:19:48,517 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:19:48,518 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:19:48,518 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:19:48,532 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:19:48,532 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:19:48,535 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:19:48,536 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:19:48,537 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:19:48,537 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:19:48,537 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:19:48,537 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:19:48,538 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:19:48,538 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:19:48,538 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:19:48,538 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:19:48,538 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:19:48,542 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:19:48,542 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:19:48,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:19:48,543 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:19:48,544 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:19:48,544 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:19:48,591 INFO ]: Repository-Root is: /tmp [2018-06-22 01:19:48,608 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:19:48,615 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:19:48,617 INFO ]: Initializing SmtParser... [2018-06-22 01:19:48,617 INFO ]: SmtParser initialized [2018-06-22 01:19:48,618 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/003c-horn.smt2 [2018-06-22 01:19:48,619 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:19:48,707 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003c-horn.smt2 unknown [2018-06-22 01:19:48,951 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003c-horn.smt2 [2018-06-22 01:19:48,958 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:19:48,964 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:19:48,964 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:19:48,964 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:19:48,965 INFO ]: ChcToBoogie initialized [2018-06-22 01:19:48,968 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:19:48" (1/1) ... [2018-06-22 01:19:49,024 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:49 Unit [2018-06-22 01:19:49,024 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:19:49,025 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:19:49,025 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:19:49,025 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:19:49,046 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:49" (1/1) ... [2018-06-22 01:19:49,046 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:49" (1/1) ... [2018-06-22 01:19:49,053 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:49" (1/1) ... [2018-06-22 01:19:49,053 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:49" (1/1) ... [2018-06-22 01:19:49,061 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:49" (1/1) ... [2018-06-22 01:19:49,063 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:49" (1/1) ... [2018-06-22 01:19:49,065 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:49" (1/1) ... [2018-06-22 01:19:49,066 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:19:49,067 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:19:49,067 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:19:49,067 INFO ]: RCFGBuilder initialized [2018-06-22 01:19:49,069 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19: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-22 01:19:49,081 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:19:49,081 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:19:49,081 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:19:49,082 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:19:49,082 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:19:49,082 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:19:49,402 INFO ]: Using library mode [2018-06-22 01:19:49,403 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:19:49 BoogieIcfgContainer [2018-06-22 01:19:49,403 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:19:49,411 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:19:49,411 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:19:49,414 INFO ]: TraceAbstraction initialized [2018-06-22 01:19:49,414 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:19:48" (1/3) ... [2018-06-22 01:19:49,415 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74016ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:19:49, skipping insertion in model container [2018-06-22 01:19:49,415 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:49" (2/3) ... [2018-06-22 01:19:49,415 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74016ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:19:49, skipping insertion in model container [2018-06-22 01:19:49,416 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:19:49" (3/3) ... [2018-06-22 01:19:49,417 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:19:49,425 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:19:49,431 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:19:49,465 INFO ]: Using default assertion order modulation [2018-06-22 01:19:49,466 INFO ]: Interprodecural is true [2018-06-22 01:19:49,466 INFO ]: Hoare is false [2018-06-22 01:19:49,466 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:19:49,466 INFO ]: Backedges is TWOTRACK [2018-06-22 01:19:49,466 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:19:49,466 INFO ]: Difference is false [2018-06-22 01:19:49,466 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:19:49,466 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:19:49,478 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 01:19:49,487 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:19:49,487 INFO ]: Found error trace [2018-06-22 01:19:49,488 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:49,488 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:49,492 INFO ]: Analyzing trace with hash -1694799506, now seen corresponding path program 1 times [2018-06-22 01:19:49,494 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:49,494 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:49,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:49,527 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:49,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:49,579 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:49,648 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:19:49,650 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:49,650 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:49,651 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:49,661 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:49,662 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:49,664 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-22 01:19:49,741 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:49,741 INFO ]: Finished difference Result 9 states and 17 transitions. [2018-06-22 01:19:49,741 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:49,742 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:19:49,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:49,751 INFO ]: With dead ends: 9 [2018-06-22 01:19:49,751 INFO ]: Without dead ends: 9 [2018-06-22 01:19:49,752 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:19:49,767 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 01:19:49,795 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 01:19:49,796 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:19:49,797 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-06-22 01:19:49,798 INFO ]: Start accepts. Automaton has 9 states and 17 transitions. Word has length 7 [2018-06-22 01:19:49,799 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:49,799 INFO ]: Abstraction has 9 states and 17 transitions. [2018-06-22 01:19:49,799 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:49,799 INFO ]: Start isEmpty. Operand 9 states and 17 transitions. [2018-06-22 01:19:49,799 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:19:49,799 INFO ]: Found error trace [2018-06-22 01:19:49,799 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:49,800 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:49,800 INFO ]: Analyzing trace with hash -989590047, now seen corresponding path program 1 times [2018-06-22 01:19:49,800 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:49,800 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:49,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:49,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:49,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:49,831 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:49,944 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:49,944 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:49,944 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:49,946 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:49,946 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:49,946 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:49,946 INFO ]: Start difference. First operand 9 states and 17 transitions. Second operand 3 states. [2018-06-22 01:19:50,079 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:50,079 INFO ]: Finished difference Result 10 states and 22 transitions. [2018-06-22 01:19:50,079 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:50,079 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:19:50,079 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:50,080 INFO ]: With dead ends: 10 [2018-06-22 01:19:50,080 INFO ]: Without dead ends: 9 [2018-06-22 01:19:50,081 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:19:50,081 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 01:19:50,082 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 01:19:50,082 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:19:50,082 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-22 01:19:50,083 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 8 [2018-06-22 01:19:50,083 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:50,083 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-22 01:19:50,083 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:50,083 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-22 01:19:50,083 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:19:50,083 INFO ]: Found error trace [2018-06-22 01:19:50,083 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:50,083 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:50,083 INFO ]: Analyzing trace with hash -985895963, now seen corresponding path program 1 times [2018-06-22 01:19:50,084 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:50,084 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:50,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:50,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:50,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:50,118 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:50,259 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:50,259 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:19:50,259 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:19:50,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:50,316 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:50,326 INFO ]: Computing forward predicates... [2018-06-22 01:19:50,361 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:50,381 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:19:50,381 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:19:50,381 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:19:50,381 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:19:50,382 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:19:50,382 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 5 states. [2018-06-22 01:19:50,496 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:50,496 INFO ]: Finished difference Result 10 states and 16 transitions. [2018-06-22 01:19:50,497 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:19:50,497 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 01:19:50,497 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:50,497 INFO ]: With dead ends: 10 [2018-06-22 01:19:50,497 INFO ]: Without dead ends: 10 [2018-06-22 01:19:50,498 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:19:50,498 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:19:50,500 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:19:50,500 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:19:50,500 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-22 01:19:50,500 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 8 [2018-06-22 01:19:50,500 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:50,500 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-22 01:19:50,500 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:19:50,500 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-22 01:19:50,501 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:19:50,501 INFO ]: Found error trace [2018-06-22 01:19:50,501 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:50,501 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:50,501 INFO ]: Analyzing trace with hash -996978215, now seen corresponding path program 1 times [2018-06-22 01:19:50,501 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:50,501 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:50,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:50,502 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:50,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:50,513 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:50,601 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:50,602 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:50,602 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:50,602 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:50,602 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:50,602 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:50,602 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. [2018-06-22 01:19:50,736 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:50,736 INFO ]: Finished difference Result 11 states and 19 transitions. [2018-06-22 01:19:50,737 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:50,737 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:19:50,737 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:50,737 INFO ]: With dead ends: 11 [2018-06-22 01:19:50,737 INFO ]: Without dead ends: 10 [2018-06-22 01:19:50,737 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:19:50,738 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:19:50,739 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:19:50,739 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:19:50,739 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-22 01:19:50,739 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 8 [2018-06-22 01:19:50,739 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:50,739 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-22 01:19:50,739 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:50,739 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-22 01:19:50,740 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:19:50,740 INFO ]: Found error trace [2018-06-22 01:19:50,740 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:50,740 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:50,740 INFO ]: Analyzing trace with hash -484722610, now seen corresponding path program 2 times [2018-06-22 01:19:50,740 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:50,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:50,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:50,741 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:50,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:50,776 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:50,995 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:50,995 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:19:50,995 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:19:51,005 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:19:51,075 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:19:51,075 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:51,079 INFO ]: Computing forward predicates... [2018-06-22 01:19:51,456 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:51,491 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:19:51,491 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 01:19:51,491 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:19:51,491 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:19:51,491 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:19:51,492 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 8 states. [2018-06-22 01:19:51,864 WARN ]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-06-22 01:19:51,906 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:51,906 INFO ]: Finished difference Result 11 states and 15 transitions. [2018-06-22 01:19:51,907 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:19:51,907 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-22 01:19:51,907 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:51,907 INFO ]: With dead ends: 11 [2018-06-22 01:19:51,907 INFO ]: Without dead ends: 11 [2018-06-22 01:19:51,908 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:19:51,908 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:19:51,909 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:19:51,909 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:19:51,909 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-06-22 01:19:51,909 INFO ]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 9 [2018-06-22 01:19:51,909 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:51,909 INFO ]: Abstraction has 11 states and 15 transitions. [2018-06-22 01:19:51,909 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:19:51,910 INFO ]: Start isEmpty. Operand 11 states and 15 transitions. [2018-06-22 01:19:51,910 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:19:51,910 INFO ]: Found error trace [2018-06-22 01:19:51,910 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:51,910 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:51,910 INFO ]: Analyzing trace with hash -492110778, now seen corresponding path program 1 times [2018-06-22 01:19:51,910 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:51,910 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:51,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:51,912 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:19:51,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:51,923 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:51,977 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:51,977 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:51,977 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:51,978 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:51,978 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:51,978 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:51,978 INFO ]: Start difference. First operand 11 states and 15 transitions. Second operand 3 states. [2018-06-22 01:19:52,022 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:52,022 INFO ]: Finished difference Result 13 states and 19 transitions. [2018-06-22 01:19:52,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:52,023 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:19:52,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:52,024 INFO ]: With dead ends: 13 [2018-06-22 01:19:52,024 INFO ]: Without dead ends: 13 [2018-06-22 01:19:52,024 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:19:52,024 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:19:52,026 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-22 01:19:52,026 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:19:52,026 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-06-22 01:19:52,026 INFO ]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 9 [2018-06-22 01:19:52,026 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:52,026 INFO ]: Abstraction has 11 states and 15 transitions. [2018-06-22 01:19:52,026 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:52,026 INFO ]: Start isEmpty. Operand 11 states and 15 transitions. [2018-06-22 01:19:52,027 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:19:52,027 INFO ]: Found error trace [2018-06-22 01:19:52,027 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:52,027 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:52,027 INFO ]: Analyzing trace with hash -2128217851, now seen corresponding path program 3 times [2018-06-22 01:19:52,027 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:52,027 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:52,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:52,030 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:52,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:52,070 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:52,500 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:52,501 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:19:52,501 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:19:52,507 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:19:52,578 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:19:52,578 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:52,582 INFO ]: Computing forward predicates... [2018-06-22 01:19:52,810 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:52,830 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:19:52,830 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 01:19:52,830 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:19:52,830 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:19:52,830 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:19:52,831 INFO ]: Start difference. First operand 11 states and 15 transitions. Second operand 10 states. [2018-06-22 01:19:52,960 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:52,960 INFO ]: Finished difference Result 13 states and 19 transitions. [2018-06-22 01:19:52,961 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:19:52,961 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-22 01:19:52,961 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:52,961 INFO ]: With dead ends: 13 [2018-06-22 01:19:52,961 INFO ]: Without dead ends: 13 [2018-06-22 01:19:52,962 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:19:52,962 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:19:52,963 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-22 01:19:52,963 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:19:52,963 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-06-22 01:19:52,964 INFO ]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 10 [2018-06-22 01:19:52,964 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:52,964 INFO ]: Abstraction has 12 states and 17 transitions. [2018-06-22 01:19:52,964 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:19:52,964 INFO ]: Start isEmpty. Operand 12 states and 17 transitions. [2018-06-22 01:19:52,964 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:19:52,964 INFO ]: Found error trace [2018-06-22 01:19:52,964 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:52,964 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:52,964 INFO ]: Analyzing trace with hash 1937716237, now seen corresponding path program 2 times [2018-06-22 01:19:52,964 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:52,964 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:52,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:52,965 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:19:52,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:52,975 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:53,049 INFO ]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:53,049 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:19:53,049 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:19:53,055 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:19:53,089 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:19:53,089 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:53,091 INFO ]: Computing forward predicates... [2018-06-22 01:19:53,094 INFO ]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:53,114 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:19:53,114 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:19:53,114 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:19:53,115 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:19:53,115 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:19:53,115 INFO ]: Start difference. First operand 12 states and 17 transitions. Second operand 4 states. [2018-06-22 01:19:53,134 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:53,135 INFO ]: Finished difference Result 16 states and 25 transitions. [2018-06-22 01:19:53,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:19:53,135 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 01:19:53,135 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:53,136 INFO ]: With dead ends: 16 [2018-06-22 01:19:53,136 INFO ]: Without dead ends: 16 [2018-06-22 01:19:53,136 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:19:53,136 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:19:53,137 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-22 01:19:53,138 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:19:53,138 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-06-22 01:19:53,138 INFO ]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 10 [2018-06-22 01:19:53,138 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:53,138 INFO ]: Abstraction has 12 states and 17 transitions. [2018-06-22 01:19:53,138 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:19:53,138 INFO ]: Start isEmpty. Operand 12 states and 17 transitions. [2018-06-22 01:19:53,138 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:19:53,138 INFO ]: Found error trace [2018-06-22 01:19:53,138 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:53,139 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:53,139 INFO ]: Analyzing trace with hash -1536962770, now seen corresponding path program 4 times [2018-06-22 01:19:53,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:53,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:53,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:53,139 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:19:53,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:53,166 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:53,593 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:53,593 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:19:53,593 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:19:53,600 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:19:53,646 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:19:53,646 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:53,650 INFO ]: Computing forward predicates... [2018-06-22 01:19:53,776 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:53,796 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:19:53,796 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 01:19:53,796 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:19:53,796 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:19:53,797 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:19:53,797 INFO ]: Start difference. First operand 12 states and 17 transitions. Second operand 8 states. [2018-06-22 01:19:53,872 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:53,872 INFO ]: Finished difference Result 15 states and 23 transitions. [2018-06-22 01:19:53,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:19:53,873 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-22 01:19:53,873 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:53,874 INFO ]: With dead ends: 15 [2018-06-22 01:19:53,874 INFO ]: Without dead ends: 15 [2018-06-22 01:19:53,874 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:19:53,874 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:19:53,876 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-06-22 01:19:53,877 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:19:53,877 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-22 01:19:53,877 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 11 [2018-06-22 01:19:53,877 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:53,877 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-22 01:19:53,877 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:19:53,878 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-22 01:19:53,878 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:19:53,878 INFO ]: Found error trace [2018-06-22 01:19:53,878 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:53,878 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:53,878 INFO ]: Analyzing trace with hash -47057626, now seen corresponding path program 3 times [2018-06-22 01:19:53,878 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:53,878 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:53,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:53,879 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:19:53,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:53,890 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:53,958 INFO ]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:53,958 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:19:53,958 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:19:53,967 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:19:54,025 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:19:54,025 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:54,026 INFO ]: Computing forward predicates... [2018-06-22 01:19:54,030 INFO ]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:54,064 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:19:54,064 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 01:19:54,064 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:19:54,064 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:19:54,064 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:19:54,065 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 5 states. [2018-06-22 01:19:54,122 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:54,122 INFO ]: Finished difference Result 19 states and 31 transitions. [2018-06-22 01:19:54,122 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:19:54,122 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-22 01:19:54,122 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:54,122 INFO ]: With dead ends: 19 [2018-06-22 01:19:54,122 INFO ]: Without dead ends: 19 [2018-06-22 01:19:54,122 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:19:54,122 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:19:54,124 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-06-22 01:19:54,124 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:19:54,124 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-22 01:19:54,124 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 11 [2018-06-22 01:19:54,124 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:54,124 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-22 01:19:54,124 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:19:54,125 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-22 01:19:54,125 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:19:54,125 INFO ]: Found error trace [2018-06-22 01:19:54,125 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:54,125 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:54,125 INFO ]: Analyzing trace with hash -387924443, now seen corresponding path program 5 times [2018-06-22 01:19:54,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:54,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:54,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:54,126 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:19:54,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:54,156 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:54,286 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:54,286 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:19:54,286 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-22 01:19:54,301 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:19:54,355 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:19:54,355 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:54,359 INFO ]: Computing forward predicates... [2018-06-22 01:19:54,436 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:54,460 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:19:54,460 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 01:19:54,460 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:19:54,461 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:19:54,461 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:19:54,461 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 9 states. [2018-06-22 01:19:54,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:54,699 INFO ]: Finished difference Result 17 states and 27 transitions. [2018-06-22 01:19:54,699 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:19:54,699 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-22 01:19:54,699 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:54,700 INFO ]: With dead ends: 17 [2018-06-22 01:19:54,700 INFO ]: Without dead ends: 17 [2018-06-22 01:19:54,700 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:19:54,700 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:19:54,701 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-22 01:19:54,701 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:19:54,702 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2018-06-22 01:19:54,702 INFO ]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 12 [2018-06-22 01:19:54,702 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:54,702 INFO ]: Abstraction has 14 states and 21 transitions. [2018-06-22 01:19:54,702 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:19:54,702 INFO ]: Start isEmpty. Operand 14 states and 21 transitions. [2018-06-22 01:19:54,702 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:19:54,702 INFO ]: Found error trace [2018-06-22 01:19:54,702 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:54,702 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:54,702 INFO ]: Analyzing trace with hash -1445505235, now seen corresponding path program 4 times [2018-06-22 01:19:54,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:54,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:54,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:54,703 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:19:54,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:54,716 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:54,864 INFO ]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:54,864 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:19:54,864 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-22 01:19:54,870 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:19:54,917 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:19:54,917 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:54,919 INFO ]: Computing forward predicates... [2018-06-22 01:19:54,924 INFO ]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:54,956 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:19:54,956 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 01:19:54,957 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:19:54,957 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:19:54,957 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:19:54,957 INFO ]: Start difference. First operand 14 states and 21 transitions. Second operand 6 states. [2018-06-22 01:19:54,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:54,987 INFO ]: Finished difference Result 22 states and 37 transitions. [2018-06-22 01:19:54,987 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:19:54,987 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-22 01:19:54,987 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:54,987 INFO ]: With dead ends: 22 [2018-06-22 01:19:54,987 INFO ]: Without dead ends: 22 [2018-06-22 01:19:54,987 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:19:54,988 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:19:54,989 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-06-22 01:19:54,989 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:19:54,990 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2018-06-22 01:19:54,990 INFO ]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 12 [2018-06-22 01:19:54,990 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:54,990 INFO ]: Abstraction has 14 states and 21 transitions. [2018-06-22 01:19:54,990 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:19:54,990 INFO ]: Start isEmpty. Operand 14 states and 21 transitions. [2018-06-22 01:19:54,990 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:19:54,990 INFO ]: Found error trace [2018-06-22 01:19:54,990 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:54,990 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:54,990 INFO ]: Analyzing trace with hash 872525326, now seen corresponding path program 6 times [2018-06-22 01:19:54,990 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:54,990 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:54,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:54,991 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:19:54,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:55,020 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:55,405 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:55,405 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:19:55,405 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:19:55,422 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:19:55,495 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:19:55,495 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:55,503 INFO ]: Computing forward predicates... [2018-06-22 01:19:56,084 WARN ]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 01:19:56,143 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:56,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:19:56,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 01:19:56,162 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:19:56,163 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:19:56,163 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:19:56,163 INFO ]: Start difference. First operand 14 states and 21 transitions. Second operand 16 states. [2018-06-22 01:19:56,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:56,473 INFO ]: Finished difference Result 19 states and 31 transitions. [2018-06-22 01:19:56,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:19:56,473 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-22 01:19:56,474 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:56,474 INFO ]: With dead ends: 19 [2018-06-22 01:19:56,474 INFO ]: Without dead ends: 19 [2018-06-22 01:19:56,474 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:19:56,474 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:19:56,476 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-06-22 01:19:56,476 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:19:56,476 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2018-06-22 01:19:56,476 INFO ]: Start accepts. Automaton has 15 states and 23 transitions. Word has length 13 [2018-06-22 01:19:56,476 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:56,476 INFO ]: Abstraction has 15 states and 23 transitions. [2018-06-22 01:19:56,476 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:19:56,476 INFO ]: Start isEmpty. Operand 15 states and 23 transitions. [2018-06-22 01:19:56,477 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:19:56,477 INFO ]: Found error trace [2018-06-22 01:19:56,477 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:56,477 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:56,477 INFO ]: Analyzing trace with hash -1847708154, now seen corresponding path program 5 times [2018-06-22 01:19:56,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:56,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:56,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:56,478 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:19:56,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:56,489 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:56,661 INFO ]: Checked inductivity of 21 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:56,661 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:19:56,661 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) [2018-06-22 01:19:56,676 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:19:56,763 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:19:56,763 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:56,767 INFO ]: Computing forward predicates... [2018-06-22 01:19:56,772 INFO ]: Checked inductivity of 21 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:56,792 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:19:56,792 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 01:19:56,793 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:19:56,793 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:19:56,793 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:19:56,793 INFO ]: Start difference. First operand 15 states and 23 transitions. Second operand 7 states. [2018-06-22 01:19:56,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:56,822 INFO ]: Finished difference Result 25 states and 43 transitions. [2018-06-22 01:19:56,822 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:19:56,822 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 01:19:56,822 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:56,822 INFO ]: With dead ends: 25 [2018-06-22 01:19:56,822 INFO ]: Without dead ends: 25 [2018-06-22 01:19:56,823 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:19:56,823 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:19:56,824 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 15. [2018-06-22 01:19:56,824 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:19:56,825 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2018-06-22 01:19:56,825 INFO ]: Start accepts. Automaton has 15 states and 23 transitions. Word has length 13 [2018-06-22 01:19:56,825 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:56,825 INFO ]: Abstraction has 15 states and 23 transitions. [2018-06-22 01:19:56,825 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:19:56,825 INFO ]: Start isEmpty. Operand 15 states and 23 transitions. [2018-06-22 01:19:56,825 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:19:56,825 INFO ]: Found error trace [2018-06-22 01:19:56,825 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:56,825 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:56,825 INFO ]: Analyzing trace with hash 1291762501, now seen corresponding path program 7 times [2018-06-22 01:19:56,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:56,825 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:56,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:56,828 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:19:56,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:56,864 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:57,187 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:57,187 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:19:57,187 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-22 01:19:57,193 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:57,249 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:57,253 INFO ]: Computing forward predicates... [2018-06-22 01:19:57,364 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:57,385 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:19:57,385 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-22 01:19:57,385 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:19:57,385 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:19:57,385 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:19:57,385 INFO ]: Start difference. First operand 15 states and 23 transitions. Second operand 11 states. [2018-06-22 01:19:57,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:57,716 INFO ]: Finished difference Result 21 states and 35 transitions. [2018-06-22 01:19:57,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:19:57,718 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-22 01:19:57,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:57,718 INFO ]: With dead ends: 21 [2018-06-22 01:19:57,718 INFO ]: Without dead ends: 21 [2018-06-22 01:19:57,718 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:19:57,719 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:19:57,720 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-06-22 01:19:57,720 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:19:57,720 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. [2018-06-22 01:19:57,721 INFO ]: Start accepts. Automaton has 16 states and 25 transitions. Word has length 14 [2018-06-22 01:19:57,721 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:57,721 INFO ]: Abstraction has 16 states and 25 transitions. [2018-06-22 01:19:57,721 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:19:57,721 INFO ]: Start isEmpty. Operand 16 states and 25 transitions. [2018-06-22 01:19:57,721 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:19:57,721 INFO ]: Found error trace [2018-06-22 01:19:57,721 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:57,721 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:57,721 INFO ]: Analyzing trace with hash -1431096755, now seen corresponding path program 6 times [2018-06-22 01:19:57,721 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:57,721 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:57,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:57,722 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:57,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:57,733 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:58,390 INFO ]: Checked inductivity of 28 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:58,390 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:19:58,390 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) [2018-06-22 01:19:58,405 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:19:58,491 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:19:58,491 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:58,493 INFO ]: Computing forward predicates... [2018-06-22 01:19:58,499 INFO ]: Checked inductivity of 28 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:58,521 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:19:58,521 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:19:58,521 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:19:58,521 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:19:58,522 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:19:58,522 INFO ]: Start difference. First operand 16 states and 25 transitions. Second operand 8 states. [2018-06-22 01:19:58,536 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:58,536 INFO ]: Finished difference Result 28 states and 49 transitions. [2018-06-22 01:19:58,536 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:19:58,536 INFO ]: Start accepts. Automaton has 8 states. Word has length 14 [2018-06-22 01:19:58,536 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:58,537 INFO ]: With dead ends: 28 [2018-06-22 01:19:58,537 INFO ]: Without dead ends: 28 [2018-06-22 01:19:58,537 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:19:58,537 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:19:58,539 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 16. [2018-06-22 01:19:58,539 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:19:58,539 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. [2018-06-22 01:19:58,539 INFO ]: Start accepts. Automaton has 16 states and 25 transitions. Word has length 14 [2018-06-22 01:19:58,539 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:58,539 INFO ]: Abstraction has 16 states and 25 transitions. [2018-06-22 01:19:58,539 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:19:58,539 INFO ]: Start isEmpty. Operand 16 states and 25 transitions. [2018-06-22 01:19:58,540 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:19:58,540 INFO ]: Found error trace [2018-06-22 01:19:58,540 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:58,540 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:58,540 INFO ]: Analyzing trace with hash 1403213038, now seen corresponding path program 8 times [2018-06-22 01:19:58,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:58,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:58,540 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:58,540 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:19:58,540 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:58,563 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:58,793 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:58,793 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:19:58,793 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-22 01:19:58,798 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:19:58,852 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:19:58,852 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:58,858 INFO ]: Computing forward predicates... [2018-06-22 01:19:59,127 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:59,146 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:19:59,146 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-22 01:19:59,146 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:19:59,147 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:19:59,147 INFO ]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:19:59,147 INFO ]: Start difference. First operand 16 states and 25 transitions. Second operand 20 states. [2018-06-22 01:19:59,388 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:59,388 INFO ]: Finished difference Result 23 states and 39 transitions. [2018-06-22 01:19:59,388 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:19:59,388 INFO ]: Start accepts. Automaton has 20 states. Word has length 15 [2018-06-22 01:19:59,388 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:59,389 INFO ]: With dead ends: 23 [2018-06-22 01:19:59,389 INFO ]: Without dead ends: 23 [2018-06-22 01:19:59,389 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:19:59,389 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:19:59,391 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-06-22 01:19:59,391 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:19:59,391 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2018-06-22 01:19:59,391 INFO ]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 15 [2018-06-22 01:19:59,391 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:59,391 INFO ]: Abstraction has 17 states and 27 transitions. [2018-06-22 01:19:59,391 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:19:59,391 INFO ]: Start isEmpty. Operand 17 states and 27 transitions. [2018-06-22 01:19:59,391 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:19:59,391 INFO ]: Found error trace [2018-06-22 01:19:59,392 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:59,392 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:59,392 INFO ]: Analyzing trace with hash -1401045274, now seen corresponding path program 7 times [2018-06-22 01:19:59,392 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:59,392 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:59,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:59,392 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:19:59,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:59,408 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:59,510 INFO ]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:59,510 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:19:59,510 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-22 01:19:59,517 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:59,558 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:59,560 INFO ]: Computing forward predicates... [2018-06-22 01:19:59,566 INFO ]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:59,597 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:19:59,597 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 01:19:59,598 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:19:59,598 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:19:59,598 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:19:59,598 INFO ]: Start difference. First operand 17 states and 27 transitions. Second operand 9 states. [2018-06-22 01:19:59,869 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:59,869 INFO ]: Finished difference Result 31 states and 55 transitions. [2018-06-22 01:19:59,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:19:59,869 INFO ]: Start accepts. Automaton has 9 states. Word has length 15 [2018-06-22 01:19:59,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:59,869 INFO ]: With dead ends: 31 [2018-06-22 01:19:59,869 INFO ]: Without dead ends: 31 [2018-06-22 01:19:59,870 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:19:59,870 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:19:59,871 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-06-22 01:19:59,871 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:19:59,872 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2018-06-22 01:19:59,872 INFO ]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 15 [2018-06-22 01:19:59,872 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:59,872 INFO ]: Abstraction has 17 states and 27 transitions. [2018-06-22 01:19:59,872 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:19:59,872 INFO ]: Start isEmpty. Operand 17 states and 27 transitions. [2018-06-22 01:19:59,872 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:19:59,872 INFO ]: Found error trace [2018-06-22 01:19:59,872 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:59,872 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:59,872 INFO ]: Analyzing trace with hash 563212389, now seen corresponding path program 9 times [2018-06-22 01:19:59,872 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:59,872 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:59,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:59,873 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:59,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:59,904 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:00,204 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:00,204 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:00,204 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-22 01:20:00,210 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:20:00,322 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 01:20:00,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:00,327 INFO ]: Computing forward predicates... [2018-06-22 01:20:00,703 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:00,723 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:00,724 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 01:20:00,724 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:20:00,724 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:20:00,724 INFO ]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:20:00,724 INFO ]: Start difference. First operand 17 states and 27 transitions. Second operand 22 states. [2018-06-22 01:20:01,173 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:01,173 INFO ]: Finished difference Result 25 states and 43 transitions. [2018-06-22 01:20:01,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:20:01,209 INFO ]: Start accepts. Automaton has 22 states. Word has length 16 [2018-06-22 01:20:01,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:01,210 INFO ]: With dead ends: 25 [2018-06-22 01:20:01,210 INFO ]: Without dead ends: 25 [2018-06-22 01:20:01,210 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:20:01,211 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:20:01,212 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-06-22 01:20:01,212 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:20:01,213 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2018-06-22 01:20:01,213 INFO ]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 16 [2018-06-22 01:20:01,213 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:01,213 INFO ]: Abstraction has 18 states and 29 transitions. [2018-06-22 01:20:01,213 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:20:01,213 INFO ]: Start isEmpty. Operand 18 states and 29 transitions. [2018-06-22 01:20:01,213 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:20:01,213 INFO ]: Found error trace [2018-06-22 01:20:01,213 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:01,213 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:01,213 INFO ]: Analyzing trace with hash -469449363, now seen corresponding path program 8 times [2018-06-22 01:20:01,214 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:01,214 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:01,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:01,214 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:01,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:01,240 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:02,063 INFO ]: Checked inductivity of 45 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:20:02,064 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:02,064 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:20:02,071 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:20:02,115 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:20:02,115 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:02,118 INFO ]: Computing forward predicates... [2018-06-22 01:20:02,123 INFO ]: Checked inductivity of 45 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:20:02,143 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:02,143 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 01:20:02,144 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:20:02,144 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:20:02,144 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:20:02,144 INFO ]: Start difference. First operand 18 states and 29 transitions. Second operand 10 states. [2018-06-22 01:20:02,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:02,164 INFO ]: Finished difference Result 34 states and 61 transitions. [2018-06-22 01:20:02,164 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:20:02,164 INFO ]: Start accepts. Automaton has 10 states. Word has length 16 [2018-06-22 01:20:02,164 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:02,165 INFO ]: With dead ends: 34 [2018-06-22 01:20:02,165 INFO ]: Without dead ends: 34 [2018-06-22 01:20:02,165 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:20:02,165 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:20:02,170 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 18. [2018-06-22 01:20:02,170 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:20:02,170 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2018-06-22 01:20:02,170 INFO ]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 16 [2018-06-22 01:20:02,171 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:02,171 INFO ]: Abstraction has 18 states and 29 transitions. [2018-06-22 01:20:02,171 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:20:02,171 INFO ]: Start isEmpty. Operand 18 states and 29 transitions. [2018-06-22 01:20:02,171 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:20:02,171 INFO ]: Found error trace [2018-06-22 01:20:02,171 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:02,171 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:02,171 INFO ]: Analyzing trace with hash 292996046, now seen corresponding path program 10 times [2018-06-22 01:20:02,171 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:02,171 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:02,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:02,172 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:02,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:02,207 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:02,955 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:02,955 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:02,955 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:20:02,962 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:20:03,020 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:20:03,020 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:03,025 INFO ]: Computing forward predicates... [2018-06-22 01:20:03,157 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:03,177 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:03,178 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-22 01:20:03,178 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:20:03,178 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:20:03,178 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:20:03,178 INFO ]: Start difference. First operand 18 states and 29 transitions. Second operand 14 states. [2018-06-22 01:20:03,487 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:03,487 INFO ]: Finished difference Result 27 states and 47 transitions. [2018-06-22 01:20:03,488 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:20:03,488 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 01:20:03,488 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:03,488 INFO ]: With dead ends: 27 [2018-06-22 01:20:03,488 INFO ]: Without dead ends: 27 [2018-06-22 01:20:03,488 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:20:03,488 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:20:03,490 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-06-22 01:20:03,490 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:20:03,490 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-06-22 01:20:03,490 INFO ]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 17 [2018-06-22 01:20:03,490 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:03,490 INFO ]: Abstraction has 19 states and 31 transitions. [2018-06-22 01:20:03,490 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:20:03,490 INFO ]: Start isEmpty. Operand 19 states and 31 transitions. [2018-06-22 01:20:03,491 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:20:03,491 INFO ]: Found error trace [2018-06-22 01:20:03,491 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:03,491 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:03,491 INFO ]: Analyzing trace with hash -1654747194, now seen corresponding path program 9 times [2018-06-22 01:20:03,491 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:03,491 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:03,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:03,492 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:03,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:03,506 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:03,665 INFO ]: Checked inductivity of 55 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:20:03,665 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:03,665 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:20:03,671 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:20:03,729 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 01:20:03,729 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:03,731 INFO ]: Computing forward predicates... [2018-06-22 01:20:03,738 INFO ]: Checked inductivity of 55 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:20:03,771 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:03,771 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 01:20:03,771 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:20:03,771 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:20:03,771 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:20:03,771 INFO ]: Start difference. First operand 19 states and 31 transitions. Second operand 11 states. [2018-06-22 01:20:04,082 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:04,082 INFO ]: Finished difference Result 37 states and 67 transitions. [2018-06-22 01:20:04,083 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:20:04,084 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 01:20:04,084 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:04,084 INFO ]: With dead ends: 37 [2018-06-22 01:20:04,084 INFO ]: Without dead ends: 37 [2018-06-22 01:20:04,084 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:20:04,084 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:20:04,086 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 19. [2018-06-22 01:20:04,086 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:20:04,086 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-06-22 01:20:04,086 INFO ]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 17 [2018-06-22 01:20:04,086 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:04,086 INFO ]: Abstraction has 19 states and 31 transitions. [2018-06-22 01:20:04,086 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:20:04,086 INFO ]: Start isEmpty. Operand 19 states and 31 transitions. [2018-06-22 01:20:04,086 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:20:04,086 INFO ]: Found error trace [2018-06-22 01:20:04,086 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:04,087 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:04,087 INFO ]: Analyzing trace with hash 506224005, now seen corresponding path program 11 times [2018-06-22 01:20:04,087 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:04,087 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:04,087 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:04,087 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:04,087 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:04,106 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:04,230 INFO ]: Checked inductivity of 66 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:04,230 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:04,230 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:20:04,236 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:20:04,294 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:20:04,294 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:04,297 INFO ]: Computing forward predicates... [2018-06-22 01:20:04,304 INFO ]: Checked inductivity of 66 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:04,324 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:04,324 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 01:20:04,324 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:20:04,324 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:20:04,324 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:20:04,324 INFO ]: Start difference. First operand 19 states and 31 transitions. Second operand 13 states. [2018-06-22 01:20:05,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:05,096 INFO ]: Finished difference Result 40 states and 73 transitions. [2018-06-22 01:20:05,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:20:05,096 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-22 01:20:05,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:05,096 INFO ]: With dead ends: 40 [2018-06-22 01:20:05,096 INFO ]: Without dead ends: 40 [2018-06-22 01:20:05,097 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:20:05,097 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 01:20:05,099 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 19. [2018-06-22 01:20:05,099 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:20:05,099 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-06-22 01:20:05,099 INFO ]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 18 [2018-06-22 01:20:05,099 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:05,099 INFO ]: Abstraction has 19 states and 31 transitions. [2018-06-22 01:20:05,099 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:20:05,099 INFO ]: Start isEmpty. Operand 19 states and 31 transitions. [2018-06-22 01:20:05,100 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:20:05,100 INFO ]: Found error trace [2018-06-22 01:20:05,100 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:05,100 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:05,100 INFO ]: Analyzing trace with hash 1330711421, now seen corresponding path program 10 times [2018-06-22 01:20:05,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:05,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:05,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:05,101 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:05,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:05,142 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:05,473 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:05,473 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:05,473 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:20:05,480 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:20:05,546 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:20:05,546 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:05,551 INFO ]: Computing forward predicates... [2018-06-22 01:20:05,831 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:05,852 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:05,852 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-22 01:20:05,852 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:20:05,852 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:20:05,852 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:20:05,853 INFO ]: Start difference. First operand 19 states and 31 transitions. Second operand 15 states. [2018-06-22 01:20:06,087 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:06,087 INFO ]: Finished difference Result 42 states and 77 transitions. [2018-06-22 01:20:06,087 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:20:06,087 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-22 01:20:06,088 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:06,088 INFO ]: With dead ends: 42 [2018-06-22 01:20:06,088 INFO ]: Without dead ends: 42 [2018-06-22 01:20:06,088 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:20:06,088 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:20:06,089 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 20. [2018-06-22 01:20:06,089 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:20:06,090 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions. [2018-06-22 01:20:06,090 INFO ]: Start accepts. Automaton has 20 states and 33 transitions. Word has length 18 [2018-06-22 01:20:06,090 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:06,090 INFO ]: Abstraction has 20 states and 33 transitions. [2018-06-22 01:20:06,090 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:20:06,090 INFO ]: Start isEmpty. Operand 20 states and 33 transitions. [2018-06-22 01:20:06,090 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:20:06,090 INFO ]: Found error trace [2018-06-22 01:20:06,090 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:06,090 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:06,090 INFO ]: Analyzing trace with hash -649156442, now seen corresponding path program 11 times [2018-06-22 01:20:06,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:06,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:06,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:06,091 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:06,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:06,122 INFO ]: Conjunction of SSA is sat [2018-06-22 01:20:06,128 INFO ]: Counterexample might be feasible [2018-06-22 01:20:06,156 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:20:06 BoogieIcfgContainer [2018-06-22 01:20:06,156 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:20:06,157 INFO ]: Toolchain (without parser) took 17197.62 ms. Allocated memory was 309.3 MB in the beginning and 427.8 MB in the end (delta: 118.5 MB). Free memory was 264.9 MB in the beginning and 201.5 MB in the end (delta: 63.4 MB). Peak memory consumption was 181.9 MB. Max. memory is 3.6 GB. [2018-06-22 01:20:06,157 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:20:06,158 INFO ]: ChcToBoogie took 60.29 ms. Allocated memory is still 309.3 MB. Free memory was 263.9 MB in the beginning and 261.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:20:06,158 INFO ]: Boogie Preprocessor took 41.37 ms. Allocated memory is still 309.3 MB. Free memory was 261.9 MB in the beginning and 260.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 01:20:06,158 INFO ]: RCFGBuilder took 336.02 ms. Allocated memory is still 309.3 MB. Free memory was 260.9 MB in the beginning and 248.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:20:06,159 INFO ]: TraceAbstraction took 16745.00 ms. Allocated memory was 309.3 MB in the beginning and 427.8 MB in the end (delta: 118.5 MB). Free memory was 248.9 MB in the beginning and 201.5 MB in the end (delta: 47.4 MB). Peak memory consumption was 165.9 MB. Max. memory is 3.6 GB. [2018-06-22 01:20:06,165 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 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.29 ms. Allocated memory is still 309.3 MB. Free memory was 263.9 MB in the beginning and 261.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 41.37 ms. Allocated memory is still 309.3 MB. Free memory was 261.9 MB in the beginning and 260.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 336.02 ms. Allocated memory is still 309.3 MB. Free memory was 260.9 MB in the beginning and 248.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 16745.00 ms. Allocated memory was 309.3 MB in the beginning and 427.8 MB in the end (delta: 118.5 MB). Free memory was 248.9 MB in the beginning and 201.5 MB in the end (delta: 47.4 MB). Peak memory consumption was 165.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] assume (((hbv_False_9_Int == hbv_False_10_Int && hbv_False_5_Int == hbv_False_6_Int) && !(hbv_False_1_Int - hbv_False_2_Int + -1 >= 0)) && !(hbv_False_7_Int == hbv_False_8_Int)) && !(hbv_False_3_Int - hbv_False_4_Int + -1 >= 0); [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hbv_False_3_Int, hbv_False_11_Int, hbv_False_4_Int, hbv_False_12_Int, hbv_False_7_Int, hbv_False_1_Int, hbv_False_13_Int, hbv_False_2_Int, hbv_False_14_Int, hbv_False_8_Int; [L0] havoc hbv_False_11_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_2_Int, hbv_False_4_Int, hbv_False_7_Int, hbv_False_10_Int, hbv_False_13_Int, hbv_False_1_Int, hbv_False_3_Int, hbv_False_9_Int, hbv_False_14_Int, hbv_False_8_Int, hbv_False_12_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_10_Int, hbv_INV1_8_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_9_Int; [L0] assume (((((((((hhv_INV1_5_Int - hbv_INV1_7_Int + -1 >= 0 && -1 * hhv_INV1_8_Int == -10) && hbv_INV1_3_Int + hbv_INV1_4_Int == hhv_INV1_9_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hbv_INV1_5_Int == hbv_INV1_6_Int) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && hbv_INV1_7_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_7_Int + -10 == 0) && hbv_INV1_8_Int == hbv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_3_Int; [L0] havoc hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_10_Int, hbv_INV1_8_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_9_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_10_Int, hbv_INV1_8_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_9_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_10_Int, hbv_INV1_8_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_9_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_10_Int, hbv_INV1_8_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_9_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_10_Int, hbv_INV1_8_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_9_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_10_Int, hbv_INV1_8_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_9_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_10_Int, hbv_INV1_8_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_9_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_10_Int, hbv_INV1_8_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_9_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_10_Int, hbv_INV1_8_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_9_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_10_Int, hbv_INV1_8_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_9_Int; [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int; [L0] havoc hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_1_Int, hbv_INV1_6_Int, hbv_INV1_10_Int, hbv_INV1_8_Int, hbv_INV1_3_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_9_Int; [L0] assume ((((((-1 * hhv_INV1_2_Int == 0 && -1 * hhv_INV1_7_Int == 0) && -1 * hhv_INV1_3_Int == 0) && hhv_INV1_8_Int == hhv_INV1_6_Int) && -1 * hhv_INV1_9_Int == 0) && hhv_INV1_0_Int == hhv_INV1_5_Int) && hhv_INV1_1_Int == hhv_INV1_6_Int) && -1 * hhv_INV1_4_Int == 0; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. UNSAFE Result, 16.6s OverallTime, 25 OverallIterations, 11 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 195 SDtfs, 20 SDslu, 755 SDs, 0 SdLazy, 2298 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 464 GetRequests, 234 SyntacticMatches, 24 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 169 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 589 NumberOfCodeBlocks, 589 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 526 ConstructedInterpolants, 11 QuantifiedInterpolants, 66761 SizeOfPredicates, 88 NumberOfNonLiveVariables, 6520 ConjunctsInSsa, 1714 ConjunctsInUnsatCore, 44 InterpolantComputations, 4 PerfectInterpolantSequences, 219/1141 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-20-06-179.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-20-06-179.csv Received shutdown request...