java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/018b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:29:02,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:29:02,288 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:29:02,302 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:29:02,302 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:29:02,305 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:29:02,306 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:29:02,308 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:29:02,310 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:29:02,310 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:29:02,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:29:02,313 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:29:02,314 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:29:02,315 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:29:02,319 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:29:02,319 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:29:02,321 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:29:02,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:29:02,336 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:29:02,336 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:29:02,338 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:29:02,340 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:29:02,340 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:29:02,340 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:29:02,341 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:29:02,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:29:02,347 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:29:02,348 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:29:02,349 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:29:02,349 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:29:02,349 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:29:02,355 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:29:02,356 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:29:02,356 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:29:02,357 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:29:02,357 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:29:02,374 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:29:02,374 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:29:02,375 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:29:02,375 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:29:02,376 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:29:02,376 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:29:02,376 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:29:02,377 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:29:02,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:29:02,378 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:29:02,378 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:29:02,378 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:29:02,378 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:29:02,379 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:29:02,379 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:29:02,379 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:29:02,379 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:29:02,380 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:29:02,381 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:29:02,432 INFO ]: Repository-Root is: /tmp [2018-06-22 01:29:02,446 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:29:02,451 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:29:02,452 INFO ]: Initializing SmtParser... [2018-06-22 01:29:02,453 INFO ]: SmtParser initialized [2018-06-22 01:29:02,453 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/018b-horn.smt2 [2018-06-22 01:29:02,455 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:29:02,543 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/018b-horn.smt2 unknown [2018-06-22 01:29:02,811 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/018b-horn.smt2 [2018-06-22 01:29:02,816 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:29:02,831 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:29:02,831 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:29:02,831 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:29:02,831 INFO ]: ChcToBoogie initialized [2018-06-22 01:29:02,838 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:29:02" (1/1) ... [2018-06-22 01:29:02,898 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:02 Unit [2018-06-22 01:29:02,898 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:29:02,898 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:29:02,898 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:29:02,898 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:29:02,915 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:02" (1/1) ... [2018-06-22 01:29:02,915 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:02" (1/1) ... [2018-06-22 01:29:02,921 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:02" (1/1) ... [2018-06-22 01:29:02,921 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:02" (1/1) ... [2018-06-22 01:29:02,926 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:02" (1/1) ... [2018-06-22 01:29:02,928 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:02" (1/1) ... [2018-06-22 01:29:02,930 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:02" (1/1) ... [2018-06-22 01:29:02,932 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:29:02,933 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:29:02,933 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:29:02,933 INFO ]: RCFGBuilder initialized [2018-06-22 01:29:02,934 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:02" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:29:02,949 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:29:02,949 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:29:02,949 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:29:02,949 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:29:02,949 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:29:02,949 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:29:03,452 INFO ]: Using library mode [2018-06-22 01:29:03,453 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:29:03 BoogieIcfgContainer [2018-06-22 01:29:03,453 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:29:03,454 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:29:03,454 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:29:03,461 INFO ]: TraceAbstraction initialized [2018-06-22 01:29:03,462 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:29:02" (1/3) ... [2018-06-22 01:29:03,462 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9913bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:29:03, skipping insertion in model container [2018-06-22 01:29:03,463 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:02" (2/3) ... [2018-06-22 01:29:03,463 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9913bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:29:03, skipping insertion in model container [2018-06-22 01:29:03,463 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:29:03" (3/3) ... [2018-06-22 01:29:03,464 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:29:03,474 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:29:03,483 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:29:03,536 INFO ]: Using default assertion order modulation [2018-06-22 01:29:03,537 INFO ]: Interprodecural is true [2018-06-22 01:29:03,537 INFO ]: Hoare is false [2018-06-22 01:29:03,537 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:29:03,537 INFO ]: Backedges is TWOTRACK [2018-06-22 01:29:03,537 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:29:03,537 INFO ]: Difference is false [2018-06-22 01:29:03,537 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:29:03,537 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:29:03,556 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 01:29:03,565 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:29:03,565 INFO ]: Found error trace [2018-06-22 01:29:03,566 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:03,568 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:03,573 INFO ]: Analyzing trace with hash 2110665552, now seen corresponding path program 1 times [2018-06-22 01:29:03,574 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:03,575 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:03,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:03,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:03,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:03,661 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:03,752 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:03,754 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:29:03,754 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:29:03,756 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:29:03,767 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:29:03,767 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:29:03,771 INFO ]: Start difference. First operand 13 states. Second operand 3 states. [2018-06-22 01:29:03,842 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:03,843 INFO ]: Finished difference Result 10 states and 18 transitions. [2018-06-22 01:29:03,843 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:29:03,844 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:29:03,844 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:03,853 INFO ]: With dead ends: 10 [2018-06-22 01:29:03,853 INFO ]: Without dead ends: 10 [2018-06-22 01:29:03,855 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:29:03,869 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:29:03,884 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:29:03,886 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:29:03,886 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-06-22 01:29:03,887 INFO ]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 7 [2018-06-22 01:29:03,887 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:03,887 INFO ]: Abstraction has 10 states and 18 transitions. [2018-06-22 01:29:03,888 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:29:03,888 INFO ]: Start isEmpty. Operand 10 states and 18 transitions. [2018-06-22 01:29:03,888 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:29:03,888 INFO ]: Found error trace [2018-06-22 01:29:03,888 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:03,888 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:03,888 INFO ]: Analyzing trace with hash 2120883865, now seen corresponding path program 1 times [2018-06-22 01:29:03,888 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:03,888 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:03,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:03,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:03,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:03,902 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:03,975 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:03,975 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:29:03,975 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:29:03,976 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:29:03,976 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:29:03,976 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:29:03,977 INFO ]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2018-06-22 01:29:04,002 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:04,003 INFO ]: Finished difference Result 11 states and 21 transitions. [2018-06-22 01:29:04,003 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:29:04,003 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:29:04,003 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:04,003 INFO ]: With dead ends: 11 [2018-06-22 01:29:04,004 INFO ]: Without dead ends: 11 [2018-06-22 01:29:04,004 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:29:04,004 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:29:04,007 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:29:04,007 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:29:04,007 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2018-06-22 01:29:04,007 INFO ]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 7 [2018-06-22 01:29:04,007 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:04,007 INFO ]: Abstraction has 11 states and 21 transitions. [2018-06-22 01:29:04,007 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:29:04,007 INFO ]: Start isEmpty. Operand 11 states and 21 transitions. [2018-06-22 01:29:04,008 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:29:04,008 INFO ]: Found error trace [2018-06-22 01:29:04,008 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:04,008 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:04,008 INFO ]: Analyzing trace with hash 995690250, now seen corresponding path program 1 times [2018-06-22 01:29:04,008 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:04,008 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:04,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:04,009 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:04,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:04,028 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:04,089 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:04,089 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:29:04,089 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:29:04,089 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:29:04,089 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:29:04,089 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:29:04,089 INFO ]: Start difference. First operand 11 states and 21 transitions. Second operand 3 states. [2018-06-22 01:29:04,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:04,154 INFO ]: Finished difference Result 13 states and 25 transitions. [2018-06-22 01:29:04,156 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:29:04,156 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:29:04,156 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:04,156 INFO ]: With dead ends: 13 [2018-06-22 01:29:04,156 INFO ]: Without dead ends: 11 [2018-06-22 01:29:04,156 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:29:04,156 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:29:04,158 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:29:04,158 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:29:04,158 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-22 01:29:04,158 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 8 [2018-06-22 01:29:04,158 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:04,158 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-22 01:29:04,158 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:29:04,158 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-22 01:29:04,159 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:29:04,159 INFO ]: Found error trace [2018-06-22 01:29:04,159 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:04,159 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:04,159 INFO ]: Analyzing trace with hash 1003078418, now seen corresponding path program 1 times [2018-06-22 01:29:04,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:04,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:04,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:04,162 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:04,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:04,197 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:04,304 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:04,304 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:29:04,304 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:29:04,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:04,351 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:04,358 INFO ]: Computing forward predicates... [2018-06-22 01:29:04,506 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:04,539 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:29:04,539 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:29:04,539 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:29:04,539 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:29:04,539 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:29:04,540 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 4 states. [2018-06-22 01:29:04,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:04,628 INFO ]: Finished difference Result 14 states and 20 transitions. [2018-06-22 01:29:04,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:29:04,629 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:29:04,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:04,631 INFO ]: With dead ends: 14 [2018-06-22 01:29:04,631 INFO ]: Without dead ends: 14 [2018-06-22 01:29:04,631 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:29:04,632 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:29:04,634 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-22 01:29:04,634 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:29:04,635 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-06-22 01:29:04,635 INFO ]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 8 [2018-06-22 01:29:04,635 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:04,635 INFO ]: Abstraction has 12 states and 18 transitions. [2018-06-22 01:29:04,635 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:29:04,635 INFO ]: Start isEmpty. Operand 12 states and 18 transitions. [2018-06-22 01:29:04,635 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:29:04,636 INFO ]: Found error trace [2018-06-22 01:29:04,636 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:04,636 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:04,636 INFO ]: Analyzing trace with hash 1325446829, now seen corresponding path program 1 times [2018-06-22 01:29:04,636 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:04,636 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:04,637 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:04,637 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:04,637 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:04,655 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:04,832 WARN ]: Spent 118.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-06-22 01:29:04,911 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:04,911 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:29:04,911 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:29:04,918 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:04,969 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:04,971 INFO ]: Computing forward predicates... [2018-06-22 01:29:05,169 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:05,202 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:29:05,202 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-22 01:29:05,202 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:29:05,202 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:29:05,202 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:29:05,202 INFO ]: Start difference. First operand 12 states and 18 transitions. Second operand 6 states. [2018-06-22 01:29:05,420 WARN ]: Spent 129.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-06-22 01:29:05,688 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:05,688 INFO ]: Finished difference Result 15 states and 25 transitions. [2018-06-22 01:29:05,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:29:05,690 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-22 01:29:05,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:05,690 INFO ]: With dead ends: 15 [2018-06-22 01:29:05,690 INFO ]: Without dead ends: 15 [2018-06-22 01:29:05,690 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:29:05,691 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:29:05,692 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:29:05,692 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:29:05,693 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 25 transitions. [2018-06-22 01:29:05,693 INFO ]: Start accepts. Automaton has 15 states and 25 transitions. Word has length 8 [2018-06-22 01:29:05,693 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:05,693 INFO ]: Abstraction has 15 states and 25 transitions. [2018-06-22 01:29:05,693 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:29:05,693 INFO ]: Start isEmpty. Operand 15 states and 25 transitions. [2018-06-22 01:29:05,693 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:29:05,693 INFO ]: Found error trace [2018-06-22 01:29:05,693 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:05,693 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:05,694 INFO ]: Analyzing trace with hash 1327293871, now seen corresponding path program 1 times [2018-06-22 01:29:05,694 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:05,694 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:05,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:05,694 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:05,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:05,725 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:05,925 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:05,925 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:29:05,925 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:29:05,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:05,975 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:05,977 INFO ]: Computing forward predicates... [2018-06-22 01:29:06,042 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:06,062 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:29:06,062 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:29:06,062 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:29:06,062 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:29:06,062 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:29:06,063 INFO ]: Start difference. First operand 15 states and 25 transitions. Second operand 4 states. [2018-06-22 01:29:06,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:06,233 INFO ]: Finished difference Result 21 states and 37 transitions. [2018-06-22 01:29:06,234 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:29:06,234 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:29:06,234 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:06,234 INFO ]: With dead ends: 21 [2018-06-22 01:29:06,234 INFO ]: Without dead ends: 21 [2018-06-22 01:29:06,235 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:29:06,235 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:29:06,237 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 01:29:06,237 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:29:06,237 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-06-22 01:29:06,237 INFO ]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 8 [2018-06-22 01:29:06,238 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:06,238 INFO ]: Abstraction has 19 states and 35 transitions. [2018-06-22 01:29:06,238 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:29:06,239 INFO ]: Start isEmpty. Operand 19 states and 35 transitions. [2018-06-22 01:29:06,240 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:29:06,240 INFO ]: Found error trace [2018-06-22 01:29:06,240 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:06,240 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:06,240 INFO ]: Analyzing trace with hash 1027615632, now seen corresponding path program 2 times [2018-06-22 01:29:06,240 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:06,240 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:06,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:06,241 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:06,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:06,258 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:06,416 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:06,416 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:29:06,416 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:29:06,416 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:29:06,416 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:29:06,416 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:29:06,416 INFO ]: Start difference. First operand 19 states and 35 transitions. Second operand 4 states. [2018-06-22 01:29:06,456 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:06,456 INFO ]: Finished difference Result 19 states and 34 transitions. [2018-06-22 01:29:06,457 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:29:06,457 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:29:06,457 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:06,457 INFO ]: With dead ends: 19 [2018-06-22 01:29:06,457 INFO ]: Without dead ends: 16 [2018-06-22 01:29:06,457 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:29:06,458 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:29:06,459 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 01:29:06,459 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:29:06,460 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2018-06-22 01:29:06,460 INFO ]: Start accepts. Automaton has 16 states and 30 transitions. Word has length 9 [2018-06-22 01:29:06,460 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:06,460 INFO ]: Abstraction has 16 states and 30 transitions. [2018-06-22 01:29:06,460 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:29:06,460 INFO ]: Start isEmpty. Operand 16 states and 30 transitions. [2018-06-22 01:29:06,460 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:29:06,460 INFO ]: Found error trace [2018-06-22 01:29:06,460 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:06,460 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:06,461 INFO ]: Analyzing trace with hash -1799159463, now seen corresponding path program 2 times [2018-06-22 01:29:06,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:06,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:06,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:06,461 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:29:06,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:06,471 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:06,559 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:06,559 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:29:06,559 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:29:06,560 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:29:06,560 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:29:06,560 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:29:06,560 INFO ]: Start difference. First operand 16 states and 30 transitions. Second operand 4 states. [2018-06-22 01:29:06,582 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:06,582 INFO ]: Finished difference Result 16 states and 28 transitions. [2018-06-22 01:29:06,583 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:29:06,583 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:29:06,583 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:06,583 INFO ]: With dead ends: 16 [2018-06-22 01:29:06,583 INFO ]: Without dead ends: 14 [2018-06-22 01:29:06,584 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:29:06,584 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:29:06,585 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-22 01:29:06,585 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:29:06,585 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-06-22 01:29:06,585 INFO ]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 9 [2018-06-22 01:29:06,585 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:06,585 INFO ]: Abstraction has 12 states and 17 transitions. [2018-06-22 01:29:06,585 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:29:06,585 INFO ]: Start isEmpty. Operand 12 states and 17 transitions. [2018-06-22 01:29:06,586 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:29:06,586 INFO ]: Found error trace [2018-06-22 01:29:06,586 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:06,586 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:06,586 INFO ]: Analyzing trace with hash 1682798722, now seen corresponding path program 1 times [2018-06-22 01:29:06,586 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:06,586 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:06,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:06,586 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:29:06,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:06,600 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:06,629 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:29:06,629 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:29:06,629 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:29:06,630 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:29:06,630 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:29:06,630 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:29:06,630 INFO ]: Start difference. First operand 12 states and 17 transitions. Second operand 3 states. [2018-06-22 01:29:06,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:06,644 INFO ]: Finished difference Result 8 states and 13 transitions. [2018-06-22 01:29:06,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:29:06,644 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-22 01:29:06,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:06,645 INFO ]: With dead ends: 8 [2018-06-22 01:29:06,645 INFO ]: Without dead ends: 0 [2018-06-22 01:29:06,645 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:29:06,645 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:29:06,645 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:29:06,645 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:29:06,645 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:29:06,645 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-06-22 01:29:06,645 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:06,645 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:29:06,645 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:29:06,645 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:29:06,645 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:29:06,649 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:29:06 BoogieIcfgContainer [2018-06-22 01:29:06,649 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:29:06,650 INFO ]: Toolchain (without parser) took 3833.68 ms. Allocated memory was 308.8 MB in the beginning and 327.7 MB in the end (delta: 18.9 MB). Free memory was 260.2 MB in the beginning and 245.9 MB in the end (delta: 14.3 MB). Peak memory consumption was 33.2 MB. Max. memory is 3.6 GB. [2018-06-22 01:29:06,651 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:29:06,651 INFO ]: ChcToBoogie took 67.02 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 257.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:29:06,652 INFO ]: Boogie Preprocessor took 33.87 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 256.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:29:06,652 INFO ]: RCFGBuilder took 520.40 ms. Allocated memory is still 308.8 MB. Free memory was 256.2 MB in the beginning and 238.1 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:29:06,653 INFO ]: TraceAbstraction took 3195.30 ms. Allocated memory was 308.8 MB in the beginning and 327.7 MB in the end (delta: 18.9 MB). Free memory was 238.1 MB in the beginning and 245.9 MB in the end (delta: -7.8 MB). Peak memory consumption was 11.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:29:06,656 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 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.02 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 257.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 33.87 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 256.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 520.40 ms. Allocated memory is still 308.8 MB. Free memory was 256.2 MB in the beginning and 238.1 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3195.30 ms. Allocated memory was 308.8 MB in the beginning and 327.7 MB in the end (delta: 18.9 MB). Free memory was 238.1 MB in the beginning and 245.9 MB in the end (delta: -7.8 MB). Peak memory consumption was 11.1 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, 13 locations, 1 error locations. SAFE Result, 3.1s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 101 SDtfs, 4 SDslu, 121 SDs, 0 SdLazy, 88 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 1597 SizeOfPredicates, 8 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 17/23 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/018b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-29-06-670.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/018b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-29-06-670.csv Received shutdown request...