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/llreve-bench/smt2/loop__break.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:11:52,915 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:11:52,918 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:11:52,930 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:11:52,931 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:11:52,932 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:11:52,933 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:11:52,935 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:11:52,937 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:11:52,937 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:11:52,938 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:11:52,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:11:52,939 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:11:52,940 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:11:52,941 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:11:52,942 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:11:52,945 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:11:52,947 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:11:52,949 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:11:52,950 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:11:52,952 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:11:52,954 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:11:52,954 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:11:52,954 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:11:52,955 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:11:52,956 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:11:52,957 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:11:52,957 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:11:52,959 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:11:52,959 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:11:52,959 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:11:52,960 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:11:52,960 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:11:52,961 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:11:52,962 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:11:52,962 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 02:11:52,976 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:11:52,977 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:11:52,977 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:11:52,977 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:11:52,978 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:11:52,979 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:11:52,979 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:11:52,979 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:11:52,979 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:11:52,980 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:11:52,980 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:11:52,980 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:11:52,980 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:11:52,980 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:11:52,981 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:11:52,981 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:11:52,981 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:11:52,982 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:11:52,983 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:11:53,032 INFO ]: Repository-Root is: /tmp [2018-06-22 02:11:53,050 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:11:53,055 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:11:53,057 INFO ]: Initializing SmtParser... [2018-06-22 02:11:53,057 INFO ]: SmtParser initialized [2018-06-22 02:11:53,057 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__break.smt2 [2018-06-22 02:11:53,059 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 02:11:53,152 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__break.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@62e780ba [2018-06-22 02:11:53,359 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__break.smt2 [2018-06-22 02:11:53,364 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:11:53,375 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:11:53,375 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:11:53,375 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:11:53,376 INFO ]: ChcToBoogie initialized [2018-06-22 02:11:53,380 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:11:53" (1/1) ... [2018-06-22 02:11:53,440 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:53 Unit [2018-06-22 02:11:53,440 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:11:53,442 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:11:53,442 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:11:53,442 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:11:53,465 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:53" (1/1) ... [2018-06-22 02:11:53,465 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:53" (1/1) ... [2018-06-22 02:11:53,474 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:53" (1/1) ... [2018-06-22 02:11:53,474 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:53" (1/1) ... [2018-06-22 02:11:53,476 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:53" (1/1) ... [2018-06-22 02:11:53,478 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:53" (1/1) ... [2018-06-22 02:11:53,479 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:53" (1/1) ... [2018-06-22 02:11:53,480 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:11:53,481 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:11:53,481 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:11:53,481 INFO ]: RCFGBuilder initialized [2018-06-22 02:11:53,482 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:53" (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 02:11:53,502 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:11:53,502 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:11:53,502 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:11:53,502 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:11:53,502 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:11:53,502 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 02:11:53,849 INFO ]: Using library mode [2018-06-22 02:11:53,849 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:11:53 BoogieIcfgContainer [2018-06-22 02:11:53,849 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:11:53,851 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:11:53,851 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:11:53,854 INFO ]: TraceAbstraction initialized [2018-06-22 02:11:53,854 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:11:53" (1/3) ... [2018-06-22 02:11:53,855 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5b94d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:11:53, skipping insertion in model container [2018-06-22 02:11:53,855 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:11:53" (2/3) ... [2018-06-22 02:11:53,855 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5b94d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:11:53, skipping insertion in model container [2018-06-22 02:11:53,855 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:11:53" (3/3) ... [2018-06-22 02:11:53,857 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:11:53,866 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:11:53,874 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:11:53,934 INFO ]: Using default assertion order modulation [2018-06-22 02:11:53,935 INFO ]: Interprodecural is true [2018-06-22 02:11:53,935 INFO ]: Hoare is false [2018-06-22 02:11:53,935 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:11:53,935 INFO ]: Backedges is TWOTRACK [2018-06-22 02:11:53,935 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:11:53,935 INFO ]: Difference is false [2018-06-22 02:11:53,935 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:11:53,935 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:11:53,964 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 02:11:53,981 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-22 02:11:53,981 INFO ]: Found error trace [2018-06-22 02:11:53,989 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-22 02:11:53,989 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:53,996 INFO ]: Analyzing trace with hash 2119190916, now seen corresponding path program 1 times [2018-06-22 02:11:53,998 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:53,998 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:54,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:54,040 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:54,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:54,066 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:54,094 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:54,096 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:11:54,097 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 02:11:54,099 INFO ]: Interpolant automaton has 2 states [2018-06-22 02:11:54,109 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 02:11:54,109 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 02:11:54,111 INFO ]: Start difference. First operand 10 states. Second operand 2 states. [2018-06-22 02:11:54,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:54,131 INFO ]: Finished difference Result 8 states and 13 transitions. [2018-06-22 02:11:54,131 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 02:11:54,132 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-22 02:11:54,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:54,151 INFO ]: With dead ends: 8 [2018-06-22 02:11:54,151 INFO ]: Without dead ends: 8 [2018-06-22 02:11:54,156 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 02:11:54,173 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-22 02:11:54,187 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-22 02:11:54,189 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-22 02:11:54,189 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-06-22 02:11:54,190 INFO ]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 6 [2018-06-22 02:11:54,191 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:54,191 INFO ]: Abstraction has 8 states and 13 transitions. [2018-06-22 02:11:54,191 INFO ]: Interpolant automaton has 2 states. [2018-06-22 02:11:54,191 INFO ]: Start isEmpty. Operand 8 states and 13 transitions. [2018-06-22 02:11:54,192 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 02:11:54,192 INFO ]: Found error trace [2018-06-22 02:11:54,192 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:54,192 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:54,192 INFO ]: Analyzing trace with hash 1266679479, now seen corresponding path program 1 times [2018-06-22 02:11:54,192 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:54,192 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:54,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:54,193 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:54,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:54,216 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:54,293 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:54,293 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:11:54,293 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:11:54,295 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:11:54,295 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:11:54,295 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:11:54,295 INFO ]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2018-06-22 02:11:54,355 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:54,355 INFO ]: Finished difference Result 9 states and 16 transitions. [2018-06-22 02:11:54,356 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:11:54,356 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 02:11:54,356 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:54,356 INFO ]: With dead ends: 9 [2018-06-22 02:11:54,356 INFO ]: Without dead ends: 9 [2018-06-22 02:11:54,357 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:11:54,357 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 02:11:54,359 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 02:11:54,359 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 02:11:54,360 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-06-22 02:11:54,360 INFO ]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 7 [2018-06-22 02:11:54,360 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:54,360 INFO ]: Abstraction has 9 states and 16 transitions. [2018-06-22 02:11:54,360 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:11:54,360 INFO ]: Start isEmpty. Operand 9 states and 16 transitions. [2018-06-22 02:11:54,360 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 02:11:54,360 INFO ]: Found error trace [2018-06-22 02:11:54,360 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:54,360 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:54,361 INFO ]: Analyzing trace with hash 1259291311, now seen corresponding path program 1 times [2018-06-22 02:11:54,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:54,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:54,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:54,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:54,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:54,370 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:54,387 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:54,387 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:11:54,387 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:11:54,387 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:11:54,387 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:11:54,388 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:11:54,388 INFO ]: Start difference. First operand 9 states and 16 transitions. Second operand 3 states. [2018-06-22 02:11:54,456 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:54,456 INFO ]: Finished difference Result 11 states and 22 transitions. [2018-06-22 02:11:54,457 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:11:54,457 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 02:11:54,457 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:54,457 INFO ]: With dead ends: 11 [2018-06-22 02:11:54,457 INFO ]: Without dead ends: 11 [2018-06-22 02:11:54,458 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:11:54,458 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 02:11:54,459 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 02:11:54,459 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 02:11:54,460 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2018-06-22 02:11:54,460 INFO ]: Start accepts. Automaton has 11 states and 22 transitions. Word has length 7 [2018-06-22 02:11:54,460 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:54,460 INFO ]: Abstraction has 11 states and 22 transitions. [2018-06-22 02:11:54,460 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:11:54,460 INFO ]: Start isEmpty. Operand 11 states and 22 transitions. [2018-06-22 02:11:54,460 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 02:11:54,460 INFO ]: Found error trace [2018-06-22 02:11:54,460 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:54,460 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:54,461 INFO ]: Analyzing trace with hash 1262985395, now seen corresponding path program 1 times [2018-06-22 02:11:54,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:54,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:54,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:54,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:54,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:54,469 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:54,512 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:54,512 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:11:54,512 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:11:54,512 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:11:54,512 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:11:54,512 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:11:54,513 INFO ]: Start difference. First operand 11 states and 22 transitions. Second operand 3 states. [2018-06-22 02:11:54,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:54,630 INFO ]: Finished difference Result 12 states and 25 transitions. [2018-06-22 02:11:54,631 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:11:54,631 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 02:11:54,631 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:54,631 INFO ]: With dead ends: 12 [2018-06-22 02:11:54,631 INFO ]: Without dead ends: 12 [2018-06-22 02:11:54,631 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:11:54,632 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 02:11:54,633 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-22 02:11:54,633 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 02:11:54,634 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2018-06-22 02:11:54,634 INFO ]: Start accepts. Automaton has 11 states and 22 transitions. Word has length 7 [2018-06-22 02:11:54,634 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:54,634 INFO ]: Abstraction has 11 states and 22 transitions. [2018-06-22 02:11:54,634 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:11:54,634 INFO ]: Start isEmpty. Operand 11 states and 22 transitions. [2018-06-22 02:11:54,634 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:11:54,634 INFO ]: Found error trace [2018-06-22 02:11:54,634 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:54,634 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:54,635 INFO ]: Analyzing trace with hash 603087582, now seen corresponding path program 1 times [2018-06-22 02:11:54,635 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:54,635 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:54,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:54,635 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:54,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:54,644 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:54,729 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:54,730 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:54,730 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 02:11:54,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:54,772 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:54,779 INFO ]: Computing forward predicates... [2018-06-22 02:11:54,817 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:54,838 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:54,838 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 02:11:54,839 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:11:54,839 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:11:54,839 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:11:54,839 INFO ]: Start difference. First operand 11 states and 22 transitions. Second operand 5 states. [2018-06-22 02:11:55,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:55,089 INFO ]: Finished difference Result 15 states and 34 transitions. [2018-06-22 02:11:55,090 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:11:55,090 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 02:11:55,090 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:55,090 INFO ]: With dead ends: 15 [2018-06-22 02:11:55,090 INFO ]: Without dead ends: 15 [2018-06-22 02:11:55,091 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:11:55,091 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 02:11:55,093 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 02:11:55,093 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 02:11:55,093 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 34 transitions. [2018-06-22 02:11:55,093 INFO ]: Start accepts. Automaton has 15 states and 34 transitions. Word has length 8 [2018-06-22 02:11:55,094 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:55,094 INFO ]: Abstraction has 15 states and 34 transitions. [2018-06-22 02:11:55,094 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:11:55,094 INFO ]: Start isEmpty. Operand 15 states and 34 transitions. [2018-06-22 02:11:55,094 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:11:55,094 INFO ]: Found error trace [2018-06-22 02:11:55,094 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:55,094 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:55,094 INFO ]: Analyzing trace with hash 381442542, now seen corresponding path program 1 times [2018-06-22 02:11:55,094 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:55,094 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:55,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:55,095 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:55,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:55,104 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:55,132 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:55,132 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:55,132 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 02:11:55,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:55,154 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:55,155 INFO ]: Computing forward predicates... [2018-06-22 02:11:55,160 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:55,181 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:55,182 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 02:11:55,182 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:11:55,182 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:11:55,182 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:11:55,182 INFO ]: Start difference. First operand 15 states and 34 transitions. Second operand 4 states. [2018-06-22 02:11:55,274 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:55,275 INFO ]: Finished difference Result 20 states and 49 transitions. [2018-06-22 02:11:55,275 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:11:55,275 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 02:11:55,275 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:55,276 INFO ]: With dead ends: 20 [2018-06-22 02:11:55,276 INFO ]: Without dead ends: 20 [2018-06-22 02:11:55,276 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:11:55,276 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 02:11:55,278 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-06-22 02:11:55,278 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 02:11:55,279 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 46 transitions. [2018-06-22 02:11:55,279 INFO ]: Start accepts. Automaton has 19 states and 46 transitions. Word has length 8 [2018-06-22 02:11:55,279 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:55,279 INFO ]: Abstraction has 19 states and 46 transitions. [2018-06-22 02:11:55,279 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:11:55,279 INFO ]: Start isEmpty. Operand 19 states and 46 transitions. [2018-06-22 02:11:55,280 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:11:55,280 INFO ]: Found error trace [2018-06-22 02:11:55,280 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:55,280 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:55,280 INFO ]: Analyzing trace with hash 495959146, now seen corresponding path program 1 times [2018-06-22 02:11:55,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:55,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:55,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:55,281 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:55,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:55,289 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:55,517 WARN ]: Spent 179.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-06-22 02:11:55,526 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:55,526 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:55,526 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 02:11:55,536 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:55,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:55,575 INFO ]: Computing forward predicates... [2018-06-22 02:11:55,674 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:55,705 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:11:55,705 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-06-22 02:11:55,706 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:11:55,706 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:11:55,706 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:11:55,706 INFO ]: Start difference. First operand 19 states and 46 transitions. Second operand 6 states. [2018-06-22 02:11:56,165 WARN ]: Spent 305.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-06-22 02:11:56,471 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:56,471 INFO ]: Finished difference Result 22 states and 55 transitions. [2018-06-22 02:11:56,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:11:56,473 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-22 02:11:56,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:56,473 INFO ]: With dead ends: 22 [2018-06-22 02:11:56,473 INFO ]: Without dead ends: 22 [2018-06-22 02:11:56,474 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:11:56,474 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 02:11:56,481 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-22 02:11:56,481 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 02:11:56,481 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 49 transitions. [2018-06-22 02:11:56,481 INFO ]: Start accepts. Automaton has 20 states and 49 transitions. Word has length 8 [2018-06-22 02:11:56,482 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:56,482 INFO ]: Abstraction has 20 states and 49 transitions. [2018-06-22 02:11:56,482 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:11:56,482 INFO ]: Start isEmpty. Operand 20 states and 49 transitions. [2018-06-22 02:11:56,482 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:11:56,482 INFO ]: Found error trace [2018-06-22 02:11:56,482 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:56,482 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:56,482 INFO ]: Analyzing trace with hash 492265062, now seen corresponding path program 1 times [2018-06-22 02:11:56,482 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:56,482 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:56,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:56,483 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:56,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:56,493 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:56,552 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:56,553 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:56,553 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 02:11:56,559 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:56,568 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:56,570 INFO ]: Computing forward predicates... [2018-06-22 02:11:56,586 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:11:56,618 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:11:56,618 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-22 02:11:56,618 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:11:56,619 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:11:56,619 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:11:56,619 INFO ]: Start difference. First operand 20 states and 49 transitions. Second operand 5 states. [2018-06-22 02:11:56,795 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:56,795 INFO ]: Finished difference Result 32 states and 85 transitions. [2018-06-22 02:11:56,795 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:11:56,795 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 02:11:56,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:56,796 INFO ]: With dead ends: 32 [2018-06-22 02:11:56,796 INFO ]: Without dead ends: 32 [2018-06-22 02:11:56,796 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:11:56,797 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 02:11:56,799 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 16. [2018-06-22 02:11:56,799 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 02:11:56,800 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 37 transitions. [2018-06-22 02:11:56,800 INFO ]: Start accepts. Automaton has 16 states and 37 transitions. Word has length 8 [2018-06-22 02:11:56,800 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:56,800 INFO ]: Abstraction has 16 states and 37 transitions. [2018-06-22 02:11:56,800 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:11:56,800 INFO ]: Start isEmpty. Operand 16 states and 37 transitions. [2018-06-22 02:11:56,800 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:11:56,800 INFO ]: Found error trace [2018-06-22 02:11:56,800 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:56,801 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:56,801 INFO ]: Analyzing trace with hash -1180276209, now seen corresponding path program 1 times [2018-06-22 02:11:56,801 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:56,801 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:56,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:56,801 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:56,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:56,810 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:56,844 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:56,844 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:56,844 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 02:11:56,851 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:56,870 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:56,871 INFO ]: Computing forward predicates... [2018-06-22 02:11:56,877 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:56,897 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:56,898 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 02:11:56,898 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:11:56,898 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:11:56,898 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:11:56,898 INFO ]: Start difference. First operand 16 states and 37 transitions. Second operand 5 states. [2018-06-22 02:11:56,929 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:56,929 INFO ]: Finished difference Result 25 states and 64 transitions. [2018-06-22 02:11:56,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:11:56,930 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-22 02:11:56,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:56,931 INFO ]: With dead ends: 25 [2018-06-22 02:11:56,931 INFO ]: Without dead ends: 25 [2018-06-22 02:11:56,931 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:11:56,931 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 02:11:56,933 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-06-22 02:11:56,933 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 02:11:56,934 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 49 transitions. [2018-06-22 02:11:56,934 INFO ]: Start accepts. Automaton has 20 states and 49 transitions. Word has length 9 [2018-06-22 02:11:56,934 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:56,934 INFO ]: Abstraction has 20 states and 49 transitions. [2018-06-22 02:11:56,934 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:11:56,934 INFO ]: Start isEmpty. Operand 20 states and 49 transitions. [2018-06-22 02:11:56,935 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:11:56,935 INFO ]: Found error trace [2018-06-22 02:11:56,935 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:56,935 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:56,935 INFO ]: Analyzing trace with hash -2039745385, now seen corresponding path program 1 times [2018-06-22 02:11:56,935 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:56,935 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:56,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:56,936 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:56,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:56,945 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:57,022 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:57,022 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:57,022 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 02:11:57,029 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:57,038 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:57,040 INFO ]: Computing forward predicates... [2018-06-22 02:11:57,288 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:57,309 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:57,309 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 02:11:57,309 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:11:57,309 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:11:57,309 INFO ]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:11:57,309 INFO ]: Start difference. First operand 20 states and 49 transitions. Second operand 8 states. [2018-06-22 02:11:57,458 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:57,458 INFO ]: Finished difference Result 31 states and 82 transitions. [2018-06-22 02:11:57,460 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 02:11:57,460 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-22 02:11:57,460 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:57,460 INFO ]: With dead ends: 31 [2018-06-22 02:11:57,460 INFO ]: Without dead ends: 22 [2018-06-22 02:11:57,461 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:11:57,461 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 02:11:57,462 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-06-22 02:11:57,463 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 02:11:57,463 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 45 transitions. [2018-06-22 02:11:57,463 INFO ]: Start accepts. Automaton has 19 states and 45 transitions. Word has length 9 [2018-06-22 02:11:57,463 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:57,463 INFO ]: Abstraction has 19 states and 45 transitions. [2018-06-22 02:11:57,463 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:11:57,463 INFO ]: Start isEmpty. Operand 19 states and 45 transitions. [2018-06-22 02:11:57,464 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:11:57,464 INFO ]: Found error trace [2018-06-22 02:11:57,464 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:57,464 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:57,464 INFO ]: Analyzing trace with hash -546383870, now seen corresponding path program 1 times [2018-06-22 02:11:57,464 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:57,464 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:57,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:57,465 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:57,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:57,478 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:57,531 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:57,531 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:57,531 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:57,541 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:57,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:57,561 INFO ]: Computing forward predicates... [2018-06-22 02:11:57,587 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:57,607 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:57,607 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 02:11:57,607 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:11:57,608 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:11:57,608 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:11:57,608 INFO ]: Start difference. First operand 19 states and 45 transitions. Second operand 7 states. [2018-06-22 02:11:57,659 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:57,659 INFO ]: Finished difference Result 36 states and 96 transitions. [2018-06-22 02:11:57,659 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:11:57,659 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-22 02:11:57,659 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:57,660 INFO ]: With dead ends: 36 [2018-06-22 02:11:57,660 INFO ]: Without dead ends: 36 [2018-06-22 02:11:57,660 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:11:57,660 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 02:11:57,663 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-06-22 02:11:57,663 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 02:11:57,664 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 69 transitions. [2018-06-22 02:11:57,664 INFO ]: Start accepts. Automaton has 27 states and 69 transitions. Word has length 10 [2018-06-22 02:11:57,664 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:57,664 INFO ]: Abstraction has 27 states and 69 transitions. [2018-06-22 02:11:57,664 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:11:57,664 INFO ]: Start isEmpty. Operand 27 states and 69 transitions. [2018-06-22 02:11:57,664 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:11:57,664 INFO ]: Found error trace [2018-06-22 02:11:57,665 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:57,665 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:57,665 INFO ]: Analyzing trace with hash 1315614094, now seen corresponding path program 1 times [2018-06-22 02:11:57,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:57,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:57,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:57,665 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:57,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:57,673 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:57,712 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:57,712 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:57,713 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 02:11:57,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:57,741 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:57,742 INFO ]: Computing forward predicates... [2018-06-22 02:11:57,747 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:57,766 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:57,766 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 02:11:57,766 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:11:57,767 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:11:57,767 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:11:57,767 INFO ]: Start difference. First operand 27 states and 69 transitions. Second operand 6 states. [2018-06-22 02:11:57,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:57,797 INFO ]: Finished difference Result 38 states and 102 transitions. [2018-06-22 02:11:57,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:11:57,799 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-22 02:11:57,799 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:57,799 INFO ]: With dead ends: 38 [2018-06-22 02:11:57,800 INFO ]: Without dead ends: 38 [2018-06-22 02:11:57,800 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:11:57,800 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 02:11:57,804 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-06-22 02:11:57,804 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 02:11:57,804 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 84 transitions. [2018-06-22 02:11:57,804 INFO ]: Start accepts. Automaton has 32 states and 84 transitions. Word has length 10 [2018-06-22 02:11:57,805 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:57,805 INFO ]: Abstraction has 32 states and 84 transitions. [2018-06-22 02:11:57,805 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:11:57,805 INFO ]: Start isEmpty. Operand 32 states and 84 transitions. [2018-06-22 02:11:57,805 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:11:57,805 INFO ]: Found error trace [2018-06-22 02:11:57,805 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:57,805 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:57,805 INFO ]: Analyzing trace with hash 1378802159, now seen corresponding path program 2 times [2018-06-22 02:11:57,805 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:57,805 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:57,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:57,807 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:57,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:57,819 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:57,916 INFO ]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:11:57,916 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:57,916 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 02:11:57,923 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:11:57,942 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:11:57,942 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:57,944 INFO ]: Computing forward predicates... [2018-06-22 02:11:58,116 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:58,142 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:58,142 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-06-22 02:11:58,143 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:11:58,143 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:11:58,143 INFO ]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:11:58,143 INFO ]: Start difference. First operand 32 states and 84 transitions. Second operand 10 states. [2018-06-22 02:11:58,682 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:58,682 INFO ]: Finished difference Result 76 states and 216 transitions. [2018-06-22 02:11:58,682 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 02:11:58,682 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-22 02:11:58,682 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:58,683 INFO ]: With dead ends: 76 [2018-06-22 02:11:58,683 INFO ]: Without dead ends: 76 [2018-06-22 02:11:58,683 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:11:58,683 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 02:11:58,689 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 55. [2018-06-22 02:11:58,689 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 02:11:58,690 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 153 transitions. [2018-06-22 02:11:58,690 INFO ]: Start accepts. Automaton has 55 states and 153 transitions. Word has length 11 [2018-06-22 02:11:58,690 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:58,690 INFO ]: Abstraction has 55 states and 153 transitions. [2018-06-22 02:11:58,690 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:11:58,690 INFO ]: Start isEmpty. Operand 55 states and 153 transitions. [2018-06-22 02:11:58,691 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:11:58,691 INFO ]: Found error trace [2018-06-22 02:11:58,691 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:58,692 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:58,692 INFO ]: Analyzing trace with hash -636901598, now seen corresponding path program 2 times [2018-06-22 02:11:58,692 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:58,692 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:58,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:58,692 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:58,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:58,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:58,788 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:58,788 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:58,788 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:58,796 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:11:58,818 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:11:58,818 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:58,819 INFO ]: Computing forward predicates... [2018-06-22 02:11:58,871 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:58,891 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:58,891 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 02:11:58,891 INFO ]: Interpolant automaton has 9 states [2018-06-22 02:11:58,891 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 02:11:58,891 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:11:58,891 INFO ]: Start difference. First operand 55 states and 153 transitions. Second operand 9 states. [2018-06-22 02:11:58,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:58,973 INFO ]: Finished difference Result 79 states and 225 transitions. [2018-06-22 02:11:58,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 02:11:58,974 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-22 02:11:58,974 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:58,974 INFO ]: With dead ends: 79 [2018-06-22 02:11:58,974 INFO ]: Without dead ends: 79 [2018-06-22 02:11:58,974 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:11:58,975 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 02:11:58,980 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-06-22 02:11:58,980 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 02:11:58,981 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 198 transitions. [2018-06-22 02:11:58,981 INFO ]: Start accepts. Automaton has 70 states and 198 transitions. Word has length 12 [2018-06-22 02:11:58,981 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:58,981 INFO ]: Abstraction has 70 states and 198 transitions. [2018-06-22 02:11:58,981 INFO ]: Interpolant automaton has 9 states. [2018-06-22 02:11:58,981 INFO ]: Start isEmpty. Operand 70 states and 198 transitions. [2018-06-22 02:11:58,982 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 02:11:58,982 INFO ]: Found error trace [2018-06-22 02:11:58,982 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:58,982 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:58,982 INFO ]: Analyzing trace with hash 496322375, now seen corresponding path program 3 times [2018-06-22 02:11:58,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:58,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:58,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:58,983 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:58,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:58,992 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:59,096 INFO ]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:11:59,096 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:59,096 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 02:11:59,104 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:11:59,160 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:11:59,160 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:59,162 INFO ]: Computing forward predicates... [2018-06-22 02:11:59,383 INFO ]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:11:59,403 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:59,403 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-06-22 02:11:59,403 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:11:59,403 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:11:59,403 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:11:59,403 INFO ]: Start difference. First operand 70 states and 198 transitions. Second operand 7 states. [2018-06-22 02:11:59,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:59,517 INFO ]: Finished difference Result 176 states and 516 transitions. [2018-06-22 02:11:59,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 02:11:59,517 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 02:11:59,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:59,519 INFO ]: With dead ends: 176 [2018-06-22 02:11:59,519 INFO ]: Without dead ends: 176 [2018-06-22 02:11:59,519 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:11:59,519 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-22 02:11:59,527 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 64. [2018-06-22 02:11:59,527 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 02:11:59,528 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 180 transitions. [2018-06-22 02:11:59,528 INFO ]: Start accepts. Automaton has 64 states and 180 transitions. Word has length 13 [2018-06-22 02:11:59,528 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:59,528 INFO ]: Abstraction has 64 states and 180 transitions. [2018-06-22 02:11:59,528 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:11:59,528 INFO ]: Start isEmpty. Operand 64 states and 180 transitions. [2018-06-22 02:11:59,528 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 02:11:59,528 INFO ]: Found error trace [2018-06-22 02:11:59,528 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:59,529 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:59,529 INFO ]: Analyzing trace with hash 1255546451, now seen corresponding path program 4 times [2018-06-22 02:11:59,529 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:59,529 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:59,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:59,529 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:59,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:59,537 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:59,550 INFO ]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:11:59,550 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:11:59,550 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:11:59,550 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:11:59,550 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:11:59,550 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:11:59,550 INFO ]: Start difference. First operand 64 states and 180 transitions. Second operand 3 states. [2018-06-22 02:11:59,558 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:59,558 INFO ]: Finished difference Result 64 states and 135 transitions. [2018-06-22 02:11:59,558 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:11:59,558 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-22 02:11:59,558 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:59,559 INFO ]: With dead ends: 64 [2018-06-22 02:11:59,559 INFO ]: Without dead ends: 64 [2018-06-22 02:11:59,559 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:11:59,559 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 02:11:59,562 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 50. [2018-06-22 02:11:59,562 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 02:11:59,564 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 107 transitions. [2018-06-22 02:11:59,564 INFO ]: Start accepts. Automaton has 50 states and 107 transitions. Word has length 13 [2018-06-22 02:11:59,564 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:59,564 INFO ]: Abstraction has 50 states and 107 transitions. [2018-06-22 02:11:59,564 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:11:59,564 INFO ]: Start isEmpty. Operand 50 states and 107 transitions. [2018-06-22 02:11:59,565 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:11:59,565 INFO ]: Found error trace [2018-06-22 02:11:59,565 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:59,565 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:59,565 INFO ]: Analyzing trace with hash -1725092286, now seen corresponding path program 3 times [2018-06-22 02:11:59,565 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:59,565 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:59,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:59,566 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:59,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:59,577 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:59,749 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:59,749 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:59,749 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 02:11:59,757 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:11:59,771 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:11:59,771 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:59,772 INFO ]: Computing forward predicates... [2018-06-22 02:11:59,904 INFO ]: Checked inductivity of 28 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:11:59,932 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:59,932 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 12 [2018-06-22 02:11:59,933 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:11:59,933 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:11:59,933 INFO ]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:11:59,933 INFO ]: Start difference. First operand 50 states and 107 transitions. Second operand 12 states. [2018-06-22 02:12:00,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:00,325 INFO ]: Finished difference Result 153 states and 313 transitions. [2018-06-22 02:12:00,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 02:12:00,325 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-22 02:12:00,325 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:00,326 INFO ]: With dead ends: 153 [2018-06-22 02:12:00,326 INFO ]: Without dead ends: 153 [2018-06-22 02:12:00,327 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2018-06-22 02:12:00,327 INFO ]: Start minimizeSevpa. Operand 153 states. [2018-06-22 02:12:00,329 INFO ]: Finished minimizeSevpa. Reduced states from 153 to 50. [2018-06-22 02:12:00,330 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 02:12:00,334 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 105 transitions. [2018-06-22 02:12:00,334 INFO ]: Start accepts. Automaton has 50 states and 105 transitions. Word has length 14 [2018-06-22 02:12:00,334 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:00,334 INFO ]: Abstraction has 50 states and 105 transitions. [2018-06-22 02:12:00,334 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:12:00,334 INFO ]: Start isEmpty. Operand 50 states and 105 transitions. [2018-06-22 02:12:00,335 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:12:00,335 INFO ]: Found error trace [2018-06-22 02:12:00,335 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:00,335 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:00,335 INFO ]: Analyzing trace with hash -309546934, now seen corresponding path program 1 times [2018-06-22 02:12:00,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:00,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:00,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:00,336 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:12:00,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:00,347 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:00,436 INFO ]: Checked inductivity of 28 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:12:00,436 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:12:00,436 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 02:12:00,443 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:00,458 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:00,459 INFO ]: Computing forward predicates... [2018-06-22 02:12:00,599 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:12:00,619 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:12:00,620 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-06-22 02:12:00,620 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:12:00,620 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:12:00,620 INFO ]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:12:00,620 INFO ]: Start difference. First operand 50 states and 105 transitions. Second operand 13 states. [2018-06-22 02:12:01,175 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:01,175 INFO ]: Finished difference Result 127 states and 268 transitions. [2018-06-22 02:12:01,175 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 02:12:01,175 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-22 02:12:01,175 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:01,177 INFO ]: With dead ends: 127 [2018-06-22 02:12:01,177 INFO ]: Without dead ends: 127 [2018-06-22 02:12:01,177 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=372, Invalid=818, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 02:12:01,177 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-22 02:12:01,181 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 70. [2018-06-22 02:12:01,181 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 02:12:01,182 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 151 transitions. [2018-06-22 02:12:01,182 INFO ]: Start accepts. Automaton has 70 states and 151 transitions. Word has length 14 [2018-06-22 02:12:01,183 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:01,183 INFO ]: Abstraction has 70 states and 151 transitions. [2018-06-22 02:12:01,183 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:12:01,183 INFO ]: Start isEmpty. Operand 70 states and 151 transitions. [2018-06-22 02:12:01,183 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 02:12:01,183 INFO ]: Found error trace [2018-06-22 02:12:01,183 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:01,183 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:01,183 INFO ]: Analyzing trace with hash -1943829833, now seen corresponding path program 4 times [2018-06-22 02:12:01,183 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:01,183 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:01,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:01,184 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:01,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:01,193 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:01,306 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:01,306 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:12:01,306 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 02:12:01,312 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:12:01,341 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:12:01,341 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:01,342 INFO ]: Computing forward predicates... [2018-06-22 02:12:01,399 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:01,417 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:12:01,418 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-22 02:12:01,418 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:12:01,418 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:12:01,418 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:12:01,418 INFO ]: Start difference. First operand 70 states and 151 transitions. Second operand 12 states. [2018-06-22 02:12:01,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:01,466 INFO ]: Finished difference Result 135 states and 281 transitions. [2018-06-22 02:12:01,466 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 02:12:01,466 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-22 02:12:01,466 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:01,467 INFO ]: With dead ends: 135 [2018-06-22 02:12:01,467 INFO ]: Without dead ends: 135 [2018-06-22 02:12:01,468 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:12:01,468 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-22 02:12:01,472 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 92. [2018-06-22 02:12:01,472 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-22 02:12:01,473 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 195 transitions. [2018-06-22 02:12:01,473 INFO ]: Start accepts. Automaton has 92 states and 195 transitions. Word has length 15 [2018-06-22 02:12:01,473 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:01,473 INFO ]: Abstraction has 92 states and 195 transitions. [2018-06-22 02:12:01,473 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:12:01,473 INFO ]: Start isEmpty. Operand 92 states and 195 transitions. [2018-06-22 02:12:01,473 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:12:01,474 INFO ]: Found error trace [2018-06-22 02:12:01,474 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:01,474 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:01,474 INFO ]: Analyzing trace with hash 488572006, now seen corresponding path program 1 times [2018-06-22 02:12:01,474 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:01,474 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:01,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:01,474 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:12:01,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:01,485 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:02,378 INFO ]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:12:02,378 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:12:02,378 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:12:02,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:02,408 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:02,409 INFO ]: Computing forward predicates... [2018-06-22 02:12:02,417 INFO ]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:12:02,449 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:12:02,449 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 02:12:02,449 INFO ]: Interpolant automaton has 11 states [2018-06-22 02:12:02,449 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 02:12:02,449 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:12:02,449 INFO ]: Start difference. First operand 92 states and 195 transitions. Second operand 11 states. [2018-06-22 02:12:02,564 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:02,564 INFO ]: Finished difference Result 210 states and 438 transitions. [2018-06-22 02:12:02,564 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:12:02,565 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-22 02:12:02,565 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:02,565 INFO ]: With dead ends: 210 [2018-06-22 02:12:02,565 INFO ]: Without dead ends: 210 [2018-06-22 02:12:02,566 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:12:02,566 INFO ]: Start minimizeSevpa. Operand 210 states. [2018-06-22 02:12:02,573 INFO ]: Finished minimizeSevpa. Reduced states from 210 to 91. [2018-06-22 02:12:02,573 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 02:12:02,575 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 195 transitions. [2018-06-22 02:12:02,575 INFO ]: Start accepts. Automaton has 91 states and 195 transitions. Word has length 16 [2018-06-22 02:12:02,575 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:02,575 INFO ]: Abstraction has 91 states and 195 transitions. [2018-06-22 02:12:02,575 INFO ]: Interpolant automaton has 11 states. [2018-06-22 02:12:02,575 INFO ]: Start isEmpty. Operand 91 states and 195 transitions. [2018-06-22 02:12:02,575 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:12:02,575 INFO ]: Found error trace [2018-06-22 02:12:02,575 INFO ]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:02,576 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:02,576 INFO ]: Analyzing trace with hash -1819465833, now seen corresponding path program 5 times [2018-06-22 02:12:02,576 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:02,576 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:02,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:02,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:02,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:02,591 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:02,741 INFO ]: Checked inductivity of 55 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 02:12:02,741 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:12:02,741 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:12:02,747 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:12:02,783 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 02:12:02,783 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:02,785 INFO ]: Computing forward predicates... [2018-06-22 02:12:02,832 INFO ]: Checked inductivity of 55 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 02:12:02,851 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:12:02,851 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-06-22 02:12:02,852 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:12:02,852 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:12:02,852 INFO ]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:12:02,852 INFO ]: Start difference. First operand 91 states and 195 transitions. Second operand 8 states. [2018-06-22 02:12:02,932 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:02,932 INFO ]: Finished difference Result 181 states and 375 transitions. [2018-06-22 02:12:02,932 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:12:02,932 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 02:12:02,932 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:02,933 INFO ]: With dead ends: 181 [2018-06-22 02:12:02,933 INFO ]: Without dead ends: 181 [2018-06-22 02:12:02,933 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:12:02,933 INFO ]: Start minimizeSevpa. Operand 181 states. [2018-06-22 02:12:02,938 INFO ]: Finished minimizeSevpa. Reduced states from 181 to 97. [2018-06-22 02:12:02,938 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-22 02:12:02,939 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 207 transitions. [2018-06-22 02:12:02,939 INFO ]: Start accepts. Automaton has 97 states and 207 transitions. Word has length 17 [2018-06-22 02:12:02,939 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:02,939 INFO ]: Abstraction has 97 states and 207 transitions. [2018-06-22 02:12:02,939 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:12:02,939 INFO ]: Start isEmpty. Operand 97 states and 207 transitions. [2018-06-22 02:12:02,940 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:12:02,940 INFO ]: Found error trace [2018-06-22 02:12:02,946 INFO ]: trace histogram [7, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:02,946 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:02,946 INFO ]: Analyzing trace with hash 856808211, now seen corresponding path program 6 times [2018-06-22 02:12:02,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:02,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:02,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:02,947 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:12:02,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:02,965 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:03,019 INFO ]: Checked inductivity of 55 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 02:12:03,019 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:12:03,019 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:12:03,019 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:12:03,019 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:12:03,019 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:12:03,019 INFO ]: Start difference. First operand 97 states and 207 transitions. Second operand 4 states. [2018-06-22 02:12:03,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:03,036 INFO ]: Finished difference Result 111 states and 206 transitions. [2018-06-22 02:12:03,037 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:12:03,038 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 02:12:03,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:03,041 INFO ]: With dead ends: 111 [2018-06-22 02:12:03,041 INFO ]: Without dead ends: 98 [2018-06-22 02:12:03,041 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:12:03,041 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 02:12:03,045 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 85. [2018-06-22 02:12:03,045 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-22 02:12:03,046 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 170 transitions. [2018-06-22 02:12:03,046 INFO ]: Start accepts. Automaton has 85 states and 170 transitions. Word has length 17 [2018-06-22 02:12:03,046 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:03,046 INFO ]: Abstraction has 85 states and 170 transitions. [2018-06-22 02:12:03,046 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:12:03,046 INFO ]: Start isEmpty. Operand 85 states and 170 transitions. [2018-06-22 02:12:03,047 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:12:03,047 INFO ]: Found error trace [2018-06-22 02:12:03,047 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:03,047 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:03,047 INFO ]: Analyzing trace with hash 520013839, now seen corresponding path program 1 times [2018-06-22 02:12:03,047 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:03,047 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:03,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:03,048 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:12:03,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:03,059 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:03,150 INFO ]: Checked inductivity of 55 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:12:03,150 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:12:03,150 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:12:03,158 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:03,188 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:03,190 INFO ]: Computing forward predicates... [2018-06-22 02:12:03,203 INFO ]: Checked inductivity of 55 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:12:03,226 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:12:03,226 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 02:12:03,226 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:12:03,226 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:12:03,226 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:12:03,226 INFO ]: Start difference. First operand 85 states and 170 transitions. Second operand 12 states. [2018-06-22 02:12:03,313 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:03,313 INFO ]: Finished difference Result 203 states and 413 transitions. [2018-06-22 02:12:03,313 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 02:12:03,313 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 02:12:03,313 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:03,314 INFO ]: With dead ends: 203 [2018-06-22 02:12:03,314 INFO ]: Without dead ends: 203 [2018-06-22 02:12:03,314 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:12:03,314 INFO ]: Start minimizeSevpa. Operand 203 states. [2018-06-22 02:12:03,318 INFO ]: Finished minimizeSevpa. Reduced states from 203 to 90. [2018-06-22 02:12:03,318 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-22 02:12:03,318 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 182 transitions. [2018-06-22 02:12:03,318 INFO ]: Start accepts. Automaton has 90 states and 182 transitions. Word has length 17 [2018-06-22 02:12:03,318 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:03,318 INFO ]: Abstraction has 90 states and 182 transitions. [2018-06-22 02:12:03,319 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:12:03,319 INFO ]: Start isEmpty. Operand 90 states and 182 transitions. [2018-06-22 02:12:03,319 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 02:12:03,319 INFO ]: Found error trace [2018-06-22 02:12:03,319 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:03,319 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:03,319 INFO ]: Analyzing trace with hash 574020358, now seen corresponding path program 1 times [2018-06-22 02:12:03,319 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:03,319 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:03,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:03,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:03,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:03,334 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:03,514 INFO ]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:03,514 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:12:03,514 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 02:12:03,514 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:12:03,514 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:12:03,514 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:12:03,514 INFO ]: Start difference. First operand 90 states and 182 transitions. Second operand 13 states. [2018-06-22 02:12:03,591 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:03,591 INFO ]: Finished difference Result 263 states and 489 transitions. [2018-06-22 02:12:03,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 02:12:03,591 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-22 02:12:03,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:03,591 INFO ]: With dead ends: 263 [2018-06-22 02:12:03,591 INFO ]: Without dead ends: 78 [2018-06-22 02:12:03,591 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:12:03,592 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 02:12:03,593 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 65. [2018-06-22 02:12:03,593 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 02:12:03,594 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2018-06-22 02:12:03,594 INFO ]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 18 [2018-06-22 02:12:03,594 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:03,594 INFO ]: Abstraction has 65 states and 123 transitions. [2018-06-22 02:12:03,594 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:12:03,594 INFO ]: Start isEmpty. Operand 65 states and 123 transitions. [2018-06-22 02:12:03,594 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 02:12:03,594 INFO ]: Found error trace [2018-06-22 02:12:03,595 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:03,595 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:03,595 INFO ]: Analyzing trace with hash 132730390, now seen corresponding path program 1 times [2018-06-22 02:12:03,595 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:03,595 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:03,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:03,595 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:03,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:03,611 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:03,662 INFO ]: Checked inductivity of 66 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 02:12:03,663 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:12:03,663 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:12:03,663 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:12:03,663 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:12:03,663 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:12:03,663 INFO ]: Start difference. First operand 65 states and 123 transitions. Second operand 3 states. [2018-06-22 02:12:03,670 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:03,670 INFO ]: Finished difference Result 65 states and 75 transitions. [2018-06-22 02:12:03,670 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:12:03,670 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-22 02:12:03,670 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:03,671 INFO ]: With dead ends: 65 [2018-06-22 02:12:03,671 INFO ]: Without dead ends: 20 [2018-06-22 02:12:03,671 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:12:03,671 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 02:12:03,672 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-06-22 02:12:03,672 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 02:12:03,672 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-22 02:12:03,672 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2018-06-22 02:12:03,672 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:03,672 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-22 02:12:03,672 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:12:03,672 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-22 02:12:03,672 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 02:12:03,672 INFO ]: Found error trace [2018-06-22 02:12:03,672 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:03,672 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:03,672 INFO ]: Analyzing trace with hash -1065016694, now seen corresponding path program 2 times [2018-06-22 02:12:03,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:03,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:03,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:03,673 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:03,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:03,688 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:03,797 INFO ]: Checked inductivity of 66 backedges. 56 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:03,797 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:12:03,797 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 02:12:03,808 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:12:03,844 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:12:03,844 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:03,846 INFO ]: Computing forward predicates... [2018-06-22 02:12:04,036 INFO ]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:04,061 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:12:04,061 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 14 [2018-06-22 02:12:04,062 INFO ]: Interpolant automaton has 14 states [2018-06-22 02:12:04,062 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 02:12:04,062 INFO ]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:12:04,062 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 14 states. [2018-06-22 02:12:04,202 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:04,202 INFO ]: Finished difference Result 71 states and 82 transitions. [2018-06-22 02:12:04,202 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 02:12:04,202 INFO ]: Start accepts. Automaton has 14 states. Word has length 18 [2018-06-22 02:12:04,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:04,202 INFO ]: With dead ends: 71 [2018-06-22 02:12:04,202 INFO ]: Without dead ends: 0 [2018-06-22 02:12:04,202 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:12:04,202 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 02:12:04,202 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 02:12:04,202 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 02:12:04,202 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 02:12:04,202 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-06-22 02:12:04,202 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:04,202 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 02:12:04,202 INFO ]: Interpolant automaton has 14 states. [2018-06-22 02:12:04,202 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 02:12:04,202 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 02:12:04,206 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:12:04 BoogieIcfgContainer [2018-06-22 02:12:04,206 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:12:04,207 INFO ]: Toolchain (without parser) took 10842.36 ms. Allocated memory was 308.3 MB in the beginning and 410.5 MB in the end (delta: 102.2 MB). Free memory was 264.7 MB in the beginning and 298.4 MB in the end (delta: -33.7 MB). Peak memory consumption was 68.5 MB. Max. memory is 3.6 GB. [2018-06-22 02:12:04,208 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:12:04,208 INFO ]: ChcToBoogie took 65.21 ms. Allocated memory is still 308.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:12:04,208 INFO ]: Boogie Preprocessor took 37.70 ms. Allocated memory is still 308.3 MB. Free memory was 261.7 MB in the beginning and 260.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 02:12:04,209 INFO ]: RCFGBuilder took 368.57 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 251.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:12:04,209 INFO ]: TraceAbstraction took 10355.55 ms. Allocated memory was 308.3 MB in the beginning and 410.5 MB in the end (delta: 102.2 MB). Free memory was 251.7 MB in the beginning and 298.4 MB in the end (delta: -46.7 MB). Peak memory consumption was 55.5 MB. Max. memory is 3.6 GB. [2018-06-22 02:12:04,212 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 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 65.21 ms. Allocated memory is still 308.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.70 ms. Allocated memory is still 308.3 MB. Free memory was 261.7 MB in the beginning and 260.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 368.57 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 251.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 10355.55 ms. Allocated memory was 308.3 MB in the beginning and 410.5 MB in the end (delta: 102.2 MB). Free memory was 251.7 MB in the beginning and 298.4 MB in the end (delta: -46.7 MB). Peak memory consumption was 55.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. SAFE Result, 10.2s OverallTime, 26 OverallIterations, 10 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 267 SDtfs, 31 SDslu, 423 SDs, 0 SdLazy, 1103 SolverSat, 432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 243 SyntacticMatches, 4 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=21, 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, 26 MinimizatonAttempts, 745 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 527 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 18705 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1940 ConjunctsInSsa, 339 ConjunctsInUnsatCore, 44 InterpolantComputations, 11 PerfectInterpolantSequences, 475/970 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-12-04-223.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-12-04-223.csv Received shutdown request...