./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-new/nested_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loop-new/nested_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a881e1073186594f4727f809fbe5d917ff145543 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 11:26:58,628 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:26:58,630 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:26:58,645 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:26:58,645 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:26:58,646 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:26:58,647 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:26:58,649 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:26:58,651 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:26:58,651 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:26:58,652 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:26:58,653 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:26:58,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:26:58,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:26:58,655 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:26:58,656 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:26:58,657 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:26:58,659 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:26:58,661 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:26:58,663 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:26:58,664 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:26:58,665 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:26:58,667 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:26:58,668 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:26:58,668 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:26:58,669 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:26:58,670 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:26:58,671 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:26:58,672 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:26:58,673 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:26:58,673 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:26:58,674 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:26:58,674 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:26:58,674 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:26:58,676 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:26:58,676 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:26:58,677 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:26:58,692 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:26:58,692 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:26:58,693 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:26:58,694 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:26:58,694 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:26:58,694 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:26:58,694 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:26:58,694 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:26:58,694 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:26:58,695 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:26:58,695 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:26:58,695 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:26:58,695 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:26:58,695 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:26:58,696 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:26:58,696 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:26:58,696 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:26:58,696 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:26:58,696 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:26:58,696 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:26:58,697 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:26:58,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:26:58,697 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:26:58,697 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:26:58,697 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:26:58,697 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:26:58,698 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:26:58,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:26:58,698 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a881e1073186594f4727f809fbe5d917ff145543 [2019-01-12 11:26:58,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:26:58,779 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:26:58,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:26:58,786 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:26:58,787 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:26:58,789 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-new/nested_true-unreach-call_true-termination.i [2019-01-12 11:26:58,847 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7136f4774/71abd88b32a7491e9cc201ba4aa0c0ac/FLAGb13fb8843 [2019-01-12 11:26:59,255 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:26:59,256 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-new/nested_true-unreach-call_true-termination.i [2019-01-12 11:26:59,262 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7136f4774/71abd88b32a7491e9cc201ba4aa0c0ac/FLAGb13fb8843 [2019-01-12 11:26:59,619 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7136f4774/71abd88b32a7491e9cc201ba4aa0c0ac [2019-01-12 11:26:59,623 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:26:59,624 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:26:59,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:26:59,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:26:59,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:26:59,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:26:59" (1/1) ... [2019-01-12 11:26:59,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7730cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:26:59, skipping insertion in model container [2019-01-12 11:26:59,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:26:59" (1/1) ... [2019-01-12 11:26:59,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:26:59,658 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:26:59,800 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:26:59,805 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:26:59,822 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:26:59,838 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:26:59,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:26:59 WrapperNode [2019-01-12 11:26:59,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:26:59,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:26:59,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:26:59,840 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:26:59,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:26:59" (1/1) ... [2019-01-12 11:26:59,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:26:59" (1/1) ... [2019-01-12 11:26:59,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:26:59,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:26:59,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:26:59,873 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:26:59,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:26:59" (1/1) ... [2019-01-12 11:26:59,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:26:59" (1/1) ... [2019-01-12 11:26:59,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:26:59" (1/1) ... [2019-01-12 11:26:59,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:26:59" (1/1) ... [2019-01-12 11:26:59,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:26:59" (1/1) ... [2019-01-12 11:26:59,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:26:59" (1/1) ... [2019-01-12 11:26:59,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:26:59" (1/1) ... [2019-01-12 11:26:59,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:26:59,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:26:59,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:26:59,889 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:26:59,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:26:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:27:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:27:00,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:27:00,225 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:27:00,225 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 11:27:00,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:27:00 BoogieIcfgContainer [2019-01-12 11:27:00,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:27:00,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:27:00,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:27:00,230 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:27:00,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:26:59" (1/3) ... [2019-01-12 11:27:00,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b0f5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:27:00, skipping insertion in model container [2019-01-12 11:27:00,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:26:59" (2/3) ... [2019-01-12 11:27:00,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b0f5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:27:00, skipping insertion in model container [2019-01-12 11:27:00,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:27:00" (3/3) ... [2019-01-12 11:27:00,235 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call_true-termination.i [2019-01-12 11:27:00,246 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:27:00,258 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 11:27:00,275 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 11:27:00,309 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:27:00,309 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:27:00,310 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:27:00,310 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:27:00,310 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:27:00,310 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:27:00,310 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:27:00,310 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:27:00,310 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:27:00,324 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 11:27:00,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 11:27:00,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:00,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:00,334 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:00,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:00,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1482176357, now seen corresponding path program 1 times [2019-01-12 11:27:00,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:00,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:00,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:00,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:27:00,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:00,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:27:00,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:27:00,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 11:27:00,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 11:27:00,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 11:27:00,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:27:00,571 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2019-01-12 11:27:00,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:00,689 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2019-01-12 11:27:00,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 11:27:00,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-12 11:27:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:00,699 INFO L225 Difference]: With dead ends: 34 [2019-01-12 11:27:00,700 INFO L226 Difference]: Without dead ends: 15 [2019-01-12 11:27:00,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:27:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-12 11:27:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-01-12 11:27:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-12 11:27:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-12 11:27:00,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 7 [2019-01-12 11:27:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:00,734 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-12 11:27:00,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 11:27:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-01-12 11:27:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 11:27:00,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:00,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:00,736 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:00,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:00,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1827763540, now seen corresponding path program 1 times [2019-01-12 11:27:00,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:00,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:00,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:00,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:27:00,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:27:00,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:27:00,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 11:27:00,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 11:27:00,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 11:27:00,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:27:00,900 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 4 states. [2019-01-12 11:27:01,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:01,076 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-12 11:27:01,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 11:27:01,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-12 11:27:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:01,078 INFO L225 Difference]: With dead ends: 22 [2019-01-12 11:27:01,078 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 11:27:01,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:27:01,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 11:27:01,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-12 11:27:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-12 11:27:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-12 11:27:01,085 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-12 11:27:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:01,086 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-12 11:27:01,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 11:27:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-12 11:27:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 11:27:01,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:01,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:01,087 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash 321118478, now seen corresponding path program 1 times [2019-01-12 11:27:01,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:01,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:01,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:01,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:27:01,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:27:01,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:01,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:01,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:27:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:01,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:27:01,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:01,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-12 11:27:01,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:27:01,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:27:01,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:27:01,530 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-12 11:27:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:01,656 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-12 11:27:01,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:27:01,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-12 11:27:01,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:01,657 INFO L225 Difference]: With dead ends: 25 [2019-01-12 11:27:01,657 INFO L226 Difference]: Without dead ends: 16 [2019-01-12 11:27:01,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:27:01,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-12 11:27:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-12 11:27:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-12 11:27:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-12 11:27:01,663 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-12 11:27:01,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:01,663 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-12 11:27:01,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:27:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-12 11:27:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 11:27:01,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:01,664 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:01,664 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:01,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash -482531600, now seen corresponding path program 2 times [2019-01-12 11:27:01,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:01,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:01,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:01,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:27:01,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:01,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:27:01,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:01,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:01,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:27:01,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:27:01,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:27:01,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:27:01,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:01,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-01-12 11:27:01,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 11:27:01,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 11:27:01,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:27:01,952 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 9 states. [2019-01-12 11:27:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:02,127 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-01-12 11:27:02,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:27:02,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-01-12 11:27:02,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:02,129 INFO L225 Difference]: With dead ends: 29 [2019-01-12 11:27:02,129 INFO L226 Difference]: Without dead ends: 18 [2019-01-12 11:27:02,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:27:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-12 11:27:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-01-12 11:27:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 11:27:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-12 11:27:02,138 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-01-12 11:27:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:02,141 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-12 11:27:02,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 11:27:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-12 11:27:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 11:27:02,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:02,142 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:02,143 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:02,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:02,143 INFO L82 PathProgramCache]: Analyzing trace with hash 303856722, now seen corresponding path program 3 times [2019-01-12 11:27:02,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:02,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:02,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:02,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:27:02,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:27:02,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:02,326 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:02,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:27:02,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-12 11:27:02,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:27:02,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 11:27:02,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:02,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-01-12 11:27:02,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 11:27:02,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 11:27:02,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:27:02,463 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2019-01-12 11:27:02,849 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 11:27:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:03,242 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-01-12 11:27:03,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 11:27:03,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-01-12 11:27:03,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:03,246 INFO L225 Difference]: With dead ends: 56 [2019-01-12 11:27:03,246 INFO L226 Difference]: Without dead ends: 43 [2019-01-12 11:27:03,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2019-01-12 11:27:03,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-12 11:27:03,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2019-01-12 11:27:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 11:27:03,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-01-12 11:27:03,255 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 16 [2019-01-12 11:27:03,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:03,255 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-01-12 11:27:03,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 11:27:03,255 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-01-12 11:27:03,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 11:27:03,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:03,256 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:03,257 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:03,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:03,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1350606587, now seen corresponding path program 4 times [2019-01-12 11:27:03,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:03,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:03,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:03,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:27:03,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-12 11:27:03,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:03,393 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:03,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:27:03,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:27:03,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:27:03,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-12 11:27:03,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:03,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-12 11:27:03,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 11:27:03,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 11:27:03,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:27:03,632 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 13 states. [2019-01-12 11:27:03,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:03,713 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2019-01-12 11:27:03,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:27:03,715 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-01-12 11:27:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:03,716 INFO L225 Difference]: With dead ends: 53 [2019-01-12 11:27:03,716 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 11:27:03,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:27:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 11:27:03,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-01-12 11:27:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-12 11:27:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-01-12 11:27:03,726 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 29 [2019-01-12 11:27:03,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:03,727 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-01-12 11:27:03,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 11:27:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-01-12 11:27:03,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 11:27:03,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:03,729 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:03,729 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:03,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:03,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2001729659, now seen corresponding path program 5 times [2019-01-12 11:27:03,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:03,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:03,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:03,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:27:03,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-12 11:27:03,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:03,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:03,875 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:27:03,917 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-01-12 11:27:03,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:27:03,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-12 11:27:04,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:04,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-01-12 11:27:04,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 11:27:04,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 11:27:04,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-12 11:27:04,167 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 15 states. [2019-01-12 11:27:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:04,230 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2019-01-12 11:27:04,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 11:27:04,232 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-01-12 11:27:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:04,233 INFO L225 Difference]: With dead ends: 59 [2019-01-12 11:27:04,233 INFO L226 Difference]: Without dead ends: 40 [2019-01-12 11:27:04,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-12 11:27:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-12 11:27:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-01-12 11:27:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 11:27:04,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-01-12 11:27:04,252 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2019-01-12 11:27:04,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:04,253 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-12 11:27:04,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 11:27:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-01-12 11:27:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 11:27:04,258 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:04,258 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:04,259 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:04,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:04,259 INFO L82 PathProgramCache]: Analyzing trace with hash -177581317, now seen corresponding path program 6 times [2019-01-12 11:27:04,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:04,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:04,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:04,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:27:04,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 87 proven. 36 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-12 11:27:04,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:04,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:04,628 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:27:04,647 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-01-12 11:27:04,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:27:04,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-01-12 11:27:04,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:04,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2019-01-12 11:27:04,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 11:27:04,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 11:27:04,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:27:04,749 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 14 states. [2019-01-12 11:27:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:06,037 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2019-01-12 11:27:06,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-12 11:27:06,038 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-01-12 11:27:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:06,040 INFO L225 Difference]: With dead ends: 100 [2019-01-12 11:27:06,040 INFO L226 Difference]: Without dead ends: 79 [2019-01-12 11:27:06,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=668, Invalid=1402, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 11:27:06,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-12 11:27:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2019-01-12 11:27:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 11:27:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-01-12 11:27:06,054 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 37 [2019-01-12 11:27:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:06,054 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-01-12 11:27:06,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 11:27:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-01-12 11:27:06,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-12 11:27:06,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:06,056 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:06,056 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:06,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1363821306, now seen corresponding path program 7 times [2019-01-12 11:27:06,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:06,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:06,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:06,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:27:06,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 229 proven. 49 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2019-01-12 11:27:06,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:06,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:06,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:27:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:06,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 229 proven. 49 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2019-01-12 11:27:06,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:06,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-01-12 11:27:06,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 11:27:06,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 11:27:06,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-01-12 11:27:06,456 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 19 states. [2019-01-12 11:27:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:06,538 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-01-12 11:27:06,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 11:27:06,541 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2019-01-12 11:27:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:06,542 INFO L225 Difference]: With dead ends: 108 [2019-01-12 11:27:06,542 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 11:27:06,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-01-12 11:27:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 11:27:06,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-01-12 11:27:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-12 11:27:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2019-01-12 11:27:06,568 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 58 [2019-01-12 11:27:06,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:06,568 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2019-01-12 11:27:06,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 11:27:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2019-01-12 11:27:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 11:27:06,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:06,573 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:06,573 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:06,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:06,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1890692772, now seen corresponding path program 8 times [2019-01-12 11:27:06,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:06,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:06,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:06,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:27:06,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 293 proven. 64 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-01-12 11:27:06,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:06,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:06,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:27:06,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:27:06,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:27:06,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:07,549 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 293 proven. 64 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-01-12 11:27:07,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:07,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-01-12 11:27:07,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 11:27:07,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 11:27:07,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-01-12 11:27:07,574 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 21 states. [2019-01-12 11:27:07,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:07,636 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2019-01-12 11:27:07,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 11:27:07,645 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2019-01-12 11:27:07,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:07,646 INFO L225 Difference]: With dead ends: 118 [2019-01-12 11:27:07,646 INFO L226 Difference]: Without dead ends: 74 [2019-01-12 11:27:07,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-01-12 11:27:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-12 11:27:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-01-12 11:27:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 11:27:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-01-12 11:27:07,661 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 64 [2019-01-12 11:27:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:07,661 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-01-12 11:27:07,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 11:27:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-01-12 11:27:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-12 11:27:07,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:07,664 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:07,664 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:07,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:07,664 INFO L82 PathProgramCache]: Analyzing trace with hash 612847166, now seen corresponding path program 9 times [2019-01-12 11:27:07,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:07,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:07,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:07,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:27:07,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 365 proven. 81 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2019-01-12 11:27:08,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:08,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:08,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:27:08,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-12 11:27:08,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:27:08,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:08,292 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 367 proven. 81 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-01-12 11:27:08,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:08,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-01-12 11:27:08,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 11:27:08,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 11:27:08,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-01-12 11:27:08,314 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 23 states. [2019-01-12 11:27:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:08,455 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2019-01-12 11:27:08,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 11:27:08,455 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2019-01-12 11:27:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:08,457 INFO L225 Difference]: With dead ends: 128 [2019-01-12 11:27:08,458 INFO L226 Difference]: Without dead ends: 80 [2019-01-12 11:27:08,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=340, Unknown=0, NotChecked=0, Total=552 [2019-01-12 11:27:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-12 11:27:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-01-12 11:27:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-12 11:27:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-01-12 11:27:08,480 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 70 [2019-01-12 11:27:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:08,480 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-01-12 11:27:08,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 11:27:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-01-12 11:27:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-12 11:27:08,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:08,481 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:08,482 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:08,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:08,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1324295776, now seen corresponding path program 10 times [2019-01-12 11:27:08,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:08,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:08,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:27:08,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-12 11:27:08,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:08,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:08,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:27:08,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:27:08,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:27:08,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-12 11:27:08,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:08,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-01-12 11:27:08,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 11:27:08,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 11:27:08,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:27:08,897 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 11 states. [2019-01-12 11:27:09,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:09,086 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2019-01-12 11:27:09,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:27:09,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2019-01-12 11:27:09,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:09,090 INFO L225 Difference]: With dead ends: 126 [2019-01-12 11:27:09,090 INFO L226 Difference]: Without dead ends: 122 [2019-01-12 11:27:09,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:27:09,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-12 11:27:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 100. [2019-01-12 11:27:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-12 11:27:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-01-12 11:27:09,119 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 76 [2019-01-12 11:27:09,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:09,120 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-01-12 11:27:09,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 11:27:09,120 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-01-12 11:27:09,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 11:27:09,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:09,127 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:09,127 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:09,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:09,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420261, now seen corresponding path program 11 times [2019-01-12 11:27:09,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:09,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:09,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:09,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:27:09,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1742 backedges. 0 proven. 1342 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-01-12 11:27:09,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:09,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:09,538 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:27:09,855 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-01-12 11:27:09,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:27:09,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1742 backedges. 0 proven. 1342 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-01-12 11:27:10,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:10,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-12 11:27:10,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 11:27:10,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 11:27:10,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:27:10,075 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 13 states. [2019-01-12 11:27:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:10,157 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2019-01-12 11:27:10,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:27:10,158 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2019-01-12 11:27:10,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:10,159 INFO L225 Difference]: With dead ends: 149 [2019-01-12 11:27:10,159 INFO L226 Difference]: Without dead ends: 145 [2019-01-12 11:27:10,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:27:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-12 11:27:10,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 123. [2019-01-12 11:27:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-12 11:27:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2019-01-12 11:27:10,179 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 99 [2019-01-12 11:27:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:10,179 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2019-01-12 11:27:10,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 11:27:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2019-01-12 11:27:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-12 11:27:10,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:10,183 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:10,183 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:10,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:10,185 INFO L82 PathProgramCache]: Analyzing trace with hash 172545856, now seen corresponding path program 12 times [2019-01-12 11:27:10,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:10,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:10,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:10,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:27:10,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2735 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2019-01-12 11:27:10,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:10,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:10,385 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:27:10,500 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2019-01-12 11:27:10,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:27:10,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2735 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2019-01-12 11:27:10,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:10,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-01-12 11:27:10,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 11:27:10,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 11:27:10,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-12 11:27:10,755 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand 15 states. [2019-01-12 11:27:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:10,914 INFO L93 Difference]: Finished difference Result 172 states and 179 transitions. [2019-01-12 11:27:10,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 11:27:10,917 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 122 [2019-01-12 11:27:10,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:10,919 INFO L225 Difference]: With dead ends: 172 [2019-01-12 11:27:10,919 INFO L226 Difference]: Without dead ends: 168 [2019-01-12 11:27:10,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-12 11:27:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-12 11:27:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 146. [2019-01-12 11:27:10,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-12 11:27:10,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 152 transitions. [2019-01-12 11:27:10,942 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 152 transitions. Word has length 122 [2019-01-12 11:27:10,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:10,942 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 152 transitions. [2019-01-12 11:27:10,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 11:27:10,942 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 152 transitions. [2019-01-12 11:27:10,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-12 11:27:10,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:10,946 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:10,946 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:10,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:10,946 INFO L82 PathProgramCache]: Analyzing trace with hash -334214213, now seen corresponding path program 13 times [2019-01-12 11:27:10,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:10,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:10,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:10,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:27:10,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3951 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-01-12 11:27:11,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:11,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:11,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:27:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:11,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3951 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-01-12 11:27:11,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:11,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-01-12 11:27:11,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 11:27:11,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 11:27:11,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-01-12 11:27:11,933 INFO L87 Difference]: Start difference. First operand 146 states and 152 transitions. Second operand 17 states. [2019-01-12 11:27:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:12,097 INFO L93 Difference]: Finished difference Result 195 states and 203 transitions. [2019-01-12 11:27:12,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 11:27:12,099 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 145 [2019-01-12 11:27:12,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:12,101 INFO L225 Difference]: With dead ends: 195 [2019-01-12 11:27:12,101 INFO L226 Difference]: Without dead ends: 191 [2019-01-12 11:27:12,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-01-12 11:27:12,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-12 11:27:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 169. [2019-01-12 11:27:12,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-12 11:27:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 176 transitions. [2019-01-12 11:27:12,129 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 176 transitions. Word has length 145 [2019-01-12 11:27:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:12,129 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 176 transitions. [2019-01-12 11:27:12,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 11:27:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 176 transitions. [2019-01-12 11:27:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-12 11:27:12,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:12,133 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:12,133 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:12,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:12,135 INFO L82 PathProgramCache]: Analyzing trace with hash -10093344, now seen corresponding path program 14 times [2019-01-12 11:27:12,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:12,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:12,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:12,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:27:12,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5390 backedges. 0 proven. 4690 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2019-01-12 11:27:12,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:12,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:12,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:27:12,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:27:12,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:27:12,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5390 backedges. 0 proven. 4690 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2019-01-12 11:27:12,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:12,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-01-12 11:27:12,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 11:27:12,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 11:27:12,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-01-12 11:27:12,694 INFO L87 Difference]: Start difference. First operand 169 states and 176 transitions. Second operand 19 states. [2019-01-12 11:27:12,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:12,997 INFO L93 Difference]: Finished difference Result 218 states and 227 transitions. [2019-01-12 11:27:12,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 11:27:12,998 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 168 [2019-01-12 11:27:12,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:13,000 INFO L225 Difference]: With dead ends: 218 [2019-01-12 11:27:13,001 INFO L226 Difference]: Without dead ends: 214 [2019-01-12 11:27:13,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-01-12 11:27:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-12 11:27:13,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 192. [2019-01-12 11:27:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-12 11:27:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 200 transitions. [2019-01-12 11:27:13,031 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 200 transitions. Word has length 168 [2019-01-12 11:27:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:13,032 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 200 transitions. [2019-01-12 11:27:13,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 11:27:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 200 transitions. [2019-01-12 11:27:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-12 11:27:13,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:13,036 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:13,036 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:13,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:13,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1089917467, now seen corresponding path program 15 times [2019-01-12 11:27:13,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:13,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:13,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:13,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:27:13,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7052 backedges. 0 proven. 6252 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-01-12 11:27:13,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:13,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:13,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:27:13,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-12 11:27:13,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:27:13,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7052 backedges. 0 proven. 6252 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-01-12 11:27:14,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:14,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-01-12 11:27:14,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 11:27:14,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 11:27:14,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-01-12 11:27:14,105 INFO L87 Difference]: Start difference. First operand 192 states and 200 transitions. Second operand 21 states. [2019-01-12 11:27:14,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:14,342 INFO L93 Difference]: Finished difference Result 241 states and 251 transitions. [2019-01-12 11:27:14,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 11:27:14,344 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 191 [2019-01-12 11:27:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:14,346 INFO L225 Difference]: With dead ends: 241 [2019-01-12 11:27:14,347 INFO L226 Difference]: Without dead ends: 237 [2019-01-12 11:27:14,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-01-12 11:27:14,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-01-12 11:27:14,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 215. [2019-01-12 11:27:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-12 11:27:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 224 transitions. [2019-01-12 11:27:14,376 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 224 transitions. Word has length 191 [2019-01-12 11:27:14,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:14,376 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 224 transitions. [2019-01-12 11:27:14,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 11:27:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 224 transitions. [2019-01-12 11:27:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-01-12 11:27:14,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:14,379 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:14,379 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:14,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:14,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1650308480, now seen corresponding path program 16 times [2019-01-12 11:27:14,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:14,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:14,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:14,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:27:14,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8937 backedges. 0 proven. 8037 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-01-12 11:27:14,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:14,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:14,711 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:27:14,799 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:27:14,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:27:14,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8937 backedges. 0 proven. 8037 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-01-12 11:27:15,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:15,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-01-12 11:27:15,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 11:27:15,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 11:27:15,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-01-12 11:27:15,038 INFO L87 Difference]: Start difference. First operand 215 states and 224 transitions. Second operand 23 states. [2019-01-12 11:27:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:15,261 INFO L93 Difference]: Finished difference Result 264 states and 275 transitions. [2019-01-12 11:27:15,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 11:27:15,261 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 214 [2019-01-12 11:27:15,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:15,263 INFO L225 Difference]: With dead ends: 264 [2019-01-12 11:27:15,263 INFO L226 Difference]: Without dead ends: 260 [2019-01-12 11:27:15,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=340, Unknown=0, NotChecked=0, Total=552 [2019-01-12 11:27:15,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-01-12 11:27:15,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 238. [2019-01-12 11:27:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-12 11:27:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 248 transitions. [2019-01-12 11:27:15,294 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 248 transitions. Word has length 214 [2019-01-12 11:27:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:15,294 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 248 transitions. [2019-01-12 11:27:15,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 11:27:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 248 transitions. [2019-01-12 11:27:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-01-12 11:27:15,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:15,296 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:27:15,296 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:15,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:15,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1479356539, now seen corresponding path program 17 times [2019-01-12 11:27:15,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:15,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:15,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:15,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:27:15,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11045 backedges. 11036 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 11:27:21,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:27:21,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [103] imperfect sequences [] total 103 [2019-01-12 11:27:21,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-12 11:27:21,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-12 11:27:21,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2019-01-12 11:27:21,187 INFO L87 Difference]: Start difference. First operand 238 states and 248 transitions. Second operand 104 states. [2019-01-12 11:27:24,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:24,117 INFO L93 Difference]: Finished difference Result 9778 states and 10238 transitions. [2019-01-12 11:27:24,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-12 11:27:24,117 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 237 [2019-01-12 11:27:24,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:24,118 INFO L225 Difference]: With dead ends: 9778 [2019-01-12 11:27:24,118 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:27:24,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5359, Invalid=5561, Unknown=0, NotChecked=0, Total=10920 [2019-01-12 11:27:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:27:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:27:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:27:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:27:24,134 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 237 [2019-01-12 11:27:24,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:24,135 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:27:24,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-12 11:27:24,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:27:24,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:27:24,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:27:30,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:30,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:31,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:32,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:33,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:34,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:34,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:34,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:34,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:34,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:34,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:34,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:34,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:34,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:34,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:34,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:34,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:34,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:34,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:34,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:35,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:36,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:36,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:36,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:36,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:36,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:36,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:36,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:37,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:37,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:37,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:37,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:37,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:37,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:37,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:37,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:37,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:37,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:38,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:39,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:39,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:39,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:39,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:39,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:39,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:39,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:39,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:39,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:39,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:39,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:39,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:39,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:40,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:40,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:40,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:40,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:40,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:40,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:40,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:40,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:40,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:40,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:40,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:40,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:40,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:41,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:41,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:41,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:41,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:41,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:41,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:41,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:41,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:41,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:41,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:41,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:41,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:41,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:41,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:42,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:43,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:43,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:43,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:43,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:43,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:43,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:43,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:43,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:43,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:43,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:44,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:44,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:44,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:44,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:44,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:44,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:44,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:44,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:44,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:44,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:45,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:45,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:45,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:45,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:45,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:45,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:45,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:45,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:45,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:45,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:46,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:46,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:46,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:46,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:46,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:46,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:47,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:47,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:47,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:47,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:47,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:47,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:48,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:48,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:48,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:48,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:48,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:49,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:49,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:49,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:49,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:49,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:49,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:49,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:50,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:50,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:50,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:50,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:50,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:51,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:51,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:51,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:51,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:51,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:51,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:51,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:51,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:51,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:52,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:52,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:52,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:52,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:52,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:52,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:53,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:53,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:53,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:53,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:54,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:54,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:54,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:54,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:54,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:54,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:55,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:55,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:55,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:55,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:55,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:55,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:55,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:55,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:56,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:56,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:57,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:57,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:58,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:58,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:59,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:59,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:59,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:27:59,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:00,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:00,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:00,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:00,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:00,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:00,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:01,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:01,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:01,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:01,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:02,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:02,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:02,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:02,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:03,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:03,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:03,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:03,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:04,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:04,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:04,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:04,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:05,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:06,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:06,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:06,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:08,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:09,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:09,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:09,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:09,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:10,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:10,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:10,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:10,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:10,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:10,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:11,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:11,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:12,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:12,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:12,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:13,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:14,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:14,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:15,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:19,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:21,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:21,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:28:26,721 WARN L181 SmtUtils]: Spent 1.04 m on a formula simplification. DAG size of input: 5175 DAG size of output: 1754 [2019-01-12 11:28:27,660 WARN L181 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2019-01-12 11:29:26,252 WARN L181 SmtUtils]: Spent 58.58 s on a formula simplification. DAG size of input: 1719 DAG size of output: 362 [2019-01-12 11:29:32,676 WARN L181 SmtUtils]: Spent 6.42 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2019-01-12 11:29:32,678 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:29:32,679 INFO L451 ceAbstractionStarter]: At program point L23(lines 10 24) the Hoare annotation is: true [2019-01-12 11:29:32,679 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-01-12 11:29:32,679 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 17 21) no Hoare annotation was computed. [2019-01-12 11:29:32,679 INFO L444 ceAbstractionStarter]: At program point L17-3(lines 17 21) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~n~0)) (.cse1 (<= 10 ULTIMATE.start_main_~m~0))) (or (and .cse0 .cse1 (<= 60 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~i~0 6)) (and (<= ULTIMATE.start_main_~i~0 9) .cse0 .cse1 (<= 90 ULTIMATE.start_main_~k~0)) (and .cse0 (<= 70 ULTIMATE.start_main_~k~0) .cse1 (<= ULTIMATE.start_main_~i~0 7)) (and .cse0 .cse1 (<= ULTIMATE.start_main_~i~0 8) (<= 80 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= 50 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~i~0 5)) (and .cse0 .cse1 (<= ULTIMATE.start_main_~i~0 3) (<= 30 ULTIMATE.start_main_~k~0)) (and (<= ULTIMATE.start_main_~i~0 2) .cse0 (<= 20 ULTIMATE.start_main_~k~0) .cse1) (and (<= 40 ULTIMATE.start_main_~k~0) .cse0 .cse1 (<= ULTIMATE.start_main_~i~0 4)) (and .cse0 .cse1 (<= 100 ULTIMATE.start_main_~k~0)) (and (<= ULTIMATE.start_main_~i~0 0) (<= 0 ULTIMATE.start_main_~k~0) .cse0 .cse1) (and .cse0 .cse1 (<= 10 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~i~0 1)))) [2019-01-12 11:29:32,679 INFO L448 ceAbstractionStarter]: For program point L17-4(lines 17 21) no Hoare annotation was computed. [2019-01-12 11:29:32,679 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-01-12 11:29:32,680 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:29:32,681 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:29:32,681 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2019-01-12 11:29:32,681 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 18 20) no Hoare annotation was computed. [2019-01-12 11:29:32,682 INFO L444 ceAbstractionStarter]: At program point L18-3(lines 18 20) the Hoare annotation is: (let ((.cse18 (<= ULTIMATE.start_main_~j~0 4)) (.cse2 (<= ULTIMATE.start_main_~j~0 1)) (.cse9 (<= ULTIMATE.start_main_~j~0 7)) (.cse15 (<= ULTIMATE.start_main_~j~0 6)) (.cse30 (<= ULTIMATE.start_main_~j~0 9)) (.cse20 (<= ULTIMATE.start_main_~j~0 5)) (.cse7 (<= ULTIMATE.start_main_~j~0 2)) (.cse19 (<= ULTIMATE.start_main_~j~0 0)) (.cse22 (<= ULTIMATE.start_main_~j~0 3)) (.cse0 (<= 10 ULTIMATE.start_main_~n~0)) (.cse32 (<= ULTIMATE.start_main_~j~0 8)) (.cse1 (<= 10 ULTIMATE.start_main_~m~0))) (let ((.cse26 (<= 20 ULTIMATE.start_main_~k~0)) (.cse10 (<= 40 ULTIMATE.start_main_~k~0)) (.cse12 (and .cse0 .cse32 .cse1)) (.cse34 (<= 30 ULTIMATE.start_main_~k~0)) (.cse36 (<= 70 ULTIMATE.start_main_~k~0)) (.cse35 (<= 60 ULTIMATE.start_main_~k~0)) (.cse37 (and .cse0 .cse1 .cse22)) (.cse4 (and .cse0 .cse1 .cse19)) (.cse23 (<= 80 ULTIMATE.start_main_~k~0)) (.cse28 (and .cse7 .cse0 .cse1)) (.cse27 (<= ULTIMATE.start_main_~i~0 2)) (.cse13 (<= ULTIMATE.start_main_~i~0 6)) (.cse39 (and .cse0 .cse20 .cse1)) (.cse11 (<= ULTIMATE.start_main_~i~0 3)) (.cse40 (<= 10 ULTIMATE.start_main_~k~0)) (.cse21 (<= ULTIMATE.start_main_~i~0 1)) (.cse29 (<= 50 ULTIMATE.start_main_~k~0)) (.cse8 (<= ULTIMATE.start_main_~i~0 4)) (.cse31 (and .cse0 .cse1 .cse30)) (.cse38 (and .cse0 .cse1 .cse15)) (.cse25 (and .cse0 .cse1 .cse9)) (.cse5 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse14 (<= ULTIMATE.start_main_~i~0 0)) (.cse6 (<= 90 ULTIMATE.start_main_~k~0)) (.cse16 (and .cse0 .cse1 .cse2)) (.cse24 (<= ULTIMATE.start_main_~i~0 7)) (.cse17 (<= ULTIMATE.start_main_~i~0 8)) (.cse33 (and .cse0 .cse1 .cse18)) (.cse3 (<= ULTIMATE.start_main_~i~0 5))) (or (and .cse0 .cse1 (<= 51 ULTIMATE.start_main_~k~0) .cse2 .cse3) (and (and .cse4 .cse5) .cse6) (and (<= 42 ULTIMATE.start_main_~k~0) .cse7 .cse0 .cse1 .cse8) (and (<= 47 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse9 .cse8) (and .cse10 .cse0 .cse1 .cse11) (and (<= 68 ULTIMATE.start_main_~k~0) .cse12 .cse13) (and (and .cse0 .cse1 .cse5) (<= 100 ULTIMATE.start_main_~k~0)) (and .cse14 .cse0 (<= 6 ULTIMATE.start_main_~k~0) .cse1 .cse15) (and (and .cse16 .cse5) (<= 91 ULTIMATE.start_main_~k~0)) (and .cse16 .cse17 (<= 81 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= 64 ULTIMATE.start_main_~k~0) .cse13 .cse18) (and .cse14 (<= 0 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse19) (and .cse0 .cse20 .cse1 (<= 15 ULTIMATE.start_main_~k~0) .cse21) (and (and .cse12 .cse5) (<= 98 ULTIMATE.start_main_~k~0)) (and .cse14 .cse0 .cse1 .cse22 (<= 3 ULTIMATE.start_main_~k~0)) (and .cse7 .cse0 .cse1 .cse13 (<= 62 ULTIMATE.start_main_~k~0)) (and .cse17 (<= 88 ULTIMATE.start_main_~k~0) .cse12) (and (<= 13 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse22 .cse21) (and .cse0 .cse1 .cse23 .cse24) (and (<= 57 ULTIMATE.start_main_~k~0) .cse25 .cse3) (and .cse0 .cse1 .cse2 .cse11 (<= 31 ULTIMATE.start_main_~k~0)) (and .cse0 .cse26 .cse1 .cse21) (and .cse27 (<= 21 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse2) (and (<= 35 ULTIMATE.start_main_~k~0) .cse0 .cse20 .cse1 .cse11) (and (<= 92 ULTIMATE.start_main_~k~0) (and .cse28 .cse5)) (and .cse12 .cse3 (<= 58 ULTIMATE.start_main_~k~0)) (and .cse14 .cse0 .cse1 .cse18 (<= 4 ULTIMATE.start_main_~k~0)) (and .cse4 .cse29 .cse3) (and .cse27 .cse0 .cse1 .cse26 .cse19) (and .cse14 (<= 2 ULTIMATE.start_main_~k~0) .cse7 .cse0 .cse1) (and (<= 54 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse3 .cse18) (and .cse14 .cse0 (<= 1 ULTIMATE.start_main_~k~0) .cse1 .cse2) (and .cse16 .cse13 (<= 61 ULTIMATE.start_main_~k~0)) (and .cse27 (<= 29 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse30) (and .cse10 .cse0 .cse1 .cse19 .cse8) (and .cse0 .cse1 (<= 66 ULTIMATE.start_main_~k~0) .cse13 .cse15) (and .cse17 .cse31 (<= 89 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse15 (<= 46 ULTIMATE.start_main_~k~0) .cse8) (and .cse0 .cse32 .cse1 (<= 18 ULTIMATE.start_main_~k~0) .cse21) (and (and .cse33 .cse5) (<= 94 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse19 .cse11 .cse34) (and .cse14 .cse0 (<= 5 ULTIMATE.start_main_~k~0) .cse20 .cse1) (and .cse27 (<= 28 ULTIMATE.start_main_~k~0) .cse0 .cse32 .cse1) (and (<= 19 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse21 .cse30) (and .cse0 .cse1 .cse35 .cse3) (and (<= 49 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse30 .cse8) (and .cse4 .cse36 .cse24) (and .cse0 .cse20 .cse1 (<= 45 ULTIMATE.start_main_~k~0) .cse8) (and (<= 78 ULTIMATE.start_main_~k~0) .cse12 .cse24) (and .cse0 (<= 39 ULTIMATE.start_main_~k~0) .cse1 .cse11 .cse30) (and .cse0 .cse1 (<= 43 ULTIMATE.start_main_~k~0) .cse22 .cse8) (and (<= 37 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse11 .cse9) (and .cse27 .cse0 .cse1 .cse34) (and .cse0 .cse1 .cse2 (<= 41 ULTIMATE.start_main_~k~0) .cse8) (and .cse0 .cse1 .cse36 .cse13) (and .cse25 .cse17 (<= 87 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= 74 ULTIMATE.start_main_~k~0) .cse24 .cse18) (and .cse0 .cse20 .cse1 (<= 65 ULTIMATE.start_main_~k~0) .cse13) (and (<= 44 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse18 .cse8) (and .cse25 (<= 67 ULTIMATE.start_main_~k~0) .cse13) (and .cse4 .cse35 .cse13) (and .cse0 .cse1 .cse21 .cse15 (<= 16 ULTIMATE.start_main_~k~0)) (and .cse27 .cse0 (<= 27 ULTIMATE.start_main_~k~0) .cse1 .cse9) (and .cse37 (<= 83 ULTIMATE.start_main_~k~0) .cse17) (and .cse27 (<= 26 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse15) (and (<= 72 ULTIMATE.start_main_~k~0) .cse28 .cse24) (and .cse0 (<= 38 ULTIMATE.start_main_~k~0) .cse32 .cse1 .cse11) (and .cse27 .cse0 .cse20 .cse1 (<= 25 ULTIMATE.start_main_~k~0)) (and .cse7 .cse0 .cse1 (<= 32 ULTIMATE.start_main_~k~0) .cse11) (and .cse0 .cse1 .cse11 (<= 34 ULTIMATE.start_main_~k~0) .cse18) (and (and .cse37 .cse5) (<= 93 ULTIMATE.start_main_~k~0)) (and (<= 76 ULTIMATE.start_main_~k~0) .cse38 .cse24) (and .cse27 .cse7 .cse0 .cse1 (<= 22 ULTIMATE.start_main_~k~0)) (and .cse14 .cse0 .cse1 (<= 9 ULTIMATE.start_main_~k~0) .cse30) (and .cse0 .cse1 .cse22 (<= 73 ULTIMATE.start_main_~k~0) .cse24) (and .cse27 .cse0 .cse1 (<= 23 ULTIMATE.start_main_~k~0) .cse22) (and (<= 77 ULTIMATE.start_main_~k~0) .cse25 .cse24) (and .cse0 .cse1 (<= 63 ULTIMATE.start_main_~k~0) .cse22 .cse13) (and .cse0 .cse32 .cse1 (<= 48 ULTIMATE.start_main_~k~0) .cse8) (and .cse0 .cse20 .cse1 (<= 75 ULTIMATE.start_main_~k~0) .cse24) (and .cse7 .cse0 .cse1 .cse21 (<= 12 ULTIMATE.start_main_~k~0)) (and .cse4 .cse17 .cse23) (and (<= 79 ULTIMATE.start_main_~k~0) .cse31 .cse24) (and (<= 59 ULTIMATE.start_main_~k~0) .cse31 .cse3) (and .cse28 (<= 82 ULTIMATE.start_main_~k~0) .cse17) (and .cse0 (<= 17 ULTIMATE.start_main_~k~0) .cse1 .cse9 .cse21) (and .cse38 .cse17 (<= 86 ULTIMATE.start_main_~k~0)) (and (<= 85 ULTIMATE.start_main_~k~0) .cse17 .cse39) (and .cse0 .cse1 .cse21 (<= 14 ULTIMATE.start_main_~k~0) .cse18) (and .cse27 .cse0 .cse1 .cse18 (<= 24 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse3 (<= 56 ULTIMATE.start_main_~k~0) .cse15) (and (<= 69 ULTIMATE.start_main_~k~0) .cse31 .cse13) (and .cse14 .cse0 .cse1 .cse40) (and (<= 33 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse22 .cse11) (and .cse14 .cse0 .cse32 .cse1 (<= 8 ULTIMATE.start_main_~k~0)) (and (and .cse39 .cse5) (<= 95 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse11 (<= 36 ULTIMATE.start_main_~k~0) .cse15) (and .cse0 .cse40 .cse1 .cse19 .cse21) (and .cse0 .cse1 (<= 11 ULTIMATE.start_main_~k~0) .cse2 .cse21) (and .cse0 .cse1 .cse29 .cse8) (and (and .cse31 .cse5) (<= 99 ULTIMATE.start_main_~k~0)) (and (<= 96 ULTIMATE.start_main_~k~0) (and .cse38 .cse5)) (and (<= 97 ULTIMATE.start_main_~k~0) (and .cse25 .cse5)) (and .cse14 .cse0 .cse1 (<= 7 ULTIMATE.start_main_~k~0) .cse9) (and .cse0 .cse1 .cse17 .cse6) (and .cse0 .cse20 .cse1 .cse3 (<= 55 ULTIMATE.start_main_~k~0)) (and .cse16 .cse24 (<= 71 ULTIMATE.start_main_~k~0)) (and .cse17 (<= 84 ULTIMATE.start_main_~k~0) .cse33) (and .cse7 .cse0 .cse1 (<= 52 ULTIMATE.start_main_~k~0) .cse3) (and (<= 53 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse22 .cse3)))) [2019-01-12 11:29:32,682 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:29:32,683 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:29:32,683 INFO L444 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: (<= 10 ULTIMATE.start_main_~n~0) [2019-01-12 11:29:32,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:29:32 BoogieIcfgContainer [2019-01-12 11:29:32,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:29:32,740 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:29:32,740 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:29:32,740 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:29:32,741 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:27:00" (3/4) ... [2019-01-12 11:29:32,745 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:29:32,757 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 11:29:32,758 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:29:32,812 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:29:32,812 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:29:32,813 INFO L168 Benchmark]: Toolchain (without parser) took 153189.58 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 946.0 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-12 11:29:32,815 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:29:32,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.01 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:29:32,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.43 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:29:32,817 INFO L168 Benchmark]: Boogie Preprocessor took 16.51 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:29:32,817 INFO L168 Benchmark]: RCFGBuilder took 337.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-12 11:29:32,818 INFO L168 Benchmark]: TraceAbstraction took 152511.69 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: -2.6 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-01-12 11:29:32,819 INFO L168 Benchmark]: Witness Printer took 72.23 ms. Allocated memory is still 5.0 GB. Free memory is still 3.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:29:32,825 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 214.01 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.43 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.51 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 337.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 152511.69 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: -2.6 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 72.23 ms. Allocated memory is still 5.0 GB. Free memory is still 3.8 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((10 <= n && 10 <= m) && 51 <= k) && j <= 1) && i <= 5) || ((((10 <= n && 10 <= m) && j <= 0) && i + 1 <= n) && 90 <= k)) || ((((42 <= k && j <= 2) && 10 <= n) && 10 <= m) && i <= 4)) || ((((47 <= k && 10 <= n) && 10 <= m) && j <= 7) && i <= 4)) || (((40 <= k && 10 <= n) && 10 <= m) && i <= 3)) || ((68 <= k && (10 <= n && j <= 8) && 10 <= m) && i <= 6)) || (((10 <= n && 10 <= m) && i + 1 <= n) && 100 <= k)) || ((((i <= 0 && 10 <= n) && 6 <= k) && 10 <= m) && j <= 6)) || ((((10 <= n && 10 <= m) && j <= 1) && i + 1 <= n) && 91 <= k)) || ((((10 <= n && 10 <= m) && j <= 1) && i <= 8) && 81 <= k)) || ((((10 <= n && 10 <= m) && 64 <= k) && i <= 6) && j <= 4)) || ((((i <= 0 && 0 <= k) && 10 <= n) && 10 <= m) && j <= 0)) || ((((10 <= n && j <= 5) && 10 <= m) && 15 <= k) && i <= 1)) || ((((10 <= n && j <= 8) && 10 <= m) && i + 1 <= n) && 98 <= k)) || ((((i <= 0 && 10 <= n) && 10 <= m) && j <= 3) && 3 <= k)) || ((((j <= 2 && 10 <= n) && 10 <= m) && i <= 6) && 62 <= k)) || ((i <= 8 && 88 <= k) && (10 <= n && j <= 8) && 10 <= m)) || ((((13 <= k && 10 <= n) && 10 <= m) && j <= 3) && i <= 1)) || (((10 <= n && 10 <= m) && 80 <= k) && i <= 7)) || ((57 <= k && (10 <= n && 10 <= m) && j <= 7) && i <= 5)) || ((((10 <= n && 10 <= m) && j <= 1) && i <= 3) && 31 <= k)) || (((10 <= n && 20 <= k) && 10 <= m) && i <= 1)) || ((((i <= 2 && 21 <= k) && 10 <= n) && 10 <= m) && j <= 1)) || ((((35 <= k && 10 <= n) && j <= 5) && 10 <= m) && i <= 3)) || (92 <= k && ((j <= 2 && 10 <= n) && 10 <= m) && i + 1 <= n)) || ((((10 <= n && j <= 8) && 10 <= m) && i <= 5) && 58 <= k)) || ((((i <= 0 && 10 <= n) && 10 <= m) && j <= 4) && 4 <= k)) || ((((10 <= n && 10 <= m) && j <= 0) && 50 <= k) && i <= 5)) || ((((i <= 2 && 10 <= n) && 10 <= m) && 20 <= k) && j <= 0)) || ((((i <= 0 && 2 <= k) && j <= 2) && 10 <= n) && 10 <= m)) || ((((54 <= k && 10 <= n) && 10 <= m) && i <= 5) && j <= 4)) || ((((i <= 0 && 10 <= n) && 1 <= k) && 10 <= m) && j <= 1)) || ((((10 <= n && 10 <= m) && j <= 1) && i <= 6) && 61 <= k)) || ((((i <= 2 && 29 <= k) && 10 <= n) && 10 <= m) && j <= 9)) || ((((40 <= k && 10 <= n) && 10 <= m) && j <= 0) && i <= 4)) || ((((10 <= n && 10 <= m) && 66 <= k) && i <= 6) && j <= 6)) || ((i <= 8 && (10 <= n && 10 <= m) && j <= 9) && 89 <= k)) || ((((10 <= n && 10 <= m) && j <= 6) && 46 <= k) && i <= 4)) || ((((10 <= n && j <= 8) && 10 <= m) && 18 <= k) && i <= 1)) || ((((10 <= n && 10 <= m) && j <= 4) && i + 1 <= n) && 94 <= k)) || ((((10 <= n && 10 <= m) && j <= 0) && i <= 3) && 30 <= k)) || ((((i <= 0 && 10 <= n) && 5 <= k) && j <= 5) && 10 <= m)) || ((((i <= 2 && 28 <= k) && 10 <= n) && j <= 8) && 10 <= m)) || ((((19 <= k && 10 <= n) && 10 <= m) && i <= 1) && j <= 9)) || (((10 <= n && 10 <= m) && 60 <= k) && i <= 5)) || ((((49 <= k && 10 <= n) && 10 <= m) && j <= 9) && i <= 4)) || ((((10 <= n && 10 <= m) && j <= 0) && 70 <= k) && i <= 7)) || ((((10 <= n && j <= 5) && 10 <= m) && 45 <= k) && i <= 4)) || ((78 <= k && (10 <= n && j <= 8) && 10 <= m) && i <= 7)) || ((((10 <= n && 39 <= k) && 10 <= m) && i <= 3) && j <= 9)) || ((((10 <= n && 10 <= m) && 43 <= k) && j <= 3) && i <= 4)) || ((((37 <= k && 10 <= n) && 10 <= m) && i <= 3) && j <= 7)) || (((i <= 2 && 10 <= n) && 10 <= m) && 30 <= k)) || ((((10 <= n && 10 <= m) && j <= 1) && 41 <= k) && i <= 4)) || (((10 <= n && 10 <= m) && 70 <= k) && i <= 6)) || ((((10 <= n && 10 <= m) && j <= 7) && i <= 8) && 87 <= k)) || ((((10 <= n && 10 <= m) && 74 <= k) && i <= 7) && j <= 4)) || ((((10 <= n && j <= 5) && 10 <= m) && 65 <= k) && i <= 6)) || ((((44 <= k && 10 <= n) && 10 <= m) && j <= 4) && i <= 4)) || ((((10 <= n && 10 <= m) && j <= 7) && 67 <= k) && i <= 6)) || ((((10 <= n && 10 <= m) && j <= 0) && 60 <= k) && i <= 6)) || ((((10 <= n && 10 <= m) && i <= 1) && j <= 6) && 16 <= k)) || ((((i <= 2 && 10 <= n) && 27 <= k) && 10 <= m) && j <= 7)) || ((((10 <= n && 10 <= m) && j <= 3) && 83 <= k) && i <= 8)) || ((((i <= 2 && 26 <= k) && 10 <= n) && 10 <= m) && j <= 6)) || ((72 <= k && (j <= 2 && 10 <= n) && 10 <= m) && i <= 7)) || ((((10 <= n && 38 <= k) && j <= 8) && 10 <= m) && i <= 3)) || ((((i <= 2 && 10 <= n) && j <= 5) && 10 <= m) && 25 <= k)) || ((((j <= 2 && 10 <= n) && 10 <= m) && 32 <= k) && i <= 3)) || ((((10 <= n && 10 <= m) && i <= 3) && 34 <= k) && j <= 4)) || ((((10 <= n && 10 <= m) && j <= 3) && i + 1 <= n) && 93 <= k)) || ((76 <= k && (10 <= n && 10 <= m) && j <= 6) && i <= 7)) || ((((i <= 2 && j <= 2) && 10 <= n) && 10 <= m) && 22 <= k)) || ((((i <= 0 && 10 <= n) && 10 <= m) && 9 <= k) && j <= 9)) || ((((10 <= n && 10 <= m) && j <= 3) && 73 <= k) && i <= 7)) || ((((i <= 2 && 10 <= n) && 10 <= m) && 23 <= k) && j <= 3)) || ((77 <= k && (10 <= n && 10 <= m) && j <= 7) && i <= 7)) || ((((10 <= n && 10 <= m) && 63 <= k) && j <= 3) && i <= 6)) || ((((10 <= n && j <= 8) && 10 <= m) && 48 <= k) && i <= 4)) || ((((10 <= n && j <= 5) && 10 <= m) && 75 <= k) && i <= 7)) || ((((j <= 2 && 10 <= n) && 10 <= m) && i <= 1) && 12 <= k)) || ((((10 <= n && 10 <= m) && j <= 0) && i <= 8) && 80 <= k)) || ((79 <= k && (10 <= n && 10 <= m) && j <= 9) && i <= 7)) || ((59 <= k && (10 <= n && 10 <= m) && j <= 9) && i <= 5)) || ((((j <= 2 && 10 <= n) && 10 <= m) && 82 <= k) && i <= 8)) || ((((10 <= n && 17 <= k) && 10 <= m) && j <= 7) && i <= 1)) || ((((10 <= n && 10 <= m) && j <= 6) && i <= 8) && 86 <= k)) || ((85 <= k && i <= 8) && (10 <= n && j <= 5) && 10 <= m)) || ((((10 <= n && 10 <= m) && i <= 1) && 14 <= k) && j <= 4)) || ((((i <= 2 && 10 <= n) && 10 <= m) && j <= 4) && 24 <= k)) || ((((10 <= n && 10 <= m) && i <= 5) && 56 <= k) && j <= 6)) || ((69 <= k && (10 <= n && 10 <= m) && j <= 9) && i <= 6)) || (((i <= 0 && 10 <= n) && 10 <= m) && 10 <= k)) || ((((33 <= k && 10 <= n) && 10 <= m) && j <= 3) && i <= 3)) || ((((i <= 0 && 10 <= n) && j <= 8) && 10 <= m) && 8 <= k)) || ((((10 <= n && j <= 5) && 10 <= m) && i + 1 <= n) && 95 <= k)) || ((((10 <= n && 10 <= m) && i <= 3) && 36 <= k) && j <= 6)) || ((((10 <= n && 10 <= k) && 10 <= m) && j <= 0) && i <= 1)) || ((((10 <= n && 10 <= m) && 11 <= k) && j <= 1) && i <= 1)) || (((10 <= n && 10 <= m) && 50 <= k) && i <= 4)) || ((((10 <= n && 10 <= m) && j <= 9) && i + 1 <= n) && 99 <= k)) || (96 <= k && ((10 <= n && 10 <= m) && j <= 6) && i + 1 <= n)) || (97 <= k && ((10 <= n && 10 <= m) && j <= 7) && i + 1 <= n)) || ((((i <= 0 && 10 <= n) && 10 <= m) && 7 <= k) && j <= 7)) || (((10 <= n && 10 <= m) && i <= 8) && 90 <= k)) || ((((10 <= n && j <= 5) && 10 <= m) && i <= 5) && 55 <= k)) || ((((10 <= n && 10 <= m) && j <= 1) && i <= 7) && 71 <= k)) || ((i <= 8 && 84 <= k) && (10 <= n && 10 <= m) && j <= 4)) || ((((j <= 2 && 10 <= n) && 10 <= m) && 52 <= k) && i <= 5)) || ((((53 <= k && 10 <= n) && 10 <= m) && j <= 3) && i <= 5) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: 10 <= n - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((10 <= n && 10 <= m) && 60 <= k) && i <= 6) || (((i <= 9 && 10 <= n) && 10 <= m) && 90 <= k)) || (((10 <= n && 70 <= k) && 10 <= m) && i <= 7)) || (((10 <= n && 10 <= m) && i <= 8) && 80 <= k)) || (((10 <= n && 10 <= m) && 50 <= k) && i <= 5)) || (((10 <= n && 10 <= m) && i <= 3) && 30 <= k)) || (((i <= 2 && 10 <= n) && 20 <= k) && 10 <= m)) || (((40 <= k && 10 <= n) && 10 <= m) && i <= 4)) || ((10 <= n && 10 <= m) && 100 <= k)) || (((i <= 0 && 0 <= k) && 10 <= n) && 10 <= m)) || (((10 <= n && 10 <= m) && 10 <= k) && i <= 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 152.3s OverallTime, 19 OverallIterations, 100 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 128.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 542 SDtfs, 1246 SDslu, 1439 SDs, 0 SdLazy, 1028 SolverSat, 262 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1646 GetRequests, 1270 SyntacticMatches, 0 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred 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, 206 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 5123 NumberOfFragments, 1945 HoareAnnotationTreeSize, 4 FomulaSimplifications, 6358835 FormulaSimplificationTreeSizeReduction, 63.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 52642 FormulaSimplificationTreeSizeReductionInter, 65.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 2950 NumberOfCodeBlocks, 2899 NumberOfCodeBlocksAsserted, 223 NumberOfCheckSat, 2915 ConstructedInterpolants, 0 QuantifiedInterpolants, 2127589 SizeOfPredicates, 32 NumberOfNonLiveVariables, 3290 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 35 InterpolantComputations, 3 PerfectInterpolantSequences, 23423/77196 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...