java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/dotprod_lin.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:24:47,238 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:24:47,240 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:24:47,254 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:24:47,254 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:24:47,255 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:24:47,256 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:24:47,258 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:24:47,260 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:24:47,260 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:24:47,262 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:24:47,262 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:24:47,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:24:47,264 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:24:47,266 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:24:47,267 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:24:47,269 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:24:47,278 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:24:47,280 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:24:47,281 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:24:47,282 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:24:47,284 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:24:47,288 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:24:47,288 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:24:47,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:24:47,289 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:24:47,290 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:24:47,292 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:24:47,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:24:47,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:24:47,293 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:24:47,294 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:24:47,294 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:24:47,300 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:24:47,301 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:24:47,301 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:24:47,323 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:24:47,323 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:24:47,323 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:24:47,324 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:24:47,324 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:24:47,325 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:24:47,325 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:24:47,325 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:24:47,325 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:24:47,326 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:24:47,328 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:24:47,328 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:24:47,329 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:24:47,329 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:24:47,329 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:24:47,329 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:24:47,329 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:24:47,330 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:24:47,330 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:24:47,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:24:47,330 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:24:47,331 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:24:47,332 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:24:47,384 INFO ]: Repository-Root is: /tmp [2018-06-25 09:24:47,397 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:24:47,405 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:24:47,406 INFO ]: Initializing SmtParser... [2018-06-25 09:24:47,407 INFO ]: SmtParser initialized [2018-06-25 09:24:47,407 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/dotprod_lin.smt2 [2018-06-25 09:24:47,408 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-25 09:24:47,484 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/dotprod_lin.smt2 unknown [2018-06-25 09:24:47,753 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/dotprod_lin.smt2 [2018-06-25 09:24:47,759 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:24:47,765 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:24:47,765 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:24:47,765 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:24:47,765 INFO ]: ChcToBoogie initialized [2018-06-25 09:24:47,768 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,839 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47 Unit [2018-06-25 09:24:47,839 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:24:47,840 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:24:47,840 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:24:47,840 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:24:47,861 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,861 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,869 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,869 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,883 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,886 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,888 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,890 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:24:47,890 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:24:47,890 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:24:47,890 INFO ]: RCFGBuilder initialized [2018-06-25 09:24:47,903 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (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-25 09:24:47,918 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:24:47,918 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:24:47,918 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:24:47,918 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:24:47,918 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:24:47,918 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-25 09:24:48,443 INFO ]: Using library mode [2018-06-25 09:24:48,447 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:24:48 BoogieIcfgContainer [2018-06-25 09:24:48,447 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:24:48,448 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:24:48,448 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:24:48,451 INFO ]: TraceAbstraction initialized [2018-06-25 09:24:48,451 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:24:47" (1/3) ... [2018-06-25 09:24:48,452 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b260aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:24:48, skipping insertion in model container [2018-06-25 09:24:48,453 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (2/3) ... [2018-06-25 09:24:48,453 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b260aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:24:48, skipping insertion in model container [2018-06-25 09:24:48,453 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:24:48" (3/3) ... [2018-06-25 09:24:48,456 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:24:48,464 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:24:48,474 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:24:48,529 INFO ]: Using default assertion order modulation [2018-06-25 09:24:48,529 INFO ]: Interprodecural is true [2018-06-25 09:24:48,529 INFO ]: Hoare is false [2018-06-25 09:24:48,529 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:24:48,529 INFO ]: Backedges is TWOTRACK [2018-06-25 09:24:48,529 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:24:48,529 INFO ]: Difference is false [2018-06-25 09:24:48,529 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:24:48,529 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:24:48,554 INFO ]: Start isEmpty. Operand 54 states. [2018-06-25 09:24:48,573 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:24:48,573 INFO ]: Found error trace [2018-06-25 09:24:48,574 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:48,574 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:48,581 INFO ]: Analyzing trace with hash -1923602570, now seen corresponding path program 1 times [2018-06-25 09:24:48,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:48,584 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:48,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:48,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:48,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:48,672 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:48,762 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:24:48,764 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:24:48,764 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:24:48,766 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:24:48,777 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:24:48,778 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:24:48,781 INFO ]: Start difference. First operand 54 states. Second operand 4 states. [2018-06-25 09:24:50,063 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:50,063 INFO ]: Finished difference Result 98 states and 165 transitions. [2018-06-25 09:24:50,064 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:24:50,065 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-25 09:24:50,065 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:50,083 INFO ]: With dead ends: 98 [2018-06-25 09:24:50,084 INFO ]: Without dead ends: 98 [2018-06-25 09:24:50,085 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-25 09:24:50,101 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-25 09:24:50,146 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-06-25 09:24:50,147 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-25 09:24:50,154 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 165 transitions. [2018-06-25 09:24:50,155 INFO ]: Start accepts. Automaton has 98 states and 165 transitions. Word has length 10 [2018-06-25 09:24:50,155 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:50,155 INFO ]: Abstraction has 98 states and 165 transitions. [2018-06-25 09:24:50,155 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:24:50,155 INFO ]: Start isEmpty. Operand 98 states and 165 transitions. [2018-06-25 09:24:50,159 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:24:50,159 INFO ]: Found error trace [2018-06-25 09:24:50,159 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:50,159 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:50,159 INFO ]: Analyzing trace with hash -1596161480, now seen corresponding path program 1 times [2018-06-25 09:24:50,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:50,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:50,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:50,160 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:50,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:50,167 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:50,245 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:24:50,245 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:24:50,245 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:24:50,247 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:24:50,247 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:24:50,247 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:24:50,247 INFO ]: Start difference. First operand 98 states and 165 transitions. Second operand 4 states. [2018-06-25 09:24:50,796 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:50,796 INFO ]: Finished difference Result 144 states and 244 transitions. [2018-06-25 09:24:50,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:24:50,797 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-25 09:24:50,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:50,807 INFO ]: With dead ends: 144 [2018-06-25 09:24:50,807 INFO ]: Without dead ends: 144 [2018-06-25 09:24:50,808 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-25 09:24:50,808 INFO ]: Start minimizeSevpa. Operand 144 states. [2018-06-25 09:24:50,847 INFO ]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-06-25 09:24:50,847 INFO ]: Start removeUnreachable. Operand 144 states. [2018-06-25 09:24:50,858 INFO ]: Finished removeUnreachable. Reduced from 144 states to 144 states and 244 transitions. [2018-06-25 09:24:50,859 INFO ]: Start accepts. Automaton has 144 states and 244 transitions. Word has length 12 [2018-06-25 09:24:50,859 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:50,859 INFO ]: Abstraction has 144 states and 244 transitions. [2018-06-25 09:24:50,859 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:24:50,859 INFO ]: Start isEmpty. Operand 144 states and 244 transitions. [2018-06-25 09:24:50,864 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:24:50,864 INFO ]: Found error trace [2018-06-25 09:24:50,864 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:50,864 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:50,864 INFO ]: Analyzing trace with hash -1265733784, now seen corresponding path program 1 times [2018-06-25 09:24:50,864 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:50,864 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:50,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:50,865 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:50,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:50,882 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:51,030 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:24:51,031 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:24:51,031 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:24:51,031 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:24:51,031 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:24:51,031 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:24:51,031 INFO ]: Start difference. First operand 144 states and 244 transitions. Second operand 4 states. [2018-06-25 09:24:51,523 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:51,523 INFO ]: Finished difference Result 190 states and 323 transitions. [2018-06-25 09:24:51,523 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:24:51,523 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-25 09:24:51,523 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:51,531 INFO ]: With dead ends: 190 [2018-06-25 09:24:51,531 INFO ]: Without dead ends: 190 [2018-06-25 09:24:51,531 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:24:51,532 INFO ]: Start minimizeSevpa. Operand 190 states. [2018-06-25 09:24:51,555 INFO ]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-06-25 09:24:51,555 INFO ]: Start removeUnreachable. Operand 190 states. [2018-06-25 09:24:51,559 INFO ]: Finished removeUnreachable. Reduced from 190 states to 190 states and 323 transitions. [2018-06-25 09:24:51,559 INFO ]: Start accepts. Automaton has 190 states and 323 transitions. Word has length 13 [2018-06-25 09:24:51,559 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:51,559 INFO ]: Abstraction has 190 states and 323 transitions. [2018-06-25 09:24:51,559 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:24:51,559 INFO ]: Start isEmpty. Operand 190 states and 323 transitions. [2018-06-25 09:24:51,562 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:24:51,562 INFO ]: Found error trace [2018-06-25 09:24:51,562 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:51,562 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:51,563 INFO ]: Analyzing trace with hash 1129891650, now seen corresponding path program 1 times [2018-06-25 09:24:51,563 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:51,563 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:51,563 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:51,564 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:51,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:51,577 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:51,765 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:24:51,765 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:24:51,765 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:24:51,765 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:24:51,765 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:24:51,765 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:24:51,765 INFO ]: Start difference. First operand 190 states and 323 transitions. Second operand 5 states. [2018-06-25 09:24:52,670 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:52,670 INFO ]: Finished difference Result 814 states and 2733 transitions. [2018-06-25 09:24:52,670 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:24:52,670 INFO ]: Start accepts. Automaton has 5 states. Word has length 15 [2018-06-25 09:24:52,671 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:52,774 INFO ]: With dead ends: 814 [2018-06-25 09:24:52,774 INFO ]: Without dead ends: 814 [2018-06-25 09:24:52,774 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:24:52,777 INFO ]: Start minimizeSevpa. Operand 814 states. [2018-06-25 09:24:52,975 INFO ]: Finished minimizeSevpa. Reduced states from 814 to 202. [2018-06-25 09:24:52,975 INFO ]: Start removeUnreachable. Operand 202 states. [2018-06-25 09:24:52,979 INFO ]: Finished removeUnreachable. Reduced from 202 states to 202 states and 347 transitions. [2018-06-25 09:24:52,979 INFO ]: Start accepts. Automaton has 202 states and 347 transitions. Word has length 15 [2018-06-25 09:24:52,979 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:52,979 INFO ]: Abstraction has 202 states and 347 transitions. [2018-06-25 09:24:52,979 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:24:52,979 INFO ]: Start isEmpty. Operand 202 states and 347 transitions. [2018-06-25 09:24:52,984 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-25 09:24:52,984 INFO ]: Found error trace [2018-06-25 09:24:52,984 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:52,984 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:52,984 INFO ]: Analyzing trace with hash 482753252, now seen corresponding path program 1 times [2018-06-25 09:24:52,985 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:52,985 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:52,985 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:52,985 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:52,985 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:52,998 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:53,144 INFO ]: Checked inductivity of 21 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:24:53,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:53,144 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-25 09:24:53,157 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:53,195 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:53,204 INFO ]: Computing forward predicates... [2018-06-25 09:24:53,230 INFO ]: Checked inductivity of 21 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:24:53,262 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:53,262 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:24:53,262 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:24:53,262 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:24:53,262 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:24:53,263 INFO ]: Start difference. First operand 202 states and 347 transitions. Second operand 4 states. [2018-06-25 09:24:54,732 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:54,732 INFO ]: Finished difference Result 254 states and 436 transitions. [2018-06-25 09:24:54,732 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:24:54,732 INFO ]: Start accepts. Automaton has 4 states. Word has length 33 [2018-06-25 09:24:54,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:54,748 INFO ]: With dead ends: 254 [2018-06-25 09:24:54,748 INFO ]: Without dead ends: 254 [2018-06-25 09:24:54,748 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:24:54,748 INFO ]: Start minimizeSevpa. Operand 254 states. [2018-06-25 09:24:54,776 INFO ]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-06-25 09:24:54,777 INFO ]: Start removeUnreachable. Operand 254 states. [2018-06-25 09:24:54,782 INFO ]: Finished removeUnreachable. Reduced from 254 states to 254 states and 436 transitions. [2018-06-25 09:24:54,782 INFO ]: Start accepts. Automaton has 254 states and 436 transitions. Word has length 33 [2018-06-25 09:24:54,782 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:54,782 INFO ]: Abstraction has 254 states and 436 transitions. [2018-06-25 09:24:54,782 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:24:54,782 INFO ]: Start isEmpty. Operand 254 states and 436 transitions. [2018-06-25 09:24:54,789 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 09:24:54,789 INFO ]: Found error trace [2018-06-25 09:24:54,790 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:54,790 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:54,790 INFO ]: Analyzing trace with hash 695131761, now seen corresponding path program 1 times [2018-06-25 09:24:54,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:54,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:54,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:54,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:54,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:54,813 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:54,921 INFO ]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:24:54,921 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:24:54,921 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:24:54,921 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:24:54,921 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:24:54,921 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:24:54,921 INFO ]: Start difference. First operand 254 states and 436 transitions. Second operand 4 states. [2018-06-25 09:24:55,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:55,233 INFO ]: Finished difference Result 344 states and 590 transitions. [2018-06-25 09:24:55,233 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:24:55,233 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-25 09:24:55,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:55,243 INFO ]: With dead ends: 344 [2018-06-25 09:24:55,243 INFO ]: Without dead ends: 306 [2018-06-25 09:24:55,243 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-25 09:24:55,244 INFO ]: Start minimizeSevpa. Operand 306 states. [2018-06-25 09:24:55,267 INFO ]: Finished minimizeSevpa. Reduced states from 306 to 306. [2018-06-25 09:24:55,267 INFO ]: Start removeUnreachable. Operand 306 states. [2018-06-25 09:24:55,272 INFO ]: Finished removeUnreachable. Reduced from 306 states to 306 states and 518 transitions. [2018-06-25 09:24:55,272 INFO ]: Start accepts. Automaton has 306 states and 518 transitions. Word has length 25 [2018-06-25 09:24:55,272 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:55,272 INFO ]: Abstraction has 306 states and 518 transitions. [2018-06-25 09:24:55,272 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:24:55,272 INFO ]: Start isEmpty. Operand 306 states and 518 transitions. [2018-06-25 09:24:55,278 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-25 09:24:55,278 INFO ]: Found error trace [2018-06-25 09:24:55,278 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:55,278 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:55,278 INFO ]: Analyzing trace with hash 843958302, now seen corresponding path program 1 times [2018-06-25 09:24:55,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:55,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:55,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:55,279 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:55,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:55,301 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:55,467 INFO ]: Checked inductivity of 24 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-25 09:24:55,467 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:55,467 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-25 09:24:55,480 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:55,519 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:55,523 INFO ]: Computing forward predicates... [2018-06-25 09:24:55,641 INFO ]: Checked inductivity of 24 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 09:24:55,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:55,663 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 11 [2018-06-25 09:24:55,663 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:24:55,663 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:24:55,663 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:24:55,663 INFO ]: Start difference. First operand 306 states and 518 transitions. Second operand 11 states. [2018-06-25 09:24:58,864 WARN ]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-25 09:25:06,643 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:06,643 INFO ]: Finished difference Result 2287 states and 12263 transitions. [2018-06-25 09:25:06,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 09:25:06,644 INFO ]: Start accepts. Automaton has 11 states. Word has length 40 [2018-06-25 09:25:06,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:06,972 INFO ]: With dead ends: 2287 [2018-06-25 09:25:06,972 INFO ]: Without dead ends: 2037 [2018-06-25 09:25:06,972 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:25:06,973 INFO ]: Start minimizeSevpa. Operand 2037 states. [2018-06-25 09:25:07,924 INFO ]: Finished minimizeSevpa. Reduced states from 2037 to 471. [2018-06-25 09:25:07,924 INFO ]: Start removeUnreachable. Operand 471 states. [2018-06-25 09:25:07,942 INFO ]: Finished removeUnreachable. Reduced from 471 states to 471 states and 979 transitions. [2018-06-25 09:25:07,943 INFO ]: Start accepts. Automaton has 471 states and 979 transitions. Word has length 40 [2018-06-25 09:25:07,943 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:07,943 INFO ]: Abstraction has 471 states and 979 transitions. [2018-06-25 09:25:07,943 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:25:07,943 INFO ]: Start isEmpty. Operand 471 states and 979 transitions. [2018-06-25 09:25:07,965 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-25 09:25:07,965 INFO ]: Found error trace [2018-06-25 09:25:07,965 INFO ]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:25:07,965 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:07,966 INFO ]: Analyzing trace with hash 1025396695, now seen corresponding path program 1 times [2018-06-25 09:25:07,966 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:07,966 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:07,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:07,967 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:07,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:07,989 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:08,122 INFO ]: Checked inductivity of 94 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-25 09:25:08,122 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:25:08,122 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-25 09:25:08,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:08,177 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:08,181 INFO ]: Computing forward predicates... [2018-06-25 09:25:08,191 INFO ]: Checked inductivity of 94 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-25 09:25:08,224 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:25:08,224 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:25:08,224 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:25:08,224 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:25:08,224 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:25:08,224 INFO ]: Start difference. First operand 471 states and 979 transitions. Second operand 4 states. [2018-06-25 09:25:08,414 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:08,414 INFO ]: Finished difference Result 568 states and 1061 transitions. [2018-06-25 09:25:08,414 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:25:08,414 INFO ]: Start accepts. Automaton has 4 states. Word has length 65 [2018-06-25 09:25:08,415 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:08,425 INFO ]: With dead ends: 568 [2018-06-25 09:25:08,425 INFO ]: Without dead ends: 490 [2018-06-25 09:25:08,425 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 67 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-25 09:25:08,426 INFO ]: Start minimizeSevpa. Operand 490 states. [2018-06-25 09:25:08,460 INFO ]: Finished minimizeSevpa. Reduced states from 490 to 481. [2018-06-25 09:25:08,460 INFO ]: Start removeUnreachable. Operand 481 states. [2018-06-25 09:25:08,471 INFO ]: Finished removeUnreachable. Reduced from 481 states to 481 states and 887 transitions. [2018-06-25 09:25:08,471 INFO ]: Start accepts. Automaton has 481 states and 887 transitions. Word has length 65 [2018-06-25 09:25:08,471 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:08,471 INFO ]: Abstraction has 481 states and 887 transitions. [2018-06-25 09:25:08,471 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:25:08,471 INFO ]: Start isEmpty. Operand 481 states and 887 transitions. [2018-06-25 09:25:08,488 INFO ]: Finished isEmpty. Found accepting run of length 87 [2018-06-25 09:25:08,488 INFO ]: Found error trace [2018-06-25 09:25:08,488 INFO ]: trace histogram [7, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:25:08,489 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:08,490 INFO ]: Analyzing trace with hash -1310676202, now seen corresponding path program 1 times [2018-06-25 09:25:08,490 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:08,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:08,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:08,490 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:08,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:08,555 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:09,015 INFO ]: Checked inductivity of 169 backedges. 23 proven. 36 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-25 09:25:09,015 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:25:09,015 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-25 09:25:09,063 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:09,126 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:09,132 INFO ]: Computing forward predicates... [2018-06-25 09:25:09,276 INFO ]: Checked inductivity of 169 backedges. 96 proven. 9 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-25 09:25:09,296 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:25:09,296 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 12 [2018-06-25 09:25:09,297 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:25:09,297 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:25:09,297 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:25:09,297 INFO ]: Start difference. First operand 481 states and 887 transitions. Second operand 12 states. [2018-06-25 09:25:13,965 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:13,966 INFO ]: Finished difference Result 2263 states and 10692 transitions. [2018-06-25 09:25:13,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 09:25:13,966 INFO ]: Start accepts. Automaton has 12 states. Word has length 86 [2018-06-25 09:25:13,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:14,181 INFO ]: With dead ends: 2263 [2018-06-25 09:25:14,181 INFO ]: Without dead ends: 2263 [2018-06-25 09:25:14,181 INFO ]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:25:14,183 INFO ]: Start minimizeSevpa. Operand 2263 states. [2018-06-25 09:25:14,602 INFO ]: Finished minimizeSevpa. Reduced states from 2263 to 547. [2018-06-25 09:25:14,602 INFO ]: Start removeUnreachable. Operand 547 states. [2018-06-25 09:25:14,610 INFO ]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1101 transitions. [2018-06-25 09:25:14,610 INFO ]: Start accepts. Automaton has 547 states and 1101 transitions. Word has length 86 [2018-06-25 09:25:14,611 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:14,611 INFO ]: Abstraction has 547 states and 1101 transitions. [2018-06-25 09:25:14,611 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:25:14,611 INFO ]: Start isEmpty. Operand 547 states and 1101 transitions. [2018-06-25 09:25:14,641 INFO ]: Finished isEmpty. Found accepting run of length 96 [2018-06-25 09:25:14,641 INFO ]: Found error trace [2018-06-25 09:25:14,641 INFO ]: trace histogram [8, 8, 8, 7, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:25:14,642 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:14,642 INFO ]: Analyzing trace with hash -1214741947, now seen corresponding path program 1 times [2018-06-25 09:25:14,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:14,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:14,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:14,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:14,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:14,678 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:14,842 INFO ]: Checked inductivity of 210 backedges. 23 proven. 48 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-06-25 09:25:14,842 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:25:14,842 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-25 09:25:14,848 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:14,950 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:14,954 INFO ]: Computing forward predicates... [2018-06-25 09:25:15,006 INFO ]: Checked inductivity of 210 backedges. 22 proven. 49 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-06-25 09:25:15,028 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:25:15,028 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-25 09:25:15,028 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:25:15,028 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:25:15,028 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:25:15,029 INFO ]: Start difference. First operand 547 states and 1101 transitions. Second operand 12 states. [2018-06-25 09:25:26,222 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:26,222 INFO ]: Finished difference Result 4245 states and 20041 transitions. [2018-06-25 09:25:26,223 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-06-25 09:25:26,223 INFO ]: Start accepts. Automaton has 12 states. Word has length 95 [2018-06-25 09:25:26,223 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:27,084 INFO ]: With dead ends: 4245 [2018-06-25 09:25:27,084 INFO ]: Without dead ends: 4245 [2018-06-25 09:25:27,086 INFO ]: 0 DeclaredPredicates, 218 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3495 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1016, Invalid=8296, Unknown=0, NotChecked=0, Total=9312 [2018-06-25 09:25:27,088 INFO ]: Start minimizeSevpa. Operand 4245 states. [2018-06-25 09:25:27,734 INFO ]: Finished minimizeSevpa. Reduced states from 4245 to 868. [2018-06-25 09:25:27,734 INFO ]: Start removeUnreachable. Operand 868 states. [2018-06-25 09:25:27,755 INFO ]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1741 transitions. [2018-06-25 09:25:27,755 INFO ]: Start accepts. Automaton has 868 states and 1741 transitions. Word has length 95 [2018-06-25 09:25:27,756 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:27,756 INFO ]: Abstraction has 868 states and 1741 transitions. [2018-06-25 09:25:27,756 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:25:27,756 INFO ]: Start isEmpty. Operand 868 states and 1741 transitions. [2018-06-25 09:25:27,797 INFO ]: Finished isEmpty. Found accepting run of length 117 [2018-06-25 09:25:27,798 INFO ]: Found error trace [2018-06-25 09:25:27,800 INFO ]: trace histogram [10, 10, 10, 8, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:25:27,801 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:27,801 INFO ]: Analyzing trace with hash -29055498, now seen corresponding path program 2 times [2018-06-25 09:25:27,801 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:27,801 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:27,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:27,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:27,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:27,809 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:27,975 INFO ]: Checked inductivity of 326 backedges. 45 proven. 43 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-06-25 09:25:27,975 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:25:27,975 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) [2018-06-25 09:25:27,989 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:25:28,068 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:25:28,068 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:28,074 INFO ]: Computing forward predicates... [2018-06-25 09:25:28,088 INFO ]: Checked inductivity of 326 backedges. 204 proven. 6 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-06-25 09:25:28,109 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:25:28,109 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:25:28,109 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:25:28,109 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:25:28,109 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:25:28,109 INFO ]: Start difference. First operand 868 states and 1741 transitions. Second operand 4 states. [2018-06-25 09:25:28,523 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:28,523 INFO ]: Finished difference Result 1117 states and 2259 transitions. [2018-06-25 09:25:28,523 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:25:28,523 INFO ]: Start accepts. Automaton has 4 states. Word has length 116 [2018-06-25 09:25:28,524 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:28,560 INFO ]: With dead ends: 1117 [2018-06-25 09:25:28,560 INFO ]: Without dead ends: 859 [2018-06-25 09:25:28,560 INFO ]: 0 DeclaredPredicates, 121 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:25:28,561 INFO ]: Start minimizeSevpa. Operand 859 states. [2018-06-25 09:25:28,618 INFO ]: Finished minimizeSevpa. Reduced states from 859 to 859. [2018-06-25 09:25:28,618 INFO ]: Start removeUnreachable. Operand 859 states. [2018-06-25 09:25:28,640 INFO ]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1722 transitions. [2018-06-25 09:25:28,641 INFO ]: Start accepts. Automaton has 859 states and 1722 transitions. Word has length 116 [2018-06-25 09:25:28,641 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:28,641 INFO ]: Abstraction has 859 states and 1722 transitions. [2018-06-25 09:25:28,641 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:25:28,641 INFO ]: Start isEmpty. Operand 859 states and 1722 transitions. [2018-06-25 09:25:28,673 INFO ]: Finished isEmpty. Found accepting run of length 167 [2018-06-25 09:25:28,673 INFO ]: Found error trace [2018-06-25 09:25:28,673 INFO ]: trace histogram [14, 14, 14, 12, 10, 8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:25:28,673 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:28,674 INFO ]: Analyzing trace with hash 560152543, now seen corresponding path program 1 times [2018-06-25 09:25:28,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:28,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:28,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:28,676 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:25:28,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:28,721 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:29,106 INFO ]: Checked inductivity of 713 backedges. 123 proven. 68 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2018-06-25 09:25:29,106 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:25:29,106 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-25 09:25:29,114 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:29,222 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:29,239 INFO ]: Computing forward predicates... [2018-06-25 09:25:29,506 INFO ]: Checked inductivity of 713 backedges. 396 proven. 65 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-06-25 09:25:29,526 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:25:29,586 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-06-25 09:25:29,586 INFO ]: Interpolant automaton has 27 states [2018-06-25 09:25:29,586 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-25 09:25:29,586 INFO ]: CoverageRelationStatistics Valid=54, Invalid=648, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:25:29,586 INFO ]: Start difference. First operand 859 states and 1722 transitions. Second operand 27 states. [2018-06-25 09:25:39,570 WARN ]: Spent 436.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-06-25 09:25:41,772 WARN ]: Spent 251.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 Received shutdown request... [2018-06-25 09:25:47,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-06-25 09:25:47,629 WARN ]: Verification canceled [2018-06-25 09:25:47,632 WARN ]: Timeout [2018-06-25 09:25:47,632 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:25:47 BoogieIcfgContainer [2018-06-25 09:25:47,632 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:25:47,633 INFO ]: Toolchain (without parser) took 59873.67 ms. Allocated memory was 309.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 259.7 MB in the beginning and 707.9 MB in the end (delta: -448.2 MB). Peak memory consumption was 785.4 MB. Max. memory is 3.6 GB. [2018-06-25 09:25:47,633 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:25:47,634 INFO ]: ChcToBoogie took 74.69 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 255.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:25:47,634 INFO ]: Boogie Preprocessor took 49.80 ms. Allocated memory is still 309.3 MB. Free memory is still 255.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:25:47,634 INFO ]: RCFGBuilder took 556.63 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 235.7 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:25:47,635 INFO ]: TraceAbstraction took 59184.26 ms. Allocated memory was 309.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 235.7 MB in the beginning and 707.9 MB in the end (delta: -472.2 MB). Peak memory consumption was 761.5 MB. Max. memory is 3.6 GB. [2018-06-25 09:25:47,637 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 74.69 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 255.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 49.80 ms. Allocated memory is still 309.3 MB. Free memory is still 255.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 556.63 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 235.7 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59184.26 ms. Allocated memory was 309.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 235.7 MB in the beginning and 707.9 MB in the end (delta: -472.2 MB). Peak memory consumption was 761.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (859states) and interpolant automaton (currently 149 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 168 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. TIMEOUT Result, 59.1s OverallTime, 12 OverallIterations, 14 TraceHistogramMax, 52.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4912 SDtfs, 2797 SDslu, 20893 SDs, 0 SdLazy, 50224 SolverSat, 9744 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1058 GetRequests, 698 SyntacticMatches, 2 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=10, 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: 2.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 7280 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1277 NumberOfCodeBlocks, 1277 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1258 ConstructedInterpolants, 0 QuantifiedInterpolants, 177636 SizeOfPredicates, 49 NumberOfNonLiveVariables, 2599 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 2786/3122 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/dotprod_lin.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-25-47-646.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dotprod_lin.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-25-47-646.csv Completed graceful shutdown