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_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/46.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:56:56,164 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:56:56,166 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:56:56,176 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:56:56,177 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:56:56,178 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:56:56,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:56:56,184 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:56:56,186 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:56:56,186 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:56:56,188 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:56:56,189 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:56:56,189 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:56:56,191 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:56:56,191 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:56:56,194 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:56:56,196 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:56:56,209 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:56:56,210 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:56:56,211 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:56:56,212 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:56:56,214 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:56:56,215 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:56:56,215 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:56:56,216 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:56:56,222 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:56:56,222 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:56:56,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:56:56,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:56:56,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:56:56,225 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:56:56,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:56:56,225 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:56:56,231 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:56:56,232 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:56:56,232 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 10:56:56,253 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:56:56,253 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:56:56,253 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:56:56,254 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:56:56,255 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:56:56,255 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:56:56,255 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:56:56,255 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:56:56,256 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:56:56,256 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:56:56,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:56:56,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:56:56,256 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:56:56,256 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:56:56,257 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:56:56,257 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:56:56,257 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:56:56,257 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:56:56,257 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:56:56,259 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:56:56,260 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:56:56,304 INFO ]: Repository-Root is: /tmp [2018-06-22 10:56:56,321 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:56:56,326 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:56:56,327 INFO ]: Initializing SmtParser... [2018-06-22 10:56:56,327 INFO ]: SmtParser initialized [2018-06-22 10:56:56,328 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/46.c.smt2 [2018-06-22 10:56:56,330 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 10:56:56,419 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/46.c.smt2 unknown [2018-06-22 10:56:56,849 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/46.c.smt2 [2018-06-22 10:56:56,853 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:56:56,872 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:56:56,873 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:56:56,873 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:56:56,873 INFO ]: ChcToBoogie initialized [2018-06-22 10:56:56,883 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:56:56" (1/1) ... [2018-06-22 10:56:56,970 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:56 Unit [2018-06-22 10:56:56,970 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:56:56,971 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:56:56,971 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:56:56,971 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:56:56,993 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:56" (1/1) ... [2018-06-22 10:56:56,993 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:56" (1/1) ... [2018-06-22 10:56:57,006 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:56" (1/1) ... [2018-06-22 10:56:57,006 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:56" (1/1) ... [2018-06-22 10:56:57,022 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:56" (1/1) ... [2018-06-22 10:56:57,024 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:56" (1/1) ... [2018-06-22 10:56:57,026 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:56" (1/1) ... [2018-06-22 10:56:57,038 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:56:57,039 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:56:57,039 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:56:57,039 INFO ]: RCFGBuilder initialized [2018-06-22 10:56:57,040 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:56" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 10:56:57,052 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:56:57,053 INFO ]: Found specification of procedure False [2018-06-22 10:56:57,053 INFO ]: Found implementation of procedure False [2018-06-22 10:56:57,053 INFO ]: Specification and implementation of procedure h25 given in one single declaration [2018-06-22 10:56:57,053 INFO ]: Found specification of procedure h25 [2018-06-22 10:56:57,053 INFO ]: Found implementation of procedure h25 [2018-06-22 10:56:57,053 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:56:57,053 INFO ]: Found specification of procedure h24 [2018-06-22 10:56:57,053 INFO ]: Found implementation of procedure h24 [2018-06-22 10:56:57,053 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:56:57,053 INFO ]: Found specification of procedure h14 [2018-06-22 10:56:57,053 INFO ]: Found implementation of procedure h14 [2018-06-22 10:56:57,053 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:56:57,053 INFO ]: Found specification of procedure h13 [2018-06-22 10:56:57,053 INFO ]: Found implementation of procedure h13 [2018-06-22 10:56:57,053 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:56:57,053 INFO ]: Found specification of procedure h12 [2018-06-22 10:56:57,053 INFO ]: Found implementation of procedure h12 [2018-06-22 10:56:57,053 INFO ]: Specification and implementation of procedure h8 given in one single declaration [2018-06-22 10:56:57,053 INFO ]: Found specification of procedure h8 [2018-06-22 10:56:57,053 INFO ]: Found implementation of procedure h8 [2018-06-22 10:56:57,053 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:56:57,053 INFO ]: Found specification of procedure h7 [2018-06-22 10:56:57,053 INFO ]: Found implementation of procedure h7 [2018-06-22 10:56:57,053 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:56:57,053 INFO ]: Found specification of procedure h6 [2018-06-22 10:56:57,053 INFO ]: Found implementation of procedure h6 [2018-06-22 10:56:57,053 INFO ]: Specification and implementation of procedure h5 given in one single declaration [2018-06-22 10:56:57,053 INFO ]: Found specification of procedure h5 [2018-06-22 10:56:57,054 INFO ]: Found implementation of procedure h5 [2018-06-22 10:56:57,054 INFO ]: Specification and implementation of procedure h22 given in one single declaration [2018-06-22 10:56:57,054 INFO ]: Found specification of procedure h22 [2018-06-22 10:56:57,054 INFO ]: Found implementation of procedure h22 [2018-06-22 10:56:57,054 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:56:57,054 INFO ]: Found specification of procedure h18 [2018-06-22 10:56:57,054 INFO ]: Found implementation of procedure h18 [2018-06-22 10:56:57,054 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:56:57,054 INFO ]: Found specification of procedure h17 [2018-06-22 10:56:57,054 INFO ]: Found implementation of procedure h17 [2018-06-22 10:56:57,054 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:56:57,054 INFO ]: Found specification of procedure h10 [2018-06-22 10:56:57,054 INFO ]: Found implementation of procedure h10 [2018-06-22 10:56:57,054 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:56:57,054 INFO ]: Found specification of procedure h11 [2018-06-22 10:56:57,054 INFO ]: Found implementation of procedure h11 [2018-06-22 10:56:57,054 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:56:57,054 INFO ]: Found specification of procedure h9 [2018-06-22 10:56:57,054 INFO ]: Found implementation of procedure h9 [2018-06-22 10:56:57,054 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:56:57,054 INFO ]: Found specification of procedure h19 [2018-06-22 10:56:57,054 INFO ]: Found implementation of procedure h19 [2018-06-22 10:56:57,054 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:56:57,054 INFO ]: Found specification of procedure h16 [2018-06-22 10:56:57,054 INFO ]: Found implementation of procedure h16 [2018-06-22 10:56:57,054 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:56:57,054 INFO ]: Found specification of procedure h15 [2018-06-22 10:56:57,054 INFO ]: Found implementation of procedure h15 [2018-06-22 10:56:57,054 INFO ]: Specification and implementation of procedure h21 given in one single declaration [2018-06-22 10:56:57,054 INFO ]: Found specification of procedure h21 [2018-06-22 10:56:57,055 INFO ]: Found implementation of procedure h21 [2018-06-22 10:56:57,055 INFO ]: Specification and implementation of procedure h20 given in one single declaration [2018-06-22 10:56:57,055 INFO ]: Found specification of procedure h20 [2018-06-22 10:56:57,055 INFO ]: Found implementation of procedure h20 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:56:57,055 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:56:57,055 INFO ]: Found specification of procedure h23 [2018-06-22 10:56:57,055 INFO ]: Found implementation of procedure h23 [2018-06-22 10:56:57,055 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:56:57,056 INFO ]: Found specification of procedure h4 [2018-06-22 10:56:57,056 INFO ]: Found implementation of procedure h4 [2018-06-22 10:56:57,056 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:56:57,056 INFO ]: Found specification of procedure h3 [2018-06-22 10:56:57,056 INFO ]: Found implementation of procedure h3 [2018-06-22 10:56:57,056 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:56:57,056 INFO ]: Found specification of procedure h2 [2018-06-22 10:56:57,056 INFO ]: Found implementation of procedure h2 [2018-06-22 10:56:57,056 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:56:57,056 INFO ]: Found specification of procedure h1 [2018-06-22 10:56:57,056 INFO ]: Found implementation of procedure h1 [2018-06-22 10:56:57,056 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:56:57,056 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:56:57,056 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 10:56:57,526 INFO ]: Using library mode [2018-06-22 10:56:57,526 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:56:57 BoogieIcfgContainer [2018-06-22 10:56:57,526 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:56:57,528 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:56:57,528 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:56:57,534 INFO ]: TraceAbstraction initialized [2018-06-22 10:56:57,534 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:56:56" (1/3) ... [2018-06-22 10:56:57,535 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5190d915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:56:57, skipping insertion in model container [2018-06-22 10:56:57,535 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:56" (2/3) ... [2018-06-22 10:56:57,535 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5190d915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:56:57, skipping insertion in model container [2018-06-22 10:56:57,535 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:56:57" (3/3) ... [2018-06-22 10:56:57,537 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:56:57,545 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:56:57,552 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:56:57,589 INFO ]: Using default assertion order modulation [2018-06-22 10:56:57,589 INFO ]: Interprodecural is true [2018-06-22 10:56:57,589 INFO ]: Hoare is false [2018-06-22 10:56:57,589 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:56:57,589 INFO ]: Backedges is TWOTRACK [2018-06-22 10:56:57,589 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:56:57,589 INFO ]: Difference is false [2018-06-22 10:56:57,589 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:56:57,590 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:56:57,617 INFO ]: Start isEmpty. Operand 114 states. [2018-06-22 10:56:57,638 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:56:57,639 INFO ]: Found error trace [2018-06-22 10:56:57,640 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:56:57,642 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:57,646 INFO ]: Analyzing trace with hash 1401534300, now seen corresponding path program 1 times [2018-06-22 10:56:57,647 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:57,647 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:57,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:57,678 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:57,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:57,750 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:58,562 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:56:58,564 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:58,564 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:58,566 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:58,577 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:58,578 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:58,580 INFO ]: Start difference. First operand 114 states. Second operand 14 states. [2018-06-22 10:56:59,126 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:59,126 INFO ]: Finished difference Result 128 states and 140 transitions. [2018-06-22 10:56:59,127 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:59,129 INFO ]: Start accepts. Automaton has 14 states. Word has length 57 [2018-06-22 10:56:59,129 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:59,144 INFO ]: With dead ends: 128 [2018-06-22 10:56:59,144 INFO ]: Without dead ends: 120 [2018-06-22 10:56:59,146 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:59,159 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-22 10:56:59,195 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-06-22 10:56:59,197 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-22 10:56:59,199 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2018-06-22 10:56:59,201 INFO ]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 57 [2018-06-22 10:56:59,202 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:59,202 INFO ]: Abstraction has 120 states and 132 transitions. [2018-06-22 10:56:59,202 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:59,202 INFO ]: Start isEmpty. Operand 120 states and 132 transitions. [2018-06-22 10:56:59,207 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:56:59,207 INFO ]: Found error trace [2018-06-22 10:56:59,207 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:56:59,207 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:59,207 INFO ]: Analyzing trace with hash -2005213669, now seen corresponding path program 1 times [2018-06-22 10:56:59,207 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:59,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:59,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:59,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:59,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:59,237 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:59,526 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:59,526 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:59,526 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:56:59,531 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:56:59,531 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:56:59,531 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:56:59,531 INFO ]: Start difference. First operand 120 states and 132 transitions. Second operand 12 states. [2018-06-22 10:57:00,371 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:00,372 INFO ]: Finished difference Result 167 states and 202 transitions. [2018-06-22 10:57:00,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:57:00,372 INFO ]: Start accepts. Automaton has 12 states. Word has length 93 [2018-06-22 10:57:00,373 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:00,377 INFO ]: With dead ends: 167 [2018-06-22 10:57:00,377 INFO ]: Without dead ends: 167 [2018-06-22 10:57:00,378 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:00,378 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-22 10:57:00,400 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-06-22 10:57:00,400 INFO ]: Start removeUnreachable. Operand 165 states. [2018-06-22 10:57:00,404 INFO ]: Finished removeUnreachable. Reduced from 165 states to 165 states and 199 transitions. [2018-06-22 10:57:00,404 INFO ]: Start accepts. Automaton has 165 states and 199 transitions. Word has length 93 [2018-06-22 10:57:00,442 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:00,442 INFO ]: Abstraction has 165 states and 199 transitions. [2018-06-22 10:57:00,442 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:57:00,442 INFO ]: Start isEmpty. Operand 165 states and 199 transitions. [2018-06-22 10:57:00,447 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:57:00,447 INFO ]: Found error trace [2018-06-22 10:57:00,447 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:00,447 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:00,447 INFO ]: Analyzing trace with hash 916237536, now seen corresponding path program 1 times [2018-06-22 10:57:00,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:00,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:00,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:00,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:00,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:00,492 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:00,666 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:00,666 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:00,666 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:57:00,666 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:57:00,666 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:57:00,666 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:00,667 INFO ]: Start difference. First operand 165 states and 199 transitions. Second operand 12 states. [2018-06-22 10:57:01,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:01,096 INFO ]: Finished difference Result 201 states and 235 transitions. [2018-06-22 10:57:01,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:57:01,096 INFO ]: Start accepts. Automaton has 12 states. Word has length 93 [2018-06-22 10:57:01,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:01,100 INFO ]: With dead ends: 201 [2018-06-22 10:57:01,100 INFO ]: Without dead ends: 201 [2018-06-22 10:57:01,100 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:01,101 INFO ]: Start minimizeSevpa. Operand 201 states. [2018-06-22 10:57:01,123 INFO ]: Finished minimizeSevpa. Reduced states from 201 to 171. [2018-06-22 10:57:01,123 INFO ]: Start removeUnreachable. Operand 171 states. [2018-06-22 10:57:01,125 INFO ]: Finished removeUnreachable. Reduced from 171 states to 171 states and 202 transitions. [2018-06-22 10:57:01,125 INFO ]: Start accepts. Automaton has 171 states and 202 transitions. Word has length 93 [2018-06-22 10:57:01,126 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:01,126 INFO ]: Abstraction has 171 states and 202 transitions. [2018-06-22 10:57:01,126 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:57:01,126 INFO ]: Start isEmpty. Operand 171 states and 202 transitions. [2018-06-22 10:57:01,130 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:57:01,130 INFO ]: Found error trace [2018-06-22 10:57:01,130 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:01,130 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:01,131 INFO ]: Analyzing trace with hash 1745762062, now seen corresponding path program 1 times [2018-06-22 10:57:01,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:01,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:01,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:01,131 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:01,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:01,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:01,267 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:01,267 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:01,267 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:57:01,268 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:57:01,268 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:57:01,268 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:01,268 INFO ]: Start difference. First operand 171 states and 202 transitions. Second operand 12 states. [2018-06-22 10:57:01,584 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:01,584 INFO ]: Finished difference Result 230 states and 285 transitions. [2018-06-22 10:57:01,585 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:57:01,585 INFO ]: Start accepts. Automaton has 12 states. Word has length 93 [2018-06-22 10:57:01,586 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:01,589 INFO ]: With dead ends: 230 [2018-06-22 10:57:01,589 INFO ]: Without dead ends: 221 [2018-06-22 10:57:01,589 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:01,589 INFO ]: Start minimizeSevpa. Operand 221 states. [2018-06-22 10:57:01,614 INFO ]: Finished minimizeSevpa. Reduced states from 221 to 201. [2018-06-22 10:57:01,614 INFO ]: Start removeUnreachable. Operand 201 states. [2018-06-22 10:57:01,617 INFO ]: Finished removeUnreachable. Reduced from 201 states to 201 states and 249 transitions. [2018-06-22 10:57:01,617 INFO ]: Start accepts. Automaton has 201 states and 249 transitions. Word has length 93 [2018-06-22 10:57:01,617 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:01,617 INFO ]: Abstraction has 201 states and 249 transitions. [2018-06-22 10:57:01,617 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:57:01,617 INFO ]: Start isEmpty. Operand 201 states and 249 transitions. [2018-06-22 10:57:01,620 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:57:01,620 INFO ]: Found error trace [2018-06-22 10:57:01,620 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:01,620 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:01,620 INFO ]: Analyzing trace with hash 1367179254, now seen corresponding path program 1 times [2018-06-22 10:57:01,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:01,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:01,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:01,621 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:01,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:01,633 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:01,856 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:01,856 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:01,856 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:57:01,857 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:57:01,857 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:57:01,857 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:01,857 INFO ]: Start difference. First operand 201 states and 249 transitions. Second operand 12 states. [2018-06-22 10:57:02,039 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:02,039 INFO ]: Finished difference Result 249 states and 309 transitions. [2018-06-22 10:57:02,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:57:02,040 INFO ]: Start accepts. Automaton has 12 states. Word has length 93 [2018-06-22 10:57:02,040 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:02,042 INFO ]: With dead ends: 249 [2018-06-22 10:57:02,042 INFO ]: Without dead ends: 241 [2018-06-22 10:57:02,042 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:02,042 INFO ]: Start minimizeSevpa. Operand 241 states. [2018-06-22 10:57:02,068 INFO ]: Finished minimizeSevpa. Reduced states from 241 to 229. [2018-06-22 10:57:02,074 INFO ]: Start removeUnreachable. Operand 229 states. [2018-06-22 10:57:02,077 INFO ]: Finished removeUnreachable. Reduced from 229 states to 229 states and 286 transitions. [2018-06-22 10:57:02,077 INFO ]: Start accepts. Automaton has 229 states and 286 transitions. Word has length 93 [2018-06-22 10:57:02,077 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:02,077 INFO ]: Abstraction has 229 states and 286 transitions. [2018-06-22 10:57:02,077 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:57:02,077 INFO ]: Start isEmpty. Operand 229 states and 286 transitions. [2018-06-22 10:57:02,080 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:57:02,080 INFO ]: Found error trace [2018-06-22 10:57:02,080 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:02,080 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:02,080 INFO ]: Analyzing trace with hash -1554271951, now seen corresponding path program 1 times [2018-06-22 10:57:02,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:02,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:02,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:02,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:02,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:02,099 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:02,225 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:02,226 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:02,226 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:57:02,226 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:57:02,226 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:57:02,226 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:02,226 INFO ]: Start difference. First operand 229 states and 286 transitions. Second operand 12 states. [2018-06-22 10:57:02,417 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:02,417 INFO ]: Finished difference Result 267 states and 323 transitions. [2018-06-22 10:57:02,417 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:57:02,417 INFO ]: Start accepts. Automaton has 12 states. Word has length 93 [2018-06-22 10:57:02,418 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:02,421 INFO ]: With dead ends: 267 [2018-06-22 10:57:02,421 INFO ]: Without dead ends: 257 [2018-06-22 10:57:02,421 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:02,421 INFO ]: Start minimizeSevpa. Operand 257 states. [2018-06-22 10:57:02,445 INFO ]: Finished minimizeSevpa. Reduced states from 257 to 231. [2018-06-22 10:57:02,445 INFO ]: Start removeUnreachable. Operand 231 states. [2018-06-22 10:57:02,447 INFO ]: Finished removeUnreachable. Reduced from 231 states to 231 states and 285 transitions. [2018-06-22 10:57:02,447 INFO ]: Start accepts. Automaton has 231 states and 285 transitions. Word has length 93 [2018-06-22 10:57:02,447 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:02,447 INFO ]: Abstraction has 231 states and 285 transitions. [2018-06-22 10:57:02,447 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:57:02,447 INFO ]: Start isEmpty. Operand 231 states and 285 transitions. [2018-06-22 10:57:02,450 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:57:02,450 INFO ]: Found error trace [2018-06-22 10:57:02,451 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:02,451 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:02,451 INFO ]: Analyzing trace with hash -78695747, now seen corresponding path program 1 times [2018-06-22 10:57:02,451 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:02,451 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:02,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:02,452 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:02,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:02,465 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:02,635 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:02,635 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:02,635 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:57:02,635 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:57:02,635 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:57:02,635 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:02,635 INFO ]: Start difference. First operand 231 states and 285 transitions. Second operand 12 states. [2018-06-22 10:57:02,999 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:02,999 INFO ]: Finished difference Result 279 states and 345 transitions. [2018-06-22 10:57:02,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:57:03,000 INFO ]: Start accepts. Automaton has 12 states. Word has length 93 [2018-06-22 10:57:03,000 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:03,002 INFO ]: With dead ends: 279 [2018-06-22 10:57:03,002 INFO ]: Without dead ends: 269 [2018-06-22 10:57:03,003 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:03,003 INFO ]: Start minimizeSevpa. Operand 269 states. [2018-06-22 10:57:03,017 INFO ]: Finished minimizeSevpa. Reduced states from 269 to 251. [2018-06-22 10:57:03,017 INFO ]: Start removeUnreachable. Operand 251 states. [2018-06-22 10:57:03,019 INFO ]: Finished removeUnreachable. Reduced from 251 states to 251 states and 315 transitions. [2018-06-22 10:57:03,019 INFO ]: Start accepts. Automaton has 251 states and 315 transitions. Word has length 93 [2018-06-22 10:57:03,019 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:03,019 INFO ]: Abstraction has 251 states and 315 transitions. [2018-06-22 10:57:03,019 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:57:03,019 INFO ]: Start isEmpty. Operand 251 states and 315 transitions. [2018-06-22 10:57:03,021 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:57:03,021 INFO ]: Found error trace [2018-06-22 10:57:03,022 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:03,022 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:03,022 INFO ]: Analyzing trace with hash 372245971, now seen corresponding path program 1 times [2018-06-22 10:57:03,022 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:03,022 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:03,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:03,023 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:03,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:03,034 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:03,328 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:03,328 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:03,329 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:57:03,329 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:57:03,329 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:57:03,329 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:03,329 INFO ]: Start difference. First operand 251 states and 315 transitions. Second operand 12 states. [2018-06-22 10:57:03,506 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:03,506 INFO ]: Finished difference Result 291 states and 355 transitions. [2018-06-22 10:57:03,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:57:03,506 INFO ]: Start accepts. Automaton has 12 states. Word has length 93 [2018-06-22 10:57:03,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:03,509 INFO ]: With dead ends: 291 [2018-06-22 10:57:03,509 INFO ]: Without dead ends: 281 [2018-06-22 10:57:03,509 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:03,509 INFO ]: Start minimizeSevpa. Operand 281 states. [2018-06-22 10:57:03,521 INFO ]: Finished minimizeSevpa. Reduced states from 281 to 257. [2018-06-22 10:57:03,521 INFO ]: Start removeUnreachable. Operand 257 states. [2018-06-22 10:57:03,523 INFO ]: Finished removeUnreachable. Reduced from 257 states to 257 states and 320 transitions. [2018-06-22 10:57:03,523 INFO ]: Start accepts. Automaton has 257 states and 320 transitions. Word has length 93 [2018-06-22 10:57:03,524 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:03,524 INFO ]: Abstraction has 257 states and 320 transitions. [2018-06-22 10:57:03,524 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:57:03,524 INFO ]: Start isEmpty. Operand 257 states and 320 transitions. [2018-06-22 10:57:03,526 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:57:03,526 INFO ]: Found error trace [2018-06-22 10:57:03,526 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:03,526 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:03,526 INFO ]: Analyzing trace with hash 1294820344, now seen corresponding path program 1 times [2018-06-22 10:57:03,526 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:03,526 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:03,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:03,527 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:03,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:03,536 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:03,849 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:03,849 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:03,849 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:57:03,849 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:57:03,850 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:57:03,850 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:03,850 INFO ]: Start difference. First operand 257 states and 320 transitions. Second operand 12 states. [2018-06-22 10:57:04,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:04,038 INFO ]: Finished difference Result 295 states and 359 transitions. [2018-06-22 10:57:04,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:57:04,038 INFO ]: Start accepts. Automaton has 12 states. Word has length 93 [2018-06-22 10:57:04,039 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:04,040 INFO ]: With dead ends: 295 [2018-06-22 10:57:04,040 INFO ]: Without dead ends: 285 [2018-06-22 10:57:04,041 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:57:04,041 INFO ]: Start minimizeSevpa. Operand 285 states. [2018-06-22 10:57:04,053 INFO ]: Finished minimizeSevpa. Reduced states from 285 to 261. [2018-06-22 10:57:04,053 INFO ]: Start removeUnreachable. Operand 261 states. [2018-06-22 10:57:04,055 INFO ]: Finished removeUnreachable. Reduced from 261 states to 261 states and 324 transitions. [2018-06-22 10:57:04,055 INFO ]: Start accepts. Automaton has 261 states and 324 transitions. Word has length 93 [2018-06-22 10:57:04,055 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:04,055 INFO ]: Abstraction has 261 states and 324 transitions. [2018-06-22 10:57:04,055 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:57:04,055 INFO ]: Start isEmpty. Operand 261 states and 324 transitions. [2018-06-22 10:57:04,057 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:57:04,057 INFO ]: Found error trace [2018-06-22 10:57:04,057 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:04,057 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:04,057 INFO ]: Analyzing trace with hash 626565404, now seen corresponding path program 1 times [2018-06-22 10:57:04,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:04,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:04,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:04,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:04,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:04,072 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:04,219 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:04,219 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:04,219 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:04,219 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:04,219 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:04,219 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:04,220 INFO ]: Start difference. First operand 261 states and 324 transitions. Second operand 13 states. [2018-06-22 10:57:04,762 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:04,762 INFO ]: Finished difference Result 311 states and 386 transitions. [2018-06-22 10:57:04,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:04,763 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:57:04,763 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:04,765 INFO ]: With dead ends: 311 [2018-06-22 10:57:04,765 INFO ]: Without dead ends: 303 [2018-06-22 10:57:04,765 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:04,765 INFO ]: Start minimizeSevpa. Operand 303 states. [2018-06-22 10:57:04,777 INFO ]: Finished minimizeSevpa. Reduced states from 303 to 285. [2018-06-22 10:57:04,777 INFO ]: Start removeUnreachable. Operand 285 states. [2018-06-22 10:57:04,779 INFO ]: Finished removeUnreachable. Reduced from 285 states to 285 states and 359 transitions. [2018-06-22 10:57:04,780 INFO ]: Start accepts. Automaton has 285 states and 359 transitions. Word has length 97 [2018-06-22 10:57:04,780 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:04,780 INFO ]: Abstraction has 285 states and 359 transitions. [2018-06-22 10:57:04,780 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:04,780 INFO ]: Start isEmpty. Operand 285 states and 359 transitions. [2018-06-22 10:57:04,782 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:57:04,782 INFO ]: Found error trace [2018-06-22 10:57:04,782 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:04,782 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:04,782 INFO ]: Analyzing trace with hash 2020568983, now seen corresponding path program 1 times [2018-06-22 10:57:04,782 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:04,782 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:04,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:04,783 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:04,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:04,796 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:05,088 WARN ]: Spent 162.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-22 10:57:05,972 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:05,972 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:05,993 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:05,993 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:05,993 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:05,993 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:05,994 INFO ]: Start difference. First operand 285 states and 359 transitions. Second operand 13 states. [2018-06-22 10:57:06,529 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:06,529 INFO ]: Finished difference Result 331 states and 405 transitions. [2018-06-22 10:57:06,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:06,529 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:57:06,530 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:06,531 INFO ]: With dead ends: 331 [2018-06-22 10:57:06,531 INFO ]: Without dead ends: 323 [2018-06-22 10:57:06,531 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:06,532 INFO ]: Start minimizeSevpa. Operand 323 states. [2018-06-22 10:57:06,545 INFO ]: Finished minimizeSevpa. Reduced states from 323 to 297. [2018-06-22 10:57:06,545 INFO ]: Start removeUnreachable. Operand 297 states. [2018-06-22 10:57:06,548 INFO ]: Finished removeUnreachable. Reduced from 297 states to 297 states and 370 transitions. [2018-06-22 10:57:06,548 INFO ]: Start accepts. Automaton has 297 states and 370 transitions. Word has length 97 [2018-06-22 10:57:06,548 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:06,548 INFO ]: Abstraction has 297 states and 370 transitions. [2018-06-22 10:57:06,548 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:06,548 INFO ]: Start isEmpty. Operand 297 states and 370 transitions. [2018-06-22 10:57:06,550 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:57:06,550 INFO ]: Found error trace [2018-06-22 10:57:06,550 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:06,550 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:06,550 INFO ]: Analyzing trace with hash -282636583, now seen corresponding path program 1 times [2018-06-22 10:57:06,550 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:06,551 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:06,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:06,552 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:06,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:06,567 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:06,835 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:06,835 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:06,835 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:06,836 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:06,837 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:06,837 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:06,837 INFO ]: Start difference. First operand 297 states and 370 transitions. Second operand 13 states. [2018-06-22 10:57:07,954 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:07,954 INFO ]: Finished difference Result 341 states and 424 transitions. [2018-06-22 10:57:07,954 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:07,954 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:57:07,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:07,957 INFO ]: With dead ends: 341 [2018-06-22 10:57:07,957 INFO ]: Without dead ends: 331 [2018-06-22 10:57:07,957 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:07,958 INFO ]: Start minimizeSevpa. Operand 331 states. [2018-06-22 10:57:07,975 INFO ]: Finished minimizeSevpa. Reduced states from 331 to 311. [2018-06-22 10:57:07,975 INFO ]: Start removeUnreachable. Operand 311 states. [2018-06-22 10:57:07,978 INFO ]: Finished removeUnreachable. Reduced from 311 states to 311 states and 393 transitions. [2018-06-22 10:57:07,978 INFO ]: Start accepts. Automaton has 311 states and 393 transitions. Word has length 97 [2018-06-22 10:57:07,978 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:07,978 INFO ]: Abstraction has 311 states and 393 transitions. [2018-06-22 10:57:07,978 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:07,978 INFO ]: Start isEmpty. Operand 311 states and 393 transitions. [2018-06-22 10:57:07,983 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:57:07,983 INFO ]: Found error trace [2018-06-22 10:57:07,983 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:07,983 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:07,984 INFO ]: Analyzing trace with hash 1685331724, now seen corresponding path program 1 times [2018-06-22 10:57:07,984 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:07,984 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:07,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:07,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:07,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:08,008 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:08,250 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:08,250 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:08,250 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:08,250 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:08,251 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:08,251 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:08,251 INFO ]: Start difference. First operand 311 states and 393 transitions. Second operand 13 states. [2018-06-22 10:57:08,597 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:08,597 INFO ]: Finished difference Result 353 states and 440 transitions. [2018-06-22 10:57:08,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:08,598 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:57:08,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:08,600 INFO ]: With dead ends: 353 [2018-06-22 10:57:08,600 INFO ]: Without dead ends: 343 [2018-06-22 10:57:08,600 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:08,601 INFO ]: Start minimizeSevpa. Operand 343 states. [2018-06-22 10:57:08,613 INFO ]: Finished minimizeSevpa. Reduced states from 343 to 323. [2018-06-22 10:57:08,613 INFO ]: Start removeUnreachable. Operand 323 states. [2018-06-22 10:57:08,615 INFO ]: Finished removeUnreachable. Reduced from 323 states to 323 states and 409 transitions. [2018-06-22 10:57:08,615 INFO ]: Start accepts. Automaton has 323 states and 409 transitions. Word has length 97 [2018-06-22 10:57:08,615 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:08,615 INFO ]: Abstraction has 323 states and 409 transitions. [2018-06-22 10:57:08,615 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:08,615 INFO ]: Start isEmpty. Operand 323 states and 409 transitions. [2018-06-22 10:57:08,618 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:57:08,618 INFO ]: Found error trace [2018-06-22 10:57:08,618 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:08,618 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:08,618 INFO ]: Analyzing trace with hash 38509679, now seen corresponding path program 1 times [2018-06-22 10:57:08,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:08,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:08,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:08,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:08,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:08,631 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:08,908 WARN ]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-22 10:57:09,340 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:09,340 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:09,340 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:09,340 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:09,340 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:09,340 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:09,340 INFO ]: Start difference. First operand 323 states and 409 transitions. Second operand 13 states. [2018-06-22 10:57:09,870 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:09,870 INFO ]: Finished difference Result 367 states and 454 transitions. [2018-06-22 10:57:09,870 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:09,871 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:57:09,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:09,872 INFO ]: With dead ends: 367 [2018-06-22 10:57:09,872 INFO ]: Without dead ends: 354 [2018-06-22 10:57:09,873 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:09,873 INFO ]: Start minimizeSevpa. Operand 354 states. [2018-06-22 10:57:09,886 INFO ]: Finished minimizeSevpa. Reduced states from 354 to 332. [2018-06-22 10:57:09,886 INFO ]: Start removeUnreachable. Operand 332 states. [2018-06-22 10:57:09,888 INFO ]: Finished removeUnreachable. Reduced from 332 states to 332 states and 417 transitions. [2018-06-22 10:57:09,888 INFO ]: Start accepts. Automaton has 332 states and 417 transitions. Word has length 97 [2018-06-22 10:57:09,888 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:09,888 INFO ]: Abstraction has 332 states and 417 transitions. [2018-06-22 10:57:09,888 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:09,888 INFO ]: Start isEmpty. Operand 332 states and 417 transitions. [2018-06-22 10:57:09,890 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:57:09,890 INFO ]: Found error trace [2018-06-22 10:57:09,890 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:09,890 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:09,890 INFO ]: Analyzing trace with hash 1364185462, now seen corresponding path program 1 times [2018-06-22 10:57:09,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:09,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:09,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:09,891 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:09,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:09,906 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:10,107 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:10,107 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:10,107 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:10,107 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:10,107 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:10,107 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:10,108 INFO ]: Start difference. First operand 332 states and 417 transitions. Second operand 13 states. [2018-06-22 10:57:10,268 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:10,269 INFO ]: Finished difference Result 372 states and 460 transitions. [2018-06-22 10:57:10,269 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:10,269 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:57:10,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:10,271 INFO ]: With dead ends: 372 [2018-06-22 10:57:10,271 INFO ]: Without dead ends: 359 [2018-06-22 10:57:10,271 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:10,272 INFO ]: Start minimizeSevpa. Operand 359 states. [2018-06-22 10:57:10,287 INFO ]: Finished minimizeSevpa. Reduced states from 359 to 337. [2018-06-22 10:57:10,287 INFO ]: Start removeUnreachable. Operand 337 states. [2018-06-22 10:57:10,288 INFO ]: Finished removeUnreachable. Reduced from 337 states to 337 states and 423 transitions. [2018-06-22 10:57:10,288 INFO ]: Start accepts. Automaton has 337 states and 423 transitions. Word has length 97 [2018-06-22 10:57:10,289 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:10,289 INFO ]: Abstraction has 337 states and 423 transitions. [2018-06-22 10:57:10,289 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:10,289 INFO ]: Start isEmpty. Operand 337 states and 423 transitions. [2018-06-22 10:57:10,291 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:57:10,291 INFO ]: Found error trace [2018-06-22 10:57:10,291 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:10,291 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:10,291 INFO ]: Analyzing trace with hash -2021579847, now seen corresponding path program 1 times [2018-06-22 10:57:10,291 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:10,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:10,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:10,292 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:10,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:10,303 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:10,597 WARN ]: Spent 148.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:57:10,804 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:10,804 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:10,804 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:10,804 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:10,804 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:10,804 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:10,805 INFO ]: Start difference. First operand 337 states and 423 transitions. Second operand 13 states. [2018-06-22 10:57:10,978 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:10,978 INFO ]: Finished difference Result 397 states and 494 transitions. [2018-06-22 10:57:11,013 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:11,013 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:57:11,013 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:11,015 INFO ]: With dead ends: 397 [2018-06-22 10:57:11,015 INFO ]: Without dead ends: 380 [2018-06-22 10:57:11,016 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:11,016 INFO ]: Start minimizeSevpa. Operand 380 states. [2018-06-22 10:57:11,030 INFO ]: Finished minimizeSevpa. Reduced states from 380 to 350. [2018-06-22 10:57:11,030 INFO ]: Start removeUnreachable. Operand 350 states. [2018-06-22 10:57:11,031 INFO ]: Finished removeUnreachable. Reduced from 350 states to 350 states and 439 transitions. [2018-06-22 10:57:11,032 INFO ]: Start accepts. Automaton has 350 states and 439 transitions. Word has length 97 [2018-06-22 10:57:11,032 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:11,032 INFO ]: Abstraction has 350 states and 439 transitions. [2018-06-22 10:57:11,032 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:11,032 INFO ]: Start isEmpty. Operand 350 states and 439 transitions. [2018-06-22 10:57:11,034 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:57:11,034 INFO ]: Found error trace [2018-06-22 10:57:11,034 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:11,034 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:11,034 INFO ]: Analyzing trace with hash -627576268, now seen corresponding path program 1 times [2018-06-22 10:57:11,034 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:11,034 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:11,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:11,035 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:11,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:11,048 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:11,255 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:11,255 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:11,255 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:57:11,255 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:57:11,256 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:57:11,256 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:11,256 INFO ]: Start difference. First operand 350 states and 439 transitions. Second operand 13 states. [2018-06-22 10:57:11,412 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:11,412 INFO ]: Finished difference Result 396 states and 487 transitions. [2018-06-22 10:57:11,412 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:57:11,412 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:57:11,412 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:11,413 INFO ]: With dead ends: 396 [2018-06-22 10:57:11,413 INFO ]: Without dead ends: 379 [2018-06-22 10:57:11,414 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:57:11,414 INFO ]: Start minimizeSevpa. Operand 379 states. [2018-06-22 10:57:11,426 INFO ]: Finished minimizeSevpa. Reduced states from 379 to 355. [2018-06-22 10:57:11,426 INFO ]: Start removeUnreachable. Operand 355 states. [2018-06-22 10:57:11,427 INFO ]: Finished removeUnreachable. Reduced from 355 states to 355 states and 442 transitions. [2018-06-22 10:57:11,427 INFO ]: Start accepts. Automaton has 355 states and 442 transitions. Word has length 97 [2018-06-22 10:57:11,427 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:11,427 INFO ]: Abstraction has 355 states and 442 transitions. [2018-06-22 10:57:11,427 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:57:11,428 INFO ]: Start isEmpty. Operand 355 states and 442 transitions. [2018-06-22 10:57:11,430 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 10:57:11,430 INFO ]: Found error trace [2018-06-22 10:57:11,430 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:11,430 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:11,430 INFO ]: Analyzing trace with hash -2068222798, now seen corresponding path program 1 times [2018-06-22 10:57:11,430 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:11,430 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:11,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:11,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:11,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:11,445 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:11,649 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:11,649 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:11,649 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:57:11,649 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:57:11,649 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:57:11,649 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:57:11,649 INFO ]: Start difference. First operand 355 states and 442 transitions. Second operand 14 states. [2018-06-22 10:57:11,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:11,825 INFO ]: Finished difference Result 405 states and 495 transitions. [2018-06-22 10:57:11,826 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:57:11,826 INFO ]: Start accepts. Automaton has 14 states. Word has length 101 [2018-06-22 10:57:11,826 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:11,827 INFO ]: With dead ends: 405 [2018-06-22 10:57:11,827 INFO ]: Without dead ends: 391 [2018-06-22 10:57:11,827 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:57:11,828 INFO ]: Start minimizeSevpa. Operand 391 states. [2018-06-22 10:57:11,839 INFO ]: Finished minimizeSevpa. Reduced states from 391 to 367. [2018-06-22 10:57:11,839 INFO ]: Start removeUnreachable. Operand 367 states. [2018-06-22 10:57:11,841 INFO ]: Finished removeUnreachable. Reduced from 367 states to 367 states and 456 transitions. [2018-06-22 10:57:11,841 INFO ]: Start accepts. Automaton has 367 states and 456 transitions. Word has length 101 [2018-06-22 10:57:11,841 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:11,841 INFO ]: Abstraction has 367 states and 456 transitions. [2018-06-22 10:57:11,841 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:57:11,841 INFO ]: Start isEmpty. Operand 367 states and 456 transitions. [2018-06-22 10:57:11,843 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 10:57:11,843 INFO ]: Found error trace [2018-06-22 10:57:11,843 INFO ]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:57:11,843 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:57:11,844 INFO ]: Analyzing trace with hash 178724181, now seen corresponding path program 1 times [2018-06-22 10:57:11,844 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:57:11,844 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:57:11,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:11,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:57:11,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:57:11,857 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:57:12,163 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:57:12,163 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:57:12,163 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:57:12,164 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:57:12,164 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:57:12,164 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:57:12,164 INFO ]: Start difference. First operand 367 states and 456 transitions. Second operand 14 states. [2018-06-22 10:57:12,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:57:12,438 INFO ]: Finished difference Result 389 states and 482 transitions. [2018-06-22 10:57:12,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:57:12,438 INFO ]: Start accepts. Automaton has 14 states. Word has length 101 [2018-06-22 10:57:12,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:57:12,438 INFO ]: With dead ends: 389 [2018-06-22 10:57:12,438 INFO ]: Without dead ends: 0 [2018-06-22 10:57:12,439 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:57:12,439 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 10:57:12,439 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 10:57:12,439 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 10:57:12,439 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 10:57:12,439 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2018-06-22 10:57:12,439 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:57:12,439 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 10:57:12,439 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:57:12,439 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 10:57:12,439 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 10:57:12,442 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:57:12 BoogieIcfgContainer [2018-06-22 10:57:12,443 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:57:12,443 INFO ]: Toolchain (without parser) took 15589.49 ms. Allocated memory was 308.3 MB in the beginning and 475.5 MB in the end (delta: 167.2 MB). Free memory was 250.8 MB in the beginning and 409.5 MB in the end (delta: -158.7 MB). Peak memory consumption was 8.5 MB. Max. memory is 3.6 GB. [2018-06-22 10:57:12,444 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:57:12,444 INFO ]: ChcToBoogie took 97.61 ms. Allocated memory is still 308.3 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:57:12,444 INFO ]: Boogie Preprocessor took 67.75 ms. Allocated memory is still 308.3 MB. Free memory was 247.8 MB in the beginning and 245.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:57:12,445 INFO ]: RCFGBuilder took 487.46 ms. Allocated memory is still 308.3 MB. Free memory was 245.8 MB in the beginning and 222.7 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 3.6 GB. [2018-06-22 10:57:12,445 INFO ]: TraceAbstraction took 14914.82 ms. Allocated memory was 308.3 MB in the beginning and 475.5 MB in the end (delta: 167.2 MB). Free memory was 222.7 MB in the beginning and 409.5 MB in the end (delta: -186.8 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:57:12,447 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 97.61 ms. Allocated memory is still 308.3 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 67.75 ms. Allocated memory is still 308.3 MB. Free memory was 247.8 MB in the beginning and 245.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 487.46 ms. Allocated memory is still 308.3 MB. Free memory was 245.8 MB in the beginning and 222.7 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 14914.82 ms. Allocated memory was 308.3 MB in the beginning and 475.5 MB in the end (delta: 167.2 MB). Free memory was 222.7 MB in the beginning and 409.5 MB in the end (delta: -186.8 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 114 locations, 1 error locations. SAFE Result, 14.8s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 7.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2920 SDtfs, 282 SDslu, 30296 SDs, 0 SdLazy, 5430 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=18, 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.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 362 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1779 NumberOfCodeBlocks, 1779 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1760 ConstructedInterpolants, 0 QuantifiedInterpolants, 274864 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 270/270 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/46.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-57-12-456.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/46.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-57-12-456.csv Received shutdown request...