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/hopv/lia/mochi/array_init.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:39:44,403 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:39:44,405 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:39:44,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:39:44,417 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:39:44,418 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:39:44,419 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:39:44,422 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:39:44,423 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:39:44,424 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:39:44,425 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:39:44,425 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:39:44,426 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:39:44,427 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:39:44,428 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:39:44,429 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:39:44,430 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:39:44,432 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:39:44,434 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:39:44,435 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:39:44,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:39:44,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:39:44,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:39:44,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:39:44,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:39:44,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:39:44,442 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:39:44,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:39:44,443 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:39:44,444 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:39:44,444 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:39:44,445 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:39:44,445 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:39:44,446 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:39:44,447 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:39:44,447 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:39:44,463 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:39:44,464 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:39:44,464 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:39:44,464 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:39:44,465 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:39:44,466 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:39:44,466 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:39:44,466 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:39:44,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:39:44,467 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:39:44,472 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:39:44,472 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:39:44,473 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:39:44,473 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:39:44,473 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:39:44,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:39:44,474 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:39:44,475 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:39:44,475 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:39:44,528 INFO ]: Repository-Root is: /tmp [2018-06-22 01:39:44,546 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:39:44,551 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:39:44,553 INFO ]: Initializing SmtParser... [2018-06-22 01:39:44,553 INFO ]: SmtParser initialized [2018-06-22 01:39:44,554 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/array_init.smt2 [2018-06-22 01:39:44,555 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:39:44,654 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/array_init.smt2 unknown [2018-06-22 01:39:44,926 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/array_init.smt2 [2018-06-22 01:39:44,931 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:39:44,938 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:39:44,939 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:39:44,939 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:39:44,939 INFO ]: ChcToBoogie initialized [2018-06-22 01:39:44,943 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:39:44" (1/1) ... [2018-06-22 01:39:44,990 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:44 Unit [2018-06-22 01:39:44,990 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:39:44,991 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:39:44,991 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:39:44,991 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:39:45,013 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:44" (1/1) ... [2018-06-22 01:39:45,013 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:44" (1/1) ... [2018-06-22 01:39:45,022 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:44" (1/1) ... [2018-06-22 01:39:45,022 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:44" (1/1) ... [2018-06-22 01:39:45,028 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:44" (1/1) ... [2018-06-22 01:39:45,038 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:44" (1/1) ... [2018-06-22 01:39:45,039 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:44" (1/1) ... [2018-06-22 01:39:45,041 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:39:45,042 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:39:45,043 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:39:45,043 INFO ]: RCFGBuilder initialized [2018-06-22 01:39:45,044 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:44" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:39:45,061 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:39:45,061 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:39:45,061 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:39:45,061 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:39:45,062 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:39:45,062 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:39:45,450 INFO ]: Using library mode [2018-06-22 01:39:45,450 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:39:45 BoogieIcfgContainer [2018-06-22 01:39:45,450 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:39:45,453 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:39:45,453 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:39:45,458 INFO ]: TraceAbstraction initialized [2018-06-22 01:39:45,458 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:39:44" (1/3) ... [2018-06-22 01:39:45,459 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71906d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:39:45, skipping insertion in model container [2018-06-22 01:39:45,459 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:44" (2/3) ... [2018-06-22 01:39:45,459 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71906d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:39:45, skipping insertion in model container [2018-06-22 01:39:45,460 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:39:45" (3/3) ... [2018-06-22 01:39:45,462 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:39:45,471 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:39:45,478 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:39:45,516 INFO ]: Using default assertion order modulation [2018-06-22 01:39:45,516 INFO ]: Interprodecural is true [2018-06-22 01:39:45,516 INFO ]: Hoare is false [2018-06-22 01:39:45,516 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:39:45,516 INFO ]: Backedges is TWOTRACK [2018-06-22 01:39:45,516 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:39:45,516 INFO ]: Difference is false [2018-06-22 01:39:45,516 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:39:45,516 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:39:45,532 INFO ]: Start isEmpty. Operand 14 states. [2018-06-22 01:39:45,541 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-22 01:39:45,541 INFO ]: Found error trace [2018-06-22 01:39:45,542 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-22 01:39:45,542 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:45,546 INFO ]: Analyzing trace with hash -1287884424, now seen corresponding path program 1 times [2018-06-22 01:39:45,547 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:45,547 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:45,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:45,594 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:45,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:45,627 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:45,662 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:39:45,664 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:45,665 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:39:45,666 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:39:45,677 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:39:45,678 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:39:45,681 INFO ]: Start difference. First operand 14 states. Second operand 2 states. [2018-06-22 01:39:45,701 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:45,701 INFO ]: Finished difference Result 12 states and 15 transitions. [2018-06-22 01:39:45,701 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:39:45,702 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-22 01:39:45,704 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:45,714 INFO ]: With dead ends: 12 [2018-06-22 01:39:45,714 INFO ]: Without dead ends: 12 [2018-06-22 01:39:45,719 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:39:45,738 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:39:45,758 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:39:45,759 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:39:45,760 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-06-22 01:39:45,761 INFO ]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 6 [2018-06-22 01:39:45,761 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:45,761 INFO ]: Abstraction has 12 states and 15 transitions. [2018-06-22 01:39:45,761 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:39:45,761 INFO ]: Start isEmpty. Operand 12 states and 15 transitions. [2018-06-22 01:39:45,761 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:39:45,761 INFO ]: Found error trace [2018-06-22 01:39:45,761 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:45,761 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:45,762 INFO ]: Analyzing trace with hash 1936924964, now seen corresponding path program 1 times [2018-06-22 01:39:45,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:45,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:45,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:45,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:45,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:45,790 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:45,851 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:39:45,851 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:45,851 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:39:45,852 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:39:45,853 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:39:45,853 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:39:45,853 INFO ]: Start difference. First operand 12 states and 15 transitions. Second operand 3 states. [2018-06-22 01:39:45,879 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:45,879 INFO ]: Finished difference Result 13 states and 16 transitions. [2018-06-22 01:39:45,879 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:39:45,879 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:39:45,879 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:45,879 INFO ]: With dead ends: 13 [2018-06-22 01:39:45,880 INFO ]: Without dead ends: 13 [2018-06-22 01:39:45,880 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:39:45,880 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:39:45,882 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:39:45,882 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:39:45,883 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-06-22 01:39:45,883 INFO ]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 9 [2018-06-22 01:39:45,883 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:45,883 INFO ]: Abstraction has 13 states and 16 transitions. [2018-06-22 01:39:45,883 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:39:45,883 INFO ]: Start isEmpty. Operand 13 states and 16 transitions. [2018-06-22 01:39:45,883 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:39:45,883 INFO ]: Found error trace [2018-06-22 01:39:45,883 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:45,883 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:45,884 INFO ]: Analyzing trace with hash 1512549380, now seen corresponding path program 1 times [2018-06-22 01:39:45,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:45,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:45,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:45,884 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:45,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:45,919 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:45,992 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:39:45,992 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:45,992 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:39:45,993 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:39:45,993 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:39:45,993 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:45,993 INFO ]: Start difference. First operand 13 states and 16 transitions. Second operand 5 states. [2018-06-22 01:39:46,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:46,089 INFO ]: Finished difference Result 18 states and 22 transitions. [2018-06-22 01:39:46,090 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:46,090 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 01:39:46,090 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:46,092 INFO ]: With dead ends: 18 [2018-06-22 01:39:46,092 INFO ]: Without dead ends: 18 [2018-06-22 01:39:46,093 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:39:46,093 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:39:46,095 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-06-22 01:39:46,096 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:39:46,096 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-06-22 01:39:46,096 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 10 [2018-06-22 01:39:46,096 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:46,096 INFO ]: Abstraction has 14 states and 17 transitions. [2018-06-22 01:39:46,096 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:39:46,096 INFO ]: Start isEmpty. Operand 14 states and 17 transitions. [2018-06-22 01:39:46,097 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:39:46,098 INFO ]: Found error trace [2018-06-22 01:39:46,098 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:46,098 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:46,098 INFO ]: Analyzing trace with hash 1514515586, now seen corresponding path program 1 times [2018-06-22 01:39:46,098 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:46,098 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:46,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:46,099 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:46,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:46,115 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:46,285 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:39:46,285 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:46,285 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:39:46,285 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:39:46,285 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:39:46,286 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:46,286 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 5 states. [2018-06-22 01:39:46,560 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:46,560 INFO ]: Finished difference Result 20 states and 25 transitions. [2018-06-22 01:39:46,560 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:39:46,560 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 01:39:46,561 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:46,561 INFO ]: With dead ends: 20 [2018-06-22 01:39:46,561 INFO ]: Without dead ends: 20 [2018-06-22 01:39:46,562 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:39:46,562 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:39:46,564 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-06-22 01:39:46,564 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:39:46,564 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-06-22 01:39:46,564 INFO ]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2018-06-22 01:39:46,564 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:46,564 INFO ]: Abstraction has 15 states and 18 transitions. [2018-06-22 01:39:46,564 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:39:46,564 INFO ]: Start isEmpty. Operand 15 states and 18 transitions. [2018-06-22 01:39:46,564 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:39:46,564 INFO ]: Found error trace [2018-06-22 01:39:46,564 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:46,565 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:46,566 INFO ]: Analyzing trace with hash 1112970488, now seen corresponding path program 1 times [2018-06-22 01:39:46,566 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:46,566 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:46,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:46,567 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:46,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:46,609 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:46,841 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:46,841 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:46,841 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:39:46,854 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:46,915 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:46,925 INFO ]: Computing forward predicates... [2018-06-22 01:39:47,132 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 01:39:47,477 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:47,499 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:47,499 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-06-22 01:39:47,499 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:39:47,500 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:39:47,500 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:39:47,500 INFO ]: Start difference. First operand 15 states and 18 transitions. Second operand 13 states. [2018-06-22 01:39:47,963 WARN ]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-22 01:39:47,996 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:47,996 INFO ]: Finished difference Result 22 states and 25 transitions. [2018-06-22 01:39:47,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:39:47,997 INFO ]: Start accepts. Automaton has 13 states. Word has length 13 [2018-06-22 01:39:47,997 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:47,997 INFO ]: With dead ends: 22 [2018-06-22 01:39:47,997 INFO ]: Without dead ends: 20 [2018-06-22 01:39:47,998 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:39:47,998 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:39:48,000 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-06-22 01:39:48,000 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:39:48,000 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-06-22 01:39:48,001 INFO ]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 13 [2018-06-22 01:39:48,001 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:48,001 INFO ]: Abstraction has 16 states and 19 transitions. [2018-06-22 01:39:48,001 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:39:48,001 INFO ]: Start isEmpty. Operand 16 states and 19 transitions. [2018-06-22 01:39:48,001 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:39:48,001 INFO ]: Found error trace [2018-06-22 01:39:48,001 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:48,001 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:48,001 INFO ]: Analyzing trace with hash 1409986520, now seen corresponding path program 2 times [2018-06-22 01:39:48,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:48,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:48,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:48,002 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:48,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:48,020 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:48,505 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:48,505 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:48,505 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:39:48,513 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:39:48,565 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:39:48,565 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:48,567 INFO ]: Computing forward predicates... [2018-06-22 01:39:48,586 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:48,609 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:48,609 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 01:39:48,610 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:39:48,610 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:39:48,610 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:39:48,610 INFO ]: Start difference. First operand 16 states and 19 transitions. Second operand 9 states. [2018-06-22 01:39:48,779 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:48,779 INFO ]: Finished difference Result 22 states and 26 transitions. [2018-06-22 01:39:48,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:39:48,779 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-22 01:39:48,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:48,780 INFO ]: With dead ends: 22 [2018-06-22 01:39:48,780 INFO ]: Without dead ends: 22 [2018-06-22 01:39:48,780 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:39:48,780 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:39:48,782 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-06-22 01:39:48,782 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:39:48,783 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-06-22 01:39:48,783 INFO ]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 14 [2018-06-22 01:39:48,783 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:48,783 INFO ]: Abstraction has 18 states and 21 transitions. [2018-06-22 01:39:48,783 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:39:48,783 INFO ]: Start isEmpty. Operand 18 states and 21 transitions. [2018-06-22 01:39:48,783 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:39:48,783 INFO ]: Found error trace [2018-06-22 01:39:48,783 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:48,784 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:48,784 INFO ]: Analyzing trace with hash 1411952726, now seen corresponding path program 1 times [2018-06-22 01:39:48,784 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:48,784 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:48,784 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:48,784 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:39:48,784 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:48,796 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:48,860 INFO ]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:39:48,860 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:48,860 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:39:48,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:48,888 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:48,891 INFO ]: Computing forward predicates... [2018-06-22 01:39:48,976 INFO ]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:39:48,997 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:39:48,997 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2018-06-22 01:39:48,998 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:39:48,998 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:39:48,998 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:39:48,998 INFO ]: Start difference. First operand 18 states and 21 transitions. Second operand 12 states. [2018-06-22 01:39:49,222 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:49,222 INFO ]: Finished difference Result 18 states and 20 transitions. [2018-06-22 01:39:49,223 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:39:49,223 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-22 01:39:49,223 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:49,223 INFO ]: With dead ends: 18 [2018-06-22 01:39:49,223 INFO ]: Without dead ends: 18 [2018-06-22 01:39:49,224 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:39:49,224 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:39:49,225 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 01:39:49,225 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:39:49,238 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-22 01:39:49,238 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2018-06-22 01:39:49,238 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:49,238 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-22 01:39:49,238 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:39:49,239 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-22 01:39:49,239 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:39:49,239 INFO ]: Found error trace [2018-06-22 01:39:49,239 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:49,239 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:49,239 INFO ]: Analyzing trace with hash -615444316, now seen corresponding path program 3 times [2018-06-22 01:39:49,239 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:49,239 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:49,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:49,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:49,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:49,298 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:49,578 INFO ]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:49,579 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:49,579 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:39:49,594 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:39:49,632 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:39:49,632 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:49,635 INFO ]: Computing forward predicates... [2018-06-22 01:39:49,945 INFO ]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:49,969 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:49,969 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-22 01:39:49,969 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:39:49,969 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:39:49,970 INFO ]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:39:49,970 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 24 states. [2018-06-22 01:39:50,620 WARN ]: Spent 235.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-06-22 01:39:50,766 WARN ]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2018-06-22 01:39:51,109 WARN ]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2018-06-22 01:39:51,186 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:51,186 INFO ]: Finished difference Result 31 states and 35 transitions. [2018-06-22 01:39:51,186 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:39:51,186 INFO ]: Start accepts. Automaton has 24 states. Word has length 17 [2018-06-22 01:39:51,187 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:51,187 INFO ]: With dead ends: 31 [2018-06-22 01:39:51,187 INFO ]: Without dead ends: 31 [2018-06-22 01:39:51,188 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:39:51,188 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:39:51,191 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 01:39:51,191 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:39:51,192 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-06-22 01:39:51,192 INFO ]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2018-06-22 01:39:51,192 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:51,192 INFO ]: Abstraction has 27 states and 31 transitions. [2018-06-22 01:39:51,192 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:39:51,192 INFO ]: Start isEmpty. Operand 27 states and 31 transitions. [2018-06-22 01:39:51,192 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:39:51,192 INFO ]: Found error trace [2018-06-22 01:39:51,192 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:51,193 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:51,193 INFO ]: Analyzing trace with hash -615414525, now seen corresponding path program 1 times [2018-06-22 01:39:51,193 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:51,193 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:51,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:51,193 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:39:51,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:51,210 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:51,498 INFO ]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:39:51,498 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:51,498 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:39:51,506 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:51,542 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:51,545 INFO ]: Computing forward predicates... [2018-06-22 01:39:51,944 INFO ]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 01:39:51,964 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:51,964 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2018-06-22 01:39:51,964 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:39:51,964 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:39:51,965 INFO ]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:39:51,965 INFO ]: Start difference. First operand 27 states and 31 transitions. Second operand 18 states. [2018-06-22 01:39:52,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:52,702 INFO ]: Finished difference Result 21 states and 23 transitions. [2018-06-22 01:39:52,702 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:39:52,702 INFO ]: Start accepts. Automaton has 18 states. Word has length 17 [2018-06-22 01:39:52,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:52,703 INFO ]: With dead ends: 21 [2018-06-22 01:39:52,703 INFO ]: Without dead ends: 0 [2018-06-22 01:39:52,703 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:39:52,703 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:39:52,703 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:39:52,703 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:39:52,703 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:39:52,703 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-22 01:39:52,704 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:52,704 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:39:52,704 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:39:52,704 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:39:52,704 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:39:52,709 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:39:52 BoogieIcfgContainer [2018-06-22 01:39:52,709 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:39:52,710 INFO ]: Toolchain (without parser) took 7778.50 ms. Allocated memory was 306.2 MB in the beginning and 380.6 MB in the end (delta: 74.4 MB). Free memory was 260.7 MB in the beginning and 346.0 MB in the end (delta: -85.3 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:39:52,711 INFO ]: SmtParser took 0.11 ms. Allocated memory is still 306.2 MB. Free memory is still 271.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:39:52,711 INFO ]: ChcToBoogie took 51.71 ms. Allocated memory is still 306.2 MB. Free memory was 259.7 MB in the beginning and 257.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:52,712 INFO ]: Boogie Preprocessor took 49.92 ms. Allocated memory is still 306.2 MB. Free memory was 257.7 MB in the beginning and 256.6 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:39:52,712 INFO ]: RCFGBuilder took 408.79 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 244.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:52,713 INFO ]: TraceAbstraction took 7256.45 ms. Allocated memory was 306.2 MB in the beginning and 380.6 MB in the end (delta: 74.4 MB). Free memory was 244.6 MB in the beginning and 346.0 MB in the end (delta: -101.4 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:39:52,716 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.11 ms. Allocated memory is still 306.2 MB. Free memory is still 271.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 51.71 ms. Allocated memory is still 306.2 MB. Free memory was 259.7 MB in the beginning and 257.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 49.92 ms. Allocated memory is still 306.2 MB. Free memory was 257.7 MB in the beginning and 256.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 408.79 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 244.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 7256.45 ms. Allocated memory was 306.2 MB in the beginning and 380.6 MB in the end (delta: 74.4 MB). Free memory was 244.6 MB in the beginning and 346.0 MB in the end (delta: -101.4 MB). There was no memory consumed. 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, 14 locations, 1 error locations. SAFE Result, 7.2s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 98 SDtfs, 239 SDslu, 410 SDs, 0 SdLazy, 328 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=8, 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, 21 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 11661 SizeOfPredicates, 60 NumberOfNonLiveVariables, 714 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 29/56 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/array_init.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-39-52-727.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_init.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-39-52-727.csv Received shutdown request...