java -Xmx8000000000 -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 ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label23_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:26:08,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:26:08,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:26:08,385 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:26:08,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:26:08,387 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:26:08,388 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:26:08,390 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:26:08,391 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:26:08,392 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:26:08,393 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:26:08,394 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:26:08,394 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:26:08,395 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:26:08,397 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:26:08,397 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:26:08,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:26:08,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:26:08,402 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:26:08,404 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:26:08,405 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:26:08,406 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:26:08,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:26:08,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:26:08,409 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:26:08,409 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:26:08,410 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:26:08,411 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:26:08,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:26:08,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:26:08,415 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:26:08,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:26:08,416 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:26:08,417 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:26:08,418 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:26:08,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:26:08,419 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:26:08,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:26:08,448 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:26:08,450 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:26:08,451 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:26:08,452 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:26:08,452 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:26:08,452 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:26:08,453 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:26:08,453 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:26:08,453 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:26:08,453 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:26:08,453 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:26:08,453 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:26:08,455 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:26:08,455 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:26:08,455 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:26:08,455 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:26:08,456 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:26:08,456 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:26:08,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:26:08,456 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:26:08,456 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:26:08,457 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:26:08,458 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:26:08,458 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:26:08,458 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:26:08,459 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:26:08,459 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:26:08,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:26:08,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:26:08,552 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:26:08,553 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:26:08,554 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:26:08,554 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label23_true-unreach-call_false-termination.c [2018-11-06 21:26:08,618 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf432886/e6cc4154139f4fb184f5af27a347f15e/FLAG599cfee81 [2018-11-06 21:26:09,175 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:26:09,176 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label23_true-unreach-call_false-termination.c [2018-11-06 21:26:09,195 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf432886/e6cc4154139f4fb184f5af27a347f15e/FLAG599cfee81 [2018-11-06 21:26:09,211 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf432886/e6cc4154139f4fb184f5af27a347f15e [2018-11-06 21:26:09,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:26:09,223 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:26:09,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:26:09,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:26:09,228 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:26:09,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:26:09" (1/1) ... [2018-11-06 21:26:09,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112b05b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:26:09, skipping insertion in model container [2018-11-06 21:26:09,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:26:09" (1/1) ... [2018-11-06 21:26:09,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:26:09,306 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:26:09,820 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:26:09,828 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:26:10,003 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:26:10,021 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:26:10,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:26:10 WrapperNode [2018-11-06 21:26:10,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:26:10,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:26:10,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:26:10,024 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:26:10,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:26:10" (1/1) ... [2018-11-06 21:26:10,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:26:10" (1/1) ... [2018-11-06 21:26:10,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:26:10,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:26:10,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:26:10,280 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:26:10,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:26:10" (1/1) ... [2018-11-06 21:26:10,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:26:10" (1/1) ... [2018-11-06 21:26:10,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:26:10" (1/1) ... [2018-11-06 21:26:10,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:26:10" (1/1) ... [2018-11-06 21:26:10,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:26:10" (1/1) ... [2018-11-06 21:26:10,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:26:10" (1/1) ... [2018-11-06 21:26:10,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:26:10" (1/1) ... [2018-11-06 21:26:10,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:26:10,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:26:10,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:26:10,416 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:26:10,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:26:10" (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 [2018-11-06 21:26:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:26:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:26:10,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:26:14,596 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:26:14,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:26:14 BoogieIcfgContainer [2018-11-06 21:26:14,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:26:14,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:26:14,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:26:14,602 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:26:14,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:26:09" (1/3) ... [2018-11-06 21:26:14,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3897b89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:26:14, skipping insertion in model container [2018-11-06 21:26:14,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:26:10" (2/3) ... [2018-11-06 21:26:14,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3897b89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:26:14, skipping insertion in model container [2018-11-06 21:26:14,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:26:14" (3/3) ... [2018-11-06 21:26:14,607 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label23_true-unreach-call_false-termination.c [2018-11-06 21:26:14,617 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:26:14,626 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:26:14,644 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:26:14,682 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:26:14,683 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:26:14,683 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:26:14,683 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:26:14,683 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:26:14,684 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:26:14,684 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:26:14,684 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:26:14,684 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:26:14,709 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2018-11-06 21:26:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-06 21:26:14,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:14,720 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:26:14,723 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:14,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:14,730 INFO L82 PathProgramCache]: Analyzing trace with hash 575043410, now seen corresponding path program 1 times [2018-11-06 21:26:14,732 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:14,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:14,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:14,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:14,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:26:15,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:26:15,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:26:15,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:26:15,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:26:15,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:26:15,210 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2018-11-06 21:26:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:26:18,626 INFO L93 Difference]: Finished difference Result 854 states and 1562 transitions. [2018-11-06 21:26:18,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:26:18,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-06 21:26:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:26:18,651 INFO L225 Difference]: With dead ends: 854 [2018-11-06 21:26:18,651 INFO L226 Difference]: Without dead ends: 601 [2018-11-06 21:26:18,657 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:26:18,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-11-06 21:26:18,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2018-11-06 21:26:18,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-11-06 21:26:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1045 transitions. [2018-11-06 21:26:18,746 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1045 transitions. Word has length 33 [2018-11-06 21:26:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:26:18,747 INFO L480 AbstractCegarLoop]: Abstraction has 601 states and 1045 transitions. [2018-11-06 21:26:18,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:26:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1045 transitions. [2018-11-06 21:26:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-06 21:26:18,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:18,752 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:26:18,752 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:18,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:18,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2032441875, now seen corresponding path program 1 times [2018-11-06 21:26:18,753 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:18,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:18,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:18,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:18,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:19,056 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 21:26:19,086 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:26:19,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:26:19,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:26:19,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:26:19,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:26:19,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:26:19,091 INFO L87 Difference]: Start difference. First operand 601 states and 1045 transitions. Second operand 4 states. [2018-11-06 21:26:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:26:21,458 INFO L93 Difference]: Finished difference Result 1379 states and 2382 transitions. [2018-11-06 21:26:21,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:26:21,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-11-06 21:26:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:26:21,465 INFO L225 Difference]: With dead ends: 1379 [2018-11-06 21:26:21,465 INFO L226 Difference]: Without dead ends: 780 [2018-11-06 21:26:21,468 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:26:21,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-11-06 21:26:21,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2018-11-06 21:26:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-11-06 21:26:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1189 transitions. [2018-11-06 21:26:21,502 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1189 transitions. Word has length 104 [2018-11-06 21:26:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:26:21,502 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 1189 transitions. [2018-11-06 21:26:21,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:26:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1189 transitions. [2018-11-06 21:26:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-06 21:26:21,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:21,511 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:26:21,512 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:21,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:21,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2057496071, now seen corresponding path program 1 times [2018-11-06 21:26:21,512 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:21,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:21,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:21,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:21,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-06 21:26:21,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:26:21,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:26:21,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:26:21,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:26:21,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:26:21,770 INFO L87 Difference]: Start difference. First operand 780 states and 1189 transitions. Second operand 4 states. [2018-11-06 21:26:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:26:25,093 INFO L93 Difference]: Finished difference Result 2643 states and 4039 transitions. [2018-11-06 21:26:25,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:26:25,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-11-06 21:26:25,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:26:25,108 INFO L225 Difference]: With dead ends: 2643 [2018-11-06 21:26:25,108 INFO L226 Difference]: Without dead ends: 1865 [2018-11-06 21:26:25,111 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:26:25,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2018-11-06 21:26:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1865. [2018-11-06 21:26:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1865 states. [2018-11-06 21:26:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2568 transitions. [2018-11-06 21:26:25,154 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2568 transitions. Word has length 179 [2018-11-06 21:26:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:26:25,154 INFO L480 AbstractCegarLoop]: Abstraction has 1865 states and 2568 transitions. [2018-11-06 21:26:25,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:26:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2568 transitions. [2018-11-06 21:26:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-06 21:26:25,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:25,163 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:26:25,163 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:25,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:25,164 INFO L82 PathProgramCache]: Analyzing trace with hash -659484655, now seen corresponding path program 1 times [2018-11-06 21:26:25,164 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:25,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:25,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:25,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:25,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:26:25,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:26:25,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:26:25,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:26:25,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:26:25,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:26:25,511 INFO L87 Difference]: Start difference. First operand 1865 states and 2568 transitions. Second operand 7 states. [2018-11-06 21:26:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:26:30,595 INFO L93 Difference]: Finished difference Result 4874 states and 6712 transitions. [2018-11-06 21:26:30,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:26:30,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 183 [2018-11-06 21:26:30,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:26:30,608 INFO L225 Difference]: With dead ends: 4874 [2018-11-06 21:26:30,609 INFO L226 Difference]: Without dead ends: 2039 [2018-11-06 21:26:30,613 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:26:30,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2018-11-06 21:26:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 1860. [2018-11-06 21:26:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2018-11-06 21:26:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 2176 transitions. [2018-11-06 21:26:30,654 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 2176 transitions. Word has length 183 [2018-11-06 21:26:30,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:26:30,655 INFO L480 AbstractCegarLoop]: Abstraction has 1860 states and 2176 transitions. [2018-11-06 21:26:30,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:26:30,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2176 transitions. [2018-11-06 21:26:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-11-06 21:26:30,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:30,667 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:26:30,668 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:30,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:30,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1939534344, now seen corresponding path program 1 times [2018-11-06 21:26:30,668 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:30,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:30,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:30,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:30,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:31,057 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 21:26:31,474 WARN L179 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2018-11-06 21:26:31,651 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2018-11-06 21:26:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-11-06 21:26:31,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:26:31,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:26:31,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:26:31,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:26:31,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:26:31,918 INFO L87 Difference]: Start difference. First operand 1860 states and 2176 transitions. Second operand 6 states. [2018-11-06 21:26:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:26:34,483 INFO L93 Difference]: Finished difference Result 3936 states and 4572 transitions. [2018-11-06 21:26:34,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:26:34,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 410 [2018-11-06 21:26:34,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:26:34,493 INFO L225 Difference]: With dead ends: 3936 [2018-11-06 21:26:34,493 INFO L226 Difference]: Without dead ends: 2078 [2018-11-06 21:26:34,496 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:26:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2018-11-06 21:26:34,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2039. [2018-11-06 21:26:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2018-11-06 21:26:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2356 transitions. [2018-11-06 21:26:34,533 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2356 transitions. Word has length 410 [2018-11-06 21:26:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:26:34,534 INFO L480 AbstractCegarLoop]: Abstraction has 2039 states and 2356 transitions. [2018-11-06 21:26:34,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:26:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2356 transitions. [2018-11-06 21:26:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-11-06 21:26:34,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:34,547 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:26:34,547 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:34,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:34,548 INFO L82 PathProgramCache]: Analyzing trace with hash -441096333, now seen corresponding path program 1 times [2018-11-06 21:26:34,548 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:34,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:34,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:34,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:34,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:34,883 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-06 21:26:35,042 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-06 21:26:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 498 proven. 46 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-11-06 21:26:35,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:26:35,712 INFO L225 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 [2018-11-06 21:26:35,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:35,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:26:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 521 proven. 23 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-11-06 21:26:36,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:26:36,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-06 21:26:36,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:26:36,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:26:36,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:26:36,561 INFO L87 Difference]: Start difference. First operand 2039 states and 2356 transitions. Second operand 9 states. [2018-11-06 21:26:41,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:26:41,166 INFO L93 Difference]: Finished difference Result 4661 states and 5318 transitions. [2018-11-06 21:26:41,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 21:26:41,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 517 [2018-11-06 21:26:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:26:41,186 INFO L225 Difference]: With dead ends: 4661 [2018-11-06 21:26:41,186 INFO L226 Difference]: Without dead ends: 2803 [2018-11-06 21:26:41,189 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 515 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:26:41,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2018-11-06 21:26:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 2217. [2018-11-06 21:26:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2018-11-06 21:26:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 2534 transitions. [2018-11-06 21:26:41,246 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 2534 transitions. Word has length 517 [2018-11-06 21:26:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:26:41,247 INFO L480 AbstractCegarLoop]: Abstraction has 2217 states and 2534 transitions. [2018-11-06 21:26:41,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:26:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 2534 transitions. [2018-11-06 21:26:41,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2018-11-06 21:26:41,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:41,255 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:26:41,255 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:41,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:41,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1336256806, now seen corresponding path program 1 times [2018-11-06 21:26:41,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:41,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:41,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:41,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:41,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:41,903 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-11-06 21:26:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 858 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-11-06 21:26:42,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:26:42,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:26:42,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:26:42,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:26:42,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:26:42,200 INFO L87 Difference]: Start difference. First operand 2217 states and 2534 transitions. Second operand 4 states. [2018-11-06 21:26:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:26:43,937 INFO L93 Difference]: Finished difference Result 7117 states and 8342 transitions. [2018-11-06 21:26:43,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:26:43,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 623 [2018-11-06 21:26:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:26:43,960 INFO L225 Difference]: With dead ends: 7117 [2018-11-06 21:26:43,960 INFO L226 Difference]: Without dead ends: 5081 [2018-11-06 21:26:43,964 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:26:43,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2018-11-06 21:26:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 5081. [2018-11-06 21:26:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5081 states. [2018-11-06 21:26:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5081 states to 5081 states and 5657 transitions. [2018-11-06 21:26:44,058 INFO L78 Accepts]: Start accepts. Automaton has 5081 states and 5657 transitions. Word has length 623 [2018-11-06 21:26:44,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:26:44,059 INFO L480 AbstractCegarLoop]: Abstraction has 5081 states and 5657 transitions. [2018-11-06 21:26:44,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:26:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 5657 transitions. [2018-11-06 21:26:44,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2018-11-06 21:26:44,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:44,068 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:26:44,068 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:44,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:44,069 INFO L82 PathProgramCache]: Analyzing trace with hash 246335204, now seen corresponding path program 1 times [2018-11-06 21:26:44,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:44,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:44,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:44,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:44,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 1160 proven. 156 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2018-11-06 21:26:45,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:26:45,255 INFO L225 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 [2018-11-06 21:26:45,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:45,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:26:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 1479 trivial. 0 not checked. [2018-11-06 21:26:45,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:26:45,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-06 21:26:45,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:26:45,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:26:45,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:26:45,979 INFO L87 Difference]: Start difference. First operand 5081 states and 5657 transitions. Second operand 6 states. [2018-11-06 21:26:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:26:52,133 INFO L93 Difference]: Finished difference Result 13928 states and 15907 transitions. [2018-11-06 21:26:52,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 21:26:52,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 763 [2018-11-06 21:26:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:26:52,167 INFO L225 Difference]: With dead ends: 13928 [2018-11-06 21:26:52,167 INFO L226 Difference]: Without dead ends: 8848 [2018-11-06 21:26:52,175 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 774 GetRequests, 767 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:26:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8848 states. [2018-11-06 21:26:52,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8848 to 7403. [2018-11-06 21:26:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7403 states. [2018-11-06 21:26:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7403 states to 7403 states and 8155 transitions. [2018-11-06 21:26:52,317 INFO L78 Accepts]: Start accepts. Automaton has 7403 states and 8155 transitions. Word has length 763 [2018-11-06 21:26:52,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:26:52,318 INFO L480 AbstractCegarLoop]: Abstraction has 7403 states and 8155 transitions. [2018-11-06 21:26:52,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:26:52,318 INFO L276 IsEmpty]: Start isEmpty. Operand 7403 states and 8155 transitions. [2018-11-06 21:26:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2018-11-06 21:26:52,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:52,334 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:26:52,335 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:52,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:52,335 INFO L82 PathProgramCache]: Analyzing trace with hash -127241302, now seen corresponding path program 1 times [2018-11-06 21:26:52,336 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:52,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:52,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:54,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2708 backedges. 1621 proven. 0 refuted. 0 times theorem prover too weak. 1087 trivial. 0 not checked. [2018-11-06 21:26:54,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:26:54,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:26:54,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:26:54,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:26:54,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:26:54,028 INFO L87 Difference]: Start difference. First operand 7403 states and 8155 transitions. Second operand 6 states. [2018-11-06 21:26:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:26:56,306 INFO L93 Difference]: Finished difference Result 16777 states and 18516 transitions. [2018-11-06 21:26:56,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 21:26:56,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 895 [2018-11-06 21:26:56,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:26:56,342 INFO L225 Difference]: With dead ends: 16777 [2018-11-06 21:26:56,342 INFO L226 Difference]: Without dead ends: 9555 [2018-11-06 21:26:56,350 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:26:56,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9555 states. [2018-11-06 21:26:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9555 to 7582. [2018-11-06 21:26:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7582 states. [2018-11-06 21:26:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7582 states to 7582 states and 8277 transitions. [2018-11-06 21:26:56,473 INFO L78 Accepts]: Start accepts. Automaton has 7582 states and 8277 transitions. Word has length 895 [2018-11-06 21:26:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:26:56,475 INFO L480 AbstractCegarLoop]: Abstraction has 7582 states and 8277 transitions. [2018-11-06 21:26:56,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:26:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 7582 states and 8277 transitions. [2018-11-06 21:26:56,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 929 [2018-11-06 21:26:56,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:56,490 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:26:56,490 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:56,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:56,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1687156824, now seen corresponding path program 1 times [2018-11-06 21:26:56,491 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:56,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:56,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:56,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:56,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 1796 proven. 0 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2018-11-06 21:26:57,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:26:57,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:26:57,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:26:57,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:26:57,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:26:57,544 INFO L87 Difference]: Start difference. First operand 7582 states and 8277 transitions. Second operand 4 states. [2018-11-06 21:26:59,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:26:59,200 INFO L93 Difference]: Finished difference Result 16594 states and 18219 transitions. [2018-11-06 21:26:59,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:26:59,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 928 [2018-11-06 21:26:59,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:26:59,220 INFO L225 Difference]: With dead ends: 16594 [2018-11-06 21:26:59,220 INFO L226 Difference]: Without dead ends: 9193 [2018-11-06 21:26:59,227 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:26:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9193 states. [2018-11-06 21:26:59,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9193 to 9193. [2018-11-06 21:26:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9193 states. [2018-11-06 21:26:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9193 states to 9193 states and 9899 transitions. [2018-11-06 21:26:59,342 INFO L78 Accepts]: Start accepts. Automaton has 9193 states and 9899 transitions. Word has length 928 [2018-11-06 21:26:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:26:59,343 INFO L480 AbstractCegarLoop]: Abstraction has 9193 states and 9899 transitions. [2018-11-06 21:26:59,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:26:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 9193 states and 9899 transitions. [2018-11-06 21:26:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1025 [2018-11-06 21:26:59,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:59,359 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:26:59,360 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:59,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:59,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1348324996, now seen corresponding path program 1 times [2018-11-06 21:26:59,360 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:59,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:59,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:59,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:59,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3442 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 2534 trivial. 0 not checked. [2018-11-06 21:27:00,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:27:00,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:27:00,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:27:00,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:27:00,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:27:00,852 INFO L87 Difference]: Start difference. First operand 9193 states and 9899 transitions. Second operand 7 states. [2018-11-06 21:27:02,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:27:02,750 INFO L93 Difference]: Finished difference Result 18967 states and 20502 transitions. [2018-11-06 21:27:02,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:27:02,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1024 [2018-11-06 21:27:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:27:02,771 INFO L225 Difference]: With dead ends: 18967 [2018-11-06 21:27:02,771 INFO L226 Difference]: Without dead ends: 9189 [2018-11-06 21:27:02,780 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:27:02,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9189 states. [2018-11-06 21:27:02,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9189 to 9189. [2018-11-06 21:27:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9189 states. [2018-11-06 21:27:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9189 states to 9189 states and 9876 transitions. [2018-11-06 21:27:02,884 INFO L78 Accepts]: Start accepts. Automaton has 9189 states and 9876 transitions. Word has length 1024 [2018-11-06 21:27:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:27:02,885 INFO L480 AbstractCegarLoop]: Abstraction has 9189 states and 9876 transitions. [2018-11-06 21:27:02,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:27:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 9189 states and 9876 transitions. [2018-11-06 21:27:02,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1066 [2018-11-06 21:27:02,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:27:02,904 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:27:02,904 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:27:02,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:27:02,905 INFO L82 PathProgramCache]: Analyzing trace with hash -380960909, now seen corresponding path program 1 times [2018-11-06 21:27:02,905 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:27:02,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:27:02,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:02,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:02,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3602 backedges. 1626 proven. 7 refuted. 0 times theorem prover too weak. 1969 trivial. 0 not checked. [2018-11-06 21:27:04,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:27:04,220 INFO L225 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 [2018-11-06 21:27:04,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:04,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:27:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3602 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 2694 trivial. 0 not checked. [2018-11-06 21:27:05,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:27:05,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 21:27:05,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:27:05,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:27:05,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:27:05,732 INFO L87 Difference]: Start difference. First operand 9189 states and 9876 transitions. Second operand 7 states. [2018-11-06 21:27:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:27:08,664 INFO L93 Difference]: Finished difference Result 20165 states and 21650 transitions. [2018-11-06 21:27:08,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:27:08,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1065 [2018-11-06 21:27:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:27:08,679 INFO L225 Difference]: With dead ends: 20165 [2018-11-06 21:27:08,680 INFO L226 Difference]: Without dead ends: 11157 [2018-11-06 21:27:08,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1082 GetRequests, 1069 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:27:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11157 states. [2018-11-06 21:27:08,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11157 to 11157. [2018-11-06 21:27:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11157 states. [2018-11-06 21:27:08,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11157 states to 11157 states and 11801 transitions. [2018-11-06 21:27:08,846 INFO L78 Accepts]: Start accepts. Automaton has 11157 states and 11801 transitions. Word has length 1065 [2018-11-06 21:27:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:27:08,847 INFO L480 AbstractCegarLoop]: Abstraction has 11157 states and 11801 transitions. [2018-11-06 21:27:08,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:27:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 11157 states and 11801 transitions. [2018-11-06 21:27:08,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1119 [2018-11-06 21:27:08,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:27:08,871 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:27:08,872 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:27:08,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:27:08,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1713622009, now seen corresponding path program 1 times [2018-11-06 21:27:08,872 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:27:08,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:27:08,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:08,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:08,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3704 backedges. 2355 proven. 0 refuted. 0 times theorem prover too weak. 1349 trivial. 0 not checked. [2018-11-06 21:27:10,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:27:10,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:27:10,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:27:10,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:27:10,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:27:10,432 INFO L87 Difference]: Start difference. First operand 11157 states and 11801 transitions. Second operand 5 states. [2018-11-06 21:27:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:27:11,921 INFO L93 Difference]: Finished difference Result 23031 states and 24363 transitions. [2018-11-06 21:27:11,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:27:11,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1118 [2018-11-06 21:27:11,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:27:11,935 INFO L225 Difference]: With dead ends: 23031 [2018-11-06 21:27:11,935 INFO L226 Difference]: Without dead ends: 12055 [2018-11-06 21:27:11,946 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:27:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12055 states. [2018-11-06 21:27:12,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12055 to 11695. [2018-11-06 21:27:12,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11695 states. [2018-11-06 21:27:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11695 states to 11695 states and 12351 transitions. [2018-11-06 21:27:12,095 INFO L78 Accepts]: Start accepts. Automaton has 11695 states and 12351 transitions. Word has length 1118 [2018-11-06 21:27:12,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:27:12,096 INFO L480 AbstractCegarLoop]: Abstraction has 11695 states and 12351 transitions. [2018-11-06 21:27:12,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:27:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 11695 states and 12351 transitions. [2018-11-06 21:27:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1709 [2018-11-06 21:27:12,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:27:12,135 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:27:12,135 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:27:12,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:27:12,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1248022839, now seen corresponding path program 1 times [2018-11-06 21:27:12,137 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:27:12,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:27:12,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:12,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:12,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9564 backedges. 4708 proven. 0 refuted. 0 times theorem prover too weak. 4856 trivial. 0 not checked. [2018-11-06 21:27:14,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:27:14,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:27:14,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:27:14,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:27:14,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:27:14,239 INFO L87 Difference]: Start difference. First operand 11695 states and 12351 transitions. Second operand 3 states. [2018-11-06 21:27:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:27:15,374 INFO L93 Difference]: Finished difference Result 25536 states and 26960 transitions. [2018-11-06 21:27:15,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:27:15,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1708 [2018-11-06 21:27:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:27:15,390 INFO L225 Difference]: With dead ends: 25536 [2018-11-06 21:27:15,391 INFO L226 Difference]: Without dead ends: 14022 [2018-11-06 21:27:15,402 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:27:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14022 states. [2018-11-06 21:27:15,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14022 to 12583. [2018-11-06 21:27:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12583 states. [2018-11-06 21:27:15,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12583 states to 12583 states and 13265 transitions. [2018-11-06 21:27:15,512 INFO L78 Accepts]: Start accepts. Automaton has 12583 states and 13265 transitions. Word has length 1708 [2018-11-06 21:27:15,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:27:15,513 INFO L480 AbstractCegarLoop]: Abstraction has 12583 states and 13265 transitions. [2018-11-06 21:27:15,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:27:15,513 INFO L276 IsEmpty]: Start isEmpty. Operand 12583 states and 13265 transitions. [2018-11-06 21:27:15,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1773 [2018-11-06 21:27:15,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:27:15,553 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:27:15,553 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:27:15,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:27:15,554 INFO L82 PathProgramCache]: Analyzing trace with hash 194212713, now seen corresponding path program 1 times [2018-11-06 21:27:15,554 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:27:15,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:27:15,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:15,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:16,503 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 21:27:16,735 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:27:17,059 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-06 21:27:17,290 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 21:27:19,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9766 backedges. 1463 proven. 0 refuted. 0 times theorem prover too weak. 8303 trivial. 0 not checked. [2018-11-06 21:27:19,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:27:19,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:27:19,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:27:19,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:27:19,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:27:19,796 INFO L87 Difference]: Start difference. First operand 12583 states and 13265 transitions. Second operand 7 states. [2018-11-06 21:27:21,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:27:21,691 INFO L93 Difference]: Finished difference Result 24542 states and 25895 transitions. [2018-11-06 21:27:21,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:27:21,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1772 [2018-11-06 21:27:21,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:27:21,701 INFO L225 Difference]: With dead ends: 24542 [2018-11-06 21:27:21,701 INFO L226 Difference]: Without dead ends: 11323 [2018-11-06 21:27:21,708 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:27:21,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11323 states. [2018-11-06 21:27:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11323 to 11323. [2018-11-06 21:27:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11323 states. [2018-11-06 21:27:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11323 states to 11323 states and 11871 transitions. [2018-11-06 21:27:21,816 INFO L78 Accepts]: Start accepts. Automaton has 11323 states and 11871 transitions. Word has length 1772 [2018-11-06 21:27:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:27:21,818 INFO L480 AbstractCegarLoop]: Abstraction has 11323 states and 11871 transitions. [2018-11-06 21:27:21,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:27:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 11323 states and 11871 transitions. [2018-11-06 21:27:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1834 [2018-11-06 21:27:21,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:27:21,845 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:27:21,845 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:27:21,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:27:21,846 INFO L82 PathProgramCache]: Analyzing trace with hash -36537091, now seen corresponding path program 1 times [2018-11-06 21:27:21,846 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:27:21,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:27:21,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:21,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:21,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9998 backedges. 4224 proven. 0 refuted. 0 times theorem prover too weak. 5774 trivial. 0 not checked. [2018-11-06 21:27:23,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:27:23,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:27:23,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:27:23,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:27:23,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:27:23,987 INFO L87 Difference]: Start difference. First operand 11323 states and 11871 transitions. Second operand 4 states. [2018-11-06 21:27:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:27:25,054 INFO L93 Difference]: Finished difference Result 22465 states and 23560 transitions. [2018-11-06 21:27:25,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:27:25,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1833 [2018-11-06 21:27:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:27:25,059 INFO L225 Difference]: With dead ends: 22465 [2018-11-06 21:27:25,060 INFO L226 Difference]: Without dead ends: 4663 [2018-11-06 21:27:25,066 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:27:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2018-11-06 21:27:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4663. [2018-11-06 21:27:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2018-11-06 21:27:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 4779 transitions. [2018-11-06 21:27:25,104 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 4779 transitions. Word has length 1833 [2018-11-06 21:27:25,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:27:25,105 INFO L480 AbstractCegarLoop]: Abstraction has 4663 states and 4779 transitions. [2018-11-06 21:27:25,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:27:25,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 4779 transitions. [2018-11-06 21:27:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1906 [2018-11-06 21:27:25,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:27:25,131 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:27:25,131 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:27:25,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:27:25,132 INFO L82 PathProgramCache]: Analyzing trace with hash -689251611, now seen corresponding path program 1 times [2018-11-06 21:27:25,132 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:27:25,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:27:25,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:25,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:25,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:27,194 INFO L134 CoverageAnalysis]: Checked inductivity of 11340 backedges. 1543 proven. 31 refuted. 0 times theorem prover too weak. 9766 trivial. 0 not checked. [2018-11-06 21:27:27,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:27:27,194 INFO L225 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 [2018-11-06 21:27:27,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:27,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:27:27,970 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 13 [2018-11-06 21:27:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 11340 backedges. 4123 proven. 295 refuted. 0 times theorem prover too weak. 6922 trivial. 0 not checked. [2018-11-06 21:27:31,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:27:31,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-06 21:27:31,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:27:31,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:27:31,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:27:31,815 INFO L87 Difference]: Start difference. First operand 4663 states and 4779 transitions. Second operand 7 states. [2018-11-06 21:27:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:27:36,242 INFO L93 Difference]: Finished difference Result 10397 states and 10683 transitions. [2018-11-06 21:27:36,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 21:27:36,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1905 [2018-11-06 21:27:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:27:36,245 INFO L225 Difference]: With dead ends: 10397 [2018-11-06 21:27:36,245 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:27:36,249 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1917 GetRequests, 1906 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:27:36,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:27:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:27:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:27:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:27:36,250 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1905 [2018-11-06 21:27:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:27:36,251 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:27:36,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:27:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:27:36,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:27:36,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:27:36,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,547 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 144 [2018-11-06 21:27:36,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:27:36,840 WARN L179 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 146 [2018-11-06 21:27:41,274 WARN L179 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 122 DAG size of output: 83 [2018-11-06 21:27:42,400 WARN L179 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 125 DAG size of output: 86 [2018-11-06 21:27:42,403 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-06 21:27:42,403 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-06 21:27:42,403 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,403 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,403 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,404 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-06 21:27:42,404 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-06 21:27:42,404 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-06 21:27:42,404 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-06 21:27:42,404 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-06 21:27:42,404 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-06 21:27:42,404 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-06 21:27:42,404 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-06 21:27:42,404 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,404 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,404 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,404 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-06 21:27:42,404 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-06 21:27:42,404 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-06 21:27:42,405 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-06 21:27:42,405 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-06 21:27:42,405 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-06 21:27:42,405 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-06 21:27:42,405 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-06 21:27:42,405 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,405 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,405 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,405 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-06 21:27:42,405 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-06 21:27:42,405 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-06 21:27:42,405 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-06 21:27:42,405 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-06 21:27:42,405 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-06 21:27:42,406 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-06 21:27:42,406 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-06 21:27:42,406 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-06 21:27:42,406 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,406 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,406 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,406 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-06 21:27:42,406 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-06 21:27:42,406 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-06 21:27:42,406 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-06 21:27:42,406 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-06 21:27:42,406 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-06 21:27:42,406 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-06 21:27:42,407 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,407 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,407 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,407 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-06 21:27:42,407 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-06 21:27:42,407 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-06 21:27:42,407 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-06 21:27:42,407 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-06 21:27:42,407 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-06 21:27:42,407 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-06 21:27:42,407 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-06 21:27:42,407 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-06 21:27:42,408 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,408 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,408 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,408 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-06 21:27:42,408 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-06 21:27:42,408 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-06 21:27:42,408 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-06 21:27:42,408 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-06 21:27:42,408 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-06 21:27:42,408 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-06 21:27:42,409 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-06 21:27:42,409 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,409 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,409 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,409 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-06 21:27:42,409 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-06 21:27:42,409 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-06 21:27:42,409 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-06 21:27:42,409 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-06 21:27:42,409 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-06 21:27:42,409 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-06 21:27:42,409 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-06 21:27:42,409 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,410 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,410 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,410 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-06 21:27:42,410 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-06 21:27:42,410 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:27:42,410 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-06 21:27:42,410 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-06 21:27:42,410 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-06 21:27:42,410 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-06 21:27:42,410 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-06 21:27:42,410 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-06 21:27:42,411 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,411 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,411 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,411 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-06 21:27:42,411 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-06 21:27:42,411 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-06 21:27:42,411 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-06 21:27:42,411 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-06 21:27:42,411 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-06 21:27:42,411 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-06 21:27:42,411 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-06 21:27:42,411 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,411 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,412 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,412 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-06 21:27:42,412 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-06 21:27:42,412 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-06 21:27:42,412 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-06 21:27:42,412 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-06 21:27:42,412 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-06 21:27:42,412 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:27:42,412 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-06 21:27:42,412 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-06 21:27:42,412 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,412 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,412 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,412 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-06 21:27:42,412 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-06 21:27:42,413 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-06 21:27:42,414 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-06 21:27:42,415 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-06 21:27:42,415 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-06 21:27:42,415 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-06 21:27:42,415 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,415 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,416 INFO L421 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse3 (= ~a15~0 8)) (.cse18 (= ~a21~0 10)) (.cse12 (= ~a21~0 6)) (.cse6 (= ~a15~0 9)) (.cse23 (+ ~a12~0 43)) (.cse22 (= ~a15~0 5))) (let ((.cse9 (not .cse22)) (.cse15 (<= (+ ~a12~0 49) 0)) (.cse7 (< 80 ~a12~0)) (.cse8 (<= ~a12~0 73282)) (.cse17 (<= .cse23 0)) (.cse11 (<= ~a21~0 6)) (.cse14 (not .cse6)) (.cse2 (not .cse12)) (.cse5 (not .cse18)) (.cse19 (or (<= ~a12~0 80) (and .cse3 .cse18))) (.cse20 (not (= ~a21~0 9))) (.cse10 (not .cse3)) (.cse21 (<= ~a12~0 11)) (.cse1 (<= ~a12~0 76)) (.cse16 (= ~a21~0 8)) (.cse4 (<= 0 (+ ~a12~0 15))) (.cse0 (= ~a24~0 1))) (or (and (= ~a15~0 7) .cse0) (and .cse1 .cse2 .cse3 .cse0 .cse4 .cse5) (and .cse0 .cse6 .cse7) (and .cse8 .cse9 .cse0 .cse10 .cse7 .cse11) (and .cse12 .cse3 .cse0 (exists ((v_prenex_1 Int)) (let ((.cse13 (mod v_prenex_1 299959))) (and (<= (+ .cse13 286349) ~a12~0) (= .cse13 0) (< 80 v_prenex_1))))) (and .cse14 .cse2 .cse9 .cse0 .cse10 .cse5) (and .cse14 .cse10 .cse11 .cse15 (not (= ~a15~0 6))) (and (not (= ULTIMATE.start_calculate_output_~input 5)) .cse0 (= ~a21~0 7) .cse15) (and .cse8 .cse3 .cse0 .cse16 .cse7) (and .cse17 .cse3 .cse0 .cse18) (and .cse14 .cse0 .cse10 .cse4 .cse11 .cse19) (and .cse3 .cse0 .cse18 .cse7) (and .cse20 .cse0 .cse6 .cse21) (and .cse8 .cse0 .cse18 .cse22) (and .cse17 .cse3 .cse0 .cse11) (and .cse14 .cse2 .cse0 .cse10 .cse5 .cse19) (and .cse0 .cse18 .cse21 .cse4) (and .cse20 .cse0 .cse10 .cse21 (< 0 .cse23)) (and .cse1 .cse0 .cse16 .cse4) (and .cse12 .cse0 .cse22)))) [2018-11-06 21:27:42,416 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-06 21:27:42,416 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-06 21:27:42,416 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-06 21:27:42,416 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-06 21:27:42,416 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-06 21:27:42,416 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-06 21:27:42,416 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-06 21:27:42,416 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-06 21:27:42,416 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,416 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,416 INFO L428 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-11-06 21:27:42,416 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-06 21:27:42,416 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-06 21:27:42,417 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-06 21:27:42,417 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-06 21:27:42,417 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-06 21:27:42,417 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-06 21:27:42,417 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-06 21:27:42,417 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,417 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,417 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-06 21:27:42,417 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-06 21:27:42,417 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-06 21:27:42,417 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-06 21:27:42,417 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:27:42,417 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-06 21:27:42,417 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-06 21:27:42,417 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,418 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,418 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-06 21:27:42,418 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,418 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-06 21:27:42,418 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-06 21:27:42,418 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse4 (= ~a15~0 8)) (.cse18 (= ~a21~0 10)) (.cse13 (= ~a21~0 6)) (.cse7 (= ~a15~0 9)) (.cse23 (+ ~a12~0 43)) (.cse22 (= ~a15~0 5))) (let ((.cse10 (not .cse22)) (.cse1 (<= (+ ~a12~0 49) 0)) (.cse8 (< 80 ~a12~0)) (.cse9 (<= ~a12~0 73282)) (.cse17 (<= .cse23 0)) (.cse12 (<= ~a21~0 6)) (.cse15 (not .cse7)) (.cse3 (not .cse13)) (.cse6 (not .cse18)) (.cse19 (or (<= ~a12~0 80) (and .cse4 .cse18))) (.cse20 (not (= ~a21~0 9))) (.cse11 (not .cse4)) (.cse21 (<= ~a12~0 11)) (.cse2 (<= ~a12~0 76)) (.cse16 (= ~a21~0 8)) (.cse5 (<= 0 (+ ~a12~0 15))) (.cse0 (= ~a24~0 1))) (or (and .cse0 (= ~a21~0 7) .cse1) (and (= ~a15~0 7) .cse0) (and .cse2 .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse0 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse8 .cse12) (and .cse13 .cse4 .cse0 (exists ((v_prenex_1 Int)) (let ((.cse14 (mod v_prenex_1 299959))) (and (<= (+ .cse14 286349) ~a12~0) (= .cse14 0) (< 80 v_prenex_1))))) (and .cse15 .cse3 .cse10 .cse0 .cse11 .cse6) (and .cse15 .cse11 .cse12 .cse1 (not (= ~a15~0 6))) (and .cse9 .cse4 .cse0 .cse16 .cse8) (and .cse17 .cse4 .cse0 .cse18) (and .cse15 .cse0 .cse11 .cse5 .cse12 .cse19) (and .cse4 .cse0 .cse18 .cse8) (and .cse20 .cse0 .cse7 .cse21) (and .cse9 .cse0 .cse18 .cse22) (and .cse17 .cse4 .cse0 .cse12) (and .cse15 .cse3 .cse0 .cse11 .cse6 .cse19) (and .cse0 .cse18 .cse21 .cse5) (and .cse20 .cse0 .cse11 .cse21 (< 0 .cse23)) (and .cse2 .cse0 .cse16 .cse5) (and .cse13 .cse0 .cse22)))) [2018-11-06 21:27:42,418 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-06 21:27:42,419 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-06 21:27:42,419 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-06 21:27:42,419 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-06 21:27:42,419 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-06 21:27:42,419 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2018-11-06 21:27:42,419 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-06 21:27:42,419 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-06 21:27:42,419 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-06 21:27:42,419 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-06 21:27:42,419 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,419 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,419 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,419 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-06 21:27:42,419 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:27:42,420 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-06 21:27:42,421 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-06 21:27:42,421 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-06 21:27:42,421 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-06 21:27:42,421 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,421 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,421 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,421 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-06 21:27:42,421 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-06 21:27:42,421 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-06 21:27:42,421 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-06 21:27:42,421 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-06 21:27:42,421 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-06 21:27:42,421 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-06 21:27:42,421 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-06 21:27:42,421 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-06 21:27:42,422 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,422 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,422 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:27:42,422 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-06 21:27:42,422 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-06 21:27:42,422 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-06 21:27:42,422 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-06 21:27:42,422 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-06 21:27:42,431 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,432 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,432 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,452 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,453 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,453 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:27:42 BoogieIcfgContainer [2018-11-06 21:27:42,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:27:42,459 INFO L168 Benchmark]: Toolchain (without parser) took 93236.97 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-11-06 21:27:42,460 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:27:42,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:27:42,461 INFO L168 Benchmark]: Boogie Procedure Inliner took 255.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -853.8 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:27:42,462 INFO L168 Benchmark]: Boogie Preprocessor took 135.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:27:42,463 INFO L168 Benchmark]: RCFGBuilder took 4182.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 133.6 MB). Peak memory consumption was 133.6 MB. Max. memory is 7.1 GB. [2018-11-06 21:27:42,464 INFO L168 Benchmark]: TraceAbstraction took 87859.49 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -984.0 MB). Peak memory consumption was 922.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:27:42,469 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 255.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -853.8 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4182.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 133.6 MB). Peak memory consumption was 133.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87859.49 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -984.0 MB). Peak memory consumption was 922.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 100]: 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: 880]: Loop Invariant [2018-11-06 21:27:42,480 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a24 == 1 && a21 == 7) && a12 + 49 <= 0) || (a15 == 7 && a24 == 1)) || (((((a12 <= 76 && !(a21 == 6)) && a15 == 8) && a24 == 1) && 0 <= a12 + 15) && !(a21 == 10))) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((((a12 <= 73282 && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && 80 < a12) && a21 <= 6)) || (((a21 == 6 && a15 == 8) && a24 == 1) && (\exists v_prenex_1 : int :: (v_prenex_1 % 299959 + 286349 <= a12 && v_prenex_1 % 299959 == 0) && 80 < v_prenex_1))) || (((((!(a15 == 9) && !(a21 == 6)) && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && !(a21 == 10))) || ((((!(a15 == 9) && !(a15 == 8)) && a21 <= 6) && a12 + 49 <= 0) && !(a15 == 6))) || ((((a12 <= 73282 && a15 == 8) && a24 == 1) && a21 == 8) && 80 < a12)) || (((a12 + 43 <= 0 && a15 == 8) && a24 == 1) && a21 == 10)) || (((((!(a15 == 9) && a24 == 1) && !(a15 == 8)) && 0 <= a12 + 15) && a21 <= 6) && (a12 <= 80 || (a15 == 8 && a21 == 10)))) || (((a15 == 8 && a24 == 1) && a21 == 10) && 80 < a12)) || (((!(a21 == 9) && a24 == 1) && a15 == 9) && a12 <= 11)) || (((a12 <= 73282 && a24 == 1) && a21 == 10) && a15 == 5)) || (((a12 + 43 <= 0 && a15 == 8) && a24 == 1) && a21 <= 6)) || (((((!(a15 == 9) && !(a21 == 6)) && a24 == 1) && !(a15 == 8)) && !(a21 == 10)) && (a12 <= 80 || (a15 == 8 && a21 == 10)))) || (((a24 == 1 && a21 == 10) && a12 <= 11) && 0 <= a12 + 15)) || ((((!(a21 == 9) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && 0 < a12 + 43)) || (((a12 <= 76 && a24 == 1) && a21 == 8) && 0 <= a12 + 15)) || ((a21 == 6 && a24 == 1) && a15 == 5) - InvariantResult [Line: 20]: Loop Invariant [2018-11-06 21:27:42,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,488 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,488 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,490 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,490 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-06 21:27:42,491 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((a15 == 7 && a24 == 1) || (((((a12 <= 76 && !(a21 == 6)) && a15 == 8) && a24 == 1) && 0 <= a12 + 15) && !(a21 == 10))) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((((a12 <= 73282 && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && 80 < a12) && a21 <= 6)) || (((a21 == 6 && a15 == 8) && a24 == 1) && (\exists v_prenex_1 : int :: (v_prenex_1 % 299959 + 286349 <= a12 && v_prenex_1 % 299959 == 0) && 80 < v_prenex_1))) || (((((!(a15 == 9) && !(a21 == 6)) && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && !(a21 == 10))) || ((((!(a15 == 9) && !(a15 == 8)) && a21 <= 6) && a12 + 49 <= 0) && !(a15 == 6))) || (((!(input == 5) && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((((a12 <= 73282 && a15 == 8) && a24 == 1) && a21 == 8) && 80 < a12)) || (((a12 + 43 <= 0 && a15 == 8) && a24 == 1) && a21 == 10)) || (((((!(a15 == 9) && a24 == 1) && !(a15 == 8)) && 0 <= a12 + 15) && a21 <= 6) && (a12 <= 80 || (a15 == 8 && a21 == 10)))) || (((a15 == 8 && a24 == 1) && a21 == 10) && 80 < a12)) || (((!(a21 == 9) && a24 == 1) && a15 == 9) && a12 <= 11)) || (((a12 <= 73282 && a24 == 1) && a21 == 10) && a15 == 5)) || (((a12 + 43 <= 0 && a15 == 8) && a24 == 1) && a21 <= 6)) || (((((!(a15 == 9) && !(a21 == 6)) && a24 == 1) && !(a15 == 8)) && !(a21 == 10)) && (a12 <= 80 || (a15 == 8 && a21 == 10)))) || (((a24 == 1 && a21 == 10) && a12 <= 11) && 0 <= a12 + 15)) || ((((!(a21 == 9) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && 0 < a12 + 43)) || (((a12 <= 76 && a24 == 1) && a21 == 8) && 0 <= a12 + 15)) || ((a21 == 6 && a24 == 1) && a15 == 5) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 1 error locations. SAFE Result, 87.7s OverallTime, 17 OverallIterations, 16 TraceHistogramMax, 48.4s AutomataDifference, 0.0s DeadEndRemovalTime, 6.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2105 SDtfs, 10825 SDslu, 1713 SDs, 0 SdLazy, 25103 SolverSat, 3102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4362 GetRequests, 4275 SyntacticMatches, 10 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12583occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 6021 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 176 NumberOfFragments, 713 HoareAnnotationTreeSize, 3 FomulaSimplifications, 22155 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2562 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 19310 NumberOfCodeBlocks, 19310 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 19289 ConstructedInterpolants, 257 QuantifiedInterpolants, 57326128 SizeOfPredicates, 6 NumberOfNonLiveVariables, 5173 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 77709/78267 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...