java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/ctigar/barbrprime.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:44:42,001 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:44:42,003 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:44:42,014 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:44:42,015 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:44:42,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:44:42,019 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:44:42,021 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:44:42,023 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:44:42,024 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:44:42,025 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:44:42,025 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:44:42,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:44:42,028 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:44:42,028 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:44:42,029 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:44:42,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:44:42,034 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:44:42,035 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:44:42,037 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:44:42,038 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:44:42,041 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:44:42,041 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:44:42,041 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:44:42,042 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:44:42,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:44:42,044 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:44:42,045 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:44:42,046 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:44:42,046 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:44:42,047 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:44:42,048 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:44:42,048 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:44:42,049 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:44:42,050 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:44:42,050 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:44:42,065 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:44:42,065 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:44:42,066 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:44:42,066 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:44:42,067 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:44:42,067 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:44:42,068 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:44:42,068 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:44:42,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:44:42,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:44:42,069 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:44:42,069 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:44:42,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:44:42,070 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:44:42,070 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:44:42,070 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:44:42,070 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:44:42,071 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:44:42,071 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:44:42,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:44:42,071 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:44:42,073 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:44:42,073 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:44:42,116 INFO ]: Repository-Root is: /tmp [2018-06-25 00:44:42,137 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:44:42,145 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:44:42,147 INFO ]: Initializing SmtParser... [2018-06-25 00:44:42,147 INFO ]: SmtParser initialized [2018-06-25 00:44:42,147 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/barbrprime.c.smt2 [2018-06-25 00:44:42,149 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 00:44:42,225 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/barbrprime.c.smt2 unknown [2018-06-25 00:44:42,806 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/barbrprime.c.smt2 [2018-06-25 00:44:42,811 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:44:42,819 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:44:42,820 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:44:42,820 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:44:42,820 INFO ]: ChcToBoogie initialized [2018-06-25 00:44:42,823 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:44:42" (1/1) ... [2018-06-25 00:44:42,887 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:44:42 Unit [2018-06-25 00:44:42,887 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:44:42,888 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:44:42,888 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:44:42,888 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:44:42,914 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:44:42" (1/1) ... [2018-06-25 00:44:42,914 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:44:42" (1/1) ... [2018-06-25 00:44:42,939 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:44:42" (1/1) ... [2018-06-25 00:44:42,939 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:44:42" (1/1) ... [2018-06-25 00:44:42,973 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:44:42" (1/1) ... [2018-06-25 00:44:42,974 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:44:42" (1/1) ... [2018-06-25 00:44:42,980 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:44:42" (1/1) ... [2018-06-25 00:44:42,993 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:44:42,994 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:44:42,994 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:44:42,994 INFO ]: RCFGBuilder initialized [2018-06-25 00:44:42,995 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:44:42" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 00:44:43,014 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:44:43,014 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:44:43,014 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:44:43,014 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:44:43,014 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:44:43,014 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:44:43,447 INFO ]: Using library mode [2018-06-25 00:44:43,449 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:44:43 BoogieIcfgContainer [2018-06-25 00:44:43,449 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:44:43,449 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:44:43,449 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:44:43,450 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:44:43,451 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:44:43" (1/1) ... [2018-06-25 00:44:43,467 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:44:43,469 INFO ]: Using Remove infeasible edges [2018-06-25 00:44:43,469 INFO ]: Using Maximize final states [2018-06-25 00:44:43,470 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:44:43,472 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:44:43,473 INFO ]: Using Remove sink states [2018-06-25 00:44:43,474 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:44:43,474 INFO ]: Using Use SBE [2018-06-25 00:44:43,482 WARN ]: expecting exponential blowup for input size 9 [2018-06-25 00:44:43,616 WARN ]: aborting because of expected exponential blowup for input size 191 [2018-06-25 00:44:43,642 WARN ]: aborting because of expected exponential blowup for input size 191 [2018-06-25 00:44:43,642 INFO ]: SBE split 1 edges [2018-06-25 00:44:43,647 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:44:43,649 INFO ]: 0 new accepting states [2018-06-25 00:44:43,720 INFO ]: Removed 5 edges and 2 locations by large block encoding [2018-06-25 00:44:43,722 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:44:43,723 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:44:43,724 INFO ]: 0 new accepting states [2018-06-25 00:44:43,724 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:44:43,724 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:44:43,724 INFO ]: Encoded RCFG 6 locations, 7 edges [2018-06-25 00:44:43,724 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:44:43 BasicIcfg [2018-06-25 00:44:43,724 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:44:43,727 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:44:43,727 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:44:43,731 INFO ]: TraceAbstraction initialized [2018-06-25 00:44:43,732 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:44:42" (1/4) ... [2018-06-25 00:44:43,733 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638d74a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:44:43, skipping insertion in model container [2018-06-25 00:44:43,733 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:44:42" (2/4) ... [2018-06-25 00:44:43,733 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638d74a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:44:43, skipping insertion in model container [2018-06-25 00:44:43,733 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:44:43" (3/4) ... [2018-06-25 00:44:43,733 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638d74a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:44:43, skipping insertion in model container [2018-06-25 00:44:43,733 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:44:43" (4/4) ... [2018-06-25 00:44:43,739 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:44:43,748 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:44:43,756 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:44:43,815 INFO ]: Using default assertion order modulation [2018-06-25 00:44:43,816 INFO ]: Interprodecural is true [2018-06-25 00:44:43,816 INFO ]: Hoare is false [2018-06-25 00:44:43,816 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:44:43,816 INFO ]: Backedges is TWOTRACK [2018-06-25 00:44:43,816 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:44:43,816 INFO ]: Difference is false [2018-06-25 00:44:43,816 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:44:43,816 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:44:43,830 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:44:43,843 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:44:43,843 INFO ]: Found error trace [2018-06-25 00:44:43,843 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:44:43,844 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:44:43,849 INFO ]: Analyzing trace with hash 35465027, now seen corresponding path program 1 times [2018-06-25 00:44:43,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:44:43,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:44:43,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:43,896 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:44:43,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:43,943 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:44,043 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:44,046 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:44:44,046 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:44:44,048 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:44:44,064 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:44:44,064 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:44:44,066 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:44:44,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:44:44,190 INFO ]: Finished difference Result 7 states and 8 transitions. [2018-06-25 00:44:44,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:44:44,192 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:44:44,192 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:44:44,200 INFO ]: With dead ends: 7 [2018-06-25 00:44:44,200 INFO ]: Without dead ends: 7 [2018-06-25 00:44:44,202 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-25 00:44:44,223 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:44:44,250 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:44:44,251 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:44:44,251 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-06-25 00:44:44,252 INFO ]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-06-25 00:44:44,252 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:44:44,252 INFO ]: Abstraction has 7 states and 8 transitions. [2018-06-25 00:44:44,253 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:44:44,253 INFO ]: Start isEmpty. Operand 7 states and 8 transitions. [2018-06-25 00:44:44,254 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:44:44,254 INFO ]: Found error trace [2018-06-25 00:44:44,254 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:44:44,254 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:44:44,254 INFO ]: Analyzing trace with hash 1099063309, now seen corresponding path program 1 times [2018-06-25 00:44:44,255 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:44:44,255 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:44:44,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:44,255 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:44:44,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:44,423 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:44,687 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:44,687 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:44:44,687 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:44:44,697 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:44:44,791 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:44,800 INFO ]: Computing forward predicates... [2018-06-25 00:44:45,217 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:45,251 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:44:45,251 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 00:44:45,251 INFO ]: Interpolant automaton has 4 states [2018-06-25 00:44:45,252 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 00:44:45,252 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 00:44:45,252 INFO ]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-06-25 00:44:45,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:44:45,296 INFO ]: Finished difference Result 8 states and 9 transitions. [2018-06-25 00:44:45,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 00:44:45,297 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 00:44:45,297 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:44:45,297 INFO ]: With dead ends: 8 [2018-06-25 00:44:45,297 INFO ]: Without dead ends: 8 [2018-06-25 00:44:45,298 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 00:44:45,298 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 00:44:45,299 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 00:44:45,299 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:44:45,299 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-06-25 00:44:45,299 INFO ]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-06-25 00:44:45,299 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:44:45,299 INFO ]: Abstraction has 8 states and 9 transitions. [2018-06-25 00:44:45,299 INFO ]: Interpolant automaton has 4 states. [2018-06-25 00:44:45,299 INFO ]: Start isEmpty. Operand 8 states and 9 transitions. [2018-06-25 00:44:45,299 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:44:45,299 INFO ]: Found error trace [2018-06-25 00:44:45,300 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 00:44:45,300 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:44:45,300 INFO ]: Analyzing trace with hash -289128317, now seen corresponding path program 2 times [2018-06-25 00:44:45,300 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:44:45,300 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:44:45,302 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:45,302 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:44:45,302 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:45,427 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:45,949 WARN ]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 00:44:46,235 WARN ]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 00:44:46,235 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:46,236 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:44:46,236 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-25 00:44:46,250 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:44:46,429 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:44:46,429 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:46,437 INFO ]: Computing forward predicates... [2018-06-25 00:44:48,180 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:48,213 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:44:48,213 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-25 00:44:48,213 INFO ]: Interpolant automaton has 5 states [2018-06-25 00:44:48,214 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 00:44:48,214 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:44:48,214 INFO ]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2018-06-25 00:44:49,020 WARN ]: Spent 646.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 00:44:49,086 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:44:49,086 INFO ]: Finished difference Result 9 states and 10 transitions. [2018-06-25 00:44:49,087 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:44:49,087 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-25 00:44:49,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:44:49,087 INFO ]: With dead ends: 9 [2018-06-25 00:44:49,087 INFO ]: Without dead ends: 9 [2018-06-25 00:44:49,088 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:44:49,088 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:44:49,089 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:44:49,089 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:44:49,089 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-06-25 00:44:49,089 INFO ]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2018-06-25 00:44:49,089 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:44:49,089 INFO ]: Abstraction has 9 states and 10 transitions. [2018-06-25 00:44:49,089 INFO ]: Interpolant automaton has 5 states. [2018-06-25 00:44:49,089 INFO ]: Start isEmpty. Operand 9 states and 10 transitions. [2018-06-25 00:44:49,089 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:44:49,089 INFO ]: Found error trace [2018-06-25 00:44:49,089 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 00:44:49,089 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:44:49,090 INFO ]: Analyzing trace with hash -373395763, now seen corresponding path program 3 times [2018-06-25 00:44:49,090 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:44:49,090 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:44:49,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:49,090 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:44:49,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:49,234 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:49,735 WARN ]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-25 00:44:49,877 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:49,877 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:44:49,877 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:44:49,883 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:44:50,095 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 00:44:50,095 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:50,101 INFO ]: Computing forward predicates... [2018-06-25 00:44:52,108 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:52,140 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:44:52,140 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-25 00:44:52,140 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:44:52,140 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:44:52,140 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:44:52,141 INFO ]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2018-06-25 00:44:52,960 WARN ]: Spent 678.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-06-25 00:44:53,127 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:44:53,127 INFO ]: Finished difference Result 10 states and 11 transitions. [2018-06-25 00:44:53,127 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:44:53,127 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-25 00:44:53,127 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:44:53,127 INFO ]: With dead ends: 10 [2018-06-25 00:44:53,127 INFO ]: Without dead ends: 10 [2018-06-25 00:44:53,128 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:44:53,128 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 00:44:53,129 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 00:44:53,129 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:44:53,129 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-06-25 00:44:53,129 INFO ]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-06-25 00:44:53,129 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:44:53,129 INFO ]: Abstraction has 10 states and 11 transitions. [2018-06-25 00:44:53,129 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:44:53,129 INFO ]: Start isEmpty. Operand 10 states and 11 transitions. [2018-06-25 00:44:53,130 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:44:53,130 INFO ]: Found error trace [2018-06-25 00:44:53,130 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-25 00:44:53,130 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:44:53,130 INFO ]: Analyzing trace with hash 1309280707, now seen corresponding path program 4 times [2018-06-25 00:44:53,130 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:44:53,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:44:53,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:53,131 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:44:53,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:53,263 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:53,746 WARN ]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 00:44:54,012 WARN ]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 00:44:54,013 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:54,013 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:44:54,013 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-25 00:44:54,030 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:44:54,274 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 00:44:54,274 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:54,282 INFO ]: Computing forward predicates... [2018-06-25 00:44:56,082 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:56,115 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:44:56,144 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-25 00:44:56,144 INFO ]: Interpolant automaton has 7 states [2018-06-25 00:44:56,144 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 00:44:56,145 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:44:56,145 INFO ]: Start difference. First operand 10 states and 11 transitions. Second operand 7 states. [2018-06-25 00:44:56,929 WARN ]: Spent 577.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-06-25 00:44:57,209 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:44:57,209 INFO ]: Finished difference Result 11 states and 12 transitions. [2018-06-25 00:44:57,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:44:57,209 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-25 00:44:57,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:44:57,209 INFO ]: With dead ends: 11 [2018-06-25 00:44:57,209 INFO ]: Without dead ends: 11 [2018-06-25 00:44:57,210 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:44:57,210 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:44:57,211 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 00:44:57,211 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:44:57,211 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-06-25 00:44:57,211 INFO ]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2018-06-25 00:44:57,211 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:44:57,212 INFO ]: Abstraction has 11 states and 12 transitions. [2018-06-25 00:44:57,212 INFO ]: Interpolant automaton has 7 states. [2018-06-25 00:44:57,212 INFO ]: Start isEmpty. Operand 11 states and 12 transitions. [2018-06-25 00:44:57,212 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:44:57,212 INFO ]: Found error trace [2018-06-25 00:44:57,212 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-25 00:44:57,212 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:44:57,212 INFO ]: Analyzing trace with hash 1932643725, now seen corresponding path program 5 times [2018-06-25 00:44:57,212 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:44:57,212 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:44:57,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:57,213 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:44:57,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:57,339 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:57,704 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:57,704 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:44:57,704 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:44:57,711 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 00:44:57,945 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 00:44:57,945 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:44:57,952 INFO ]: Computing forward predicates... [2018-06-25 00:44:59,225 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:44:59,246 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:44:59,246 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-25 00:44:59,246 INFO ]: Interpolant automaton has 8 states [2018-06-25 00:44:59,246 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 00:44:59,246 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:44:59,246 INFO ]: Start difference. First operand 11 states and 12 transitions. Second operand 8 states. [2018-06-25 00:44:59,579 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:44:59,579 INFO ]: Finished difference Result 12 states and 13 transitions. [2018-06-25 00:44:59,579 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:44:59,579 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-25 00:44:59,580 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:44:59,581 INFO ]: With dead ends: 12 [2018-06-25 00:44:59,581 INFO ]: Without dead ends: 12 [2018-06-25 00:44:59,581 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:44:59,581 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 00:44:59,582 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 00:44:59,582 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:44:59,582 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-06-25 00:44:59,583 INFO ]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-06-25 00:44:59,583 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:44:59,583 INFO ]: Abstraction has 12 states and 13 transitions. [2018-06-25 00:44:59,583 INFO ]: Interpolant automaton has 8 states. [2018-06-25 00:44:59,583 INFO ]: Start isEmpty. Operand 12 states and 13 transitions. [2018-06-25 00:44:59,583 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:44:59,583 INFO ]: Found error trace [2018-06-25 00:44:59,583 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-25 00:44:59,583 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:44:59,583 INFO ]: Analyzing trace with hash -217939197, now seen corresponding path program 6 times [2018-06-25 00:44:59,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:44:59,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:44:59,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:59,584 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:44:59,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:44:59,706 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:45:00,190 WARN ]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-25 00:45:00,477 WARN ]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-25 00:45:00,794 WARN ]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 00:45:00,958 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:45:00,958 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:45:00,958 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-25 00:45:00,966 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 00:45:01,230 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 00:45:01,230 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:45:01,239 INFO ]: Computing forward predicates... [2018-06-25 00:45:02,028 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:45:02,051 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:45:02,051 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-25 00:45:02,051 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:45:02,051 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:45:02,052 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:45:02,052 INFO ]: Start difference. First operand 12 states and 13 transitions. Second operand 9 states. [2018-06-25 00:45:02,179 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-06-25 00:45:02,574 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:45:02,574 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-25 00:45:02,574 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 00:45:02,574 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-25 00:45:02,574 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:45:02,574 INFO ]: With dead ends: 13 [2018-06-25 00:45:02,574 INFO ]: Without dead ends: 13 [2018-06-25 00:45:02,574 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-06-25 00:45:02,574 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:45:02,576 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 00:45:02,576 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:45:02,576 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-25 00:45:02,576 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-06-25 00:45:02,576 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:45:02,576 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-25 00:45:02,576 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:45:02,576 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-25 00:45:02,576 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:45:02,576 INFO ]: Found error trace [2018-06-25 00:45:02,576 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-25 00:45:02,577 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:45:02,577 INFO ]: Analyzing trace with hash 1833466957, now seen corresponding path program 7 times [2018-06-25 00:45:02,577 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:45:02,577 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:45:02,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:45:02,577 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:45:02,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:45:02,709 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:45:03,093 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:45:03,094 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:45:03,094 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:45:03,100 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:45:03,385 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:45:03,395 INFO ]: Computing forward predicates... [2018-06-25 00:45:24,071 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:45:24,092 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:45:24,092 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-25 00:45:24,092 INFO ]: Interpolant automaton has 11 states [2018-06-25 00:45:24,092 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 00:45:24,092 INFO ]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:45:24,093 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 11 states. [2018-06-25 00:45:24,603 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:45:24,603 INFO ]: Finished difference Result 14 states and 15 transitions. [2018-06-25 00:45:24,604 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 00:45:24,604 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-25 00:45:24,604 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:45:24,604 INFO ]: With dead ends: 14 [2018-06-25 00:45:24,604 INFO ]: Without dead ends: 14 [2018-06-25 00:45:24,605 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-06-25 00:45:24,605 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 00:45:24,606 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 00:45:24,606 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:45:24,607 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-25 00:45:24,607 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-06-25 00:45:24,607 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:45:24,607 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-25 00:45:24,607 INFO ]: Interpolant automaton has 11 states. [2018-06-25 00:45:24,607 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-25 00:45:24,607 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:45:24,607 INFO ]: Found error trace [2018-06-25 00:45:24,607 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-25 00:45:24,607 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:45:24,607 INFO ]: Analyzing trace with hash 1002548291, now seen corresponding path program 8 times [2018-06-25 00:45:24,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:45:24,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:45:24,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:45:24,608 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:45:24,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:45:24,742 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:45:25,153 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:45:25,153 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:45:25,153 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-25 00:45:25,159 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:45:25,520 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:45:25,520 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:45:25,530 INFO ]: Computing forward predicates... [2018-06-25 00:45:29,738 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:45:29,767 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:45:29,767 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-25 00:45:29,768 INFO ]: Interpolant automaton has 12 states [2018-06-25 00:45:29,768 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 00:45:29,768 INFO ]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-25 00:45:29,768 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 12 states. [2018-06-25 00:45:30,382 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:45:30,382 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-25 00:45:30,382 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 00:45:30,382 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-25 00:45:30,382 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:45:30,383 INFO ]: With dead ends: 15 [2018-06-25 00:45:30,383 INFO ]: Without dead ends: 15 [2018-06-25 00:45:30,383 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2018-06-25 00:45:30,383 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 00:45:30,384 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 00:45:30,384 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 00:45:30,385 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-25 00:45:30,385 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-25 00:45:30,385 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:45:30,385 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-25 00:45:30,385 INFO ]: Interpolant automaton has 12 states. [2018-06-25 00:45:30,385 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-25 00:45:30,385 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 00:45:30,385 INFO ]: Found error trace [2018-06-25 00:45:30,385 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-25 00:45:30,385 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:45:30,385 INFO ]: Analyzing trace with hash 1013873421, now seen corresponding path program 9 times [2018-06-25 00:45:30,385 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:45:30,385 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:45:30,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:45:30,386 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:45:30,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:45:30,508 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:45:30,904 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:45:30,904 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:45:30,904 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-25 00:45:30,911 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:45:31,321 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-25 00:45:31,321 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:45:31,337 INFO ]: Computing forward predicates... [2018-06-25 00:45:33,831 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:45:33,851 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:45:33,851 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-25 00:45:33,852 INFO ]: Interpolant automaton has 13 states [2018-06-25 00:45:33,852 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 00:45:33,852 INFO ]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:45:33,852 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 13 states. [2018-06-25 00:45:34,268 WARN ]: Spent 145.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-06-25 00:45:34,642 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:45:34,642 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-25 00:45:34,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 00:45:34,642 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-25 00:45:34,642 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:45:34,642 INFO ]: With dead ends: 17 [2018-06-25 00:45:34,642 INFO ]: Without dead ends: 17 [2018-06-25 00:45:34,643 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2018-06-25 00:45:34,643 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 00:45:34,644 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-06-25 00:45:34,644 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 00:45:34,644 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-25 00:45:34,644 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-06-25 00:45:34,645 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:45:34,645 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-25 00:45:34,645 INFO ]: Interpolant automaton has 13 states. [2018-06-25 00:45:34,645 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-25 00:45:34,645 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 00:45:34,645 INFO ]: Found error trace [2018-06-25 00:45:34,645 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-25 00:45:34,645 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:45:34,645 INFO ]: Analyzing trace with hash 1364952451, now seen corresponding path program 10 times [2018-06-25 00:45:34,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:45:34,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:45:34,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:45:34,646 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:45:34,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:45:34,810 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:45:35,358 WARN ]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-25 00:45:35,504 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:45:35,504 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:45:35,504 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:45:35,510 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 00:45:35,879 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 00:45:35,879 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:45:35,892 INFO ]: Computing forward predicates... [2018-06-25 00:45:36,559 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 00:45:36,594 WARN ]: expecting exponential blowup for input size 6 Received shutdown request... [2018-06-25 00:45:42,845 INFO ]: Timeout while computing interpolants [2018-06-25 00:45:43,047 WARN ]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:45:43,047 WARN ]: Verification canceled [2018-06-25 00:45:43,049 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:45:43,050 WARN ]: Timeout [2018-06-25 00:45:43,051 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:45:43 BasicIcfg [2018-06-25 00:45:43,051 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:45:43,051 INFO ]: Toolchain (without parser) took 60240.38 ms. Allocated memory was 307.2 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 218.8 MB in the beginning and 1.2 GB in the end (delta: -950.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. [2018-06-25 00:45:43,052 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:45:43,052 INFO ]: ChcToBoogie took 68.09 ms. Allocated memory is still 307.2 MB. Free memory was 218.8 MB in the beginning and 215.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:45:43,053 INFO ]: Boogie Preprocessor took 105.02 ms. Allocated memory is still 307.2 MB. Free memory was 215.8 MB in the beginning and 213.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-25 00:45:43,053 INFO ]: RCFGBuilder took 455.44 ms. Allocated memory was 307.2 MB in the beginning and 323.5 MB in the end (delta: 16.3 MB). Free memory was 213.7 MB in the beginning and 282.0 MB in the end (delta: -68.3 MB). Peak memory consumption was 32.4 MB. Max. memory is 3.6 GB. [2018-06-25 00:45:43,054 INFO ]: BlockEncodingV2 took 275.04 ms. Allocated memory is still 323.5 MB. Free memory was 282.0 MB in the beginning and 262.6 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 3.6 GB. [2018-06-25 00:45:43,054 INFO ]: TraceAbstraction took 59323.43 ms. Allocated memory was 323.5 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 261.1 MB in the beginning and 1.2 GB in the end (delta: -907.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-25 00:45:43,057 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 7 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 68.09 ms. Allocated memory is still 307.2 MB. Free memory was 218.8 MB in the beginning and 215.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 105.02 ms. Allocated memory is still 307.2 MB. Free memory was 215.8 MB in the beginning and 213.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 455.44 ms. Allocated memory was 307.2 MB in the beginning and 323.5 MB in the end (delta: 16.3 MB). Free memory was 213.7 MB in the beginning and 282.0 MB in the end (delta: -68.3 MB). Peak memory consumption was 32.4 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 275.04 ms. Allocated memory is still 323.5 MB. Free memory was 282.0 MB in the beginning and 262.6 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59323.43 ms. Allocated memory was 323.5 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 261.1 MB in the beginning and 1.2 GB in the end (delta: -907.8 MB). Peak memory consumption was 1.3 GB. 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 Cancelled while BasicCegarLoop was analyzing trace of length 16 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 32 quantified variables from 12 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 59.2s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 60 SDtfs, 0 SDslu, 162 SDs, 0 SdLazy, 85 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 59 SyntacticMatches, 39 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 40.8s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 10564 SizeOfPredicates, 72 NumberOfNonLiveVariables, 9981 ConjunctsInSsa, 488 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 0/330 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/barbrprime.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-45-43-077.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barbrprime.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-45-43-077.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barbrprime.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-45-43-077.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barbrprime.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-45-43-077.csv Completed graceful shutdown