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/queen.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:51:03,681 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:51:03,684 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:51:03,698 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:51:03,699 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:51:03,700 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:51:03,703 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:51:03,706 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:51:03,707 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:51:03,709 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:51:03,710 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:51:03,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:51:03,711 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:51:03,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:51:03,716 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:51:03,717 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:51:03,726 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:51:03,728 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:51:03,729 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:51:03,730 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:51:03,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:51:03,737 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:51:03,737 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:51:03,737 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:51:03,739 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:51:03,740 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:51:03,740 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:51:03,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:51:03,744 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:51:03,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:51:03,745 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:51:03,746 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:51:03,746 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:51:03,747 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:51:03,749 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:51:03,750 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:51:03,774 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:51:03,775 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:51:03,775 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:51:03,775 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:51:03,776 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:51:03,776 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:51:03,777 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:51:03,777 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:51:03,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:51:03,777 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:51:03,777 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:51:03,777 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:51:03,778 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:51:03,778 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:51:03,779 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:51:03,779 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:51:03,779 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:51:03,780 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:51:03,781 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:51:03,828 INFO ]: Repository-Root is: /tmp [2018-06-22 01:51:03,845 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:51:03,857 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:51:03,859 INFO ]: Initializing SmtParser... [2018-06-22 01:51:03,859 INFO ]: SmtParser initialized [2018-06-22 01:51:03,860 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/queen.smt2 [2018-06-22 01:51:03,861 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:51:03,959 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/queen.smt2 unknown [2018-06-22 01:51:04,760 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/queen.smt2 [2018-06-22 01:51:04,765 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:51:04,772 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:51:04,772 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:51:04,772 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:51:04,773 INFO ]: ChcToBoogie initialized [2018-06-22 01:51:04,778 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:51:04" (1/1) ... [2018-06-22 01:51:04,865 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:51:04 Unit [2018-06-22 01:51:04,866 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:51:04,866 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:51:04,866 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:51:04,866 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:51:04,888 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:51:04" (1/1) ... [2018-06-22 01:51:04,889 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:51:04" (1/1) ... [2018-06-22 01:51:04,901 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:51:04" (1/1) ... [2018-06-22 01:51:04,901 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:51:04" (1/1) ... [2018-06-22 01:51:04,926 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:51:04" (1/1) ... [2018-06-22 01:51:04,936 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:51:04" (1/1) ... [2018-06-22 01:51:04,939 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:51:04" (1/1) ... [2018-06-22 01:51:04,948 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:51:04,948 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:51:04,948 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:51:04,948 INFO ]: RCFGBuilder initialized [2018-06-22 01:51:04,949 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:51:04" (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:51:04,974 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:51:04,974 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:51:04,974 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:51:04,974 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:51:04,974 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:51:04,974 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:51:06,697 INFO ]: Using library mode [2018-06-22 01:51:06,697 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:51:06 BoogieIcfgContainer [2018-06-22 01:51:06,698 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:51:06,699 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:51:06,702 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:51:06,705 INFO ]: TraceAbstraction initialized [2018-06-22 01:51:06,705 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:51:04" (1/3) ... [2018-06-22 01:51:06,706 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23980539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:51:06, skipping insertion in model container [2018-06-22 01:51:06,706 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:51:04" (2/3) ... [2018-06-22 01:51:06,707 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23980539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:51:06, skipping insertion in model container [2018-06-22 01:51:06,707 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:51:06" (3/3) ... [2018-06-22 01:51:06,709 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:51:06,716 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:51:06,725 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:51:06,776 INFO ]: Using default assertion order modulation [2018-06-22 01:51:06,777 INFO ]: Interprodecural is true [2018-06-22 01:51:06,777 INFO ]: Hoare is false [2018-06-22 01:51:06,777 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:51:06,777 INFO ]: Backedges is TWOTRACK [2018-06-22 01:51:06,777 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:51:06,777 INFO ]: Difference is false [2018-06-22 01:51:06,777 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:51:06,777 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:51:06,794 INFO ]: Start isEmpty. Operand 123 states. [2018-06-22 01:51:06,804 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:51:06,804 INFO ]: Found error trace [2018-06-22 01:51:06,808 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:51:06,808 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:51:06,813 INFO ]: Analyzing trace with hash 179211156, now seen corresponding path program 1 times [2018-06-22 01:51:06,814 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:51:06,814 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:51:06,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:06,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:06,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:06,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:07,066 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:51:07,069 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:51:07,069 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:51:07,071 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:51:07,087 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:51:07,088 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:51:07,091 INFO ]: Start difference. First operand 123 states. Second operand 4 states. [2018-06-22 01:51:09,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:51:09,453 INFO ]: Finished difference Result 231 states and 389 transitions. [2018-06-22 01:51:09,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:51:09,457 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:51:09,458 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:51:09,496 INFO ]: With dead ends: 231 [2018-06-22 01:51:09,496 INFO ]: Without dead ends: 231 [2018-06-22 01:51:09,498 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:51:09,516 INFO ]: Start minimizeSevpa. Operand 231 states. [2018-06-22 01:51:09,591 INFO ]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-06-22 01:51:09,592 INFO ]: Start removeUnreachable. Operand 231 states. [2018-06-22 01:51:09,609 INFO ]: Finished removeUnreachable. Reduced from 231 states to 231 states and 389 transitions. [2018-06-22 01:51:09,611 INFO ]: Start accepts. Automaton has 231 states and 389 transitions. Word has length 8 [2018-06-22 01:51:09,611 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:51:09,611 INFO ]: Abstraction has 231 states and 389 transitions. [2018-06-22 01:51:09,611 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:51:09,611 INFO ]: Start isEmpty. Operand 231 states and 389 transitions. [2018-06-22 01:51:09,613 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:51:09,613 INFO ]: Found error trace [2018-06-22 01:51:09,613 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:51:09,613 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:51:09,613 INFO ]: Analyzing trace with hash 857348610, now seen corresponding path program 1 times [2018-06-22 01:51:09,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:51:09,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:51:09,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:09,614 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:09,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:09,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:09,755 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:51:09,755 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:51:09,755 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:51:09,757 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:51:09,757 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:51:09,757 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:51:09,757 INFO ]: Start difference. First operand 231 states and 389 transitions. Second operand 4 states. [2018-06-22 01:51:11,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:51:11,072 INFO ]: Finished difference Result 341 states and 576 transitions. [2018-06-22 01:51:11,072 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:51:11,073 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:51:11,073 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:51:11,095 INFO ]: With dead ends: 341 [2018-06-22 01:51:11,095 INFO ]: Without dead ends: 341 [2018-06-22 01:51:11,095 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:51:11,096 INFO ]: Start minimizeSevpa. Operand 341 states. [2018-06-22 01:51:11,137 INFO ]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-06-22 01:51:11,137 INFO ]: Start removeUnreachable. Operand 341 states. [2018-06-22 01:51:11,158 INFO ]: Finished removeUnreachable. Reduced from 341 states to 341 states and 576 transitions. [2018-06-22 01:51:11,158 INFO ]: Start accepts. Automaton has 341 states and 576 transitions. Word has length 9 [2018-06-22 01:51:11,158 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:51:11,158 INFO ]: Abstraction has 341 states and 576 transitions. [2018-06-22 01:51:11,158 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:51:11,158 INFO ]: Start isEmpty. Operand 341 states and 576 transitions. [2018-06-22 01:51:11,159 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:51:11,159 INFO ]: Found error trace [2018-06-22 01:51:11,159 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:51:11,160 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:51:11,160 INFO ]: Analyzing trace with hash -66170910, now seen corresponding path program 1 times [2018-06-22 01:51:11,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:51:11,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:51:11,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:11,160 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:11,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:11,166 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:11,213 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:51:11,213 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:51:11,213 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:51:11,213 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:51:11,213 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:51:11,213 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:51:11,213 INFO ]: Start difference. First operand 341 states and 576 transitions. Second operand 4 states. [2018-06-22 01:51:12,427 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:51:12,427 INFO ]: Finished difference Result 445 states and 752 transitions. [2018-06-22 01:51:12,427 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:51:12,427 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 01:51:12,427 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:51:12,459 INFO ]: With dead ends: 445 [2018-06-22 01:51:12,459 INFO ]: Without dead ends: 445 [2018-06-22 01:51:12,460 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:51:12,460 INFO ]: Start minimizeSevpa. Operand 445 states. [2018-06-22 01:51:12,530 INFO ]: Finished minimizeSevpa. Reduced states from 445 to 445. [2018-06-22 01:51:12,530 INFO ]: Start removeUnreachable. Operand 445 states. [2018-06-22 01:51:12,547 INFO ]: Finished removeUnreachable. Reduced from 445 states to 445 states and 752 transitions. [2018-06-22 01:51:12,548 INFO ]: Start accepts. Automaton has 445 states and 752 transitions. Word has length 11 [2018-06-22 01:51:12,548 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:51:12,548 INFO ]: Abstraction has 445 states and 752 transitions. [2018-06-22 01:51:12,548 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:51:12,548 INFO ]: Start isEmpty. Operand 445 states and 752 transitions. [2018-06-22 01:51:12,552 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:51:12,552 INFO ]: Found error trace [2018-06-22 01:51:12,552 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:51:12,552 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:51:12,552 INFO ]: Analyzing trace with hash -1374522704, now seen corresponding path program 1 times [2018-06-22 01:51:12,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:51:12,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:51:12,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:12,553 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:12,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:12,569 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:12,697 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:51:12,697 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:51:12,697 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:51:12,697 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:51:12,697 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:51:12,698 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:51:12,698 INFO ]: Start difference. First operand 445 states and 752 transitions. Second operand 4 states. [2018-06-22 01:51:13,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:51:13,517 INFO ]: Finished difference Result 536 states and 906 transitions. [2018-06-22 01:51:13,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:51:13,518 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 01:51:13,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:51:13,559 INFO ]: With dead ends: 536 [2018-06-22 01:51:13,559 INFO ]: Without dead ends: 536 [2018-06-22 01:51:13,559 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:51:13,559 INFO ]: Start minimizeSevpa. Operand 536 states. [2018-06-22 01:51:13,612 INFO ]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-06-22 01:51:13,612 INFO ]: Start removeUnreachable. Operand 536 states. [2018-06-22 01:51:13,641 INFO ]: Finished removeUnreachable. Reduced from 536 states to 536 states and 906 transitions. [2018-06-22 01:51:13,641 INFO ]: Start accepts. Automaton has 536 states and 906 transitions. Word has length 13 [2018-06-22 01:51:13,641 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:51:13,641 INFO ]: Abstraction has 536 states and 906 transitions. [2018-06-22 01:51:13,641 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:51:13,641 INFO ]: Start isEmpty. Operand 536 states and 906 transitions. [2018-06-22 01:51:13,643 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:51:13,643 INFO ]: Found error trace [2018-06-22 01:51:13,643 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:51:13,643 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:51:13,643 INFO ]: Analyzing trace with hash -460291041, now seen corresponding path program 1 times [2018-06-22 01:51:13,643 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:51:13,643 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:51:13,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:13,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:13,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:13,650 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:13,749 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:51:13,749 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:51:13,749 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:51:13,749 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:51:13,749 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:51:13,749 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:51:13,749 INFO ]: Start difference. First operand 536 states and 906 transitions. Second operand 4 states. [2018-06-22 01:51:14,315 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:51:14,315 INFO ]: Finished difference Result 623 states and 1054 transitions. [2018-06-22 01:51:14,315 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:51:14,315 INFO ]: Start accepts. Automaton has 4 states. Word has length 15 [2018-06-22 01:51:14,315 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:51:14,344 INFO ]: With dead ends: 623 [2018-06-22 01:51:14,344 INFO ]: Without dead ends: 623 [2018-06-22 01:51:14,344 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:51:14,345 INFO ]: Start minimizeSevpa. Operand 623 states. [2018-06-22 01:51:14,392 INFO ]: Finished minimizeSevpa. Reduced states from 623 to 623. [2018-06-22 01:51:14,392 INFO ]: Start removeUnreachable. Operand 623 states. [2018-06-22 01:51:14,411 INFO ]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1054 transitions. [2018-06-22 01:51:14,411 INFO ]: Start accepts. Automaton has 623 states and 1054 transitions. Word has length 15 [2018-06-22 01:51:14,411 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:51:14,411 INFO ]: Abstraction has 623 states and 1054 transitions. [2018-06-22 01:51:14,411 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:51:14,411 INFO ]: Start isEmpty. Operand 623 states and 1054 transitions. [2018-06-22 01:51:14,416 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:51:14,416 INFO ]: Found error trace [2018-06-22 01:51:14,416 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:51:14,416 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:51:14,417 INFO ]: Analyzing trace with hash -64007256, now seen corresponding path program 1 times [2018-06-22 01:51:14,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:51:14,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:51:14,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:14,417 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:14,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:14,423 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:14,447 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:51:14,447 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:51:14,447 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:51:14,447 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:51:14,447 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:51:14,447 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:51:14,447 INFO ]: Start difference. First operand 623 states and 1054 transitions. Second operand 4 states. [2018-06-22 01:51:16,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:51:16,720 INFO ]: Finished difference Result 710 states and 1202 transitions. [2018-06-22 01:51:16,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:51:16,720 INFO ]: Start accepts. Automaton has 4 states. Word has length 20 [2018-06-22 01:51:16,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:51:16,766 INFO ]: With dead ends: 710 [2018-06-22 01:51:16,766 INFO ]: Without dead ends: 710 [2018-06-22 01:51:16,767 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:51:16,767 INFO ]: Start minimizeSevpa. Operand 710 states. [2018-06-22 01:51:16,860 INFO ]: Finished minimizeSevpa. Reduced states from 710 to 710. [2018-06-22 01:51:16,860 INFO ]: Start removeUnreachable. Operand 710 states. [2018-06-22 01:51:16,886 INFO ]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1202 transitions. [2018-06-22 01:51:16,886 INFO ]: Start accepts. Automaton has 710 states and 1202 transitions. Word has length 20 [2018-06-22 01:51:16,886 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:51:16,886 INFO ]: Abstraction has 710 states and 1202 transitions. [2018-06-22 01:51:16,886 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:51:16,886 INFO ]: Start isEmpty. Operand 710 states and 1202 transitions. [2018-06-22 01:51:16,941 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:51:16,941 INFO ]: Found error trace [2018-06-22 01:51:16,941 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:51:16,941 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:51:16,941 INFO ]: Analyzing trace with hash 280562874, now seen corresponding path program 1 times [2018-06-22 01:51:16,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:51:16,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:51:16,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:16,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:16,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:16,955 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:17,127 INFO ]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:51:17,127 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:51:17,127 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:51:17,178 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:17,211 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:17,220 INFO ]: Computing forward predicates... [2018-06-22 01:51:17,255 INFO ]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:51:17,292 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:51:17,292 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:51:17,292 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:51:17,292 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:51:17,292 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:51:17,292 INFO ]: Start difference. First operand 710 states and 1202 transitions. Second operand 4 states. [2018-06-22 01:51:20,107 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:51:20,107 INFO ]: Finished difference Result 797 states and 1350 transitions. [2018-06-22 01:51:20,107 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:51:20,107 INFO ]: Start accepts. Automaton has 4 states. Word has length 42 [2018-06-22 01:51:20,107 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:51:20,190 INFO ]: With dead ends: 797 [2018-06-22 01:51:20,190 INFO ]: Without dead ends: 797 [2018-06-22 01:51:20,190 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:51:20,191 INFO ]: Start minimizeSevpa. Operand 797 states. [2018-06-22 01:51:20,281 INFO ]: Finished minimizeSevpa. Reduced states from 797 to 797. [2018-06-22 01:51:20,281 INFO ]: Start removeUnreachable. Operand 797 states. [2018-06-22 01:51:20,308 INFO ]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1350 transitions. [2018-06-22 01:51:20,308 INFO ]: Start accepts. Automaton has 797 states and 1350 transitions. Word has length 42 [2018-06-22 01:51:20,309 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:51:20,309 INFO ]: Abstraction has 797 states and 1350 transitions. [2018-06-22 01:51:20,309 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:51:20,309 INFO ]: Start isEmpty. Operand 797 states and 1350 transitions. [2018-06-22 01:51:20,434 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 01:51:20,434 INFO ]: Found error trace [2018-06-22 01:51:20,434 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:51:20,435 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:51:20,435 INFO ]: Analyzing trace with hash 2103591472, now seen corresponding path program 1 times [2018-06-22 01:51:20,435 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:51:20,435 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:51:20,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:20,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:20,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:20,454 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:20,641 INFO ]: Checked inductivity of 62 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 01:51:20,642 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:51:20,642 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) [2018-06-22 01:51:20,657 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:51:20,715 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:20,719 INFO ]: Computing forward predicates... [2018-06-22 01:51:20,735 INFO ]: Checked inductivity of 62 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 01:51:20,768 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:51:20,768 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:51:20,768 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:51:20,768 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:51:20,768 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:51:20,768 INFO ]: Start difference. First operand 797 states and 1350 transitions. Second operand 4 states. [2018-06-22 01:51:21,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:51:21,410 INFO ]: Finished difference Result 884 states and 1498 transitions. [2018-06-22 01:51:21,410 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:51:21,410 INFO ]: Start accepts. Automaton has 4 states. Word has length 69 [2018-06-22 01:51:21,411 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:51:21,465 INFO ]: With dead ends: 884 [2018-06-22 01:51:21,465 INFO ]: Without dead ends: 884 [2018-06-22 01:51:21,466 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:51:21,466 INFO ]: Start minimizeSevpa. Operand 884 states. [2018-06-22 01:51:21,529 INFO ]: Finished minimizeSevpa. Reduced states from 884 to 884. [2018-06-22 01:51:21,529 INFO ]: Start removeUnreachable. Operand 884 states. [2018-06-22 01:51:21,557 INFO ]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1498 transitions. [2018-06-22 01:51:21,557 INFO ]: Start accepts. Automaton has 884 states and 1498 transitions. Word has length 69 [2018-06-22 01:51:21,558 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:51:21,558 INFO ]: Abstraction has 884 states and 1498 transitions. [2018-06-22 01:51:21,558 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:51:21,558 INFO ]: Start isEmpty. Operand 884 states and 1498 transitions. [2018-06-22 01:51:21,604 INFO ]: Finished isEmpty. Found accepting run of length 72 [2018-06-22 01:51:21,604 INFO ]: Found error trace [2018-06-22 01:51:21,605 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:51:21,605 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:51:21,606 INFO ]: Analyzing trace with hash -1603450721, now seen corresponding path program 1 times [2018-06-22 01:51:21,606 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:51:21,606 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:51:21,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:21,606 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:21,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:21,620 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:21,795 INFO ]: Checked inductivity of 62 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 01:51:21,795 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:51:21,795 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) [2018-06-22 01:51:21,811 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:51:21,856 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:21,859 INFO ]: Computing forward predicates... [2018-06-22 01:51:21,878 INFO ]: Checked inductivity of 62 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 01:51:21,911 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:51:21,911 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:51:21,911 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:51:21,911 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:51:21,911 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:51:21,912 INFO ]: Start difference. First operand 884 states and 1498 transitions. Second operand 4 states. [2018-06-22 01:51:22,556 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:51:22,556 INFO ]: Finished difference Result 971 states and 1646 transitions. [2018-06-22 01:51:22,556 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:51:22,556 INFO ]: Start accepts. Automaton has 4 states. Word has length 71 [2018-06-22 01:51:22,556 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:51:22,605 INFO ]: With dead ends: 971 [2018-06-22 01:51:22,605 INFO ]: Without dead ends: 971 [2018-06-22 01:51:22,605 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:51:22,606 INFO ]: Start minimizeSevpa. Operand 971 states. [2018-06-22 01:51:22,667 INFO ]: Finished minimizeSevpa. Reduced states from 971 to 971. [2018-06-22 01:51:22,667 INFO ]: Start removeUnreachable. Operand 971 states. [2018-06-22 01:51:22,698 INFO ]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1646 transitions. [2018-06-22 01:51:22,699 INFO ]: Start accepts. Automaton has 971 states and 1646 transitions. Word has length 71 [2018-06-22 01:51:22,699 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:51:22,699 INFO ]: Abstraction has 971 states and 1646 transitions. [2018-06-22 01:51:22,699 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:51:22,699 INFO ]: Start isEmpty. Operand 971 states and 1646 transitions. [2018-06-22 01:51:22,756 INFO ]: Finished isEmpty. Found accepting run of length 81 [2018-06-22 01:51:22,756 INFO ]: Found error trace [2018-06-22 01:51:22,756 INFO ]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:51:22,756 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:51:22,756 INFO ]: Analyzing trace with hash 180833870, now seen corresponding path program 1 times [2018-06-22 01:51:22,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:51:22,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:51:22,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:22,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:22,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:22,771 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:22,920 INFO ]: Checked inductivity of 82 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-06-22 01:51:22,920 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:51:22,920 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:51:22,930 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:51:22,978 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:22,983 INFO ]: Computing forward predicates... [2018-06-22 01:51:22,993 INFO ]: Checked inductivity of 82 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 01:51:23,024 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:51:23,024 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 01:51:23,024 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:51:23,024 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:51:23,024 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:51:23,024 INFO ]: Start difference. First operand 971 states and 1646 transitions. Second operand 4 states. [2018-06-22 01:51:23,858 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:51:23,858 INFO ]: Finished difference Result 1066 states and 1806 transitions. [2018-06-22 01:51:23,859 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:51:23,859 INFO ]: Start accepts. Automaton has 4 states. Word has length 80 [2018-06-22 01:51:23,859 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:51:23,933 INFO ]: With dead ends: 1066 [2018-06-22 01:51:23,933 INFO ]: Without dead ends: 1066 [2018-06-22 01:51:23,933 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:51:23,934 INFO ]: Start minimizeSevpa. Operand 1066 states. [2018-06-22 01:51:24,002 INFO ]: Finished minimizeSevpa. Reduced states from 1066 to 1066. [2018-06-22 01:51:24,002 INFO ]: Start removeUnreachable. Operand 1066 states. [2018-06-22 01:51:24,116 INFO ]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1806 transitions. [2018-06-22 01:51:24,116 INFO ]: Start accepts. Automaton has 1066 states and 1806 transitions. Word has length 80 [2018-06-22 01:51:24,116 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:51:24,116 INFO ]: Abstraction has 1066 states and 1806 transitions. [2018-06-22 01:51:24,116 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:51:24,116 INFO ]: Start isEmpty. Operand 1066 states and 1806 transitions. [2018-06-22 01:51:24,214 INFO ]: Finished isEmpty. Found accepting run of length 275 [2018-06-22 01:51:24,214 INFO ]: Found error trace [2018-06-22 01:51:24,215 INFO ]: trace histogram [17, 17, 16, 16, 16, 12, 12, 12, 11, 11, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:51:24,215 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:51:24,215 INFO ]: Analyzing trace with hash -1238315582, now seen corresponding path program 1 times [2018-06-22 01:51:24,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:51:24,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:51:24,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:24,216 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:24,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:24,259 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:24,428 INFO ]: Checked inductivity of 1336 backedges. 91 proven. 152 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2018-06-22 01:51:24,428 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:51:24,428 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:51:24,436 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:24,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:24,575 INFO ]: Computing forward predicates... [2018-06-22 01:51:24,632 INFO ]: Checked inductivity of 1336 backedges. 534 proven. 0 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2018-06-22 01:51:24,664 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:51:24,664 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 01:51:24,665 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:51:24,665 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:51:24,665 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:51:24,665 INFO ]: Start difference. First operand 1066 states and 1806 transitions. Second operand 4 states. [2018-06-22 01:51:26,074 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:51:26,075 INFO ]: Finished difference Result 1444 states and 2435 transitions. [2018-06-22 01:51:26,075 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:51:26,075 INFO ]: Start accepts. Automaton has 4 states. Word has length 274 [2018-06-22 01:51:26,075 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:51:26,159 INFO ]: With dead ends: 1444 [2018-06-22 01:51:26,159 INFO ]: Without dead ends: 1137 [2018-06-22 01:51:26,159 INFO ]: 0 DeclaredPredicates, 279 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:51:26,160 INFO ]: Start minimizeSevpa. Operand 1137 states. [2018-06-22 01:51:26,236 INFO ]: Finished minimizeSevpa. Reduced states from 1137 to 1137. [2018-06-22 01:51:26,236 INFO ]: Start removeUnreachable. Operand 1137 states. [2018-06-22 01:51:26,308 INFO ]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1843 transitions. [2018-06-22 01:51:26,308 INFO ]: Start accepts. Automaton has 1137 states and 1843 transitions. Word has length 274 [2018-06-22 01:51:26,308 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:51:26,308 INFO ]: Abstraction has 1137 states and 1843 transitions. [2018-06-22 01:51:26,308 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:51:26,308 INFO ]: Start isEmpty. Operand 1137 states and 1843 transitions. [2018-06-22 01:51:26,392 INFO ]: Finished isEmpty. Found accepting run of length 327 [2018-06-22 01:51:26,392 INFO ]: Found error trace [2018-06-22 01:51:26,392 INFO ]: trace histogram [21, 21, 20, 20, 20, 16, 16, 16, 11, 9, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:51:26,392 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:51:26,392 INFO ]: Analyzing trace with hash 1952181034, now seen corresponding path program 1 times [2018-06-22 01:51:26,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:51:26,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:51:26,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:26,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:26,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:26,422 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:26,675 INFO ]: Checked inductivity of 2026 backedges. 151 proven. 188 refuted. 0 times theorem prover too weak. 1687 trivial. 0 not checked. [2018-06-22 01:51:26,676 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:51:26,676 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:51:26,691 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:26,893 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:26,903 INFO ]: Computing forward predicates... [2018-06-22 01:51:26,978 INFO ]: Checked inductivity of 2026 backedges. 933 proven. 0 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2018-06-22 01:51:27,012 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:51:27,013 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 01:51:27,013 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:51:27,013 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:51:27,013 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:51:27,013 INFO ]: Start difference. First operand 1137 states and 1843 transitions. Second operand 4 states. [2018-06-22 01:51:27,916 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:51:27,917 INFO ]: Finished difference Result 1294 states and 2099 transitions. [2018-06-22 01:51:27,917 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:51:27,917 INFO ]: Start accepts. Automaton has 4 states. Word has length 326 [2018-06-22 01:51:27,917 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:51:27,965 INFO ]: With dead ends: 1294 [2018-06-22 01:51:27,965 INFO ]: Without dead ends: 1224 [2018-06-22 01:51:27,965 INFO ]: 0 DeclaredPredicates, 331 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:51:27,966 INFO ]: Start minimizeSevpa. Operand 1224 states. [2018-06-22 01:51:28,037 INFO ]: Finished minimizeSevpa. Reduced states from 1224 to 1224. [2018-06-22 01:51:28,037 INFO ]: Start removeUnreachable. Operand 1224 states. [2018-06-22 01:51:28,076 INFO ]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1966 transitions. [2018-06-22 01:51:28,076 INFO ]: Start accepts. Automaton has 1224 states and 1966 transitions. Word has length 326 [2018-06-22 01:51:28,076 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:51:28,076 INFO ]: Abstraction has 1224 states and 1966 transitions. [2018-06-22 01:51:28,076 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:51:28,076 INFO ]: Start isEmpty. Operand 1224 states and 1966 transitions. [2018-06-22 01:51:28,179 INFO ]: Finished isEmpty. Found accepting run of length 477 [2018-06-22 01:51:28,180 INFO ]: Found error trace [2018-06-22 01:51:28,180 INFO ]: trace histogram [33, 33, 32, 32, 32, 25, 25, 25, 18, 14, 11, 11, 11, 11, 11, 11, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:51:28,180 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:51:28,180 INFO ]: Analyzing trace with hash -26567506, now seen corresponding path program 1 times [2018-06-22 01:51:28,180 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:51:28,180 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:51:28,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:28,181 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:28,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:28,213 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:28,475 INFO ]: Checked inductivity of 5083 backedges. 237 proven. 349 refuted. 0 times theorem prover too weak. 4497 trivial. 0 not checked. [2018-06-22 01:51:28,475 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:51:28,476 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:51:28,482 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:28,696 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:28,707 INFO ]: Computing forward predicates... [2018-06-22 01:51:28,894 INFO ]: Checked inductivity of 5083 backedges. 2286 proven. 26 refuted. 0 times theorem prover too weak. 2771 trivial. 0 not checked. [2018-06-22 01:51:28,921 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:51:28,921 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:51:28,921 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:51:28,921 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:51:28,921 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:51:28,922 INFO ]: Start difference. First operand 1224 states and 1966 transitions. Second operand 4 states. [2018-06-22 01:51:29,298 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:51:29,298 INFO ]: Finished difference Result 1377 states and 2216 transitions. [2018-06-22 01:51:29,298 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:51:29,298 INFO ]: Start accepts. Automaton has 4 states. Word has length 476 [2018-06-22 01:51:29,299 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:51:29,386 INFO ]: With dead ends: 1377 [2018-06-22 01:51:29,386 INFO ]: Without dead ends: 1311 [2018-06-22 01:51:29,386 INFO ]: 0 DeclaredPredicates, 481 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:51:29,387 INFO ]: Start minimizeSevpa. Operand 1311 states. [2018-06-22 01:51:29,462 INFO ]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2018-06-22 01:51:29,462 INFO ]: Start removeUnreachable. Operand 1311 states. [2018-06-22 01:51:29,498 INFO ]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 2098 transitions. [2018-06-22 01:51:29,498 INFO ]: Start accepts. Automaton has 1311 states and 2098 transitions. Word has length 476 [2018-06-22 01:51:29,499 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:51:29,499 INFO ]: Abstraction has 1311 states and 2098 transitions. [2018-06-22 01:51:29,499 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:51:29,499 INFO ]: Start isEmpty. Operand 1311 states and 2098 transitions. [2018-06-22 01:51:29,580 INFO ]: Finished isEmpty. Found accepting run of length 531 [2018-06-22 01:51:29,580 INFO ]: Found error trace [2018-06-22 01:51:29,580 INFO ]: trace histogram [36, 36, 35, 35, 35, 28, 28, 28, 18, 17, 11, 11, 11, 11, 11, 11, 10, 7, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:51:29,580 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:51:29,581 INFO ]: Analyzing trace with hash 859559315, now seen corresponding path program 1 times [2018-06-22 01:51:29,581 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:51:29,581 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:51:29,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:29,581 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:29,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:29,607 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:29,983 INFO ]: Checked inductivity of 6133 backedges. 261 proven. 401 refuted. 0 times theorem prover too weak. 5471 trivial. 0 not checked. [2018-06-22 01:51:29,983 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:51:29,983 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:51:29,990 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:30,189 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:30,202 INFO ]: Computing forward predicates... [2018-06-22 01:51:30,328 INFO ]: Checked inductivity of 6133 backedges. 2760 proven. 35 refuted. 0 times theorem prover too weak. 3338 trivial. 0 not checked. [2018-06-22 01:51:30,354 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:51:30,355 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:51:30,355 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:51:30,355 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:51:30,355 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:51:30,355 INFO ]: Start difference. First operand 1311 states and 2098 transitions. Second operand 4 states. [2018-06-22 01:51:31,066 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:51:31,066 INFO ]: Finished difference Result 1464 states and 2348 transitions. [2018-06-22 01:51:31,066 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:51:31,066 INFO ]: Start accepts. Automaton has 4 states. Word has length 530 [2018-06-22 01:51:31,067 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:51:31,130 INFO ]: With dead ends: 1464 [2018-06-22 01:51:31,130 INFO ]: Without dead ends: 1398 [2018-06-22 01:51:31,131 INFO ]: 0 DeclaredPredicates, 535 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:51:31,132 INFO ]: Start minimizeSevpa. Operand 1398 states. [2018-06-22 01:51:31,225 INFO ]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2018-06-22 01:51:31,225 INFO ]: Start removeUnreachable. Operand 1398 states. [2018-06-22 01:51:31,270 INFO ]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2230 transitions. [2018-06-22 01:51:31,270 INFO ]: Start accepts. Automaton has 1398 states and 2230 transitions. Word has length 530 [2018-06-22 01:51:31,271 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:51:31,271 INFO ]: Abstraction has 1398 states and 2230 transitions. [2018-06-22 01:51:31,271 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:51:31,271 INFO ]: Start isEmpty. Operand 1398 states and 2230 transitions. [2018-06-22 01:51:31,386 INFO ]: Finished isEmpty. Found accepting run of length 651 [2018-06-22 01:51:31,386 INFO ]: Found error trace [2018-06-22 01:51:31,386 INFO ]: trace histogram [45, 45, 44, 44, 44, 34, 34, 34, 24, 20, 14, 14, 14, 14, 14, 14, 10, 10, 10, 10, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:51:31,386 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:51:31,386 INFO ]: Analyzing trace with hash -1069051272, now seen corresponding path program 1 times [2018-06-22 01:51:31,386 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:51:31,386 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:51:31,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:31,387 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:31,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:51:31,494 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:32,067 INFO ]: Checked inductivity of 9544 backedges. 188 proven. 30 refuted. 0 times theorem prover too weak. 9326 trivial. 0 not checked. [2018-06-22 01:51:32,068 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:51:32,068 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:51:32,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:51:32,378 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:51:32,405 INFO ]: Computing forward predicates... [2018-06-22 01:51:34,105 INFO ]: Checked inductivity of 9544 backedges. 4122 proven. 182 refuted. 0 times theorem prover too weak. 5240 trivial. 0 not checked. [2018-06-22 01:51:34,129 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:51:34,129 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 21] total 26 [2018-06-22 01:51:34,130 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:51:34,130 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:51:34,130 INFO ]: CoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:51:34,131 INFO ]: Start difference. First operand 1398 states and 2230 transitions. Second operand 26 states. Received shutdown request... [2018-06-22 01:52:01,330 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-06-22 01:52:01,330 WARN ]: Verification canceled [2018-06-22 01:52:01,336 WARN ]: Timeout [2018-06-22 01:52:01,336 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:52:01 BoogieIcfgContainer [2018-06-22 01:52:01,336 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:52:01,337 INFO ]: Toolchain (without parser) took 56570.96 ms. Allocated memory was 308.3 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 234.7 MB in the beginning and 495.8 MB in the end (delta: -261.0 MB). Peak memory consumption was 805.9 MB. Max. memory is 3.6 GB. [2018-06-22 01:52:01,338 INFO ]: SmtParser took 0.39 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:52:01,338 INFO ]: ChcToBoogie took 93.36 ms. Allocated memory is still 308.3 MB. Free memory was 233.7 MB in the beginning and 230.7 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:52:01,339 INFO ]: Boogie Preprocessor took 81.65 ms. Allocated memory is still 308.3 MB. Free memory was 230.7 MB in the beginning and 228.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:52:01,339 INFO ]: RCFGBuilder took 1749.43 ms. Allocated memory was 308.3 MB in the beginning and 323.5 MB in the end (delta: 15.2 MB). Free memory was 228.7 MB in the beginning and 283.5 MB in the end (delta: -54.8 MB). Peak memory consumption was 47.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:52:01,340 INFO ]: TraceAbstraction took 54637.27 ms. Allocated memory was 323.5 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 283.5 MB in the beginning and 495.8 MB in the end (delta: -212.3 MB). Peak memory consumption was 839.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:52:01,343 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.39 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 93.36 ms. Allocated memory is still 308.3 MB. Free memory was 233.7 MB in the beginning and 230.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 81.65 ms. Allocated memory is still 308.3 MB. Free memory was 230.7 MB in the beginning and 228.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1749.43 ms. Allocated memory was 308.3 MB in the beginning and 323.5 MB in the end (delta: 15.2 MB). Free memory was 228.7 MB in the beginning and 283.5 MB in the end (delta: -54.8 MB). Peak memory consumption was 47.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54637.27 ms. Allocated memory was 323.5 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 283.5 MB in the beginning and 495.8 MB in the end (delta: -212.3 MB). Peak memory consumption was 839.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (1398states) and interpolant automaton (currently 78 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3883 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. TIMEOUT Result, 54.5s OverallTime, 15 OverallIterations, 45 TraceHistogramMax, 44.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3907 SDtfs, 4472 SDslu, 19592 SDs, 0 SdLazy, 34378 SolverSat, 6095 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2694 GetRequests, 2559 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2332 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1398occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 5112 NumberOfCodeBlocks, 5112 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 5088 ConstructedInterpolants, 0 QuantifiedInterpolants, 2574984 SizeOfPredicates, 29 NumberOfNonLiveVariables, 8218 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 47179/48690 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/queen.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-52-01-359.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/queen.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-52-01-359.csv Completed graceful shutdown