java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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/Problem01_label09_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:49:51,297 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:49:51,299 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:49:51,312 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:49:51,312 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:49:51,313 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:49:51,315 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:49:51,317 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:49:51,319 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:49:51,320 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:49:51,321 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:49:51,321 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:49:51,322 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:49:51,323 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:49:51,325 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:49:51,326 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:49:51,326 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:49:51,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:49:51,331 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:49:51,332 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:49:51,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:49:51,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:49:51,338 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:49:51,338 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:49:51,338 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:49:51,339 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:49:51,340 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:49:51,341 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:49:51,342 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:49:51,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:49:51,344 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:49:51,344 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:49:51,345 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:49:51,345 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:49:51,346 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:49:51,347 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:49:51,347 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:49:51,373 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:49:51,374 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:49:51,374 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:49:51,381 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:49:51,382 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:49:51,382 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:49:51,382 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:49:51,382 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:49:51,383 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:49:51,383 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:49:51,383 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:49:51,383 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:49:51,383 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:49:51,383 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:49:51,384 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:49:51,385 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:49:51,385 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:49:51,385 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:49:51,385 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:49:51,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:49:51,386 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:49:51,386 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:49:51,386 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:49:51,386 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:49:51,386 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:49:51,386 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:49:51,389 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:49:51,389 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:49:51,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:49:51,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:49:51,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:49:51,467 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:49:51,467 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:49:51,468 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label09_true-unreach-call_false-termination.c [2018-10-24 14:49:51,535 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/aac65fda8/d03133a0f7414502a5aa9d7342fcf4b3/FLAG9fa1ff9cb [2018-10-24 14:49:52,093 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:49:52,094 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label09_true-unreach-call_false-termination.c [2018-10-24 14:49:52,118 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/aac65fda8/d03133a0f7414502a5aa9d7342fcf4b3/FLAG9fa1ff9cb [2018-10-24 14:49:52,135 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/aac65fda8/d03133a0f7414502a5aa9d7342fcf4b3 [2018-10-24 14:49:52,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:49:52,148 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:49:52,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:49:52,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:49:52,153 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:49:52,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:49:52" (1/1) ... [2018-10-24 14:49:52,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68109397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:52, skipping insertion in model container [2018-10-24 14:49:52,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:49:52" (1/1) ... [2018-10-24 14:49:52,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:49:52,223 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:49:52,734 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:49:52,740 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:49:52,874 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:49:52,892 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:49:52,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:52 WrapperNode [2018-10-24 14:49:52,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:49:52,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:49:52,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:49:52,894 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:49:52,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:52" (1/1) ... [2018-10-24 14:49:52,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:52" (1/1) ... [2018-10-24 14:49:53,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:49:53,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:49:53,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:49:53,120 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:49:53,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:52" (1/1) ... [2018-10-24 14:49:53,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:52" (1/1) ... [2018-10-24 14:49:53,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:52" (1/1) ... [2018-10-24 14:49:53,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:52" (1/1) ... [2018-10-24 14:49:53,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:52" (1/1) ... [2018-10-24 14:49:53,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:52" (1/1) ... [2018-10-24 14:49:53,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:52" (1/1) ... [2018-10-24 14:49:53,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:49:53,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:49:53,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:49:53,204 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:49:53,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 14:49:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:49:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:49:53,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:49:56,685 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:49:56,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:49:56 BoogieIcfgContainer [2018-10-24 14:49:56,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:49:56,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:49:56,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:49:56,692 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:49:56,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:49:52" (1/3) ... [2018-10-24 14:49:56,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e8ef99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:49:56, skipping insertion in model container [2018-10-24 14:49:56,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:52" (2/3) ... [2018-10-24 14:49:56,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e8ef99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:49:56, skipping insertion in model container [2018-10-24 14:49:56,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:49:56" (3/3) ... [2018-10-24 14:49:56,698 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label09_true-unreach-call_false-termination.c [2018-10-24 14:49:56,708 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:49:56,723 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:49:56,743 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:49:56,795 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:49:56,796 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:49:56,797 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:49:56,797 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:49:56,797 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:49:56,797 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:49:56,797 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:49:56,798 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:49:56,798 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:49:56,828 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-24 14:49:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-24 14:49:56,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:56,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:49:56,858 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:56,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:56,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1150694151, now seen corresponding path program 1 times [2018-10-24 14:49:56,868 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:56,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:56,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:56,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:56,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:49:57,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:57,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:49:57,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:49:57,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:49:57,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:57,642 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-10-24 14:49:59,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:59,830 INFO L93 Difference]: Finished difference Result 691 states and 1207 transitions. [2018-10-24 14:49:59,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:49:59,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-10-24 14:49:59,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:59,854 INFO L225 Difference]: With dead ends: 691 [2018-10-24 14:49:59,854 INFO L226 Difference]: Without dead ends: 485 [2018-10-24 14:49:59,859 INFO L605 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-10-24 14:49:59,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-10-24 14:49:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 328. [2018-10-24 14:49:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-24 14:49:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 527 transitions. [2018-10-24 14:49:59,940 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 527 transitions. Word has length 119 [2018-10-24 14:49:59,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:59,942 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 527 transitions. [2018-10-24 14:49:59,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:49:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 527 transitions. [2018-10-24 14:49:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-24 14:49:59,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:59,948 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:49:59,949 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:59,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:59,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1267409620, now seen corresponding path program 1 times [2018-10-24 14:49:59,950 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:59,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:59,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:59,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:59,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:50:00,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:00,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:00,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:00,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:00,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:00,214 INFO L87 Difference]: Start difference. First operand 328 states and 527 transitions. Second operand 4 states. [2018-10-24 14:50:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:01,808 INFO L93 Difference]: Finished difference Result 1182 states and 1980 transitions. [2018-10-24 14:50:01,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:50:01,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-10-24 14:50:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:01,817 INFO L225 Difference]: With dead ends: 1182 [2018-10-24 14:50:01,817 INFO L226 Difference]: Without dead ends: 856 [2018-10-24 14:50:01,820 INFO L605 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-10-24 14:50:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-24 14:50:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-10-24 14:50:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-24 14:50:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1303 transitions. [2018-10-24 14:50:01,868 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1303 transitions. Word has length 126 [2018-10-24 14:50:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:01,869 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1303 transitions. [2018-10-24 14:50:01,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1303 transitions. [2018-10-24 14:50:01,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-24 14:50:01,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:01,881 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:50:01,881 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:01,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:01,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1202833165, now seen corresponding path program 1 times [2018-10-24 14:50:01,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:01,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:01,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:01,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:01,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:50:02,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:02,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:50:02,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:02,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:02,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:02,114 INFO L87 Difference]: Start difference. First operand 856 states and 1303 transitions. Second operand 3 states. [2018-10-24 14:50:05,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:05,417 INFO L93 Difference]: Finished difference Result 2364 states and 3579 transitions. [2018-10-24 14:50:05,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:05,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2018-10-24 14:50:05,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:05,426 INFO L225 Difference]: With dead ends: 2364 [2018-10-24 14:50:05,426 INFO L226 Difference]: Without dead ends: 1510 [2018-10-24 14:50:05,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-24 14:50:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-10-24 14:50:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2018-10-24 14:50:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2018-10-24 14:50:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2086 transitions. [2018-10-24 14:50:05,467 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2086 transitions. Word has length 127 [2018-10-24 14:50:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:05,468 INFO L481 AbstractCegarLoop]: Abstraction has 1510 states and 2086 transitions. [2018-10-24 14:50:05,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2086 transitions. [2018-10-24 14:50:05,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-24 14:50:05,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:05,473 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:50:05,473 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:05,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:05,473 INFO L82 PathProgramCache]: Analyzing trace with hash -209508063, now seen corresponding path program 1 times [2018-10-24 14:50:05,474 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:05,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:05,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:05,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:05,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:50:05,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:05,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:50:05,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:05,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:05,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:05,584 INFO L87 Difference]: Start difference. First operand 1510 states and 2086 transitions. Second operand 3 states. [2018-10-24 14:50:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:06,498 INFO L93 Difference]: Finished difference Result 3546 states and 4969 transitions. [2018-10-24 14:50:06,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:06,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-10-24 14:50:06,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:06,510 INFO L225 Difference]: With dead ends: 3546 [2018-10-24 14:50:06,511 INFO L226 Difference]: Without dead ends: 2038 [2018-10-24 14:50:06,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-24 14:50:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2018-10-24 14:50:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 2038. [2018-10-24 14:50:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2038 states. [2018-10-24 14:50:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 2807 transitions. [2018-10-24 14:50:06,555 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 2807 transitions. Word has length 144 [2018-10-24 14:50:06,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:06,555 INFO L481 AbstractCegarLoop]: Abstraction has 2038 states and 2807 transitions. [2018-10-24 14:50:06,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2807 transitions. [2018-10-24 14:50:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-24 14:50:06,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:06,560 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:50:06,560 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:06,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:06,561 INFO L82 PathProgramCache]: Analyzing trace with hash 675128811, now seen corresponding path program 1 times [2018-10-24 14:50:06,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:06,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:06,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:06,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:06,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 14:50:06,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:06,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:50:06,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:06,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:06,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:06,664 INFO L87 Difference]: Start difference. First operand 2038 states and 2807 transitions. Second operand 3 states. [2018-10-24 14:50:07,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:07,505 INFO L93 Difference]: Finished difference Result 5526 states and 7563 transitions. [2018-10-24 14:50:07,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:07,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2018-10-24 14:50:07,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:07,524 INFO L225 Difference]: With dead ends: 5526 [2018-10-24 14:50:07,525 INFO L226 Difference]: Without dead ends: 3490 [2018-10-24 14:50:07,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-24 14:50:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2018-10-24 14:50:07,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 3490. [2018-10-24 14:50:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2018-10-24 14:50:07,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4530 transitions. [2018-10-24 14:50:07,591 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4530 transitions. Word has length 156 [2018-10-24 14:50:07,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:07,591 INFO L481 AbstractCegarLoop]: Abstraction has 3490 states and 4530 transitions. [2018-10-24 14:50:07,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4530 transitions. [2018-10-24 14:50:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-24 14:50:07,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:07,598 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:50:07,598 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:07,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:07,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1093020247, now seen corresponding path program 1 times [2018-10-24 14:50:07,598 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:07,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:07,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:07,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:07,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-24 14:50:07,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:07,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:07,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:07,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:07,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:07,784 INFO L87 Difference]: Start difference. First operand 3490 states and 4530 transitions. Second operand 4 states. [2018-10-24 14:50:08,098 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-24 14:50:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:09,058 INFO L93 Difference]: Finished difference Result 7434 states and 9567 transitions. [2018-10-24 14:50:09,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:50:09,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-10-24 14:50:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:09,073 INFO L225 Difference]: With dead ends: 7434 [2018-10-24 14:50:09,073 INFO L226 Difference]: Without dead ends: 3946 [2018-10-24 14:50:09,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:50:09,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2018-10-24 14:50:09,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3754. [2018-10-24 14:50:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3754 states. [2018-10-24 14:50:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 4807 transitions. [2018-10-24 14:50:09,147 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 4807 transitions. Word has length 164 [2018-10-24 14:50:09,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:09,147 INFO L481 AbstractCegarLoop]: Abstraction has 3754 states and 4807 transitions. [2018-10-24 14:50:09,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 4807 transitions. [2018-10-24 14:50:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-24 14:50:09,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:09,155 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:50:09,155 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:09,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:09,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1598589521, now seen corresponding path program 1 times [2018-10-24 14:50:09,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:09,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:09,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:09,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:09,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-24 14:50:09,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:09,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:09,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:09,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:09,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:09,401 INFO L87 Difference]: Start difference. First operand 3754 states and 4807 transitions. Second operand 4 states. [2018-10-24 14:50:10,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:10,591 INFO L93 Difference]: Finished difference Result 7506 states and 9669 transitions. [2018-10-24 14:50:10,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:50:10,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-10-24 14:50:10,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:10,611 INFO L225 Difference]: With dead ends: 7506 [2018-10-24 14:50:10,611 INFO L226 Difference]: Without dead ends: 3886 [2018-10-24 14:50:10,617 INFO L605 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-10-24 14:50:10,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2018-10-24 14:50:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3886. [2018-10-24 14:50:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3886 states. [2018-10-24 14:50:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 4907 transitions. [2018-10-24 14:50:10,697 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 4907 transitions. Word has length 169 [2018-10-24 14:50:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:10,697 INFO L481 AbstractCegarLoop]: Abstraction has 3886 states and 4907 transitions. [2018-10-24 14:50:10,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 4907 transitions. [2018-10-24 14:50:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-24 14:50:10,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:10,705 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:50:10,706 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:10,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:10,706 INFO L82 PathProgramCache]: Analyzing trace with hash -932654101, now seen corresponding path program 1 times [2018-10-24 14:50:10,706 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:10,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:10,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:10,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:10,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-24 14:50:10,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:10,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:10,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:10,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:10,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:10,862 INFO L87 Difference]: Start difference. First operand 3886 states and 4907 transitions. Second operand 3 states. [2018-10-24 14:50:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:11,752 INFO L93 Difference]: Finished difference Result 7638 states and 9674 transitions. [2018-10-24 14:50:11,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:11,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-10-24 14:50:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:11,761 INFO L225 Difference]: With dead ends: 7638 [2018-10-24 14:50:11,761 INFO L226 Difference]: Without dead ends: 2944 [2018-10-24 14:50:11,766 INFO L605 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-10-24 14:50:11,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2018-10-24 14:50:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2812. [2018-10-24 14:50:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2812 states. [2018-10-24 14:50:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 3199 transitions. [2018-10-24 14:50:11,807 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 3199 transitions. Word has length 172 [2018-10-24 14:50:11,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:11,807 INFO L481 AbstractCegarLoop]: Abstraction has 2812 states and 3199 transitions. [2018-10-24 14:50:11,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:11,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 3199 transitions. [2018-10-24 14:50:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-24 14:50:11,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:11,813 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:50:11,813 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:11,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1118643072, now seen corresponding path program 1 times [2018-10-24 14:50:11,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:11,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:11,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:11,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:11,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 14:50:11,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:11,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:50:11,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:11,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:11,947 INFO L87 Difference]: Start difference. First operand 2812 states and 3199 transitions. Second operand 3 states. [2018-10-24 14:50:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:13,000 INFO L93 Difference]: Finished difference Result 5490 states and 6261 transitions. [2018-10-24 14:50:13,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:13,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-10-24 14:50:13,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:13,010 INFO L225 Difference]: With dead ends: 5490 [2018-10-24 14:50:13,010 INFO L226 Difference]: Without dead ends: 2542 [2018-10-24 14:50:13,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-24 14:50:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2018-10-24 14:50:13,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2278. [2018-10-24 14:50:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2278 states. [2018-10-24 14:50:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 2578 transitions. [2018-10-24 14:50:13,048 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 2578 transitions. Word has length 186 [2018-10-24 14:50:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:13,048 INFO L481 AbstractCegarLoop]: Abstraction has 2278 states and 2578 transitions. [2018-10-24 14:50:13,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 2578 transitions. [2018-10-24 14:50:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-24 14:50:13,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:13,054 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:13,055 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:13,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:13,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1104600451, now seen corresponding path program 1 times [2018-10-24 14:50:13,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:13,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:13,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:13,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:13,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:13,390 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 14:50:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 27 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-24 14:50:13,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:50:13,459 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 14:50:13,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:13,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:50:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-24 14:50:13,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:50:13,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-24 14:50:13,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:50:13,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:50:13,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:50:13,825 INFO L87 Difference]: Start difference. First operand 2278 states and 2578 transitions. Second operand 8 states. [2018-10-24 14:50:18,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:18,070 INFO L93 Difference]: Finished difference Result 5612 states and 6361 transitions. [2018-10-24 14:50:18,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 14:50:18,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 216 [2018-10-24 14:50:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:18,082 INFO L225 Difference]: With dead ends: 5612 [2018-10-24 14:50:18,082 INFO L226 Difference]: Without dead ends: 3068 [2018-10-24 14:50:18,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-10-24 14:50:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2018-10-24 14:50:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2928. [2018-10-24 14:50:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2018-10-24 14:50:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3167 transitions. [2018-10-24 14:50:18,145 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3167 transitions. Word has length 216 [2018-10-24 14:50:18,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:18,146 INFO L481 AbstractCegarLoop]: Abstraction has 2928 states and 3167 transitions. [2018-10-24 14:50:18,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:50:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3167 transitions. [2018-10-24 14:50:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-24 14:50:18,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:18,157 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 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-10-24 14:50:18,157 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:18,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:18,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1216797626, now seen corresponding path program 1 times [2018-10-24 14:50:18,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:18,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:18,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:18,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:18,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:18,550 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 14:50:18,740 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 14:50:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-24 14:50:18,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:18,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 14:50:18,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:50:18,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:50:18,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:50:18,837 INFO L87 Difference]: Start difference. First operand 2928 states and 3167 transitions. Second operand 6 states. [2018-10-24 14:50:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:20,311 INFO L93 Difference]: Finished difference Result 6110 states and 6618 transitions. [2018-10-24 14:50:20,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:50:20,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 285 [2018-10-24 14:50:20,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:20,323 INFO L225 Difference]: With dead ends: 6110 [2018-10-24 14:50:20,323 INFO L226 Difference]: Without dead ends: 3316 [2018-10-24 14:50:20,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:50:20,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3316 states. [2018-10-24 14:50:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3316 to 2928. [2018-10-24 14:50:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2018-10-24 14:50:20,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3148 transitions. [2018-10-24 14:50:20,370 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3148 transitions. Word has length 285 [2018-10-24 14:50:20,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:20,370 INFO L481 AbstractCegarLoop]: Abstraction has 2928 states and 3148 transitions. [2018-10-24 14:50:20,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:50:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3148 transitions. [2018-10-24 14:50:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-24 14:50:20,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:20,378 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-24 14:50:20,378 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:20,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:20,379 INFO L82 PathProgramCache]: Analyzing trace with hash -865417859, now seen corresponding path program 1 times [2018-10-24 14:50:20,379 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:20,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:20,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:20,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-24 14:50:20,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:20,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:50:20,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:20,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:20,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:20,895 INFO L87 Difference]: Start difference. First operand 2928 states and 3148 transitions. Second operand 4 states. [2018-10-24 14:50:22,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:22,583 INFO L93 Difference]: Finished difference Result 6376 states and 6867 transitions. [2018-10-24 14:50:22,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:50:22,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2018-10-24 14:50:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:22,584 INFO L225 Difference]: With dead ends: 6376 [2018-10-24 14:50:22,584 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 14:50:22,588 INFO L605 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-10-24 14:50:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 14:50:22,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 14:50:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 14:50:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 14:50:22,589 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 307 [2018-10-24 14:50:22,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:22,589 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 14:50:22,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 14:50:22,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 14:50:22,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 14:50:22,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:22,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:23,493 WARN L179 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 31 [2018-10-24 14:50:24,130 WARN L179 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 31 [2018-10-24 14:50:24,134 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-24 14:50:24,134 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-24 14:50:24,134 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 530) no Hoare annotation was computed. [2018-10-24 14:50:24,134 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,135 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,135 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,135 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,135 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,135 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,135 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-24 14:50:24,135 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-24 14:50:24,135 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-24 14:50:24,135 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-24 14:50:24,135 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-24 14:50:24,135 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-24 14:50:24,135 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-24 14:50:24,136 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-24 14:50:24,136 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-24 14:50:24,136 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-24 14:50:24,136 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,136 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,136 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,136 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,136 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,136 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,137 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-24 14:50:24,137 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-24 14:50:24,137 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-24 14:50:24,137 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-24 14:50:24,137 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-24 14:50:24,137 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-24 14:50:24,137 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-24 14:50:24,137 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-24 14:50:24,137 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-24 14:50:24,138 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-24 14:50:24,140 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-24 14:50:24,140 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-24 14:50:24,140 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-24 14:50:24,141 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-24 14:50:24,141 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-24 14:50:24,141 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,141 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,141 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,141 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,141 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,141 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-24 14:50:24,141 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-24 14:50:24,142 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-24 14:50:24,142 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-24 14:50:24,142 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-24 14:50:24,142 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-24 14:50:24,142 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-24 14:50:24,142 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-24 14:50:24,142 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-24 14:50:24,143 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse3 (= ~a16~0 6)) (.cse2 (= ~a7~0 1)) (.cse5 (= ~a20~0 1)) (.cse6 (<= 15 ~a8~0)) (.cse1 (= ~a16~0 5)) (.cse0 (= ~a21~0 1))) (or (and (= ~a8~0 14) .cse0 .cse1) (and .cse2 (not .cse3) .cse4) (and .cse4 .cse0 .cse5 .cse3) (and .cse6 (not .cse2) .cse0 .cse3) (and .cse2 .cse5) (and .cse6 .cse0 .cse1) (and (= ~a16~0 4) .cse0))) [2018-10-24 14:50:24,143 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,143 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,143 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,143 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,143 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,143 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-24 14:50:24,144 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-24 14:50:24,144 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-24 14:50:24,144 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-24 14:50:24,144 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-24 14:50:24,144 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-24 14:50:24,144 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-24 14:50:24,144 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-24 14:50:24,144 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-24 14:50:24,144 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-24 14:50:24,144 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-24 14:50:24,144 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-24 14:50:24,144 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-24 14:50:24,145 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-24 14:50:24,145 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,145 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,145 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,145 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,145 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,145 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-24 14:50:24,145 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-24 14:50:24,145 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-24 14:50:24,145 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-24 14:50:24,145 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-24 14:50:24,145 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-24 14:50:24,145 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-24 14:50:24,145 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-24 14:50:24,146 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-24 14:50:24,146 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,146 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,146 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,146 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,146 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,146 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-24 14:50:24,146 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-24 14:50:24,146 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-24 14:50:24,146 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-24 14:50:24,146 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-24 14:50:24,146 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-24 14:50:24,146 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-24 14:50:24,147 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-24 14:50:24,147 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 14:50:24,147 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-24 14:50:24,147 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-24 14:50:24,147 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-24 14:50:24,147 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-24 14:50:24,147 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-24 14:50:24,147 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-24 14:50:24,147 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-24 14:50:24,147 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,148 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,148 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,148 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse3 (= ~a16~0 6)) (.cse2 (= ~a7~0 1)) (.cse5 (= ~a20~0 1)) (.cse6 (<= 15 ~a8~0)) (.cse1 (= ~a16~0 5)) (.cse0 (= ~a21~0 1))) (or (and (= ~a8~0 14) .cse0 .cse1) (and .cse2 (not .cse3) .cse4) (and .cse4 .cse0 .cse5 .cse3) (and .cse6 (not .cse2) .cse0 .cse3) (and .cse2 .cse5) (and .cse6 .cse0 .cse1) (and (= ~a16~0 4) .cse0))) [2018-10-24 14:50:24,148 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,148 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,148 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-24 14:50:24,148 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-24 14:50:24,148 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-24 14:50:24,148 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-24 14:50:24,149 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-24 14:50:24,149 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-24 14:50:24,149 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-24 14:50:24,149 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-24 14:50:24,149 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,149 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,149 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,149 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,149 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,150 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-24 14:50:24,150 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 14:50:24,150 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-24 14:50:24,150 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-24 14:50:24,150 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-24 14:50:24,150 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-24 14:50:24,150 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-24 14:50:24,150 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-24 14:50:24,150 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-24 14:50:24,150 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-24 14:50:24,150 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-24 14:50:24,151 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-24 14:50:24,151 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-24 14:50:24,151 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,151 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,151 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,151 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,151 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,151 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-24 14:50:24,151 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,151 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-24 14:50:24,152 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-24 14:50:24,152 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 14:50:24,152 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-24 14:50:24,152 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-24 14:50:24,152 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-24 14:50:24,152 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-24 14:50:24,152 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-24 14:50:24,152 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-24 14:50:24,152 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-24 14:50:24,152 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-24 14:50:24,152 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-24 14:50:24,152 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-24 14:50:24,152 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,153 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,153 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,153 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,153 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,153 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,153 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-24 14:50:24,153 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-24 14:50:24,153 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-24 14:50:24,153 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-24 14:50:24,153 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-24 14:50:24,153 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-24 14:50:24,153 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-24 14:50:24,153 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-24 14:50:24,153 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-24 14:50:24,154 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-24 14:50:24,154 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-24 14:50:24,154 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-24 14:50:24,154 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 14:50:24,154 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-24 14:50:24,154 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-24 14:50:24,154 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-24 14:50:24,154 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,154 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,154 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,154 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,154 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,154 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:24,154 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-24 14:50:24,154 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-24 14:50:24,155 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-24 14:50:24,155 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-24 14:50:24,155 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-24 14:50:24,155 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-24 14:50:24,155 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-24 14:50:24,155 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-24 14:50:24,155 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-24 14:50:24,155 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-24 14:50:24,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:50:24 BoogieIcfgContainer [2018-10-24 14:50:24,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:50:24,175 INFO L168 Benchmark]: Toolchain (without parser) took 32028.45 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -641.7 MB). Peak memory consumption was 435.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:50:24,176 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:50:24,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.50 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:50:24,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 225.28 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -797.8 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:50:24,179 INFO L168 Benchmark]: Boogie Preprocessor took 83.77 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:50:24,180 INFO L168 Benchmark]: RCFGBuilder took 3484.17 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 119.5 MB). Peak memory consumption was 119.5 MB. Max. memory is 7.1 GB. [2018-10-24 14:50:24,180 INFO L168 Benchmark]: TraceAbstraction took 27485.67 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 353.9 MB). Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 4.9 MB). Peak memory consumption was 358.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:50:24,186 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.50 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 225.28 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -797.8 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.77 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3484.17 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 119.5 MB). Peak memory consumption was 119.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27485.67 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 353.9 MB). Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 4.9 MB). Peak memory consumption was 358.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 530]: 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: 583]: Loop Invariant Derived loop invariant: (((((((a8 == 14 && a21 == 1) && a16 == 5) || ((a7 == 1 && !(a16 == 6)) && a17 == 1)) || (((a17 == 1 && a21 == 1) && a20 == 1) && a16 == 6)) || (((15 <= a8 && !(a7 == 1)) && a21 == 1) && a16 == 6)) || (a7 == 1 && a20 == 1)) || ((15 <= a8 && a21 == 1) && a16 == 5)) || (a16 == 4 && a21 == 1) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((a8 == 14 && a21 == 1) && a16 == 5) || ((a7 == 1 && !(a16 == 6)) && a17 == 1)) || (((a17 == 1 && a21 == 1) && a20 == 1) && a16 == 6)) || (((15 <= a8 && !(a7 == 1)) && a21 == 1) && a16 == 6)) || (a7 == 1 && a20 == 1)) || ((15 <= a8 && a21 == 1) && a16 == 5)) || (a16 == 4 && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 27.3s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 20.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1600 SDtfs, 3413 SDslu, 685 SDs, 0 SdLazy, 7401 SolverSat, 1458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 232 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3886occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 1273 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 84 NumberOfFragments, 147 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4455 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 290 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2387 NumberOfCodeBlocks, 2387 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2374 ConstructedInterpolants, 0 QuantifiedInterpolants, 1038385 SizeOfPredicates, 1 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1552/1579 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...