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/rec__cocome1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:29:41,945 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:29:41,948 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:29:41,961 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:29:41,961 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:29:41,962 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:29:41,963 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:29:41,969 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:29:41,970 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:29:41,972 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:29:41,973 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:29:41,973 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:29:41,974 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:29:41,975 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:29:41,978 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:29:41,979 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:29:41,981 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:29:41,991 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:29:41,993 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:29:41,994 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:29:41,995 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:29:42,000 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:29:42,000 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:29:42,001 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:29:42,002 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:29:42,002 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:29:42,003 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:29:42,004 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:29:42,005 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:29:42,005 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:29:42,010 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:29:42,011 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:29:42,011 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:29:42,012 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:29:42,012 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:29:42,013 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:29:42,038 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:29:42,038 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:29:42,038 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:29:42,038 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:29:42,039 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:29:42,040 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:29:42,040 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:29:42,040 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:29:42,040 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:29:42,040 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:29:42,041 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:29:42,041 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:29:42,042 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:29:42,042 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:29:42,042 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:29:42,042 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:29:42,042 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:29:42,044 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:29:42,044 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:29:42,097 INFO ]: Repository-Root is: /tmp [2018-06-22 02:29:42,113 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:29:42,118 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:29:42,120 INFO ]: Initializing SmtParser... [2018-06-22 02:29:42,120 INFO ]: SmtParser initialized [2018-06-22 02:29:42,121 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__cocome1.smt2 [2018-06-22 02:29:42,122 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:29:42,219 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__cocome1.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@2ae85bd9 [2018-06-22 02:29:42,461 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__cocome1.smt2 [2018-06-22 02:29:42,469 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:29:42,478 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:29:42,478 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:29:42,478 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:29:42,478 INFO ]: ChcToBoogie initialized [2018-06-22 02:29:42,482 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:29:42" (1/1) ... [2018-06-22 02:29:42,542 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:42 Unit [2018-06-22 02:29:42,542 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:29:42,543 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:29:42,543 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:29:42,543 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:29:42,569 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:42" (1/1) ... [2018-06-22 02:29:42,569 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:42" (1/1) ... [2018-06-22 02:29:42,576 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:42" (1/1) ... [2018-06-22 02:29:42,576 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:42" (1/1) ... [2018-06-22 02:29:42,581 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:42" (1/1) ... [2018-06-22 02:29:42,593 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:42" (1/1) ... [2018-06-22 02:29:42,594 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:42" (1/1) ... [2018-06-22 02:29:42,596 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:29:42,597 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:29:42,597 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:29:42,597 INFO ]: RCFGBuilder initialized [2018-06-22 02:29:42,598 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:42" (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:29:42,619 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:29:42,619 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:29:42,619 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:29:42,619 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:29:42,619 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:29:42,619 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:29:43,039 INFO ]: Using library mode [2018-06-22 02:29:43,040 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:29:43 BoogieIcfgContainer [2018-06-22 02:29:43,040 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:29:43,042 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:29:43,042 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:29:43,050 INFO ]: TraceAbstraction initialized [2018-06-22 02:29:43,050 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:29:42" (1/3) ... [2018-06-22 02:29:43,052 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6676ae46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:29:43, skipping insertion in model container [2018-06-22 02:29:43,052 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:42" (2/3) ... [2018-06-22 02:29:43,052 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6676ae46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:29:43, skipping insertion in model container [2018-06-22 02:29:43,052 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:29:43" (3/3) ... [2018-06-22 02:29:43,054 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:29:43,065 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:29:43,075 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:29:43,115 INFO ]: Using default assertion order modulation [2018-06-22 02:29:43,115 INFO ]: Interprodecural is true [2018-06-22 02:29:43,115 INFO ]: Hoare is false [2018-06-22 02:29:43,115 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:29:43,115 INFO ]: Backedges is TWOTRACK [2018-06-22 02:29:43,116 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:29:43,116 INFO ]: Difference is false [2018-06-22 02:29:43,116 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:29:43,116 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:29:43,131 INFO ]: Start isEmpty. Operand 28 states. [2018-06-22 02:29:43,143 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 02:29:43,143 INFO ]: Found error trace [2018-06-22 02:29:43,144 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:43,144 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:43,150 INFO ]: Analyzing trace with hash 1651176972, now seen corresponding path program 1 times [2018-06-22 02:29:43,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:43,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:43,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:43,203 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:43,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:43,235 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:43,324 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:29:43,326 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:43,326 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:29:43,328 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:29:43,339 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:29:43,339 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:29:43,341 INFO ]: Start difference. First operand 28 states. Second operand 4 states. [2018-06-22 02:29:43,899 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:43,899 INFO ]: Finished difference Result 49 states and 79 transitions. [2018-06-22 02:29:43,900 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:29:43,901 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-22 02:29:43,901 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:43,913 INFO ]: With dead ends: 49 [2018-06-22 02:29:43,913 INFO ]: Without dead ends: 49 [2018-06-22 02:29:43,915 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:29:43,934 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 02:29:43,964 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-22 02:29:43,965 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 02:29:43,968 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2018-06-22 02:29:43,970 INFO ]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 7 [2018-06-22 02:29:43,970 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:43,970 INFO ]: Abstraction has 49 states and 79 transitions. [2018-06-22 02:29:43,970 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:29:43,970 INFO ]: Start isEmpty. Operand 49 states and 79 transitions. [2018-06-22 02:29:43,972 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:29:43,972 INFO ]: Found error trace [2018-06-22 02:29:43,972 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:43,972 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:43,972 INFO ]: Analyzing trace with hash 1900691461, now seen corresponding path program 1 times [2018-06-22 02:29:43,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:43,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:43,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:43,973 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:43,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:43,978 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:44,011 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:29:44,011 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:44,011 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:29:44,013 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:29:44,013 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:29:44,013 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:29:44,013 INFO ]: Start difference. First operand 49 states and 79 transitions. Second operand 4 states. [2018-06-22 02:29:44,269 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:44,269 INFO ]: Finished difference Result 72 states and 117 transitions. [2018-06-22 02:29:44,269 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:29:44,269 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 02:29:44,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:44,275 INFO ]: With dead ends: 72 [2018-06-22 02:29:44,275 INFO ]: Without dead ends: 72 [2018-06-22 02:29:44,276 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:29:44,276 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 02:29:44,288 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-22 02:29:44,288 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 02:29:44,291 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 117 transitions. [2018-06-22 02:29:44,291 INFO ]: Start accepts. Automaton has 72 states and 117 transitions. Word has length 9 [2018-06-22 02:29:44,292 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:44,292 INFO ]: Abstraction has 72 states and 117 transitions. [2018-06-22 02:29:44,292 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:29:44,292 INFO ]: Start isEmpty. Operand 72 states and 117 transitions. [2018-06-22 02:29:44,292 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:29:44,292 INFO ]: Found error trace [2018-06-22 02:29:44,292 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:44,292 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:44,293 INFO ]: Analyzing trace with hash -883072120, now seen corresponding path program 1 times [2018-06-22 02:29:44,293 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:44,293 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:44,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:44,294 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:44,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:44,300 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:44,334 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:29:44,334 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:44,334 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:29:44,334 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:29:44,334 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:29:44,334 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:29:44,335 INFO ]: Start difference. First operand 72 states and 117 transitions. Second operand 4 states. [2018-06-22 02:29:44,546 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:44,546 INFO ]: Finished difference Result 95 states and 155 transitions. [2018-06-22 02:29:44,546 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:29:44,546 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 02:29:44,546 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:44,549 INFO ]: With dead ends: 95 [2018-06-22 02:29:44,549 INFO ]: Without dead ends: 95 [2018-06-22 02:29:44,549 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:29:44,549 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 02:29:44,563 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-06-22 02:29:44,564 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-22 02:29:44,567 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 155 transitions. [2018-06-22 02:29:44,567 INFO ]: Start accepts. Automaton has 95 states and 155 transitions. Word has length 10 [2018-06-22 02:29:44,567 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:44,567 INFO ]: Abstraction has 95 states and 155 transitions. [2018-06-22 02:29:44,567 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:29:44,567 INFO ]: Start isEmpty. Operand 95 states and 155 transitions. [2018-06-22 02:29:44,568 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:29:44,568 INFO ]: Found error trace [2018-06-22 02:29:44,568 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:44,568 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:44,568 INFO ]: Analyzing trace with hash -835260089, now seen corresponding path program 1 times [2018-06-22 02:29:44,568 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:44,568 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:44,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:44,570 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:44,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:44,579 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:44,617 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:29:44,617 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:44,617 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:29:44,618 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:29:44,618 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:29:44,618 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:29:44,618 INFO ]: Start difference. First operand 95 states and 155 transitions. Second operand 4 states. [2018-06-22 02:29:44,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:44,997 INFO ]: Finished difference Result 171 states and 320 transitions. [2018-06-22 02:29:45,000 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:29:45,000 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 02:29:45,000 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:45,006 INFO ]: With dead ends: 171 [2018-06-22 02:29:45,006 INFO ]: Without dead ends: 171 [2018-06-22 02:29:45,007 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:29:45,011 INFO ]: Start minimizeSevpa. Operand 171 states. [2018-06-22 02:29:45,032 INFO ]: Finished minimizeSevpa. Reduced states from 171 to 103. [2018-06-22 02:29:45,032 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 02:29:45,035 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 175 transitions. [2018-06-22 02:29:45,035 INFO ]: Start accepts. Automaton has 103 states and 175 transitions. Word has length 11 [2018-06-22 02:29:45,036 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:45,036 INFO ]: Abstraction has 103 states and 175 transitions. [2018-06-22 02:29:45,036 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:29:45,036 INFO ]: Start isEmpty. Operand 103 states and 175 transitions. [2018-06-22 02:29:45,037 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:29:45,037 INFO ]: Found error trace [2018-06-22 02:29:45,037 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:45,037 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:45,037 INFO ]: Analyzing trace with hash -125150684, now seen corresponding path program 1 times [2018-06-22 02:29:45,037 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:45,038 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:45,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:45,038 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:45,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:45,048 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:45,081 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:29:45,081 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:45,081 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:29:45,095 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:45,110 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:45,116 INFO ]: Computing forward predicates... [2018-06-22 02:29:45,256 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:29:45,290 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:29:45,290 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-06-22 02:29:45,290 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:29:45,291 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:29:45,291 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:29:45,291 INFO ]: Start difference. First operand 103 states and 175 transitions. Second operand 6 states. [2018-06-22 02:29:45,682 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:45,682 INFO ]: Finished difference Result 175 states and 324 transitions. [2018-06-22 02:29:45,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:29:45,683 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-22 02:29:45,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:45,687 INFO ]: With dead ends: 175 [2018-06-22 02:29:45,687 INFO ]: Without dead ends: 167 [2018-06-22 02:29:45,687 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:29:45,688 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-22 02:29:45,706 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 99. [2018-06-22 02:29:45,706 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-22 02:29:45,709 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 167 transitions. [2018-06-22 02:29:45,709 INFO ]: Start accepts. Automaton has 99 states and 167 transitions. Word has length 12 [2018-06-22 02:29:45,709 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:45,709 INFO ]: Abstraction has 99 states and 167 transitions. [2018-06-22 02:29:45,709 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:29:45,709 INFO ]: Start isEmpty. Operand 99 states and 167 transitions. [2018-06-22 02:29:45,711 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 02:29:45,711 INFO ]: Found error trace [2018-06-22 02:29:45,711 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:45,711 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:45,711 INFO ]: Analyzing trace with hash -376704030, now seen corresponding path program 1 times [2018-06-22 02:29:45,711 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:45,711 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:45,712 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:45,712 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:45,712 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:45,723 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:45,862 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:29:45,862 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:45,862 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:29:45,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:45,911 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:45,913 INFO ]: Computing forward predicates... [2018-06-22 02:29:45,987 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:29:46,008 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:29:46,008 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-06-22 02:29:46,009 INFO ]: Interpolant automaton has 9 states [2018-06-22 02:29:46,009 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 02:29:46,009 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:29:46,009 INFO ]: Start difference. First operand 99 states and 167 transitions. Second operand 9 states. [2018-06-22 02:29:46,337 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-22 02:29:47,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:47,145 INFO ]: Finished difference Result 209 states and 481 transitions. [2018-06-22 02:29:47,146 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:29:47,146 INFO ]: Start accepts. Automaton has 9 states. Word has length 19 [2018-06-22 02:29:47,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:47,150 INFO ]: With dead ends: 209 [2018-06-22 02:29:47,150 INFO ]: Without dead ends: 209 [2018-06-22 02:29:47,150 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:29:47,152 INFO ]: Start minimizeSevpa. Operand 209 states. [2018-06-22 02:29:47,208 INFO ]: Finished minimizeSevpa. Reduced states from 209 to 103. [2018-06-22 02:29:47,208 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 02:29:47,210 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 171 transitions. [2018-06-22 02:29:47,210 INFO ]: Start accepts. Automaton has 103 states and 171 transitions. Word has length 19 [2018-06-22 02:29:47,210 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:47,210 INFO ]: Abstraction has 103 states and 171 transitions. [2018-06-22 02:29:47,210 INFO ]: Interpolant automaton has 9 states. [2018-06-22 02:29:47,210 INFO ]: Start isEmpty. Operand 103 states and 171 transitions. [2018-06-22 02:29:47,212 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:29:47,212 INFO ]: Found error trace [2018-06-22 02:29:47,212 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:47,212 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:47,212 INFO ]: Analyzing trace with hash -1569964147, now seen corresponding path program 1 times [2018-06-22 02:29:47,212 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:47,212 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:47,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:47,218 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:47,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:47,227 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:47,322 INFO ]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:29:47,322 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:47,322 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:29:47,322 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:29:47,322 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:29:47,322 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:29:47,322 INFO ]: Start difference. First operand 103 states and 171 transitions. Second operand 3 states. [2018-06-22 02:29:47,380 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:47,380 INFO ]: Finished difference Result 42 states and 58 transitions. [2018-06-22 02:29:47,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:29:47,381 INFO ]: Start accepts. Automaton has 3 states. Word has length 20 [2018-06-22 02:29:47,381 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:47,381 INFO ]: With dead ends: 42 [2018-06-22 02:29:47,382 INFO ]: Without dead ends: 34 [2018-06-22 02:29:47,382 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:29:47,382 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 02:29:47,385 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-06-22 02:29:47,385 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 02:29:47,386 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2018-06-22 02:29:47,386 INFO ]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2018-06-22 02:29:47,386 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:47,386 INFO ]: Abstraction has 31 states and 41 transitions. [2018-06-22 02:29:47,386 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:29:47,386 INFO ]: Start isEmpty. Operand 31 states and 41 transitions. [2018-06-22 02:29:47,387 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:29:47,387 INFO ]: Found error trace [2018-06-22 02:29:47,387 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:47,387 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:47,387 INFO ]: Analyzing trace with hash 1205185257, now seen corresponding path program 1 times [2018-06-22 02:29:47,387 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:47,387 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:47,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:47,388 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:47,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:47,403 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:47,549 INFO ]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:29:47,549 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:47,549 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:29:47,556 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:47,575 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:47,578 INFO ]: Computing forward predicates... [2018-06-22 02:29:47,651 INFO ]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:29:47,673 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:47,674 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-22 02:29:47,674 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:29:47,674 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:29:47,674 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:29:47,674 INFO ]: Start difference. First operand 31 states and 41 transitions. Second operand 7 states. [2018-06-22 02:29:47,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:47,767 INFO ]: Finished difference Result 41 states and 55 transitions. [2018-06-22 02:29:47,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:29:47,768 INFO ]: Start accepts. Automaton has 7 states. Word has length 20 [2018-06-22 02:29:47,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:47,769 INFO ]: With dead ends: 41 [2018-06-22 02:29:47,769 INFO ]: Without dead ends: 41 [2018-06-22 02:29:47,769 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:29:47,769 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 02:29:47,772 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-06-22 02:29:47,772 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 02:29:47,773 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-06-22 02:29:47,773 INFO ]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 20 [2018-06-22 02:29:47,773 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:47,773 INFO ]: Abstraction has 37 states and 49 transitions. [2018-06-22 02:29:47,773 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:29:47,773 INFO ]: Start isEmpty. Operand 37 states and 49 transitions. [2018-06-22 02:29:47,774 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 02:29:47,774 INFO ]: Found error trace [2018-06-22 02:29:47,774 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:47,774 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:47,775 INFO ]: Analyzing trace with hash -1753586002, now seen corresponding path program 2 times [2018-06-22 02:29:47,775 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:47,775 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:47,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:47,775 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:47,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:47,792 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:47,876 INFO ]: Checked inductivity of 23 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 02:29:47,876 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:47,876 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:29:47,891 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:29:47,922 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:29:47,922 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:47,924 INFO ]: Computing forward predicates... [2018-06-22 02:29:47,950 INFO ]: Checked inductivity of 23 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 02:29:47,983 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:47,983 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 02:29:47,984 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:29:47,984 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:29:47,984 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:29:47,984 INFO ]: Start difference. First operand 37 states and 49 transitions. Second operand 7 states. [2018-06-22 02:29:48,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:48,424 INFO ]: Finished difference Result 45 states and 65 transitions. [2018-06-22 02:29:48,424 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 02:29:48,424 INFO ]: Start accepts. Automaton has 7 states. Word has length 28 [2018-06-22 02:29:48,424 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:48,425 INFO ]: With dead ends: 45 [2018-06-22 02:29:48,425 INFO ]: Without dead ends: 43 [2018-06-22 02:29:48,425 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:29:48,425 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 02:29:48,428 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-06-22 02:29:48,428 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 02:29:48,429 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2018-06-22 02:29:48,429 INFO ]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 28 [2018-06-22 02:29:48,429 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:48,429 INFO ]: Abstraction has 40 states and 53 transitions. [2018-06-22 02:29:48,429 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:29:48,429 INFO ]: Start isEmpty. Operand 40 states and 53 transitions. [2018-06-22 02:29:48,430 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 02:29:48,430 INFO ]: Found error trace [2018-06-22 02:29:48,430 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:48,430 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:48,430 INFO ]: Analyzing trace with hash 1804486009, now seen corresponding path program 3 times [2018-06-22 02:29:48,430 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:48,430 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:48,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:48,431 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:29:48,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:48,448 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:48,584 INFO ]: Checked inductivity of 27 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 02:29:48,584 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:48,584 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:29:48,591 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:29:48,623 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:29:48,623 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:48,626 INFO ]: Computing forward predicates... [2018-06-22 02:29:48,775 INFO ]: Checked inductivity of 27 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 02:29:48,799 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:48,800 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2018-06-22 02:29:48,800 INFO ]: Interpolant automaton has 15 states [2018-06-22 02:29:48,800 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 02:29:48,800 INFO ]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:29:48,800 INFO ]: Start difference. First operand 40 states and 53 transitions. Second operand 15 states. [2018-06-22 02:29:49,753 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:49,754 INFO ]: Finished difference Result 86 states and 130 transitions. [2018-06-22 02:29:49,754 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 02:29:49,754 INFO ]: Start accepts. Automaton has 15 states. Word has length 29 [2018-06-22 02:29:49,754 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:49,755 INFO ]: With dead ends: 86 [2018-06-22 02:29:49,755 INFO ]: Without dead ends: 84 [2018-06-22 02:29:49,756 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 02:29:49,756 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 02:29:49,760 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 63. [2018-06-22 02:29:49,760 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 02:29:49,761 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2018-06-22 02:29:49,761 INFO ]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 29 [2018-06-22 02:29:49,762 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:49,762 INFO ]: Abstraction has 63 states and 89 transitions. [2018-06-22 02:29:49,762 INFO ]: Interpolant automaton has 15 states. [2018-06-22 02:29:49,762 INFO ]: Start isEmpty. Operand 63 states and 89 transitions. [2018-06-22 02:29:49,763 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 02:29:49,763 INFO ]: Found error trace [2018-06-22 02:29:49,763 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:49,763 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:49,763 INFO ]: Analyzing trace with hash 102599730, now seen corresponding path program 4 times [2018-06-22 02:29:49,764 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:49,764 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:49,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:49,764 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:29:49,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:49,789 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:50,013 INFO ]: Checked inductivity of 32 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:29:50,013 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:50,039 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:29:50,057 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:29:50,094 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:29:50,094 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:50,097 INFO ]: Computing forward predicates... [2018-06-22 02:29:50,406 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 02:29:50,631 INFO ]: Checked inductivity of 32 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 02:29:50,653 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:50,653 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-06-22 02:29:50,653 INFO ]: Interpolant automaton has 15 states [2018-06-22 02:29:50,653 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 02:29:50,654 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:29:50,654 INFO ]: Start difference. First operand 63 states and 89 transitions. Second operand 15 states. [2018-06-22 02:29:51,731 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:51,731 INFO ]: Finished difference Result 114 states and 169 transitions. [2018-06-22 02:29:51,731 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 02:29:51,732 INFO ]: Start accepts. Automaton has 15 states. Word has length 30 [2018-06-22 02:29:51,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:51,733 INFO ]: With dead ends: 114 [2018-06-22 02:29:51,733 INFO ]: Without dead ends: 114 [2018-06-22 02:29:51,734 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2018-06-22 02:29:51,734 INFO ]: Start minimizeSevpa. Operand 114 states. [2018-06-22 02:29:51,740 INFO ]: Finished minimizeSevpa. Reduced states from 114 to 106. [2018-06-22 02:29:51,740 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-22 02:29:51,742 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 158 transitions. [2018-06-22 02:29:51,742 INFO ]: Start accepts. Automaton has 106 states and 158 transitions. Word has length 30 [2018-06-22 02:29:51,742 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:51,742 INFO ]: Abstraction has 106 states and 158 transitions. [2018-06-22 02:29:51,742 INFO ]: Interpolant automaton has 15 states. [2018-06-22 02:29:51,742 INFO ]: Start isEmpty. Operand 106 states and 158 transitions. [2018-06-22 02:29:51,744 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 02:29:51,744 INFO ]: Found error trace [2018-06-22 02:29:51,744 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:51,744 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:51,744 INFO ]: Analyzing trace with hash -272747020, now seen corresponding path program 1 times [2018-06-22 02:29:51,744 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:51,744 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:51,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:51,745 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:29:51,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:51,759 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:51,820 INFO ]: Checked inductivity of 58 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 02:29:51,821 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:51,821 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:29:51,821 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:29:51,821 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:29:51,821 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:29:51,821 INFO ]: Start difference. First operand 106 states and 158 transitions. Second operand 4 states. [2018-06-22 02:29:51,848 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:51,848 INFO ]: Finished difference Result 115 states and 167 transitions. [2018-06-22 02:29:51,849 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:29:51,849 INFO ]: Start accepts. Automaton has 4 states. Word has length 40 [2018-06-22 02:29:51,849 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:51,850 INFO ]: With dead ends: 115 [2018-06-22 02:29:51,850 INFO ]: Without dead ends: 100 [2018-06-22 02:29:51,850 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:29:51,850 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 02:29:51,855 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-06-22 02:29:51,855 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 02:29:51,857 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 140 transitions. [2018-06-22 02:29:51,857 INFO ]: Start accepts. Automaton has 100 states and 140 transitions. Word has length 40 [2018-06-22 02:29:51,857 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:51,857 INFO ]: Abstraction has 100 states and 140 transitions. [2018-06-22 02:29:51,857 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:29:51,857 INFO ]: Start isEmpty. Operand 100 states and 140 transitions. [2018-06-22 02:29:51,859 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 02:29:51,859 INFO ]: Found error trace [2018-06-22 02:29:51,859 INFO ]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:51,859 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:51,860 INFO ]: Analyzing trace with hash -280498638, now seen corresponding path program 5 times [2018-06-22 02:29:51,860 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:51,860 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:51,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:51,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:51,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:51,883 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:52,088 INFO ]: Checked inductivity of 107 backedges. 55 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 02:29:52,088 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:52,088 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:29:52,095 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:29:52,134 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 02:29:52,134 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:52,137 INFO ]: Computing forward predicates... [2018-06-22 02:29:52,238 INFO ]: Checked inductivity of 107 backedges. 69 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 02:29:52,260 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:52,260 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-06-22 02:29:52,261 INFO ]: Interpolant automaton has 17 states [2018-06-22 02:29:52,261 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 02:29:52,261 INFO ]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:29:52,261 INFO ]: Start difference. First operand 100 states and 140 transitions. Second operand 17 states. [2018-06-22 02:29:53,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:53,510 INFO ]: Finished difference Result 127 states and 188 transitions. [2018-06-22 02:29:53,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 02:29:53,511 INFO ]: Start accepts. Automaton has 17 states. Word has length 48 [2018-06-22 02:29:53,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:53,512 INFO ]: With dead ends: 127 [2018-06-22 02:29:53,512 INFO ]: Without dead ends: 127 [2018-06-22 02:29:53,513 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=395, Invalid=1957, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 02:29:53,513 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-22 02:29:53,519 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 115. [2018-06-22 02:29:53,519 INFO ]: Start removeUnreachable. Operand 115 states. [2018-06-22 02:29:53,520 INFO ]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2018-06-22 02:29:53,521 INFO ]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 48 [2018-06-22 02:29:53,521 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:53,521 INFO ]: Abstraction has 115 states and 171 transitions. [2018-06-22 02:29:53,521 INFO ]: Interpolant automaton has 17 states. [2018-06-22 02:29:53,521 INFO ]: Start isEmpty. Operand 115 states and 171 transitions. [2018-06-22 02:29:53,523 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-22 02:29:53,523 INFO ]: Found error trace [2018-06-22 02:29:53,523 INFO ]: trace histogram [7, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:53,523 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:53,523 INFO ]: Analyzing trace with hash 1028044136, now seen corresponding path program 6 times [2018-06-22 02:29:53,523 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:53,523 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:53,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:53,524 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:29:53,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:53,550 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:53,707 INFO ]: Checked inductivity of 128 backedges. 46 proven. 33 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 02:29:53,707 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:53,707 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:29:53,713 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:29:53,776 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 02:29:53,776 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:53,781 INFO ]: Computing forward predicates... [2018-06-22 02:29:54,284 INFO ]: Checked inductivity of 128 backedges. 61 proven. 41 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 02:29:54,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:54,304 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2018-06-22 02:29:54,305 INFO ]: Interpolant automaton has 26 states [2018-06-22 02:29:54,305 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 02:29:54,305 INFO ]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-06-22 02:29:54,305 INFO ]: Start difference. First operand 115 states and 171 transitions. Second operand 26 states. [2018-06-22 02:29:55,695 WARN ]: Spent 359.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-06-22 02:29:57,558 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:57,558 INFO ]: Finished difference Result 392 states and 787 transitions. [2018-06-22 02:29:57,558 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-22 02:29:57,558 INFO ]: Start accepts. Automaton has 26 states. Word has length 50 [2018-06-22 02:29:57,558 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:57,566 INFO ]: With dead ends: 392 [2018-06-22 02:29:57,566 INFO ]: Without dead ends: 392 [2018-06-22 02:29:57,567 INFO ]: 0 DeclaredPredicates, 120 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=894, Invalid=4656, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 02:29:57,568 INFO ]: Start minimizeSevpa. Operand 392 states. [2018-06-22 02:29:57,599 INFO ]: Finished minimizeSevpa. Reduced states from 392 to 272. [2018-06-22 02:29:57,599 INFO ]: Start removeUnreachable. Operand 272 states. [2018-06-22 02:29:57,604 INFO ]: Finished removeUnreachable. Reduced from 272 states to 272 states and 464 transitions. [2018-06-22 02:29:57,604 INFO ]: Start accepts. Automaton has 272 states and 464 transitions. Word has length 50 [2018-06-22 02:29:57,604 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:57,604 INFO ]: Abstraction has 272 states and 464 transitions. [2018-06-22 02:29:57,604 INFO ]: Interpolant automaton has 26 states. [2018-06-22 02:29:57,605 INFO ]: Start isEmpty. Operand 272 states and 464 transitions. [2018-06-22 02:29:57,608 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-22 02:29:57,608 INFO ]: Found error trace [2018-06-22 02:29:57,609 INFO ]: trace histogram [9, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:57,609 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:57,609 INFO ]: Analyzing trace with hash -2092009052, now seen corresponding path program 7 times [2018-06-22 02:29:57,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:57,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:57,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:57,609 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:29:57,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:57,648 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:57,937 INFO ]: Checked inductivity of 153 backedges. 57 proven. 40 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 02:29:57,937 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:57,937 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:29:57,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:57,977 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:57,982 INFO ]: Computing forward predicates... [2018-06-22 02:29:58,232 INFO ]: Checked inductivity of 153 backedges. 55 proven. 21 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-22 02:29:58,254 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:58,254 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 20 [2018-06-22 02:29:58,254 INFO ]: Interpolant automaton has 20 states [2018-06-22 02:29:58,254 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 02:29:58,254 INFO ]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:29:58,254 INFO ]: Start difference. First operand 272 states and 464 transitions. Second operand 20 states. [2018-06-22 02:29:59,647 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:59,647 INFO ]: Finished difference Result 409 states and 742 transitions. [2018-06-22 02:29:59,648 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 02:29:59,648 INFO ]: Start accepts. Automaton has 20 states. Word has length 52 [2018-06-22 02:29:59,648 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:59,654 INFO ]: With dead ends: 409 [2018-06-22 02:29:59,654 INFO ]: Without dead ends: 409 [2018-06-22 02:29:59,658 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=467, Invalid=1789, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 02:29:59,659 INFO ]: Start minimizeSevpa. Operand 409 states. [2018-06-22 02:29:59,691 INFO ]: Finished minimizeSevpa. Reduced states from 409 to 290. [2018-06-22 02:29:59,691 INFO ]: Start removeUnreachable. Operand 290 states. [2018-06-22 02:29:59,695 INFO ]: Finished removeUnreachable. Reduced from 290 states to 290 states and 488 transitions. [2018-06-22 02:29:59,695 INFO ]: Start accepts. Automaton has 290 states and 488 transitions. Word has length 52 [2018-06-22 02:29:59,695 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:59,695 INFO ]: Abstraction has 290 states and 488 transitions. [2018-06-22 02:29:59,695 INFO ]: Interpolant automaton has 20 states. [2018-06-22 02:29:59,695 INFO ]: Start isEmpty. Operand 290 states and 488 transitions. [2018-06-22 02:29:59,698 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 02:29:59,698 INFO ]: Found error trace [2018-06-22 02:29:59,699 INFO ]: trace histogram [10, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:59,699 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:59,699 INFO ]: Analyzing trace with hash -429662873, now seen corresponding path program 8 times [2018-06-22 02:29:59,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:59,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:59,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:59,699 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:59,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:59,738 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:00,639 INFO ]: Checked inductivity of 167 backedges. 82 proven. 41 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-06-22 02:30:00,639 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:00,639 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:30:00,645 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:30:00,681 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:30:00,682 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:00,686 INFO ]: Computing forward predicates... [2018-06-22 02:30:01,141 INFO ]: Checked inductivity of 167 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-22 02:30:01,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:01,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2018-06-22 02:30:01,162 INFO ]: Interpolant automaton has 27 states [2018-06-22 02:30:01,162 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 02:30:01,163 INFO ]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2018-06-22 02:30:01,163 INFO ]: Start difference. First operand 290 states and 488 transitions. Second operand 27 states. [2018-06-22 02:30:03,741 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-06-22 02:30:05,702 WARN ]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-06-22 02:30:06,402 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-06-22 02:30:07,651 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:07,651 INFO ]: Finished difference Result 660 states and 1119 transitions. [2018-06-22 02:30:07,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-06-22 02:30:07,652 INFO ]: Start accepts. Automaton has 27 states. Word has length 53 [2018-06-22 02:30:07,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:07,661 INFO ]: With dead ends: 660 [2018-06-22 02:30:07,661 INFO ]: Without dead ends: 644 [2018-06-22 02:30:07,663 INFO ]: 0 DeclaredPredicates, 141 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2529 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1092, Invalid=7098, Unknown=0, NotChecked=0, Total=8190 [2018-06-22 02:30:07,664 INFO ]: Start minimizeSevpa. Operand 644 states. [2018-06-22 02:30:07,733 INFO ]: Finished minimizeSevpa. Reduced states from 644 to 587. [2018-06-22 02:30:07,733 INFO ]: Start removeUnreachable. Operand 587 states. [2018-06-22 02:30:07,744 INFO ]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1020 transitions. [2018-06-22 02:30:07,744 INFO ]: Start accepts. Automaton has 587 states and 1020 transitions. Word has length 53 [2018-06-22 02:30:07,744 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:07,744 INFO ]: Abstraction has 587 states and 1020 transitions. [2018-06-22 02:30:07,744 INFO ]: Interpolant automaton has 27 states. [2018-06-22 02:30:07,744 INFO ]: Start isEmpty. Operand 587 states and 1020 transitions. [2018-06-22 02:30:07,750 INFO ]: Finished isEmpty. Found accepting run of length 87 [2018-06-22 02:30:07,750 INFO ]: Found error trace [2018-06-22 02:30:07,750 INFO ]: trace histogram [19, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:07,750 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:07,750 INFO ]: Analyzing trace with hash -20967091, now seen corresponding path program 9 times [2018-06-22 02:30:07,750 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:07,750 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:07,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:07,751 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:30:07,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:07,784 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:08,209 INFO ]: Checked inductivity of 533 backedges. 210 proven. 115 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-06-22 02:30:08,210 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:08,210 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:30:08,216 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:30:08,278 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 02:30:08,278 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:08,283 INFO ]: Computing forward predicates... [2018-06-22 02:30:09,122 INFO ]: Checked inductivity of 533 backedges. 286 proven. 30 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-06-22 02:30:09,157 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:09,157 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 28 [2018-06-22 02:30:09,157 INFO ]: Interpolant automaton has 28 states [2018-06-22 02:30:09,158 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 02:30:09,158 INFO ]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2018-06-22 02:30:09,158 INFO ]: Start difference. First operand 587 states and 1020 transitions. Second operand 28 states. [2018-06-22 02:30:10,569 WARN ]: Spent 163.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2018-06-22 02:30:11,828 WARN ]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 02:30:13,987 WARN ]: Spent 207.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-06-22 02:30:15,898 WARN ]: Spent 262.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-06-22 02:30:16,463 WARN ]: Spent 261.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-06-22 02:30:16,866 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2018-06-22 02:30:17,701 WARN ]: Spent 243.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-06-22 02:30:19,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:19,069 INFO ]: Finished difference Result 2245 states and 6103 transitions. [2018-06-22 02:30:19,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-06-22 02:30:19,069 INFO ]: Start accepts. Automaton has 28 states. Word has length 86 [2018-06-22 02:30:19,070 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:19,127 INFO ]: With dead ends: 2245 [2018-06-22 02:30:19,127 INFO ]: Without dead ends: 2239 [2018-06-22 02:30:19,133 INFO ]: 0 DeclaredPredicates, 240 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7625 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1938, Invalid=19818, Unknown=0, NotChecked=0, Total=21756 [2018-06-22 02:30:19,135 INFO ]: Start minimizeSevpa. Operand 2239 states. [2018-06-22 02:30:19,372 INFO ]: Finished minimizeSevpa. Reduced states from 2239 to 1189. [2018-06-22 02:30:19,372 INFO ]: Start removeUnreachable. Operand 1189 states. [2018-06-22 02:30:19,390 INFO ]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 2268 transitions. [2018-06-22 02:30:19,390 INFO ]: Start accepts. Automaton has 1189 states and 2268 transitions. Word has length 86 [2018-06-22 02:30:19,390 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:19,390 INFO ]: Abstraction has 1189 states and 2268 transitions. [2018-06-22 02:30:19,390 INFO ]: Interpolant automaton has 28 states. [2018-06-22 02:30:19,390 INFO ]: Start isEmpty. Operand 1189 states and 2268 transitions. [2018-06-22 02:30:19,400 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 02:30:19,401 INFO ]: Found error trace [2018-06-22 02:30:19,401 INFO ]: trace histogram [22, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:19,401 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:19,401 INFO ]: Analyzing trace with hash 1336191864, now seen corresponding path program 10 times [2018-06-22 02:30:19,401 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:19,401 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:19,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:19,402 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:30:19,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:19,436 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:20,279 INFO ]: Checked inductivity of 617 backedges. 161 proven. 115 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2018-06-22 02:30:20,279 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:20,279 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:30:20,285 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:30:20,346 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:30:20,346 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:20,358 INFO ]: Computing forward predicates... [2018-06-22 02:30:20,639 INFO ]: Checked inductivity of 617 backedges. 356 proven. 45 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-06-22 02:30:20,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:20,663 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 26 [2018-06-22 02:30:20,663 INFO ]: Interpolant automaton has 26 states [2018-06-22 02:30:20,664 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 02:30:20,664 INFO ]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2018-06-22 02:30:20,664 INFO ]: Start difference. First operand 1189 states and 2268 transitions. Second operand 26 states. [2018-06-22 02:30:24,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:24,833 INFO ]: Finished difference Result 1664 states and 3882 transitions. [2018-06-22 02:30:24,835 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-06-22 02:30:24,835 INFO ]: Start accepts. Automaton has 26 states. Word has length 89 [2018-06-22 02:30:24,835 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:24,870 INFO ]: With dead ends: 1664 [2018-06-22 02:30:24,870 INFO ]: Without dead ends: 1664 [2018-06-22 02:30:24,872 INFO ]: 0 DeclaredPredicates, 191 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2666 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1686, Invalid=9234, Unknown=0, NotChecked=0, Total=10920 [2018-06-22 02:30:24,873 INFO ]: Start minimizeSevpa. Operand 1664 states. [2018-06-22 02:30:25,001 INFO ]: Finished minimizeSevpa. Reduced states from 1664 to 1313. [2018-06-22 02:30:25,001 INFO ]: Start removeUnreachable. Operand 1313 states. [2018-06-22 02:30:25,022 INFO ]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 2535 transitions. [2018-06-22 02:30:25,022 INFO ]: Start accepts. Automaton has 1313 states and 2535 transitions. Word has length 89 [2018-06-22 02:30:25,022 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:25,022 INFO ]: Abstraction has 1313 states and 2535 transitions. [2018-06-22 02:30:25,022 INFO ]: Interpolant automaton has 26 states. [2018-06-22 02:30:25,022 INFO ]: Start isEmpty. Operand 1313 states and 2535 transitions. [2018-06-22 02:30:25,041 INFO ]: Finished isEmpty. Found accepting run of length 93 [2018-06-22 02:30:25,041 INFO ]: Found error trace [2018-06-22 02:30:25,041 INFO ]: trace histogram [25, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:25,041 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:25,041 INFO ]: Analyzing trace with hash 1070974857, now seen corresponding path program 11 times [2018-06-22 02:30:25,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:25,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:25,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:25,041 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:30:25,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:25,327 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:25,810 INFO ]: Checked inductivity of 710 backedges. 196 proven. 126 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-06-22 02:30:25,810 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:25,810 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:30:25,818 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:30:25,896 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 02:30:25,896 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:25,902 INFO ]: Computing forward predicates... [2018-06-22 02:30:26,861 INFO ]: Checked inductivity of 710 backedges. 183 proven. 131 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-06-22 02:30:26,882 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:26,882 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 39 [2018-06-22 02:30:26,882 INFO ]: Interpolant automaton has 39 states [2018-06-22 02:30:26,883 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 02:30:26,883 INFO ]: CoverageRelationStatistics Valid=88, Invalid=1393, Unknown=1, NotChecked=0, Total=1482 [2018-06-22 02:30:26,883 INFO ]: Start difference. First operand 1313 states and 2535 transitions. Second operand 39 states. [2018-06-22 02:30:36,618 WARN ]: Spent 651.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2018-06-22 02:30:41,065 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:41,065 INFO ]: Finished difference Result 3185 states and 9294 transitions. [2018-06-22 02:30:41,065 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-06-22 02:30:41,065 INFO ]: Start accepts. Automaton has 39 states. Word has length 92 [2018-06-22 02:30:41,066 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:41,174 INFO ]: With dead ends: 3185 [2018-06-22 02:30:41,174 INFO ]: Without dead ends: 3174 [2018-06-22 02:30:41,177 INFO ]: 0 DeclaredPredicates, 209 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4003 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1700, Invalid=14793, Unknown=19, NotChecked=0, Total=16512 [2018-06-22 02:30:41,179 INFO ]: Start minimizeSevpa. Operand 3174 states. [2018-06-22 02:30:41,454 INFO ]: Finished minimizeSevpa. Reduced states from 3174 to 2457. [2018-06-22 02:30:41,454 INFO ]: Start removeUnreachable. Operand 2457 states. [2018-06-22 02:30:41,510 INFO ]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 4548 transitions. [2018-06-22 02:30:41,510 INFO ]: Start accepts. Automaton has 2457 states and 4548 transitions. Word has length 92 [2018-06-22 02:30:41,512 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:41,512 INFO ]: Abstraction has 2457 states and 4548 transitions. [2018-06-22 02:30:41,512 INFO ]: Interpolant automaton has 39 states. [2018-06-22 02:30:41,512 INFO ]: Start isEmpty. Operand 2457 states and 4548 transitions. [2018-06-22 02:30:41,543 INFO ]: Finished isEmpty. Found accepting run of length 95 [2018-06-22 02:30:41,543 INFO ]: Found error trace [2018-06-22 02:30:41,543 INFO ]: trace histogram [27, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:41,543 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:41,543 INFO ]: Analyzing trace with hash -321970505, now seen corresponding path program 12 times [2018-06-22 02:30:41,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:41,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:41,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:41,545 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:30:41,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:41,583 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:41,902 INFO ]: Checked inductivity of 777 backedges. 260 proven. 110 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2018-06-22 02:30:41,902 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:41,902 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:30:41,908 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:30:41,960 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 02:30:41,960 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:41,963 INFO ]: Computing forward predicates... [2018-06-22 02:30:42,066 INFO ]: Checked inductivity of 777 backedges. 211 proven. 5 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-06-22 02:30:42,087 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:42,087 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2018-06-22 02:30:42,087 INFO ]: Interpolant automaton has 20 states [2018-06-22 02:30:42,088 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 02:30:42,088 INFO ]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:30:42,088 INFO ]: Start difference. First operand 2457 states and 4548 transitions. Second operand 20 states. [2018-06-22 02:30:42,244 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:42,244 INFO ]: Finished difference Result 1458 states and 2592 transitions. [2018-06-22 02:30:42,244 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 02:30:42,244 INFO ]: Start accepts. Automaton has 20 states. Word has length 94 [2018-06-22 02:30:42,244 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:42,273 INFO ]: With dead ends: 1458 [2018-06-22 02:30:42,273 INFO ]: Without dead ends: 1449 [2018-06-22 02:30:42,273 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:30:42,273 INFO ]: Start minimizeSevpa. Operand 1449 states. [2018-06-22 02:30:42,357 INFO ]: Finished minimizeSevpa. Reduced states from 1449 to 1447. [2018-06-22 02:30:42,357 INFO ]: Start removeUnreachable. Operand 1447 states. [2018-06-22 02:30:42,442 INFO ]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2572 transitions. [2018-06-22 02:30:42,442 INFO ]: Start accepts. Automaton has 1447 states and 2572 transitions. Word has length 94 [2018-06-22 02:30:42,442 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:42,442 INFO ]: Abstraction has 1447 states and 2572 transitions. [2018-06-22 02:30:42,442 INFO ]: Interpolant automaton has 20 states. [2018-06-22 02:30:42,442 INFO ]: Start isEmpty. Operand 1447 states and 2572 transitions. [2018-06-22 02:30:42,447 INFO ]: Finished isEmpty. Found accepting run of length 107 [2018-06-22 02:30:42,447 INFO ]: Found error trace [2018-06-22 02:30:42,447 INFO ]: trace histogram [31, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:42,448 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:42,449 INFO ]: Analyzing trace with hash 1344339730, now seen corresponding path program 13 times [2018-06-22 02:30:42,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:42,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:42,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:42,449 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:30:42,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:42,487 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:42,889 INFO ]: Checked inductivity of 1016 backedges. 425 proven. 166 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2018-06-22 02:30:42,889 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:42,889 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:30:42,896 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:42,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:42,986 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-22 02:30:43,113 INFO ]: Timeout while computing interpolants [2018-06-22 02:30:43,314 WARN ]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:30:43,314 WARN ]: Verification canceled [2018-06-22 02:30:43,317 WARN ]: Timeout [2018-06-22 02:30:43,318 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:30:43 BoogieIcfgContainer [2018-06-22 02:30:43,318 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:30:43,318 INFO ]: Toolchain (without parser) took 60848.43 ms. Allocated memory was 307.8 MB in the beginning and 803.7 MB in the end (delta: 496.0 MB). Free memory was 263.2 MB in the beginning and 569.1 MB in the end (delta: -305.9 MB). Peak memory consumption was 190.1 MB. Max. memory is 3.6 GB. [2018-06-22 02:30:43,319 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:30:43,319 INFO ]: ChcToBoogie took 64.04 ms. Allocated memory is still 307.8 MB. Free memory was 262.2 MB in the beginning and 260.2 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:30:43,320 INFO ]: Boogie Preprocessor took 53.49 ms. Allocated memory is still 307.8 MB. Free memory was 260.2 MB in the beginning and 259.2 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:30:43,320 INFO ]: RCFGBuilder took 443.32 ms. Allocated memory is still 307.8 MB. Free memory was 259.2 MB in the beginning and 247.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:30:43,320 INFO ]: TraceAbstraction took 60276.15 ms. Allocated memory was 307.8 MB in the beginning and 803.7 MB in the end (delta: 496.0 MB). Free memory was 246.1 MB in the beginning and 569.1 MB in the end (delta: -322.9 MB). Peak memory consumption was 173.1 MB. Max. memory is 3.6 GB. [2018-06-22 02:30:43,323 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.04 ms. Allocated memory is still 307.8 MB. Free memory was 262.2 MB in the beginning and 260.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 53.49 ms. Allocated memory is still 307.8 MB. Free memory was 260.2 MB in the beginning and 259.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 443.32 ms. Allocated memory is still 307.8 MB. Free memory was 259.2 MB in the beginning and 247.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 60276.15 ms. Allocated memory was 307.8 MB in the beginning and 803.7 MB in the end (delta: 496.0 MB). Free memory was 246.1 MB in the beginning and 569.1 MB in the end (delta: -322.9 MB). Peak memory consumption was 173.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 31, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. TIMEOUT Result, 60.2s OverallTime, 21 OverallIterations, 31 TraceHistogramMax, 46.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 800 SDtfs, 1616 SDslu, 4687 SDs, 0 SdLazy, 14813 SolverSat, 2028 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 17.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1456 GetRequests, 682 SyntacticMatches, 11 SemanticMatches, 763 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19121 ImplicationChecksByTransitivity, 34.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2457occurred in iteration=19, 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: 1.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 2709 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 1501 NumberOfCodeBlocks, 1417 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1467 ConstructedInterpolants, 9 QuantifiedInterpolants, 281730 SizeOfPredicates, 78 NumberOfNonLiveVariables, 4244 ConjunctsInSsa, 451 ConjunctsInUnsatCore, 34 InterpolantComputations, 8 PerfectInterpolantSequences, 5706/6641 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__cocome1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-30-43-345.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__cocome1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-30-43-345.csv Completed graceful shutdown