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/HOLA/31.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:02:35,766 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:02:35,768 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:02:35,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:02:35,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:02:35,788 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:02:35,789 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:02:35,792 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:02:35,793 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:02:35,794 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:02:35,796 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:02:35,796 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:02:35,797 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:02:35,798 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:02:35,799 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:02:35,799 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:02:35,803 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:02:35,805 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:02:35,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:02:35,820 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:02:35,821 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:02:35,823 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:02:35,823 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:02:35,823 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:02:35,824 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:02:35,825 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:02:35,825 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:02:35,826 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:02:35,832 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:02:35,832 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:02:35,833 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:02:35,833 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:02:35,833 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:02:35,834 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:02:35,835 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:02:35,835 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:02:35,855 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:02:35,855 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:02:35,855 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:02:35,855 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:02:35,858 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:02:35,858 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:02:35,858 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:02:35,858 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:02:35,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:02:35,859 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:02:35,859 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:02:35,859 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:02:35,859 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:02:35,860 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:02:35,860 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:02:35,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:02:35,860 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:02:35,864 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:02:35,864 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:02:35,912 INFO ]: Repository-Root is: /tmp [2018-06-22 01:02:35,928 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:02:35,933 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:02:35,935 INFO ]: Initializing SmtParser... [2018-06-22 01:02:35,935 INFO ]: SmtParser initialized [2018-06-22 01:02:35,936 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/31.c.smt2 [2018-06-22 01:02:35,937 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:02:36,018 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/31.c.smt2 unknown [2018-06-22 01:02:36,890 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/31.c.smt2 [2018-06-22 01:02:36,895 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:02:36,901 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:02:36,901 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:02:36,901 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:02:36,902 INFO ]: ChcToBoogie initialized [2018-06-22 01:02:36,905 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:02:36" (1/1) ... [2018-06-22 01:02:36,995 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:36 Unit [2018-06-22 01:02:36,995 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:02:36,996 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:02:36,996 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:02:36,996 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:02:37,017 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:36" (1/1) ... [2018-06-22 01:02:37,017 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:36" (1/1) ... [2018-06-22 01:02:37,031 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:36" (1/1) ... [2018-06-22 01:02:37,031 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:36" (1/1) ... [2018-06-22 01:02:37,039 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:36" (1/1) ... [2018-06-22 01:02:37,041 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:36" (1/1) ... [2018-06-22 01:02:37,044 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:36" (1/1) ... [2018-06-22 01:02:37,049 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:02:37,049 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:02:37,049 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:02:37,049 INFO ]: RCFGBuilder initialized [2018-06-22 01:02:37,050 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:36" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:02:37,078 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:02:37,079 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:02:37,079 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:02:37,079 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:02:37,079 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:02:37,079 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:02:37,993 INFO ]: Using library mode [2018-06-22 01:02:37,994 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:02:37 BoogieIcfgContainer [2018-06-22 01:02:37,994 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:02:37,995 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:02:37,995 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:02:38,002 INFO ]: TraceAbstraction initialized [2018-06-22 01:02:38,002 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:02:36" (1/3) ... [2018-06-22 01:02:38,003 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea7d5cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:02:38, skipping insertion in model container [2018-06-22 01:02:38,003 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:36" (2/3) ... [2018-06-22 01:02:38,003 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea7d5cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:02:38, skipping insertion in model container [2018-06-22 01:02:38,003 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:02:37" (3/3) ... [2018-06-22 01:02:38,005 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:02:38,014 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:02:38,024 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:02:38,079 INFO ]: Using default assertion order modulation [2018-06-22 01:02:38,079 INFO ]: Interprodecural is true [2018-06-22 01:02:38,079 INFO ]: Hoare is false [2018-06-22 01:02:38,079 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:02:38,079 INFO ]: Backedges is TWOTRACK [2018-06-22 01:02:38,079 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:02:38,079 INFO ]: Difference is false [2018-06-22 01:02:38,079 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:02:38,080 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:02:38,097 INFO ]: Start isEmpty. Operand 51 states. [2018-06-22 01:02:38,112 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:02:38,113 INFO ]: Found error trace [2018-06-22 01:02:38,113 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:02:38,114 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:02:38,119 INFO ]: Analyzing trace with hash -633447494, now seen corresponding path program 1 times [2018-06-22 01:02:38,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:02:38,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:02:38,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:38,170 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:38,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:38,319 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:38,899 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:02:38,901 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:02:38,902 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 01:02:38,904 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:02:38,915 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:02:38,916 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:02:38,918 INFO ]: Start difference. First operand 51 states. Second operand 19 states. [2018-06-22 01:02:39,169 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:02:40,512 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 01:02:41,375 WARN ]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-22 01:02:42,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:02:42,877 INFO ]: Finished difference Result 387 states and 430 transitions. [2018-06-22 01:02:42,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-06-22 01:02:42,879 INFO ]: Start accepts. Automaton has 19 states. Word has length 27 [2018-06-22 01:02:42,879 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:02:42,901 INFO ]: With dead ends: 387 [2018-06-22 01:02:42,901 INFO ]: Without dead ends: 384 [2018-06-22 01:02:42,906 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3200 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1900, Invalid=7220, Unknown=0, NotChecked=0, Total=9120 [2018-06-22 01:02:42,933 INFO ]: Start minimizeSevpa. Operand 384 states. [2018-06-22 01:02:42,981 INFO ]: Finished minimizeSevpa. Reduced states from 384 to 63. [2018-06-22 01:02:42,983 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 01:02:42,988 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-06-22 01:02:42,989 INFO ]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 27 [2018-06-22 01:02:42,990 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:02:42,990 INFO ]: Abstraction has 63 states and 71 transitions. [2018-06-22 01:02:42,990 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:02:42,990 INFO ]: Start isEmpty. Operand 63 states and 71 transitions. [2018-06-22 01:02:42,993 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:02:42,993 INFO ]: Found error trace [2018-06-22 01:02:42,993 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:02:42,993 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:02:42,993 INFO ]: Analyzing trace with hash 1076552897, now seen corresponding path program 1 times [2018-06-22 01:02:42,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:02:42,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:02:42,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:42,994 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:42,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:43,050 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:43,272 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:02:43,272 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:02:43,272 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 01:02:43,274 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:02:43,274 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:02:43,274 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:02:43,274 INFO ]: Start difference. First operand 63 states and 71 transitions. Second operand 19 states. [2018-06-22 01:02:45,450 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:02:45,450 INFO ]: Finished difference Result 399 states and 444 transitions. [2018-06-22 01:02:45,450 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-06-22 01:02:45,450 INFO ]: Start accepts. Automaton has 19 states. Word has length 27 [2018-06-22 01:02:45,450 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:02:45,453 INFO ]: With dead ends: 399 [2018-06-22 01:02:45,453 INFO ]: Without dead ends: 396 [2018-06-22 01:02:45,456 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3173 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1900, Invalid=7220, Unknown=0, NotChecked=0, Total=9120 [2018-06-22 01:02:45,457 INFO ]: Start minimizeSevpa. Operand 396 states. [2018-06-22 01:02:45,465 INFO ]: Finished minimizeSevpa. Reduced states from 396 to 64. [2018-06-22 01:02:45,465 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 01:02:45,466 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-06-22 01:02:45,466 INFO ]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 27 [2018-06-22 01:02:45,466 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:02:45,466 INFO ]: Abstraction has 64 states and 72 transitions. [2018-06-22 01:02:45,466 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:02:45,466 INFO ]: Start isEmpty. Operand 64 states and 72 transitions. [2018-06-22 01:02:45,467 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:02:45,467 INFO ]: Found error trace [2018-06-22 01:02:45,467 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:02:45,467 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:02:45,467 INFO ]: Analyzing trace with hash -1213418823, now seen corresponding path program 1 times [2018-06-22 01:02:45,467 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:02:45,467 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:02:45,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:45,468 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:45,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:45,504 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:45,897 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:02:45,898 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:02:45,898 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 01:02:45,898 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:02:45,898 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:02:45,898 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:02:45,898 INFO ]: Start difference. First operand 64 states and 72 transitions. Second operand 19 states. [2018-06-22 01:02:46,481 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-06-22 01:02:49,195 WARN ]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 01:02:50,355 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:02:50,355 INFO ]: Finished difference Result 286 states and 320 transitions. [2018-06-22 01:02:50,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-06-22 01:02:50,355 INFO ]: Start accepts. Automaton has 19 states. Word has length 27 [2018-06-22 01:02:50,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:02:50,356 INFO ]: With dead ends: 286 [2018-06-22 01:02:50,356 INFO ]: Without dead ends: 283 [2018-06-22 01:02:50,357 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1940 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1414, Invalid=4906, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 01:02:50,357 INFO ]: Start minimizeSevpa. Operand 283 states. [2018-06-22 01:02:50,364 INFO ]: Finished minimizeSevpa. Reduced states from 283 to 66. [2018-06-22 01:02:50,364 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 01:02:50,364 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-06-22 01:02:50,364 INFO ]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 27 [2018-06-22 01:02:50,364 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:02:50,364 INFO ]: Abstraction has 66 states and 74 transitions. [2018-06-22 01:02:50,364 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:02:50,364 INFO ]: Start isEmpty. Operand 66 states and 74 transitions. [2018-06-22 01:02:50,365 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:02:50,365 INFO ]: Found error trace [2018-06-22 01:02:50,366 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:02:50,366 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:02:50,366 INFO ]: Analyzing trace with hash 1319359790, now seen corresponding path program 1 times [2018-06-22 01:02:50,366 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:02:50,366 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:02:50,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:50,368 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:50,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:50,392 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:50,875 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:02:50,876 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:02:50,876 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:02:50,876 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:02:50,876 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:02:50,876 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:02:50,876 INFO ]: Start difference. First operand 66 states and 74 transitions. Second operand 12 states. [2018-06-22 01:02:51,166 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:02:51,166 INFO ]: Finished difference Result 170 states and 189 transitions. [2018-06-22 01:02:51,166 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:02:51,166 INFO ]: Start accepts. Automaton has 12 states. Word has length 37 [2018-06-22 01:02:51,166 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:02:51,167 INFO ]: With dead ends: 170 [2018-06-22 01:02:51,167 INFO ]: Without dead ends: 166 [2018-06-22 01:02:51,168 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:02:51,168 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-22 01:02:51,173 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 78. [2018-06-22 01:02:51,173 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 01:02:51,174 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-06-22 01:02:51,174 INFO ]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 37 [2018-06-22 01:02:51,174 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:02:51,174 INFO ]: Abstraction has 78 states and 88 transitions. [2018-06-22 01:02:51,174 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:02:51,174 INFO ]: Start isEmpty. Operand 78 states and 88 transitions. [2018-06-22 01:02:51,175 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:02:51,175 INFO ]: Found error trace [2018-06-22 01:02:51,175 INFO ]: trace histogram [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, 1, 1, 1] [2018-06-22 01:02:51,175 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:02:51,175 INFO ]: Analyzing trace with hash -563299987, now seen corresponding path program 1 times [2018-06-22 01:02:51,175 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:02:51,175 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:02:51,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:51,178 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:51,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:51,202 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:51,365 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:02:51,365 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:02:51,365 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:02:51,366 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:02:51,366 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:02:51,366 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:02:51,366 INFO ]: Start difference. First operand 78 states and 88 transitions. Second operand 12 states. [2018-06-22 01:02:51,819 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:02:51,819 INFO ]: Finished difference Result 197 states and 219 transitions. [2018-06-22 01:02:51,819 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:02:51,819 INFO ]: Start accepts. Automaton has 12 states. Word has length 37 [2018-06-22 01:02:51,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:02:51,820 INFO ]: With dead ends: 197 [2018-06-22 01:02:51,820 INFO ]: Without dead ends: 195 [2018-06-22 01:02:51,820 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=804, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:02:51,820 INFO ]: Start minimizeSevpa. Operand 195 states. [2018-06-22 01:02:51,824 INFO ]: Finished minimizeSevpa. Reduced states from 195 to 72. [2018-06-22 01:02:51,824 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 01:02:51,824 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-06-22 01:02:51,824 INFO ]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 37 [2018-06-22 01:02:51,824 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:02:51,825 INFO ]: Abstraction has 72 states and 80 transitions. [2018-06-22 01:02:51,825 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:02:51,825 INFO ]: Start isEmpty. Operand 72 states and 80 transitions. [2018-06-22 01:02:51,826 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:02:51,826 INFO ]: Found error trace [2018-06-22 01:02:51,826 INFO ]: trace histogram [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, 1, 1, 1, 1, 1] [2018-06-22 01:02:51,826 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:02:51,826 INFO ]: Analyzing trace with hash -1999819354, now seen corresponding path program 1 times [2018-06-22 01:02:51,826 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:02:51,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:02:51,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:51,827 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:51,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:51,852 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:53,023 INFO ]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:02:53,023 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:02:53,023 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:02:53,042 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:53,182 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:53,196 INFO ]: Computing forward predicates... [2018-06-22 01:02:54,630 INFO ]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:02:54,651 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:02:54,656 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 19] total 48 [2018-06-22 01:02:54,656 INFO ]: Interpolant automaton has 48 states [2018-06-22 01:02:54,656 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 01:02:54,657 INFO ]: CoverageRelationStatistics Valid=106, Invalid=2150, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:02:54,657 INFO ]: Start difference. First operand 72 states and 80 transitions. Second operand 48 states. [2018-06-22 01:02:56,843 WARN ]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-06-22 01:03:02,098 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-06-22 01:03:03,154 WARN ]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-06-22 01:03:05,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:05,482 INFO ]: Finished difference Result 597 states and 657 transitions. [2018-06-22 01:03:05,501 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-06-22 01:03:05,501 INFO ]: Start accepts. Automaton has 48 states. Word has length 39 [2018-06-22 01:03:05,501 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:05,504 INFO ]: With dead ends: 597 [2018-06-22 01:03:05,504 INFO ]: Without dead ends: 582 [2018-06-22 01:03:05,510 INFO ]: 0 DeclaredPredicates, 223 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9644 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=4974, Invalid=30558, Unknown=0, NotChecked=0, Total=35532 [2018-06-22 01:03:05,511 INFO ]: Start minimizeSevpa. Operand 582 states. [2018-06-22 01:03:05,519 INFO ]: Finished minimizeSevpa. Reduced states from 582 to 74. [2018-06-22 01:03:05,519 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 01:03:05,520 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-06-22 01:03:05,520 INFO ]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 39 [2018-06-22 01:03:05,520 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:05,520 INFO ]: Abstraction has 74 states and 83 transitions. [2018-06-22 01:03:05,520 INFO ]: Interpolant automaton has 48 states. [2018-06-22 01:03:05,520 INFO ]: Start isEmpty. Operand 74 states and 83 transitions. [2018-06-22 01:03:05,521 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:03:05,521 INFO ]: Found error trace [2018-06-22 01:03:05,521 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:05,521 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:05,522 INFO ]: Analyzing trace with hash 1076721171, now seen corresponding path program 1 times [2018-06-22 01:03:05,522 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:05,522 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:05,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:05,522 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:05,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:05,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:05,856 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:05,856 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:05,856 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 01:03:05,856 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:03:05,857 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:03:05,857 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:03:05,857 INFO ]: Start difference. First operand 74 states and 83 transitions. Second operand 19 states. [2018-06-22 01:03:06,762 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:06,762 INFO ]: Finished difference Result 361 states and 404 transitions. [2018-06-22 01:03:06,762 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-22 01:03:06,762 INFO ]: Start accepts. Automaton has 19 states. Word has length 44 [2018-06-22 01:03:06,762 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:06,765 INFO ]: With dead ends: 361 [2018-06-22 01:03:06,765 INFO ]: Without dead ends: 357 [2018-06-22 01:03:06,765 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1008, Invalid=3024, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:03:06,766 INFO ]: Start minimizeSevpa. Operand 357 states. [2018-06-22 01:03:06,777 INFO ]: Finished minimizeSevpa. Reduced states from 357 to 85. [2018-06-22 01:03:06,777 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-22 01:03:06,777 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-06-22 01:03:06,777 INFO ]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 44 [2018-06-22 01:03:06,777 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:06,777 INFO ]: Abstraction has 85 states and 95 transitions. [2018-06-22 01:03:06,777 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:03:06,777 INFO ]: Start isEmpty. Operand 85 states and 95 transitions. [2018-06-22 01:03:06,779 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:03:06,779 INFO ]: Found error trace [2018-06-22 01:03:06,779 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:06,779 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:06,779 INFO ]: Analyzing trace with hash 1640053740, now seen corresponding path program 1 times [2018-06-22 01:03:06,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:06,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:06,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:06,779 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:06,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:06,802 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:07,111 INFO ]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:07,111 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:07,111 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 01:03:07,112 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:03:07,112 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:03:07,112 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:03:07,112 INFO ]: Start difference. First operand 85 states and 95 transitions. Second operand 19 states. [2018-06-22 01:03:08,581 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:08,582 INFO ]: Finished difference Result 358 states and 396 transitions. [2018-06-22 01:03:08,582 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-06-22 01:03:08,582 INFO ]: Start accepts. Automaton has 19 states. Word has length 44 [2018-06-22 01:03:08,582 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:08,583 INFO ]: With dead ends: 358 [2018-06-22 01:03:08,583 INFO ]: Without dead ends: 357 [2018-06-22 01:03:08,583 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1949 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1626, Invalid=5016, Unknown=0, NotChecked=0, Total=6642 [2018-06-22 01:03:08,584 INFO ]: Start minimizeSevpa. Operand 357 states. [2018-06-22 01:03:08,592 INFO ]: Finished minimizeSevpa. Reduced states from 357 to 107. [2018-06-22 01:03:08,592 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 01:03:08,593 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2018-06-22 01:03:08,593 INFO ]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 44 [2018-06-22 01:03:08,593 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:08,593 INFO ]: Abstraction has 107 states and 120 transitions. [2018-06-22 01:03:08,593 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:03:08,593 INFO ]: Start isEmpty. Operand 107 states and 120 transitions. [2018-06-22 01:03:08,594 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:03:08,594 INFO ]: Found error trace [2018-06-22 01:03:08,594 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:08,594 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:08,594 INFO ]: Analyzing trace with hash -944913165, now seen corresponding path program 1 times [2018-06-22 01:03:08,594 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:08,594 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:08,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:08,595 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:08,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:08,617 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:08,894 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:08,894 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:08,894 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 01:03:08,894 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:03:08,894 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:03:08,894 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:03:08,895 INFO ]: Start difference. First operand 107 states and 120 transitions. Second operand 19 states. [2018-06-22 01:03:09,774 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:09,774 INFO ]: Finished difference Result 384 states and 429 transitions. [2018-06-22 01:03:09,775 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-22 01:03:09,775 INFO ]: Start accepts. Automaton has 19 states. Word has length 44 [2018-06-22 01:03:09,775 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:09,776 INFO ]: With dead ends: 384 [2018-06-22 01:03:09,777 INFO ]: Without dead ends: 380 [2018-06-22 01:03:09,777 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1008, Invalid=3024, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:03:09,777 INFO ]: Start minimizeSevpa. Operand 380 states. [2018-06-22 01:03:09,787 INFO ]: Finished minimizeSevpa. Reduced states from 380 to 101. [2018-06-22 01:03:09,787 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-22 01:03:09,788 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-06-22 01:03:09,788 INFO ]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 44 [2018-06-22 01:03:09,788 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:09,788 INFO ]: Abstraction has 101 states and 113 transitions. [2018-06-22 01:03:09,788 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:03:09,788 INFO ]: Start isEmpty. Operand 101 states and 113 transitions. [2018-06-22 01:03:09,795 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:03:09,795 INFO ]: Found error trace [2018-06-22 01:03:09,795 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:09,795 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:09,795 INFO ]: Analyzing trace with hash -70902540, now seen corresponding path program 1 times [2018-06-22 01:03:09,795 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:09,795 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:09,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:09,796 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:09,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:09,813 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:09,990 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:09,990 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:09,990 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 01:03:09,990 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:03:09,990 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:03:09,990 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:03:09,990 INFO ]: Start difference. First operand 101 states and 113 transitions. Second operand 19 states. [2018-06-22 01:03:11,443 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:11,443 INFO ]: Finished difference Result 400 states and 439 transitions. [2018-06-22 01:03:11,443 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-06-22 01:03:11,443 INFO ]: Start accepts. Automaton has 19 states. Word has length 44 [2018-06-22 01:03:11,443 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:11,445 INFO ]: With dead ends: 400 [2018-06-22 01:03:11,445 INFO ]: Without dead ends: 399 [2018-06-22 01:03:11,446 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2388 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1885, Invalid=5947, Unknown=0, NotChecked=0, Total=7832 [2018-06-22 01:03:11,446 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-22 01:03:11,453 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 101. [2018-06-22 01:03:11,453 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-22 01:03:11,454 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-06-22 01:03:11,454 INFO ]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 44 [2018-06-22 01:03:11,454 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:11,454 INFO ]: Abstraction has 101 states and 113 transitions. [2018-06-22 01:03:11,454 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:03:11,454 INFO ]: Start isEmpty. Operand 101 states and 113 transitions. [2018-06-22 01:03:11,455 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:03:11,455 INFO ]: Found error trace [2018-06-22 01:03:11,455 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:11,455 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:11,455 INFO ]: Analyzing trace with hash 1639097851, now seen corresponding path program 1 times [2018-06-22 01:03:11,455 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:11,455 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:11,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:11,457 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:11,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:11,472 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:12,302 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:12,302 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:12,302 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 01:03:12,302 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:03:12,302 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:03:12,302 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:03:12,302 INFO ]: Start difference. First operand 101 states and 113 transitions. Second operand 19 states. [2018-06-22 01:03:13,253 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 01:03:14,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:14,036 INFO ]: Finished difference Result 274 states and 300 transitions. [2018-06-22 01:03:14,037 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 01:03:14,037 INFO ]: Start accepts. Automaton has 19 states. Word has length 44 [2018-06-22 01:03:14,037 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:14,038 INFO ]: With dead ends: 274 [2018-06-22 01:03:14,038 INFO ]: Without dead ends: 268 [2018-06-22 01:03:14,039 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=784, Invalid=2078, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:03:14,039 INFO ]: Start minimizeSevpa. Operand 268 states. [2018-06-22 01:03:14,042 INFO ]: Finished minimizeSevpa. Reduced states from 268 to 95. [2018-06-22 01:03:14,042 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-22 01:03:14,043 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2018-06-22 01:03:14,043 INFO ]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 44 [2018-06-22 01:03:14,043 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:14,043 INFO ]: Abstraction has 95 states and 106 transitions. [2018-06-22 01:03:14,043 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:03:14,043 INFO ]: Start isEmpty. Operand 95 states and 106 transitions. [2018-06-22 01:03:14,043 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 01:03:14,043 INFO ]: Found error trace [2018-06-22 01:03:14,044 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:14,044 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:14,053 INFO ]: Analyzing trace with hash 1609243851, now seen corresponding path program 1 times [2018-06-22 01:03:14,053 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:14,053 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:14,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:14,053 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:14,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:14,079 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:14,478 INFO ]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:14,479 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:03:14,479 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:03:14,484 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:14,646 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:14,655 INFO ]: Computing forward predicates... [2018-06-22 01:03:14,764 INFO ]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:14,789 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:03:14,789 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 28 [2018-06-22 01:03:14,789 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:03:14,789 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:03:14,790 INFO ]: CoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:03:14,790 INFO ]: Start difference. First operand 95 states and 106 transitions. Second operand 28 states. [2018-06-22 01:03:15,581 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:15,581 INFO ]: Finished difference Result 323 states and 357 transitions. [2018-06-22 01:03:15,581 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:03:15,581 INFO ]: Start accepts. Automaton has 28 states. Word has length 48 [2018-06-22 01:03:15,582 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:15,583 INFO ]: With dead ends: 323 [2018-06-22 01:03:15,583 INFO ]: Without dead ends: 308 [2018-06-22 01:03:15,583 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=770, Invalid=2536, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 01:03:15,583 INFO ]: Start minimizeSevpa. Operand 308 states. [2018-06-22 01:03:15,589 INFO ]: Finished minimizeSevpa. Reduced states from 308 to 101. [2018-06-22 01:03:15,590 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-22 01:03:15,590 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2018-06-22 01:03:15,590 INFO ]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 48 [2018-06-22 01:03:15,590 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:15,590 INFO ]: Abstraction has 101 states and 112 transitions. [2018-06-22 01:03:15,590 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:03:15,591 INFO ]: Start isEmpty. Operand 101 states and 112 transitions. [2018-06-22 01:03:15,591 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 01:03:15,591 INFO ]: Found error trace [2018-06-22 01:03:15,591 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:15,591 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:15,591 INFO ]: Analyzing trace with hash 1678134820, now seen corresponding path program 1 times [2018-06-22 01:03:15,591 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:15,591 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:15,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:15,592 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:15,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:15,613 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:15,957 INFO ]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:03:15,957 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:15,979 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 01:03:15,979 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:03:15,979 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:03:15,979 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:03:15,979 INFO ]: Start difference. First operand 101 states and 112 transitions. Second operand 21 states. [2018-06-22 01:03:18,823 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:18,823 INFO ]: Finished difference Result 501 states and 552 transitions. [2018-06-22 01:03:18,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-06-22 01:03:18,823 INFO ]: Start accepts. Automaton has 21 states. Word has length 48 [2018-06-22 01:03:18,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:18,825 INFO ]: With dead ends: 501 [2018-06-22 01:03:18,825 INFO ]: Without dead ends: 500 [2018-06-22 01:03:18,827 INFO ]: 0 DeclaredPredicates, 120 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4044 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2702, Invalid=9954, Unknown=0, NotChecked=0, Total=12656 [2018-06-22 01:03:18,829 INFO ]: Start minimizeSevpa. Operand 500 states. [2018-06-22 01:03:18,834 INFO ]: Finished minimizeSevpa. Reduced states from 500 to 114. [2018-06-22 01:03:18,834 INFO ]: Start removeUnreachable. Operand 114 states. [2018-06-22 01:03:18,835 INFO ]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2018-06-22 01:03:18,835 INFO ]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 48 [2018-06-22 01:03:18,835 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:18,835 INFO ]: Abstraction has 114 states and 126 transitions. [2018-06-22 01:03:18,835 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:03:18,835 INFO ]: Start isEmpty. Operand 114 states and 126 transitions. [2018-06-22 01:03:18,836 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 01:03:18,836 INFO ]: Found error trace [2018-06-22 01:03:18,836 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:18,836 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:18,836 INFO ]: Analyzing trace with hash -906832085, now seen corresponding path program 1 times [2018-06-22 01:03:18,836 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:18,836 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:18,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:18,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:18,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:18,859 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:19,251 INFO ]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:19,251 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:03:19,251 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:03:19,257 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:19,374 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:19,381 INFO ]: Computing forward predicates... [2018-06-22 01:03:19,489 INFO ]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:19,510 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:03:19,510 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 28 [2018-06-22 01:03:19,510 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:03:19,510 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:03:19,510 INFO ]: CoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:03:19,510 INFO ]: Start difference. First operand 114 states and 126 transitions. Second operand 28 states. [2018-06-22 01:03:20,332 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:20,333 INFO ]: Finished difference Result 315 states and 347 transitions. [2018-06-22 01:03:20,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:03:20,333 INFO ]: Start accepts. Automaton has 28 states. Word has length 48 [2018-06-22 01:03:20,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:20,333 INFO ]: With dead ends: 315 [2018-06-22 01:03:20,333 INFO ]: Without dead ends: 300 [2018-06-22 01:03:20,334 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=770, Invalid=2536, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 01:03:20,334 INFO ]: Start minimizeSevpa. Operand 300 states. [2018-06-22 01:03:20,337 INFO ]: Finished minimizeSevpa. Reduced states from 300 to 103. [2018-06-22 01:03:20,337 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 01:03:20,337 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-06-22 01:03:20,337 INFO ]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 48 [2018-06-22 01:03:20,337 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:20,337 INFO ]: Abstraction has 103 states and 114 transitions. [2018-06-22 01:03:20,337 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:03:20,337 INFO ]: Start isEmpty. Operand 103 states and 114 transitions. [2018-06-22 01:03:20,338 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 01:03:20,338 INFO ]: Found error trace [2018-06-22 01:03:20,338 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:20,338 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:20,338 INFO ]: Analyzing trace with hash -1088197844, now seen corresponding path program 1 times [2018-06-22 01:03:20,338 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:20,338 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:20,339 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:20,339 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:20,339 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:20,352 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:20,633 INFO ]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:03:20,633 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:20,633 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 01:03:20,633 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:03:20,633 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:03:20,633 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:03:20,633 INFO ]: Start difference. First operand 103 states and 114 transitions. Second operand 21 states. [2018-06-22 01:03:22,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:22,419 INFO ]: Finished difference Result 442 states and 485 transitions. [2018-06-22 01:03:22,419 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-06-22 01:03:22,419 INFO ]: Start accepts. Automaton has 21 states. Word has length 48 [2018-06-22 01:03:22,419 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:22,420 INFO ]: With dead ends: 442 [2018-06-22 01:03:22,420 INFO ]: Without dead ends: 441 [2018-06-22 01:03:22,421 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2889 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2228, Invalid=7474, Unknown=0, NotChecked=0, Total=9702 [2018-06-22 01:03:22,421 INFO ]: Start minimizeSevpa. Operand 441 states. [2018-06-22 01:03:22,429 INFO ]: Finished minimizeSevpa. Reduced states from 441 to 103. [2018-06-22 01:03:22,429 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 01:03:22,429 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-06-22 01:03:22,429 INFO ]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 48 [2018-06-22 01:03:22,429 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:22,429 INFO ]: Abstraction has 103 states and 114 transitions. [2018-06-22 01:03:22,429 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:03:22,429 INFO ]: Start isEmpty. Operand 103 states and 114 transitions. [2018-06-22 01:03:22,431 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 01:03:22,431 INFO ]: Found error trace [2018-06-22 01:03:22,431 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:22,431 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:22,431 INFO ]: Analyzing trace with hash 621802547, now seen corresponding path program 1 times [2018-06-22 01:03:22,431 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:22,431 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:22,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:22,432 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:22,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:22,445 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:22,690 INFO ]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:03:22,690 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:22,690 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 01:03:22,690 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:03:22,690 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:03:22,690 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:03:22,690 INFO ]: Start difference. First operand 103 states and 114 transitions. Second operand 21 states. [2018-06-22 01:03:23,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:23,354 INFO ]: Finished difference Result 176 states and 191 transitions. [2018-06-22 01:03:23,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:03:23,354 INFO ]: Start accepts. Automaton has 21 states. Word has length 48 [2018-06-22 01:03:23,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:23,354 INFO ]: With dead ends: 176 [2018-06-22 01:03:23,354 INFO ]: Without dead ends: 160 [2018-06-22 01:03:23,354 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=485, Invalid=1237, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:03:23,355 INFO ]: Start minimizeSevpa. Operand 160 states. [2018-06-22 01:03:23,356 INFO ]: Finished minimizeSevpa. Reduced states from 160 to 92. [2018-06-22 01:03:23,356 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-22 01:03:23,356 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-06-22 01:03:23,357 INFO ]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 48 [2018-06-22 01:03:23,357 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:23,357 INFO ]: Abstraction has 92 states and 101 transitions. [2018-06-22 01:03:23,357 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:03:23,357 INFO ]: Start isEmpty. Operand 92 states and 101 transitions. [2018-06-22 01:03:23,357 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 01:03:23,357 INFO ]: Found error trace [2018-06-22 01:03:23,357 INFO ]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:23,357 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:23,357 INFO ]: Analyzing trace with hash -1669976038, now seen corresponding path program 1 times [2018-06-22 01:03:23,357 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:23,357 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:23,357 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:23,357 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:23,357 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:23,371 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:23,977 INFO ]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:03:23,977 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:23,977 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 01:03:23,978 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:03:23,978 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:03:23,978 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:03:23,978 INFO ]: Start difference. First operand 92 states and 101 transitions. Second operand 22 states. [2018-06-22 01:03:24,629 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:24,629 INFO ]: Finished difference Result 207 states and 225 transitions. [2018-06-22 01:03:24,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:03:24,630 INFO ]: Start accepts. Automaton has 22 states. Word has length 49 [2018-06-22 01:03:24,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:24,630 INFO ]: With dead ends: 207 [2018-06-22 01:03:24,630 INFO ]: Without dead ends: 203 [2018-06-22 01:03:24,631 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=459, Invalid=1181, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:03:24,631 INFO ]: Start minimizeSevpa. Operand 203 states. [2018-06-22 01:03:24,633 INFO ]: Finished minimizeSevpa. Reduced states from 203 to 116. [2018-06-22 01:03:24,633 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-22 01:03:24,634 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2018-06-22 01:03:24,634 INFO ]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 49 [2018-06-22 01:03:24,634 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:24,634 INFO ]: Abstraction has 116 states and 126 transitions. [2018-06-22 01:03:24,634 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:03:24,634 INFO ]: Start isEmpty. Operand 116 states and 126 transitions. [2018-06-22 01:03:24,635 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 01:03:24,635 INFO ]: Found error trace [2018-06-22 01:03:24,635 INFO ]: trace histogram [3, 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, 1, 1, 1, 1] [2018-06-22 01:03:24,635 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:24,635 INFO ]: Analyzing trace with hash 608677337, now seen corresponding path program 1 times [2018-06-22 01:03:24,635 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:24,635 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:24,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:24,635 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:24,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:24,655 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:25,775 INFO ]: Checked inductivity of 18 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:03:25,775 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:03:25,775 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:03:25,787 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:25,929 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:25,948 INFO ]: Computing forward predicates... [2018-06-22 01:03:27,029 INFO ]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:27,049 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:03:27,050 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 29] total 65 [2018-06-22 01:03:27,050 INFO ]: Interpolant automaton has 65 states [2018-06-22 01:03:27,050 INFO ]: Constructing interpolant automaton starting with 65 interpolants. [2018-06-22 01:03:27,050 INFO ]: CoverageRelationStatistics Valid=153, Invalid=4007, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 01:03:27,051 INFO ]: Start difference. First operand 116 states and 126 transitions. Second operand 65 states. [2018-06-22 01:03:30,549 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2018-06-22 01:03:30,981 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2018-06-22 01:03:31,149 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-06-22 01:03:31,319 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-06-22 01:03:31,487 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2018-06-22 01:03:31,767 WARN ]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2018-06-22 01:03:31,933 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2018-06-22 01:03:32,224 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2018-06-22 01:03:32,653 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 148 Received shutdown request... [2018-06-22 01:03:36,318 WARN ]: Removed 27 from assertion stack [2018-06-22 01:03:36,319 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-06-22 01:03:36,319 WARN ]: Verification canceled [2018-06-22 01:03:36,323 WARN ]: Timeout [2018-06-22 01:03:36,323 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:03:36 BoogieIcfgContainer [2018-06-22 01:03:36,323 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:03:36,324 INFO ]: Toolchain (without parser) took 59428.83 ms. Allocated memory was 306.7 MB in the beginning and 820.0 MB in the end (delta: 513.3 MB). Free memory was 225.1 MB in the beginning and 360.8 MB in the end (delta: -135.7 MB). Peak memory consumption was 377.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:03:36,325 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:03:36,325 INFO ]: ChcToBoogie took 94.16 ms. Allocated memory is still 306.7 MB. Free memory was 224.1 MB in the beginning and 221.1 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:03:36,325 INFO ]: Boogie Preprocessor took 52.73 ms. Allocated memory is still 306.7 MB. Free memory was 221.1 MB in the beginning and 219.1 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:03:36,325 INFO ]: RCFGBuilder took 944.76 ms. Allocated memory was 306.7 MB in the beginning and 324.0 MB in the end (delta: 17.3 MB). Free memory was 219.1 MB in the beginning and 264.3 MB in the end (delta: -45.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 3.6 GB. [2018-06-22 01:03:36,325 INFO ]: TraceAbstraction took 58328.11 ms. Allocated memory was 324.0 MB in the beginning and 820.0 MB in the end (delta: 496.0 MB). Free memory was 264.3 MB in the beginning and 360.8 MB in the end (delta: -96.5 MB). Peak memory consumption was 399.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:03:36,327 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 94.16 ms. Allocated memory is still 306.7 MB. Free memory was 224.1 MB in the beginning and 221.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 52.73 ms. Allocated memory is still 306.7 MB. Free memory was 221.1 MB in the beginning and 219.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 944.76 ms. Allocated memory was 306.7 MB in the beginning and 324.0 MB in the end (delta: 17.3 MB). Free memory was 219.1 MB in the beginning and 264.3 MB in the end (delta: -45.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58328.11 ms. Allocated memory was 324.0 MB in the beginning and 820.0 MB in the end (delta: 496.0 MB). Free memory was 264.3 MB in the beginning and 360.8 MB in the end (delta: -96.5 MB). Peak memory consumption was 399.5 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 (116states) and interpolant automaton (currently 86 states, 65 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 126. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. TIMEOUT Result, 58.2s OverallTime, 18 OverallIterations, 3 TraceHistogramMax, 45.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1785 SDtfs, 21171 SDslu, 36442 SDs, 0 SdLazy, 10855 SolverSat, 2943 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1624 GetRequests, 224 SyntacticMatches, 5 SemanticMatches, 1394 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37338 ImplicationChecksByTransitivity, 45.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=17, 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.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 4144 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 936 NumberOfCodeBlocks, 936 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 914 ConstructedInterpolants, 0 QuantifiedInterpolants, 109980 SizeOfPredicates, 140 NumberOfNonLiveVariables, 4769 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 150/182 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/31.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-03-36-335.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/31.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-03-36-335.csv Completed graceful shutdown