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/termination/x_plus_2_pow_n00.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:40:00,168 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:40:00,170 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:40:00,181 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:40:00,182 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:40:00,182 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:40:00,185 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:40:00,187 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:40:00,189 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:40:00,190 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:40:00,192 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:40:00,192 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:40:00,193 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:40:00,194 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:40:00,194 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:40:00,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:40:00,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:40:00,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:40:00,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:40:00,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:40:00,217 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:40:00,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:40:00,219 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:40:00,220 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:40:00,220 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:40:00,221 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:40:00,227 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:40:00,228 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:40:00,229 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:40:00,229 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:40:00,229 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:40:00,230 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:40:00,230 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:40:00,236 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:40:00,237 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:40:00,237 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:40:00,256 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:40:00,256 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:40:00,259 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:40:00,259 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:40:00,260 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:40:00,261 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:40:00,261 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:40:00,261 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:40:00,261 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:40:00,261 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:40:00,262 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:40:00,262 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:40:00,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:40:00,262 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:40:00,262 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:40:00,262 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:40:00,263 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:40:00,265 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:40:00,265 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:40:00,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:40:00,266 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:40:00,267 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:40:00,267 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:40:00,311 INFO ]: Repository-Root is: /tmp [2018-06-25 09:40:00,327 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:40:00,332 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:40:00,333 INFO ]: Initializing SmtParser... [2018-06-25 09:40:00,333 INFO ]: SmtParser initialized [2018-06-25 09:40:00,334 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/termination/x_plus_2_pow_n00.smt2 [2018-06-25 09:40:00,335 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:40:00,419 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/termination/x_plus_2_pow_n00.smt2 unknown [2018-06-25 09:40:00,733 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/termination/x_plus_2_pow_n00.smt2 [2018-06-25 09:40:00,741 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:40:00,747 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:40:00,748 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:40:00,748 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:40:00,748 INFO ]: ChcToBoogie initialized [2018-06-25 09:40:00,751 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:40:00" (1/1) ... [2018-06-25 09:40:00,818 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:40:00 Unit [2018-06-25 09:40:00,818 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:40:00,818 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:40:00,818 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:40:00,818 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:40:00,839 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:40:00" (1/1) ... [2018-06-25 09:40:00,839 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:40:00" (1/1) ... [2018-06-25 09:40:00,847 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:40:00" (1/1) ... [2018-06-25 09:40:00,847 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:40:00" (1/1) ... [2018-06-25 09:40:00,852 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:40:00" (1/1) ... [2018-06-25 09:40:00,855 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:40:00" (1/1) ... [2018-06-25 09:40:00,857 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:40:00" (1/1) ... [2018-06-25 09:40:00,859 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:40:00,860 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:40:00,860 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:40:00,860 INFO ]: RCFGBuilder initialized [2018-06-25 09:40:00,860 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:40:00" (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:40:00,872 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:40:00,872 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:40:00,872 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:40:00,872 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:40:00,872 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:40:00,872 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:40:01,424 INFO ]: Using library mode [2018-06-25 09:40:01,425 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:40:01 BoogieIcfgContainer [2018-06-25 09:40:01,425 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:40:01,426 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:40:01,426 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:40:01,430 INFO ]: TraceAbstraction initialized [2018-06-25 09:40:01,430 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:40:00" (1/3) ... [2018-06-25 09:40:01,431 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21203be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:40:01, skipping insertion in model container [2018-06-25 09:40:01,431 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:40:00" (2/3) ... [2018-06-25 09:40:01,431 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21203be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:40:01, skipping insertion in model container [2018-06-25 09:40:01,431 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:40:01" (3/3) ... [2018-06-25 09:40:01,433 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:40:01,443 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:40:01,453 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:40:01,503 INFO ]: Using default assertion order modulation [2018-06-25 09:40:01,503 INFO ]: Interprodecural is true [2018-06-25 09:40:01,503 INFO ]: Hoare is false [2018-06-25 09:40:01,503 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:40:01,503 INFO ]: Backedges is TWOTRACK [2018-06-25 09:40:01,503 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:40:01,503 INFO ]: Difference is false [2018-06-25 09:40:01,503 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:40:01,503 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:40:01,522 INFO ]: Start isEmpty. Operand 46 states. [2018-06-25 09:40:01,535 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:40:01,535 INFO ]: Found error trace [2018-06-25 09:40:01,538 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:40:01,538 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:40:01,543 INFO ]: Analyzing trace with hash -1077628711, now seen corresponding path program 1 times [2018-06-25 09:40:01,545 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:40:01,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:40:01,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:01,586 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:40:01,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:01,634 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-25 09:40:01,634 INFO ]: Advancing trace checker [2018-06-25 09:40:01,634 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-25 09:40:01,649 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:40:01,684 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:40:01,701 INFO ]: Computing forward predicates... [2018-06-25 09:40:01,826 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:40:01,849 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:40:01,849 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:40:01,851 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:40:01,863 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:40:01,864 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:40:01,866 INFO ]: Start difference. First operand 46 states. Second operand 4 states. [2018-06-25 09:40:02,642 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:40:02,642 INFO ]: Finished difference Result 85 states and 125 transitions. [2018-06-25 09:40:02,643 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:40:02,644 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:40:02,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:40:02,660 INFO ]: With dead ends: 85 [2018-06-25 09:40:02,660 INFO ]: Without dead ends: 73 [2018-06-25 09:40:02,662 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 5 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:40:02,680 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-25 09:40:02,713 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-06-25 09:40:02,714 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-25 09:40:02,718 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 105 transitions. [2018-06-25 09:40:02,719 INFO ]: Start accepts. Automaton has 73 states and 105 transitions. Word has length 8 [2018-06-25 09:40:02,719 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:40:02,719 INFO ]: Abstraction has 73 states and 105 transitions. [2018-06-25 09:40:02,719 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:40:02,720 INFO ]: Start isEmpty. Operand 73 states and 105 transitions. [2018-06-25 09:40:02,721 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:40:02,721 INFO ]: Found error trace [2018-06-25 09:40:02,721 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:40:02,721 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:40:02,721 INFO ]: Analyzing trace with hash 141210901, now seen corresponding path program 1 times [2018-06-25 09:40:02,722 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:40:02,722 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:40:02,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:02,722 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:40:02,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:02,733 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:40:02,838 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:40:02,838 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:40:02,838 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:40:02,839 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:40:02,839 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:40:02,839 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:40:02,840 INFO ]: Start difference. First operand 73 states and 105 transitions. Second operand 4 states. [2018-06-25 09:40:03,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:40:03,619 INFO ]: Finished difference Result 103 states and 149 transitions. [2018-06-25 09:40:03,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:40:03,628 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:40:03,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:40:03,635 INFO ]: With dead ends: 103 [2018-06-25 09:40:03,635 INFO ]: Without dead ends: 103 [2018-06-25 09:40:03,636 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:40:03,636 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-25 09:40:03,648 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-06-25 09:40:03,648 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-25 09:40:03,652 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2018-06-25 09:40:03,652 INFO ]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 9 [2018-06-25 09:40:03,652 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:40:03,652 INFO ]: Abstraction has 103 states and 149 transitions. [2018-06-25 09:40:03,652 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:40:03,652 INFO ]: Start isEmpty. Operand 103 states and 149 transitions. [2018-06-25 09:40:03,653 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:40:03,653 INFO ]: Found error trace [2018-06-25 09:40:03,653 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:40:03,654 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:40:03,654 INFO ]: Analyzing trace with hash -421288059, now seen corresponding path program 1 times [2018-06-25 09:40:03,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:40:03,654 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:40:03,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:03,655 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:40:03,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:03,666 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:40:03,709 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:40:03,709 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:40:03,710 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:40:03,710 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:40:03,710 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:40:03,710 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:40:03,710 INFO ]: Start difference. First operand 103 states and 149 transitions. Second operand 4 states. [2018-06-25 09:40:03,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:40:03,967 INFO ]: Finished difference Result 133 states and 193 transitions. [2018-06-25 09:40:03,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:40:03,968 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-25 09:40:03,968 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:40:03,975 INFO ]: With dead ends: 133 [2018-06-25 09:40:03,975 INFO ]: Without dead ends: 133 [2018-06-25 09:40:03,976 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:40:03,976 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-25 09:40:04,002 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-06-25 09:40:04,002 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-25 09:40:04,007 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 193 transitions. [2018-06-25 09:40:04,007 INFO ]: Start accepts. Automaton has 133 states and 193 transitions. Word has length 13 [2018-06-25 09:40:04,007 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:40:04,007 INFO ]: Abstraction has 133 states and 193 transitions. [2018-06-25 09:40:04,007 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:40:04,007 INFO ]: Start isEmpty. Operand 133 states and 193 transitions. [2018-06-25 09:40:04,009 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:40:04,009 INFO ]: Found error trace [2018-06-25 09:40:04,009 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:40:04,009 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:40:04,009 INFO ]: Analyzing trace with hash 107246994, now seen corresponding path program 1 times [2018-06-25 09:40:04,010 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:40:04,010 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:40:04,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:04,010 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:40:04,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:04,022 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:40:04,084 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:40:04,084 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:40:04,084 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:40:04,085 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:40:04,085 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:40:04,085 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:40:04,085 INFO ]: Start difference. First operand 133 states and 193 transitions. Second operand 4 states. [2018-06-25 09:40:04,367 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:40:04,367 INFO ]: Finished difference Result 152 states and 219 transitions. [2018-06-25 09:40:04,368 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:40:04,368 INFO ]: Start accepts. Automaton has 4 states. Word has length 15 [2018-06-25 09:40:04,368 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:40:04,371 INFO ]: With dead ends: 152 [2018-06-25 09:40:04,371 INFO ]: Without dead ends: 133 [2018-06-25 09:40:04,372 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:40:04,372 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-25 09:40:04,394 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-06-25 09:40:04,394 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-25 09:40:04,402 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 192 transitions. [2018-06-25 09:40:04,402 INFO ]: Start accepts. Automaton has 133 states and 192 transitions. Word has length 15 [2018-06-25 09:40:04,402 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:40:04,402 INFO ]: Abstraction has 133 states and 192 transitions. [2018-06-25 09:40:04,402 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:40:04,403 INFO ]: Start isEmpty. Operand 133 states and 192 transitions. [2018-06-25 09:40:04,405 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:40:04,405 INFO ]: Found error trace [2018-06-25 09:40:04,405 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:40:04,405 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:40:04,405 INFO ]: Analyzing trace with hash -1245950739, now seen corresponding path program 1 times [2018-06-25 09:40:04,405 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:40:04,405 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:40:04,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:04,406 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:40:04,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:04,432 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:40:04,564 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:40:04,564 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:40:04,564 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:40:04,565 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:40:04,565 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:40:04,565 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:40:04,565 INFO ]: Start difference. First operand 133 states and 192 transitions. Second operand 4 states. [2018-06-25 09:40:04,773 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:40:04,773 INFO ]: Finished difference Result 277 states and 457 transitions. [2018-06-25 09:40:04,773 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:40:04,774 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-25 09:40:04,774 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:40:04,787 INFO ]: With dead ends: 277 [2018-06-25 09:40:04,787 INFO ]: Without dead ends: 277 [2018-06-25 09:40:04,788 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-25 09:40:04,788 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-25 09:40:04,820 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 141. [2018-06-25 09:40:04,820 INFO ]: Start removeUnreachable. Operand 141 states. [2018-06-25 09:40:04,825 INFO ]: Finished removeUnreachable. Reduced from 141 states to 141 states and 200 transitions. [2018-06-25 09:40:04,825 INFO ]: Start accepts. Automaton has 141 states and 200 transitions. Word has length 17 [2018-06-25 09:40:04,825 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:40:04,825 INFO ]: Abstraction has 141 states and 200 transitions. [2018-06-25 09:40:04,825 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:40:04,825 INFO ]: Start isEmpty. Operand 141 states and 200 transitions. [2018-06-25 09:40:04,829 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:40:04,829 INFO ]: Found error trace [2018-06-25 09:40:04,829 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:40:04,829 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:40:04,830 INFO ]: Analyzing trace with hash 250625469, now seen corresponding path program 1 times [2018-06-25 09:40:04,830 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:40:04,830 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:40:04,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:04,831 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:40:04,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:04,844 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-25 09:40:04,844 INFO ]: Advancing trace checker [2018-06-25 09:40:04,844 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-25 09:40:04,867 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:40:04,902 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:40:04,906 INFO ]: Computing forward predicates... [2018-06-25 09:40:04,987 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:40:05,010 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:40:05,010 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-25 09:40:05,010 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:40:05,011 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:40:05,011 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:40:05,011 INFO ]: Start difference. First operand 141 states and 200 transitions. Second operand 6 states. [2018-06-25 09:40:05,676 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:40:05,676 INFO ]: Finished difference Result 529 states and 1603 transitions. [2018-06-25 09:40:05,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:40:05,677 INFO ]: Start accepts. Automaton has 6 states. Word has length 20 [2018-06-25 09:40:05,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:40:05,708 INFO ]: With dead ends: 529 [2018-06-25 09:40:05,709 INFO ]: Without dead ends: 529 [2018-06-25 09:40:05,709 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:40:05,709 INFO ]: Start minimizeSevpa. Operand 529 states. [2018-06-25 09:40:05,814 INFO ]: Finished minimizeSevpa. Reduced states from 529 to 149. [2018-06-25 09:40:05,814 INFO ]: Start removeUnreachable. Operand 149 states. [2018-06-25 09:40:05,817 INFO ]: Finished removeUnreachable. Reduced from 149 states to 149 states and 212 transitions. [2018-06-25 09:40:05,817 INFO ]: Start accepts. Automaton has 149 states and 212 transitions. Word has length 20 [2018-06-25 09:40:05,817 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:40:05,817 INFO ]: Abstraction has 149 states and 212 transitions. [2018-06-25 09:40:05,817 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:40:05,817 INFO ]: Start isEmpty. Operand 149 states and 212 transitions. [2018-06-25 09:40:05,822 INFO ]: Finished isEmpty. Found accepting run of length 52 [2018-06-25 09:40:05,822 INFO ]: Found error trace [2018-06-25 09:40:05,822 INFO ]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:40:05,822 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:40:05,822 INFO ]: Analyzing trace with hash 27559613, now seen corresponding path program 1 times [2018-06-25 09:40:05,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:40:05,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:40:05,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:05,823 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:40:05,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:05,833 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-25 09:40:05,833 INFO ]: Advancing trace checker [2018-06-25 09:40:05,833 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-25 09:40:05,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:40:05,916 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:40:05,919 INFO ]: Computing forward predicates... [2018-06-25 09:40:05,989 INFO ]: Checked inductivity of 40 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:40:06,016 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:40:06,016 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:40:06,016 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:40:06,016 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:40:06,016 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:40:06,016 INFO ]: Start difference. First operand 149 states and 212 transitions. Second operand 4 states. [2018-06-25 09:40:06,185 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:40:06,185 INFO ]: Finished difference Result 226 states and 320 transitions. [2018-06-25 09:40:06,185 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:40:06,185 INFO ]: Start accepts. Automaton has 4 states. Word has length 51 [2018-06-25 09:40:06,186 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:40:06,191 INFO ]: With dead ends: 226 [2018-06-25 09:40:06,191 INFO ]: Without dead ends: 183 [2018-06-25 09:40:06,191 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 49 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:40:06,192 INFO ]: Start minimizeSevpa. Operand 183 states. [2018-06-25 09:40:06,201 INFO ]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-06-25 09:40:06,201 INFO ]: Start removeUnreachable. Operand 183 states. [2018-06-25 09:40:06,203 INFO ]: Finished removeUnreachable. Reduced from 183 states to 183 states and 251 transitions. [2018-06-25 09:40:06,203 INFO ]: Start accepts. Automaton has 183 states and 251 transitions. Word has length 51 [2018-06-25 09:40:06,203 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:40:06,203 INFO ]: Abstraction has 183 states and 251 transitions. [2018-06-25 09:40:06,203 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:40:06,204 INFO ]: Start isEmpty. Operand 183 states and 251 transitions. [2018-06-25 09:40:06,208 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-25 09:40:06,208 INFO ]: Found error trace [2018-06-25 09:40:06,208 INFO ]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:40:06,208 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:40:06,208 INFO ]: Analyzing trace with hash 1720350943, now seen corresponding path program 1 times [2018-06-25 09:40:06,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:40:06,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:40:06,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:06,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:40:06,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:06,217 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-25 09:40:06,217 INFO ]: Advancing trace checker [2018-06-25 09:40:06,217 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 (exit command is (exit), workingDir is null) [2018-06-25 09:40:06,235 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-25 09:40:06,303 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:40:06,308 INFO ]: Computing forward predicates... [2018-06-25 09:40:06,447 INFO ]: Checked inductivity of 41 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:40:06,480 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:40:06,480 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:40:06,480 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:40:06,480 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:40:06,480 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:40:06,480 INFO ]: Start difference. First operand 183 states and 251 transitions. Second operand 4 states. [2018-06-25 09:40:06,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:40:06,674 INFO ]: Finished difference Result 240 states and 330 transitions. [2018-06-25 09:40:06,674 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:40:06,674 INFO ]: Start accepts. Automaton has 4 states. Word has length 52 [2018-06-25 09:40:06,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:40:06,677 INFO ]: With dead ends: 240 [2018-06-25 09:40:06,678 INFO ]: Without dead ends: 220 [2018-06-25 09:40:06,678 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 50 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:40:06,678 INFO ]: Start minimizeSevpa. Operand 220 states. [2018-06-25 09:40:06,686 INFO ]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-06-25 09:40:06,686 INFO ]: Start removeUnreachable. Operand 220 states. [2018-06-25 09:40:06,689 INFO ]: Finished removeUnreachable. Reduced from 220 states to 220 states and 298 transitions. [2018-06-25 09:40:06,689 INFO ]: Start accepts. Automaton has 220 states and 298 transitions. Word has length 52 [2018-06-25 09:40:06,689 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:40:06,689 INFO ]: Abstraction has 220 states and 298 transitions. [2018-06-25 09:40:06,689 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:40:06,689 INFO ]: Start isEmpty. Operand 220 states and 298 transitions. [2018-06-25 09:40:06,693 INFO ]: Finished isEmpty. Found accepting run of length 68 [2018-06-25 09:40:06,693 INFO ]: Found error trace [2018-06-25 09:40:06,694 INFO ]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:40:06,694 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:40:06,694 INFO ]: Analyzing trace with hash 869042877, now seen corresponding path program 1 times [2018-06-25 09:40:06,694 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:40:06,694 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:40:06,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:06,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:40:06,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:06,703 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-25 09:40:06,703 INFO ]: Advancing trace checker [2018-06-25 09:40:06,703 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 (exit command is (exit), workingDir is null) [2018-06-25 09:40:06,717 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-25 09:40:06,797 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:40:06,802 INFO ]: Computing forward predicates... [2018-06-25 09:40:07,025 INFO ]: Checked inductivity of 75 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-25 09:40:07,059 INFO ]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:40:07,059 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-06-25 09:40:07,059 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:40:07,059 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:40:07,059 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:40:07,059 INFO ]: Start difference. First operand 220 states and 298 transitions. Second operand 8 states. [2018-06-25 09:40:08,047 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:40:08,047 INFO ]: Finished difference Result 563 states and 1197 transitions. [2018-06-25 09:40:08,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:40:08,047 INFO ]: Start accepts. Automaton has 8 states. Word has length 67 [2018-06-25 09:40:08,047 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:40:08,057 INFO ]: With dead ends: 563 [2018-06-25 09:40:08,057 INFO ]: Without dead ends: 529 [2018-06-25 09:40:08,058 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:40:08,058 INFO ]: Start minimizeSevpa. Operand 529 states. [2018-06-25 09:40:08,118 INFO ]: Finished minimizeSevpa. Reduced states from 529 to 242. [2018-06-25 09:40:08,118 INFO ]: Start removeUnreachable. Operand 242 states. [2018-06-25 09:40:08,121 INFO ]: Finished removeUnreachable. Reduced from 242 states to 242 states and 338 transitions. [2018-06-25 09:40:08,121 INFO ]: Start accepts. Automaton has 242 states and 338 transitions. Word has length 67 [2018-06-25 09:40:08,121 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:40:08,121 INFO ]: Abstraction has 242 states and 338 transitions. [2018-06-25 09:40:08,121 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:40:08,121 INFO ]: Start isEmpty. Operand 242 states and 338 transitions. [2018-06-25 09:40:08,125 INFO ]: Finished isEmpty. Found accepting run of length 71 [2018-06-25 09:40:08,125 INFO ]: Found error trace [2018-06-25 09:40:08,125 INFO ]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:40:08,125 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:40:08,125 INFO ]: Analyzing trace with hash -2027116659, now seen corresponding path program 2 times [2018-06-25 09:40:08,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:40:08,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:40:08,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:08,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:40:08,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:08,133 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-25 09:40:08,133 INFO ]: Advancing trace checker [2018-06-25 09:40:08,133 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-25 09:40:08,145 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:40:08,230 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:40:08,230 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:40:08,235 INFO ]: Computing forward predicates... [2018-06-25 09:40:08,318 INFO ]: Checked inductivity of 84 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-25 09:40:08,337 INFO ]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:40:08,337 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-06-25 09:40:08,338 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:40:08,338 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:40:08,338 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:40:08,338 INFO ]: Start difference. First operand 242 states and 338 transitions. Second operand 9 states. [2018-06-25 09:40:10,530 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:40:10,530 INFO ]: Finished difference Result 847 states and 2672 transitions. [2018-06-25 09:40:10,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-25 09:40:10,531 INFO ]: Start accepts. Automaton has 9 states. Word has length 70 [2018-06-25 09:40:10,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:40:10,562 INFO ]: With dead ends: 847 [2018-06-25 09:40:10,562 INFO ]: Without dead ends: 847 [2018-06-25 09:40:10,563 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=293, Invalid=1267, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:40:10,564 INFO ]: Start minimizeSevpa. Operand 847 states. [2018-06-25 09:40:10,753 INFO ]: Finished minimizeSevpa. Reduced states from 847 to 230. [2018-06-25 09:40:10,753 INFO ]: Start removeUnreachable. Operand 230 states. [2018-06-25 09:40:10,756 INFO ]: Finished removeUnreachable. Reduced from 230 states to 230 states and 320 transitions. [2018-06-25 09:40:10,756 INFO ]: Start accepts. Automaton has 230 states and 320 transitions. Word has length 70 [2018-06-25 09:40:10,756 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:40:10,756 INFO ]: Abstraction has 230 states and 320 transitions. [2018-06-25 09:40:10,756 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:40:10,756 INFO ]: Start isEmpty. Operand 230 states and 320 transitions. [2018-06-25 09:40:10,759 INFO ]: Finished isEmpty. Found accepting run of length 71 [2018-06-25 09:40:10,759 INFO ]: Found error trace [2018-06-25 09:40:10,759 INFO ]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:40:10,759 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:40:10,759 INFO ]: Analyzing trace with hash 2004387443, now seen corresponding path program 3 times [2018-06-25 09:40:10,759 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:40:10,759 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:40:10,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:10,760 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:40:10,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:10,773 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-25 09:40:10,773 INFO ]: Advancing trace checker [2018-06-25 09:40:10,773 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-25 09:40:10,795 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:40:10,874 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 09:40:10,874 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:40:10,884 INFO ]: Computing forward predicates... [2018-06-25 09:40:10,956 INFO ]: Checked inductivity of 84 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-25 09:40:10,976 INFO ]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:40:10,976 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-06-25 09:40:10,976 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:40:10,976 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:40:10,976 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:40:10,976 INFO ]: Start difference. First operand 230 states and 320 transitions. Second operand 8 states. [2018-06-25 09:40:11,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:40:11,162 INFO ]: Finished difference Result 554 states and 1133 transitions. [2018-06-25 09:40:11,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:40:11,163 INFO ]: Start accepts. Automaton has 8 states. Word has length 70 [2018-06-25 09:40:11,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:40:11,172 INFO ]: With dead ends: 554 [2018-06-25 09:40:11,172 INFO ]: Without dead ends: 536 [2018-06-25 09:40:11,172 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:40:11,173 INFO ]: Start minimizeSevpa. Operand 536 states. [2018-06-25 09:40:11,208 INFO ]: Finished minimizeSevpa. Reduced states from 536 to 308. [2018-06-25 09:40:11,208 INFO ]: Start removeUnreachable. Operand 308 states. [2018-06-25 09:40:11,215 INFO ]: Finished removeUnreachable. Reduced from 308 states to 308 states and 440 transitions. [2018-06-25 09:40:11,215 INFO ]: Start accepts. Automaton has 308 states and 440 transitions. Word has length 70 [2018-06-25 09:40:11,216 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:40:11,216 INFO ]: Abstraction has 308 states and 440 transitions. [2018-06-25 09:40:11,216 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:40:11,216 INFO ]: Start isEmpty. Operand 308 states and 440 transitions. [2018-06-25 09:40:11,223 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-25 09:40:11,223 INFO ]: Found error trace [2018-06-25 09:40:11,223 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:40:11,223 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:40:11,223 INFO ]: Analyzing trace with hash -181307485, now seen corresponding path program 4 times [2018-06-25 09:40:11,223 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:40:11,223 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:40:11,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:11,224 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:40:11,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:11,239 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-25 09:40:11,239 INFO ]: Advancing trace checker [2018-06-25 09:40:11,239 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 (exit command is (exit), workingDir is null) [2018-06-25 09:40:11,253 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-25 09:40:11,336 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:40:11,336 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:40:11,341 INFO ]: Computing forward predicates... [2018-06-25 09:40:11,491 INFO ]: Checked inductivity of 96 backedges. 57 proven. 13 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-25 09:40:11,512 INFO ]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:40:11,512 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-06-25 09:40:11,512 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:40:11,512 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:40:11,512 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:40:11,512 INFO ]: Start difference. First operand 308 states and 440 transitions. Second operand 11 states. [2018-06-25 09:40:15,352 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:40:15,352 INFO ]: Finished difference Result 1567 states and 6975 transitions. [2018-06-25 09:40:15,352 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-25 09:40:15,352 INFO ]: Start accepts. Automaton has 11 states. Word has length 73 [2018-06-25 09:40:15,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:40:15,442 INFO ]: With dead ends: 1567 [2018-06-25 09:40:15,442 INFO ]: Without dead ends: 1567 [2018-06-25 09:40:15,444 INFO ]: 0 DeclaredPredicates, 152 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=618, Invalid=3938, Unknown=0, NotChecked=0, Total=4556 [2018-06-25 09:40:15,445 INFO ]: Start minimizeSevpa. Operand 1567 states. [2018-06-25 09:40:16,740 INFO ]: Finished minimizeSevpa. Reduced states from 1567 to 386. [2018-06-25 09:40:16,740 INFO ]: Start removeUnreachable. Operand 386 states. [2018-06-25 09:40:16,743 INFO ]: Finished removeUnreachable. Reduced from 386 states to 386 states and 571 transitions. [2018-06-25 09:40:16,743 INFO ]: Start accepts. Automaton has 386 states and 571 transitions. Word has length 73 [2018-06-25 09:40:16,743 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:40:16,743 INFO ]: Abstraction has 386 states and 571 transitions. [2018-06-25 09:40:16,743 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:40:16,743 INFO ]: Start isEmpty. Operand 386 states and 571 transitions. [2018-06-25 09:40:16,764 INFO ]: Finished isEmpty. Found accepting run of length 262 [2018-06-25 09:40:16,764 INFO ]: Found error trace [2018-06-25 09:40:16,764 INFO ]: trace histogram [21, 21, 18, 18, 15, 12, 12, 11, 11, 8, 7, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:40:16,765 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:40:16,765 INFO ]: Analyzing trace with hash 1720371348, now seen corresponding path program 1 times [2018-06-25 09:40:16,765 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:40:16,765 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:40:16,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:16,766 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:40:16,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:40:16,785 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-25 09:40:16,785 INFO ]: Advancing trace checker [2018-06-25 09:40:16,785 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 (exit command is (exit), workingDir is null) [2018-06-25 09:40:16,807 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-25 09:40:17,087 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:40:17,099 INFO ]: Computing forward predicates... [2018-06-25 09:40:17,157 INFO ]: Checked inductivity of 1650 backedges. 792 proven. 9 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2018-06-25 09:40:17,179 INFO ]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:40:17,179 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-06-25 09:40:17,180 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:40:17,180 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:40:17,180 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:40:17,180 INFO ]: Start difference. First operand 386 states and 571 transitions. Second operand 4 states. [2018-06-25 09:40:17,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:40:17,289 INFO ]: Finished difference Result 292 states and 407 transitions. [2018-06-25 09:40:17,289 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:40:17,289 INFO ]: Start accepts. Automaton has 4 states. Word has length 261 [2018-06-25 09:40:17,289 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:40:17,289 INFO ]: With dead ends: 292 [2018-06-25 09:40:17,289 INFO ]: Without dead ends: 0 [2018-06-25 09:40:17,289 INFO ]: 0 DeclaredPredicates, 262 GetRequests, 259 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:40:17,289 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 09:40:17,289 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 09:40:17,289 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 09:40:17,289 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 09:40:17,289 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 261 [2018-06-25 09:40:17,290 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:40:17,290 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 09:40:17,290 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:40:17,290 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 09:40:17,290 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 09:40:17,293 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:40:17 BoogieIcfgContainer [2018-06-25 09:40:17,293 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:40:17,294 INFO ]: Toolchain (without parser) took 16552.89 ms. Allocated memory was 309.9 MB in the beginning and 494.9 MB in the end (delta: 185.1 MB). Free memory was 258.3 MB in the beginning and 257.7 MB in the end (delta: 519.6 kB). Peak memory consumption was 185.6 MB. Max. memory is 3.6 GB. [2018-06-25 09:40:17,295 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.9 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:40:17,296 INFO ]: ChcToBoogie took 70.21 ms. Allocated memory is still 309.9 MB. Free memory was 258.3 MB in the beginning and 256.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:40:17,296 INFO ]: Boogie Preprocessor took 40.74 ms. Allocated memory is still 309.9 MB. Free memory was 256.3 MB in the beginning and 254.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:40:17,297 INFO ]: RCFGBuilder took 565.09 ms. Allocated memory is still 309.9 MB. Free memory was 254.3 MB in the beginning and 232.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:40:17,297 INFO ]: TraceAbstraction took 15867.63 ms. Allocated memory was 309.9 MB in the beginning and 494.9 MB in the end (delta: 185.1 MB). Free memory was 232.3 MB in the beginning and 257.7 MB in the end (delta: -25.4 MB). Peak memory consumption was 159.6 MB. Max. memory is 3.6 GB. [2018-06-25 09:40:17,299 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.9 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 70.21 ms. Allocated memory is still 309.9 MB. Free memory was 258.3 MB in the beginning and 256.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 40.74 ms. Allocated memory is still 309.9 MB. Free memory was 256.3 MB in the beginning and 254.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 565.09 ms. Allocated memory is still 309.9 MB. Free memory was 254.3 MB in the beginning and 232.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 15867.63 ms. Allocated memory was 309.9 MB in the beginning and 494.9 MB in the end (delta: 185.1 MB). Free memory was 232.3 MB in the beginning and 257.7 MB in the end (delta: -25.4 MB). Peak memory consumption was 159.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. SAFE Result, 15.8s OverallTime, 13 OverallIterations, 21 TraceHistogramMax, 10.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1600 SDtfs, 1665 SDslu, 4969 SDs, 0 SdLazy, 4463 SolverSat, 1084 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 660 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2098 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=12, 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.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 2829 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 726 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 713 ConstructedInterpolants, 0 QuantifiedInterpolants, 114133 SizeOfPredicates, 33 NumberOfNonLiveVariables, 5438 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 2039/2071 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/x_plus_2_pow_n00.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-40-17-310.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/x_plus_2_pow_n00.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-40-17-310.csv Received shutdown request...