java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/dotprod5.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:41:53,881 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:41:53,883 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:41:53,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:41:53,895 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:41:53,895 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:41:53,896 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:41:53,900 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:41:53,902 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:41:53,902 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:41:53,904 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:41:53,905 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:41:53,905 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:41:53,906 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:41:53,907 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:41:53,910 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:41:53,911 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:41:53,918 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:41:53,920 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:41:53,921 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:41:53,922 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:41:53,924 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:41:53,924 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:41:53,925 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:41:53,926 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:41:53,926 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:41:53,927 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:41:53,928 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:41:53,929 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:41:53,930 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:41:53,930 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:41:53,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:41:53,931 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:41:53,932 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:41:53,933 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:41:53,933 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:41:53,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:41:53,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:41:53,947 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:41:53,947 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:41:53,949 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:41:53,949 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:41:53,949 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:41:53,949 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:41:53,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:41:53,952 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:41:53,953 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:41:53,953 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:41:53,953 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:41:53,953 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:41:53,953 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:41:53,954 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:41:53,954 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:41:53,955 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:41:53,955 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:41:54,010 INFO ]: Repository-Root is: /tmp [2018-06-22 01:41:54,031 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:41:54,035 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:41:54,036 INFO ]: Initializing SmtParser... [2018-06-22 01:41:54,036 INFO ]: SmtParser initialized [2018-06-22 01:41:54,037 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/dotprod5.smt2 [2018-06-22 01:41:54,038 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:41:54,138 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/dotprod5.smt2 unknown [2018-06-22 01:41:54,478 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/dotprod5.smt2 [2018-06-22 01:41:54,483 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:41:54,490 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:41:54,491 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:41:54,491 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:41:54,491 INFO ]: ChcToBoogie initialized [2018-06-22 01:41:54,494 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:41:54" (1/1) ... [2018-06-22 01:41:54,564 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:41:54 Unit [2018-06-22 01:41:54,564 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:41:54,565 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:41:54,565 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:41:54,565 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:41:54,586 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:41:54" (1/1) ... [2018-06-22 01:41:54,587 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:41:54" (1/1) ... [2018-06-22 01:41:54,597 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:41:54" (1/1) ... [2018-06-22 01:41:54,597 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:41:54" (1/1) ... [2018-06-22 01:41:54,615 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:41:54" (1/1) ... [2018-06-22 01:41:54,618 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:41:54" (1/1) ... [2018-06-22 01:41:54,629 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:41:54" (1/1) ... [2018-06-22 01:41:54,633 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:41:54,633 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:41:54,633 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:41:54,633 INFO ]: RCFGBuilder initialized [2018-06-22 01:41:54,634 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:41:54" (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:41:54,647 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:41:54,647 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:41:54,647 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:41:54,647 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:41:54,647 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:41:54,647 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:41:55,418 INFO ]: Using library mode [2018-06-22 01:41:55,419 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:41:55 BoogieIcfgContainer [2018-06-22 01:41:55,419 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:41:55,420 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:41:55,420 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:41:55,423 INFO ]: TraceAbstraction initialized [2018-06-22 01:41:55,424 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:41:54" (1/3) ... [2018-06-22 01:41:55,424 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9fb83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:41:55, skipping insertion in model container [2018-06-22 01:41:55,425 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:41:54" (2/3) ... [2018-06-22 01:41:55,425 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9fb83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:41:55, skipping insertion in model container [2018-06-22 01:41:55,425 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:41:55" (3/3) ... [2018-06-22 01:41:55,426 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:41:55,435 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:41:55,444 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:41:55,490 INFO ]: Using default assertion order modulation [2018-06-22 01:41:55,490 INFO ]: Interprodecural is true [2018-06-22 01:41:55,490 INFO ]: Hoare is false [2018-06-22 01:41:55,490 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:41:55,490 INFO ]: Backedges is TWOTRACK [2018-06-22 01:41:55,490 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:41:55,490 INFO ]: Difference is false [2018-06-22 01:41:55,490 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:41:55,490 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:41:55,511 INFO ]: Start isEmpty. Operand 74 states. [2018-06-22 01:41:55,529 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:41:55,529 INFO ]: Found error trace [2018-06-22 01:41:55,530 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:55,530 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:55,537 INFO ]: Analyzing trace with hash -883827522, now seen corresponding path program 1 times [2018-06-22 01:41:55,539 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:55,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:55,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:55,581 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:55,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:55,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:55,749 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:41:55,752 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:41:55,752 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:41:55,754 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:41:55,769 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:41:55,770 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:41:55,774 INFO ]: Start difference. First operand 74 states. Second operand 4 states. [2018-06-22 01:41:57,505 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:57,506 INFO ]: Finished difference Result 141 states and 221 transitions. [2018-06-22 01:41:57,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:41:57,507 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-22 01:41:57,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:57,530 INFO ]: With dead ends: 141 [2018-06-22 01:41:57,530 INFO ]: Without dead ends: 141 [2018-06-22 01:41:57,531 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:41:57,550 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 01:41:57,612 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-06-22 01:41:57,613 INFO ]: Start removeUnreachable. Operand 141 states. [2018-06-22 01:41:57,624 INFO ]: Finished removeUnreachable. Reduced from 141 states to 141 states and 221 transitions. [2018-06-22 01:41:57,627 INFO ]: Start accepts. Automaton has 141 states and 221 transitions. Word has length 7 [2018-06-22 01:41:57,627 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:57,627 INFO ]: Abstraction has 141 states and 221 transitions. [2018-06-22 01:41:57,627 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:41:57,627 INFO ]: Start isEmpty. Operand 141 states and 221 transitions. [2018-06-22 01:41:57,638 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:41:57,639 INFO ]: Found error trace [2018-06-22 01:41:57,639 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:57,639 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:57,639 INFO ]: Analyzing trace with hash -1083259511, now seen corresponding path program 1 times [2018-06-22 01:41:57,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:57,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:57,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:57,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:57,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:57,661 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:57,842 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:41:57,843 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:41:57,843 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:41:57,844 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:41:57,844 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:41:57,844 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:41:57,844 INFO ]: Start difference. First operand 141 states and 221 transitions. Second operand 4 states. [2018-06-22 01:41:58,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:58,636 INFO ]: Finished difference Result 168 states and 264 transitions. [2018-06-22 01:41:58,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:41:58,637 INFO ]: Start accepts. Automaton has 4 states. Word has length 18 [2018-06-22 01:41:58,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:58,644 INFO ]: With dead ends: 168 [2018-06-22 01:41:58,644 INFO ]: Without dead ends: 168 [2018-06-22 01:41:58,645 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:41:58,645 INFO ]: Start minimizeSevpa. Operand 168 states. [2018-06-22 01:41:58,665 INFO ]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-06-22 01:41:58,665 INFO ]: Start removeUnreachable. Operand 168 states. [2018-06-22 01:41:58,671 INFO ]: Finished removeUnreachable. Reduced from 168 states to 168 states and 264 transitions. [2018-06-22 01:41:58,671 INFO ]: Start accepts. Automaton has 168 states and 264 transitions. Word has length 18 [2018-06-22 01:41:58,671 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:58,671 INFO ]: Abstraction has 168 states and 264 transitions. [2018-06-22 01:41:58,671 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:41:58,671 INFO ]: Start isEmpty. Operand 168 states and 264 transitions. [2018-06-22 01:41:58,676 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:41:58,676 INFO ]: Found error trace [2018-06-22 01:41:58,676 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:58,676 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:58,676 INFO ]: Analyzing trace with hash 860572853, now seen corresponding path program 1 times [2018-06-22 01:41:58,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:58,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:58,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:58,677 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:58,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:58,695 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:58,866 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:41:58,866 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:41:58,866 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:41:58,866 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:41:58,866 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:41:58,866 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:41:58,866 INFO ]: Start difference. First operand 168 states and 264 transitions. Second operand 5 states. [2018-06-22 01:41:59,233 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 01:41:59,313 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:59,313 INFO ]: Finished difference Result 233 states and 422 transitions. [2018-06-22 01:41:59,313 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:41:59,314 INFO ]: Start accepts. Automaton has 5 states. Word has length 20 [2018-06-22 01:41:59,314 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:59,341 INFO ]: With dead ends: 233 [2018-06-22 01:41:59,341 INFO ]: Without dead ends: 233 [2018-06-22 01:41:59,341 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:41:59,342 INFO ]: Start minimizeSevpa. Operand 233 states. [2018-06-22 01:41:59,390 INFO ]: Finished minimizeSevpa. Reduced states from 233 to 176. [2018-06-22 01:41:59,390 INFO ]: Start removeUnreachable. Operand 176 states. [2018-06-22 01:41:59,398 INFO ]: Finished removeUnreachable. Reduced from 176 states to 176 states and 274 transitions. [2018-06-22 01:41:59,398 INFO ]: Start accepts. Automaton has 176 states and 274 transitions. Word has length 20 [2018-06-22 01:41:59,398 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:59,398 INFO ]: Abstraction has 176 states and 274 transitions. [2018-06-22 01:41:59,398 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:41:59,399 INFO ]: Start isEmpty. Operand 176 states and 274 transitions. [2018-06-22 01:41:59,407 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:41:59,407 INFO ]: Found error trace [2018-06-22 01:41:59,408 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:59,408 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:59,408 INFO ]: Analyzing trace with hash 249477516, now seen corresponding path program 1 times [2018-06-22 01:41:59,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:59,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:59,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:59,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:59,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:59,417 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:59,593 INFO ]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:41:59,593 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:59,593 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:41:59,606 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:59,653 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:59,663 INFO ]: Computing forward predicates... [2018-06-22 01:41:59,693 INFO ]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:41:59,715 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:59,715 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:41:59,716 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:41:59,716 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:41:59,716 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:41:59,716 INFO ]: Start difference. First operand 176 states and 274 transitions. Second operand 4 states. [2018-06-22 01:42:01,064 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:42:01,064 INFO ]: Finished difference Result 205 states and 319 transitions. [2018-06-22 01:42:01,064 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:42:01,064 INFO ]: Start accepts. Automaton has 4 states. Word has length 36 [2018-06-22 01:42:01,065 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:42:01,071 INFO ]: With dead ends: 205 [2018-06-22 01:42:01,071 INFO ]: Without dead ends: 205 [2018-06-22 01:42:01,071 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:42:01,071 INFO ]: Start minimizeSevpa. Operand 205 states. [2018-06-22 01:42:01,103 INFO ]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-06-22 01:42:01,103 INFO ]: Start removeUnreachable. Operand 205 states. [2018-06-22 01:42:01,110 INFO ]: Finished removeUnreachable. Reduced from 205 states to 205 states and 319 transitions. [2018-06-22 01:42:01,110 INFO ]: Start accepts. Automaton has 205 states and 319 transitions. Word has length 36 [2018-06-22 01:42:01,111 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:42:01,111 INFO ]: Abstraction has 205 states and 319 transitions. [2018-06-22 01:42:01,111 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:42:01,111 INFO ]: Start isEmpty. Operand 205 states and 319 transitions. [2018-06-22 01:42:01,122 INFO ]: Finished isEmpty. Found accepting run of length 67 [2018-06-22 01:42:01,122 INFO ]: Found error trace [2018-06-22 01:42:01,122 INFO ]: trace histogram [5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:42:01,122 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:42:01,122 INFO ]: Analyzing trace with hash -650418820, now seen corresponding path program 1 times [2018-06-22 01:42:01,122 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:42:01,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:42:01,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:01,123 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:42:01,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:01,160 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:01,234 INFO ]: Checked inductivity of 75 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 01:42:01,234 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:42:01,234 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) [2018-06-22 01:42:01,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:42:01,325 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:01,329 INFO ]: Computing forward predicates... [2018-06-22 01:42:02,154 INFO ]: Checked inductivity of 75 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 01:42:02,205 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:42:02,205 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:42:02,206 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:42:02,206 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:42:02,206 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:42:02,207 INFO ]: Start difference. First operand 205 states and 319 transitions. Second operand 4 states. [2018-06-22 01:42:02,715 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:42:02,715 INFO ]: Finished difference Result 277 states and 432 transitions. [2018-06-22 01:42:02,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:42:02,716 INFO ]: Start accepts. Automaton has 4 states. Word has length 66 [2018-06-22 01:42:02,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:42:02,726 INFO ]: With dead ends: 277 [2018-06-22 01:42:02,726 INFO ]: Without dead ends: 277 [2018-06-22 01:42:02,726 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:42:02,727 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-22 01:42:02,747 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-06-22 01:42:02,747 INFO ]: Start removeUnreachable. Operand 277 states. [2018-06-22 01:42:02,753 INFO ]: Finished removeUnreachable. Reduced from 277 states to 277 states and 432 transitions. [2018-06-22 01:42:02,754 INFO ]: Start accepts. Automaton has 277 states and 432 transitions. Word has length 66 [2018-06-22 01:42:02,754 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:42:02,754 INFO ]: Abstraction has 277 states and 432 transitions. [2018-06-22 01:42:02,754 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:42:02,754 INFO ]: Start isEmpty. Operand 277 states and 432 transitions. [2018-06-22 01:42:02,765 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 01:42:02,765 INFO ]: Found error trace [2018-06-22 01:42:02,765 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:42:02,765 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:42:02,766 INFO ]: Analyzing trace with hash 215478898, now seen corresponding path program 1 times [2018-06-22 01:42:02,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:42:02,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:42:02,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:02,766 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:42:02,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:02,796 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:03,099 INFO ]: Checked inductivity of 30 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 01:42:03,099 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:42:03,099 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:42:03,104 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:42:03,137 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:03,140 INFO ]: Computing forward predicates... [2018-06-22 01:42:03,178 INFO ]: Checked inductivity of 30 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:42:03,374 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:42:03,374 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:42:03,375 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:42:03,375 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:42:03,375 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:42:03,375 INFO ]: Start difference. First operand 277 states and 432 transitions. Second operand 8 states. [2018-06-22 01:42:04,406 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:42:04,406 INFO ]: Finished difference Result 520 states and 977 transitions. [2018-06-22 01:42:04,406 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:42:04,406 INFO ]: Start accepts. Automaton has 8 states. Word has length 48 [2018-06-22 01:42:04,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:42:04,420 INFO ]: With dead ends: 520 [2018-06-22 01:42:04,421 INFO ]: Without dead ends: 429 [2018-06-22 01:42:04,421 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:42:04,421 INFO ]: Start minimizeSevpa. Operand 429 states. [2018-06-22 01:42:04,471 INFO ]: Finished minimizeSevpa. Reduced states from 429 to 315. [2018-06-22 01:42:04,483 INFO ]: Start removeUnreachable. Operand 315 states. [2018-06-22 01:42:04,490 INFO ]: Finished removeUnreachable. Reduced from 315 states to 315 states and 506 transitions. [2018-06-22 01:42:04,491 INFO ]: Start accepts. Automaton has 315 states and 506 transitions. Word has length 48 [2018-06-22 01:42:04,491 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:42:04,491 INFO ]: Abstraction has 315 states and 506 transitions. [2018-06-22 01:42:04,491 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:42:04,491 INFO ]: Start isEmpty. Operand 315 states and 506 transitions. [2018-06-22 01:42:04,521 INFO ]: Finished isEmpty. Found accepting run of length 60 [2018-06-22 01:42:04,521 INFO ]: Found error trace [2018-06-22 01:42:04,521 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:42:04,521 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:42:04,521 INFO ]: Analyzing trace with hash 1899308241, now seen corresponding path program 1 times [2018-06-22 01:42:04,521 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:42:04,521 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:42:04,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:04,522 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:42:04,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:04,554 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:04,627 INFO ]: Checked inductivity of 52 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:42:04,627 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:42:04,627 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:42:04,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:42:04,706 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:04,710 INFO ]: Computing forward predicates... [2018-06-22 01:42:04,717 INFO ]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 01:42:04,748 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:42:04,748 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 01:42:04,749 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:42:04,749 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:42:04,749 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:42:04,749 INFO ]: Start difference. First operand 315 states and 506 transitions. Second operand 4 states. [2018-06-22 01:42:05,770 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:42:05,770 INFO ]: Finished difference Result 424 states and 679 transitions. [2018-06-22 01:42:05,770 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:42:05,770 INFO ]: Start accepts. Automaton has 4 states. Word has length 59 [2018-06-22 01:42:05,770 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:42:05,779 INFO ]: With dead ends: 424 [2018-06-22 01:42:05,779 INFO ]: Without dead ends: 388 [2018-06-22 01:42:05,779 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:42:05,779 INFO ]: Start minimizeSevpa. Operand 388 states. [2018-06-22 01:42:05,804 INFO ]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-06-22 01:42:05,805 INFO ]: Start removeUnreachable. Operand 388 states. [2018-06-22 01:42:05,813 INFO ]: Finished removeUnreachable. Reduced from 388 states to 388 states and 615 transitions. [2018-06-22 01:42:05,813 INFO ]: Start accepts. Automaton has 388 states and 615 transitions. Word has length 59 [2018-06-22 01:42:05,813 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:42:05,813 INFO ]: Abstraction has 388 states and 615 transitions. [2018-06-22 01:42:05,813 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:42:05,813 INFO ]: Start isEmpty. Operand 388 states and 615 transitions. [2018-06-22 01:42:05,824 INFO ]: Finished isEmpty. Found accepting run of length 77 [2018-06-22 01:42:05,824 INFO ]: Found error trace [2018-06-22 01:42:05,824 INFO ]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:42:05,824 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:42:05,825 INFO ]: Analyzing trace with hash -619086673, now seen corresponding path program 2 times [2018-06-22 01:42:05,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:42:05,825 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:42:05,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:05,825 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:42:05,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:05,857 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:06,197 INFO ]: Checked inductivity of 104 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 01:42:06,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:42:06,197 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:42:06,204 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:42:06,279 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:42:06,279 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:06,285 INFO ]: Computing forward predicates... [2018-06-22 01:42:06,393 INFO ]: Checked inductivity of 104 backedges. 39 proven. 17 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-22 01:42:06,415 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:42:06,415 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 15 [2018-06-22 01:42:06,415 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:42:06,415 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:42:06,415 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:42:06,415 INFO ]: Start difference. First operand 388 states and 615 transitions. Second operand 15 states. [2018-06-22 01:42:08,027 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:42:08,042 INFO ]: Finished difference Result 596 states and 1000 transitions. [2018-06-22 01:42:08,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-22 01:42:08,042 INFO ]: Start accepts. Automaton has 15 states. Word has length 76 [2018-06-22 01:42:08,043 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:42:08,058 INFO ]: With dead ends: 596 [2018-06-22 01:42:08,058 INFO ]: Without dead ends: 596 [2018-06-22 01:42:08,059 INFO ]: 0 DeclaredPredicates, 137 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=404, Invalid=2788, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 01:42:08,060 INFO ]: Start minimizeSevpa. Operand 596 states. [2018-06-22 01:42:08,098 INFO ]: Finished minimizeSevpa. Reduced states from 596 to 452. [2018-06-22 01:42:08,098 INFO ]: Start removeUnreachable. Operand 452 states. [2018-06-22 01:42:08,105 INFO ]: Finished removeUnreachable. Reduced from 452 states to 452 states and 740 transitions. [2018-06-22 01:42:08,106 INFO ]: Start accepts. Automaton has 452 states and 740 transitions. Word has length 76 [2018-06-22 01:42:08,106 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:42:08,106 INFO ]: Abstraction has 452 states and 740 transitions. [2018-06-22 01:42:08,106 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:42:08,106 INFO ]: Start isEmpty. Operand 452 states and 740 transitions. [2018-06-22 01:42:08,121 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 01:42:08,122 INFO ]: Found error trace [2018-06-22 01:42:08,122 INFO ]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:42:08,122 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:42:08,122 INFO ]: Analyzing trace with hash 278222087, now seen corresponding path program 2 times [2018-06-22 01:42:08,122 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:42:08,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:42:08,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:08,123 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:42:08,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:08,136 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:08,300 INFO ]: Checked inductivity of 99 backedges. 31 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-06-22 01:42:08,303 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:42:08,303 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:42:08,309 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:42:08,349 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:42:08,349 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:08,355 INFO ]: Computing forward predicates... [2018-06-22 01:42:08,365 INFO ]: Checked inductivity of 99 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:42:08,390 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:42:08,390 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:42:08,390 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:42:08,390 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:42:08,390 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:42:08,390 INFO ]: Start difference. First operand 452 states and 740 transitions. Second operand 4 states. [2018-06-22 01:42:08,530 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:42:08,531 INFO ]: Finished difference Result 490 states and 797 transitions. [2018-06-22 01:42:08,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:42:08,531 INFO ]: Start accepts. Automaton has 4 states. Word has length 77 [2018-06-22 01:42:08,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:42:08,541 INFO ]: With dead ends: 490 [2018-06-22 01:42:08,541 INFO ]: Without dead ends: 409 [2018-06-22 01:42:08,541 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:42:08,541 INFO ]: Start minimizeSevpa. Operand 409 states. [2018-06-22 01:42:08,564 INFO ]: Finished minimizeSevpa. Reduced states from 409 to 409. [2018-06-22 01:42:08,564 INFO ]: Start removeUnreachable. Operand 409 states. [2018-06-22 01:42:08,570 INFO ]: Finished removeUnreachable. Reduced from 409 states to 409 states and 655 transitions. [2018-06-22 01:42:08,570 INFO ]: Start accepts. Automaton has 409 states and 655 transitions. Word has length 77 [2018-06-22 01:42:08,570 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:42:08,570 INFO ]: Abstraction has 409 states and 655 transitions. [2018-06-22 01:42:08,570 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:42:08,570 INFO ]: Start isEmpty. Operand 409 states and 655 transitions. [2018-06-22 01:42:08,580 INFO ]: Finished isEmpty. Found accepting run of length 88 [2018-06-22 01:42:08,580 INFO ]: Found error trace [2018-06-22 01:42:08,580 INFO ]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:42:08,580 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:42:08,580 INFO ]: Analyzing trace with hash 2118049433, now seen corresponding path program 1 times [2018-06-22 01:42:08,580 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:42:08,580 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:42:08,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:08,581 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:42:08,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:08,588 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:08,740 INFO ]: Checked inductivity of 131 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-06-22 01:42:08,741 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:42:08,741 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:42:08,755 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:42:08,812 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:08,817 INFO ]: Computing forward predicates... [2018-06-22 01:42:08,829 INFO ]: Checked inductivity of 131 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-06-22 01:42:08,860 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:42:08,860 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:42:08,860 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:42:08,860 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:42:08,860 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:42:08,861 INFO ]: Start difference. First operand 409 states and 655 transitions. Second operand 4 states. [2018-06-22 01:42:09,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:42:09,131 INFO ]: Finished difference Result 428 states and 684 transitions. [2018-06-22 01:42:09,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:42:09,132 INFO ]: Start accepts. Automaton has 4 states. Word has length 87 [2018-06-22 01:42:09,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:42:09,138 INFO ]: With dead ends: 428 [2018-06-22 01:42:09,138 INFO ]: Without dead ends: 409 [2018-06-22 01:42:09,138 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:42:09,138 INFO ]: Start minimizeSevpa. Operand 409 states. [2018-06-22 01:42:09,156 INFO ]: Finished minimizeSevpa. Reduced states from 409 to 409. [2018-06-22 01:42:09,156 INFO ]: Start removeUnreachable. Operand 409 states. [2018-06-22 01:42:09,162 INFO ]: Finished removeUnreachable. Reduced from 409 states to 409 states and 654 transitions. [2018-06-22 01:42:09,162 INFO ]: Start accepts. Automaton has 409 states and 654 transitions. Word has length 87 [2018-06-22 01:42:09,162 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:42:09,162 INFO ]: Abstraction has 409 states and 654 transitions. [2018-06-22 01:42:09,162 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:42:09,162 INFO ]: Start isEmpty. Operand 409 states and 654 transitions. [2018-06-22 01:42:09,169 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 01:42:09,169 INFO ]: Found error trace [2018-06-22 01:42:09,169 INFO ]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:42:09,169 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:42:09,169 INFO ]: Analyzing trace with hash 1797804379, now seen corresponding path program 1 times [2018-06-22 01:42:09,170 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:42:09,170 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:42:09,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:09,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:42:09,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:09,206 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:09,516 INFO ]: Checked inductivity of 133 backedges. 32 proven. 23 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-22 01:42:09,516 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:42:09,516 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:42:09,527 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:42:09,583 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:09,588 INFO ]: Computing forward predicates... [2018-06-22 01:42:09,831 INFO ]: Checked inductivity of 133 backedges. 74 proven. 10 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 01:42:09,850 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:42:09,850 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2018-06-22 01:42:09,851 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:42:09,851 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:42:09,851 INFO ]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:42:09,851 INFO ]: Start difference. First operand 409 states and 654 transitions. Second operand 21 states. [2018-06-22 01:42:11,769 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-06-22 01:42:20,370 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:42:20,370 INFO ]: Finished difference Result 1658 states and 5684 transitions. [2018-06-22 01:42:20,373 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-22 01:42:20,373 INFO ]: Start accepts. Automaton has 21 states. Word has length 89 [2018-06-22 01:42:20,373 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:42:20,497 INFO ]: With dead ends: 1658 [2018-06-22 01:42:20,497 INFO ]: Without dead ends: 1640 [2018-06-22 01:42:20,499 INFO ]: 0 DeclaredPredicates, 175 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=728, Invalid=4384, Unknown=0, NotChecked=0, Total=5112 [2018-06-22 01:42:20,500 INFO ]: Start minimizeSevpa. Operand 1640 states. [2018-06-22 01:42:20,780 INFO ]: Finished minimizeSevpa. Reduced states from 1640 to 819. [2018-06-22 01:42:20,780 INFO ]: Start removeUnreachable. Operand 819 states. [2018-06-22 01:42:20,801 INFO ]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1772 transitions. [2018-06-22 01:42:20,801 INFO ]: Start accepts. Automaton has 819 states and 1772 transitions. Word has length 89 [2018-06-22 01:42:20,801 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:42:20,801 INFO ]: Abstraction has 819 states and 1772 transitions. [2018-06-22 01:42:20,801 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:42:20,801 INFO ]: Start isEmpty. Operand 819 states and 1772 transitions. [2018-06-22 01:42:20,822 INFO ]: Finished isEmpty. Found accepting run of length 146 [2018-06-22 01:42:20,822 INFO ]: Found error trace [2018-06-22 01:42:20,822 INFO ]: trace histogram [10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:42:20,822 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:42:20,823 INFO ]: Analyzing trace with hash 977877781, now seen corresponding path program 1 times [2018-06-22 01:42:20,823 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:42:20,823 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:42:20,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:20,824 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:42:20,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:20,860 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:21,284 INFO ]: Checked inductivity of 425 backedges. 132 proven. 33 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-06-22 01:42:21,285 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:42:21,285 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:42:21,291 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:42:21,370 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:21,377 INFO ]: Computing forward predicates... [2018-06-22 01:42:21,646 INFO ]: Checked inductivity of 425 backedges. 183 proven. 60 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-06-22 01:42:21,666 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:42:21,666 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2018-06-22 01:42:21,666 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:42:21,667 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:42:21,667 INFO ]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:42:21,667 INFO ]: Start difference. First operand 819 states and 1772 transitions. Second operand 28 states. [2018-06-22 01:42:30,408 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:42:30,408 INFO ]: Finished difference Result 2929 states and 20382 transitions. [2018-06-22 01:42:30,408 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-06-22 01:42:30,408 INFO ]: Start accepts. Automaton has 28 states. Word has length 145 [2018-06-22 01:42:30,409 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:42:30,666 INFO ]: With dead ends: 2929 [2018-06-22 01:42:30,666 INFO ]: Without dead ends: 2715 [2018-06-22 01:42:30,668 INFO ]: 0 DeclaredPredicates, 285 GetRequests, 172 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3663 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1482, Invalid=10950, Unknown=0, NotChecked=0, Total=12432 [2018-06-22 01:42:30,669 INFO ]: Start minimizeSevpa. Operand 2715 states. [2018-06-22 01:42:32,871 INFO ]: Finished minimizeSevpa. Reduced states from 2715 to 1044. [2018-06-22 01:42:32,871 INFO ]: Start removeUnreachable. Operand 1044 states. [2018-06-22 01:42:32,900 INFO ]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 2794 transitions. [2018-06-22 01:42:32,900 INFO ]: Start accepts. Automaton has 1044 states and 2794 transitions. Word has length 145 [2018-06-22 01:42:32,901 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:42:32,901 INFO ]: Abstraction has 1044 states and 2794 transitions. [2018-06-22 01:42:32,901 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:42:32,901 INFO ]: Start isEmpty. Operand 1044 states and 2794 transitions. [2018-06-22 01:42:32,925 INFO ]: Finished isEmpty. Found accepting run of length 164 [2018-06-22 01:42:32,925 INFO ]: Found error trace [2018-06-22 01:42:32,926 INFO ]: trace histogram [11, 11, 11, 9, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:42:32,926 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:42:32,926 INFO ]: Analyzing trace with hash 1135890290, now seen corresponding path program 1 times [2018-06-22 01:42:32,926 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:42:32,926 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:42:32,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:32,927 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:42:32,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:32,959 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:33,134 INFO ]: Checked inductivity of 545 backedges. 158 proven. 26 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-06-22 01:42:33,135 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:42:33,135 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:42:33,144 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:42:33,245 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:33,251 INFO ]: Computing forward predicates... [2018-06-22 01:42:33,279 INFO ]: Checked inductivity of 545 backedges. 260 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-06-22 01:42:33,313 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:42:33,313 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:42:33,313 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:42:33,313 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:42:33,313 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:42:33,313 INFO ]: Start difference. First operand 1044 states and 2794 transitions. Second operand 4 states. [2018-06-22 01:42:34,815 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:42:34,815 INFO ]: Finished difference Result 1176 states and 3246 transitions. [2018-06-22 01:42:34,815 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:42:34,815 INFO ]: Start accepts. Automaton has 4 states. Word has length 163 [2018-06-22 01:42:34,815 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:42:34,842 INFO ]: With dead ends: 1176 [2018-06-22 01:42:34,842 INFO ]: Without dead ends: 1044 [2018-06-22 01:42:34,842 INFO ]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:42:34,843 INFO ]: Start minimizeSevpa. Operand 1044 states. [2018-06-22 01:42:34,947 INFO ]: Finished minimizeSevpa. Reduced states from 1044 to 1044. [2018-06-22 01:42:34,947 INFO ]: Start removeUnreachable. Operand 1044 states. [2018-06-22 01:42:34,981 INFO ]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 2779 transitions. [2018-06-22 01:42:34,981 INFO ]: Start accepts. Automaton has 1044 states and 2779 transitions. Word has length 163 [2018-06-22 01:42:34,981 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:42:34,981 INFO ]: Abstraction has 1044 states and 2779 transitions. [2018-06-22 01:42:34,981 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:42:34,981 INFO ]: Start isEmpty. Operand 1044 states and 2779 transitions. [2018-06-22 01:42:34,996 INFO ]: Finished isEmpty. Found accepting run of length 171 [2018-06-22 01:42:34,996 INFO ]: Found error trace [2018-06-22 01:42:34,996 INFO ]: trace histogram [12, 12, 12, 9, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:42:34,996 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:42:34,996 INFO ]: Analyzing trace with hash 148008909, now seen corresponding path program 2 times [2018-06-22 01:42:34,996 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:42:34,996 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:42:34,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:34,997 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:42:34,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:35,020 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:35,203 INFO ]: Checked inductivity of 600 backedges. 167 proven. 25 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-06-22 01:42:37,095 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:42:37,095 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:42:37,102 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:42:37,207 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:42:37,207 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:37,211 INFO ]: Computing forward predicates... [2018-06-22 01:42:37,234 INFO ]: Checked inductivity of 600 backedges. 273 proven. 9 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-06-22 01:42:37,270 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:42:37,270 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:42:37,270 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:42:37,270 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:42:37,270 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:42:37,270 INFO ]: Start difference. First operand 1044 states and 2779 transitions. Second operand 4 states. [2018-06-22 01:42:37,511 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:42:37,511 INFO ]: Finished difference Result 1102 states and 2883 transitions. [2018-06-22 01:42:37,512 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:42:37,512 INFO ]: Start accepts. Automaton has 4 states. Word has length 170 [2018-06-22 01:42:37,512 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:42:37,530 INFO ]: With dead ends: 1102 [2018-06-22 01:42:37,530 INFO ]: Without dead ends: 924 [2018-06-22 01:42:37,531 INFO ]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:42:37,531 INFO ]: Start minimizeSevpa. Operand 924 states. [2018-06-22 01:42:37,626 INFO ]: Finished minimizeSevpa. Reduced states from 924 to 924. [2018-06-22 01:42:37,626 INFO ]: Start removeUnreachable. Operand 924 states. [2018-06-22 01:42:37,647 INFO ]: Finished removeUnreachable. Reduced from 924 states to 924 states and 2219 transitions. [2018-06-22 01:42:37,647 INFO ]: Start accepts. Automaton has 924 states and 2219 transitions. Word has length 170 [2018-06-22 01:42:37,647 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:42:37,647 INFO ]: Abstraction has 924 states and 2219 transitions. [2018-06-22 01:42:37,647 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:42:37,647 INFO ]: Start isEmpty. Operand 924 states and 2219 transitions. [2018-06-22 01:42:37,657 INFO ]: Finished isEmpty. Found accepting run of length 215 [2018-06-22 01:42:37,657 INFO ]: Found error trace [2018-06-22 01:42:37,657 INFO ]: trace histogram [15, 15, 15, 11, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:42:37,658 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:42:37,658 INFO ]: Analyzing trace with hash 225803043, now seen corresponding path program 3 times [2018-06-22 01:42:37,658 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:42:37,658 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:42:37,658 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:37,658 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:42:37,658 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:37,716 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:38,013 INFO ]: Checked inductivity of 975 backedges. 241 proven. 108 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2018-06-22 01:42:38,013 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:42:38,013 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:42:38,020 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:42:38,234 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 01:42:38,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:38,243 INFO ]: Computing forward predicates... [2018-06-22 01:42:38,559 INFO ]: Checked inductivity of 975 backedges. 290 proven. 47 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2018-06-22 01:42:38,582 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:42:38,582 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 25 [2018-06-22 01:42:38,583 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:42:38,583 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:42:38,583 INFO ]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:42:38,583 INFO ]: Start difference. First operand 924 states and 2219 transitions. Second operand 25 states. [2018-06-22 01:42:39,517 WARN ]: Spent 202.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-06-22 01:42:43,897 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 01:42:44,800 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:42:44,800 INFO ]: Finished difference Result 2975 states and 10530 transitions. [2018-06-22 01:42:44,800 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-06-22 01:42:44,800 INFO ]: Start accepts. Automaton has 25 states. Word has length 214 [2018-06-22 01:42:44,801 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:42:45,022 INFO ]: With dead ends: 2975 [2018-06-22 01:42:45,022 INFO ]: Without dead ends: 2975 [2018-06-22 01:42:45,028 INFO ]: 0 DeclaredPredicates, 315 GetRequests, 210 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3093 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1105, Invalid=8995, Unknown=0, NotChecked=0, Total=10100 [2018-06-22 01:42:45,029 INFO ]: Start minimizeSevpa. Operand 2975 states. [2018-06-22 01:42:45,586 INFO ]: Finished minimizeSevpa. Reduced states from 2975 to 1100. [2018-06-22 01:42:45,586 INFO ]: Start removeUnreachable. Operand 1100 states. [2018-06-22 01:42:45,610 INFO ]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 2875 transitions. [2018-06-22 01:42:45,610 INFO ]: Start accepts. Automaton has 1100 states and 2875 transitions. Word has length 214 [2018-06-22 01:42:45,611 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:42:45,611 INFO ]: Abstraction has 1100 states and 2875 transitions. [2018-06-22 01:42:45,611 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:42:45,611 INFO ]: Start isEmpty. Operand 1100 states and 2875 transitions. [2018-06-22 01:42:45,617 INFO ]: Finished isEmpty. Found accepting run of length 133 [2018-06-22 01:42:45,617 INFO ]: Found error trace [2018-06-22 01:42:45,617 INFO ]: trace histogram [9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:42:45,617 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:42:45,618 INFO ]: Analyzing trace with hash 1328755151, now seen corresponding path program 3 times [2018-06-22 01:42:45,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:42:45,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:42:45,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:45,618 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:42:45,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:45,669 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:46,566 INFO ]: Checked inductivity of 384 backedges. 107 proven. 59 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-06-22 01:42:46,566 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:42:46,566 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:42:46,572 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:42:46,646 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:42:46,646 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:46,650 INFO ]: Computing forward predicates... [2018-06-22 01:42:46,987 INFO ]: Checked inductivity of 384 backedges. 105 proven. 28 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2018-06-22 01:42:47,008 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:42:47,008 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 20 [2018-06-22 01:42:47,008 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:42:47,008 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:42:47,008 INFO ]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:42:47,008 INFO ]: Start difference. First operand 1100 states and 2875 transitions. Second operand 20 states. [2018-06-22 01:42:48,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:42:48,390 INFO ]: Finished difference Result 1562 states and 3802 transitions. [2018-06-22 01:42:48,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:42:48,391 INFO ]: Start accepts. Automaton has 20 states. Word has length 132 [2018-06-22 01:42:48,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:42:48,422 INFO ]: With dead ends: 1562 [2018-06-22 01:42:48,422 INFO ]: Without dead ends: 1221 [2018-06-22 01:42:48,423 INFO ]: 0 DeclaredPredicates, 179 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=468, Invalid=2082, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 01:42:48,424 INFO ]: Start minimizeSevpa. Operand 1221 states. [2018-06-22 01:42:48,608 INFO ]: Finished minimizeSevpa. Reduced states from 1221 to 1067. [2018-06-22 01:42:48,608 INFO ]: Start removeUnreachable. Operand 1067 states. [2018-06-22 01:42:48,637 INFO ]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 2798 transitions. [2018-06-22 01:42:48,637 INFO ]: Start accepts. Automaton has 1067 states and 2798 transitions. Word has length 132 [2018-06-22 01:42:48,637 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:42:48,637 INFO ]: Abstraction has 1067 states and 2798 transitions. [2018-06-22 01:42:48,637 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:42:48,637 INFO ]: Start isEmpty. Operand 1067 states and 2798 transitions. [2018-06-22 01:42:48,650 INFO ]: Finished isEmpty. Found accepting run of length 202 [2018-06-22 01:42:48,650 INFO ]: Found error trace [2018-06-22 01:42:48,650 INFO ]: trace histogram [14, 14, 14, 12, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:42:48,651 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:42:48,651 INFO ]: Analyzing trace with hash 302062901, now seen corresponding path program 4 times [2018-06-22 01:42:48,651 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:42:48,651 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:42:48,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:48,653 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:42:48,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:42:48,713 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:48,908 INFO ]: Checked inductivity of 893 backedges. 68 proven. 119 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2018-06-22 01:42:48,908 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:42:48,908 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:42:48,916 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:42:49,023 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:42:49,023 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:42:49,031 INFO ]: Computing forward predicates... [2018-06-22 01:42:49,634 INFO ]: Checked inductivity of 893 backedges. 257 proven. 82 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2018-06-22 01:42:49,654 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:42:49,654 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 21] total 27 [2018-06-22 01:42:49,654 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:42:49,654 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:42:49,654 INFO ]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:42:49,655 INFO ]: Start difference. First operand 1067 states and 2798 transitions. Second operand 27 states. Received shutdown request... [2018-06-22 01:42:52,941 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-06-22 01:42:52,941 WARN ]: Verification canceled [2018-06-22 01:42:53,157 WARN ]: Timeout [2018-06-22 01:42:53,157 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:42:53 BoogieIcfgContainer [2018-06-22 01:42:53,157 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:42:53,158 INFO ]: Toolchain (without parser) took 58674.74 ms. Allocated memory was 304.1 MB in the beginning and 1.2 GB in the end (delta: 877.1 MB). Free memory was 252.5 MB in the beginning and 1.1 GB in the end (delta: -878.4 MB). Peak memory consumption was 272.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:42:53,159 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:42:53,159 INFO ]: ChcToBoogie took 73.75 ms. Allocated memory is still 304.1 MB. Free memory was 252.5 MB in the beginning and 249.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:42:53,159 INFO ]: Boogie Preprocessor took 67.65 ms. Allocated memory is still 304.1 MB. Free memory was 249.5 MB in the beginning and 247.5 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:42:53,160 INFO ]: RCFGBuilder took 785.62 ms. Allocated memory is still 304.1 MB. Free memory was 247.5 MB in the beginning and 221.4 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:42:53,162 INFO ]: TraceAbstraction took 57737.00 ms. Allocated memory was 304.1 MB in the beginning and 1.2 GB in the end (delta: 877.1 MB). Free memory was 221.4 MB in the beginning and 1.1 GB in the end (delta: -909.4 MB). Peak memory consumption was 241.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:42:53,165 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 73.75 ms. Allocated memory is still 304.1 MB. Free memory was 252.5 MB in the beginning and 249.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 67.65 ms. Allocated memory is still 304.1 MB. Free memory was 249.5 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 785.62 ms. Allocated memory is still 304.1 MB. Free memory was 247.5 MB in the beginning and 221.4 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57737.00 ms. Allocated memory was 304.1 MB in the beginning and 1.2 GB in the end (delta: 877.1 MB). Free memory was 221.4 MB in the beginning and 1.1 GB in the end (delta: -909.4 MB). Peak memory consumption was 241.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (1067states) and interpolant automaton (currently 62 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (548 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. TIMEOUT Result, 57.6s OverallTime, 17 OverallIterations, 15 TraceHistogramMax, 41.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2554 SDtfs, 3182 SDslu, 14651 SDs, 0 SdLazy, 32990 SolverSat, 4193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2140 GetRequests, 1617 SyntacticMatches, 11 SemanticMatches, 512 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10857 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1100occurred in iteration=15, 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: 4.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 4836 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 3171 NumberOfCodeBlocks, 3103 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3140 ConstructedInterpolants, 0 QuantifiedInterpolants, 602127 SizeOfPredicates, 109 NumberOfNonLiveVariables, 6233 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 31 InterpolantComputations, 4 PerfectInterpolantSequences, 8128/8920 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dotprod5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-42-53-178.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dotprod5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-42-53-178.csv Completed graceful shutdown