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_label29_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:50:53,222 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:50:53,224 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:50:53,239 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:50:53,239 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:50:53,240 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:50:53,241 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:50:53,244 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:50:53,246 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:50:53,247 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:50:53,248 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:50:53,248 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:50:53,249 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:50:53,250 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:50:53,251 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:50:53,251 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:50:53,252 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:50:53,254 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:50:53,256 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:50:53,258 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:50:53,259 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:50:53,260 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:50:53,263 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:50:53,263 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:50:53,263 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:50:53,264 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:50:53,265 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:50:53,266 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:50:53,267 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:50:53,268 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:50:53,268 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:50:53,269 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:50:53,269 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:50:53,270 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:50:53,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:50:53,274 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:50:53,274 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:50:53,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:50:53,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:50:53,304 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:50:53,304 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:50:53,308 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:50:53,308 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:50:53,309 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:50:53,309 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:50:53,309 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:50:53,309 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:50:53,309 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:50:53,310 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:50:53,311 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:50:53,311 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:50:53,311 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:50:53,311 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:50:53,312 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:50:53,312 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:50:53,312 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:50:53,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:50:53,312 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:50:53,313 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:50:53,314 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:50:53,314 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:50:53,314 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:50:53,315 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:50:53,315 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:50:53,315 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:50:53,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:50:53,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:50:53,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:50:53,403 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:50:53,403 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:50:53,404 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-10-24 14:50:53,466 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e74085605/46e64a6b8edd4a92b5022bf8a1ab2de7/FLAG42e118d7d [2018-10-24 14:50:54,061 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:50:54,066 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-10-24 14:50:54,082 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e74085605/46e64a6b8edd4a92b5022bf8a1ab2de7/FLAG42e118d7d [2018-10-24 14:50:54,106 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e74085605/46e64a6b8edd4a92b5022bf8a1ab2de7 [2018-10-24 14:50:54,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:50:54,118 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:50:54,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:50:54,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:50:54,124 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:50:54,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:54,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a802b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54, skipping insertion in model container [2018-10-24 14:50:54,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:54,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:50:54,213 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:50:54,663 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:50:54,668 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:50:54,768 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:50:54,785 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:50:54,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54 WrapperNode [2018-10-24 14:50:54,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:50:54,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:50:54,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:50:54,787 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:50:54,797 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:50:54" (1/1) ... [2018-10-24 14:50:54,821 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:50:54" (1/1) ... [2018-10-24 14:50:54,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:50:54,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:50:54,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:50:54,994 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:50:55,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:55,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:55,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:55,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:55,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:55,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:55,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:55,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:50:55,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:50:55,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:50:55,060 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:50:55,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (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:50:55,142 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:50:55,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:50:55,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:50:58,109 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:50:58,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:50:58 BoogieIcfgContainer [2018-10-24 14:50:58,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:50:58,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:50:58,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:50:58,115 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:50:58,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:50:54" (1/3) ... [2018-10-24 14:50:58,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ea33f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:50:58, skipping insertion in model container [2018-10-24 14:50:58,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (2/3) ... [2018-10-24 14:50:58,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ea33f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:50:58, skipping insertion in model container [2018-10-24 14:50:58,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:50:58" (3/3) ... [2018-10-24 14:50:58,119 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label29_true-unreach-call_false-termination.c [2018-10-24 14:50:58,129 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:50:58,139 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:50:58,156 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:50:58,193 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:50:58,194 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:50:58,194 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:50:58,194 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:50:58,194 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:50:58,195 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:50:58,195 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:50:58,195 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:50:58,196 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:50:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-24 14:50:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-24 14:50:58,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:58,235 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] [2018-10-24 14:50:58,238 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:58,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:58,245 INFO L82 PathProgramCache]: Analyzing trace with hash -450802649, now seen corresponding path program 1 times [2018-10-24 14:50:58,246 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:58,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:58,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:58,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:58,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:58,916 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:50:58,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:58,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:58,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:58,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:58,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:58,946 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-10-24 14:51:01,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:01,727 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-10-24 14:51:01,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:01,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-10-24 14:51:01,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:01,751 INFO L225 Difference]: With dead ends: 666 [2018-10-24 14:51:01,751 INFO L226 Difference]: Without dead ends: 460 [2018-10-24 14:51:01,756 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:51:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-24 14:51:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-10-24 14:51:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-24 14:51:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 736 transitions. [2018-10-24 14:51:01,837 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 736 transitions. Word has length 102 [2018-10-24 14:51:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:01,838 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 736 transitions. [2018-10-24 14:51:01,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 736 transitions. [2018-10-24 14:51:01,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-24 14:51:01,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:01,845 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] [2018-10-24 14:51:01,846 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:01,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:01,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1219592005, now seen corresponding path program 1 times [2018-10-24 14:51:01,846 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:01,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:01,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:01,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:01,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:02,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:02,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:51:02,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:02,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:02,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:02,324 INFO L87 Difference]: Start difference. First operand 460 states and 736 transitions. Second operand 4 states. [2018-10-24 14:51:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:03,897 INFO L93 Difference]: Finished difference Result 1710 states and 2816 transitions. [2018-10-24 14:51:03,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:03,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-10-24 14:51:03,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:03,907 INFO L225 Difference]: With dead ends: 1710 [2018-10-24 14:51:03,908 INFO L226 Difference]: Without dead ends: 1252 [2018-10-24 14:51:03,912 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:51:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-10-24 14:51:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2018-10-24 14:51:03,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-10-24 14:51:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1792 transitions. [2018-10-24 14:51:04,000 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1792 transitions. Word has length 110 [2018-10-24 14:51:04,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:04,001 INFO L481 AbstractCegarLoop]: Abstraction has 1252 states and 1792 transitions. [2018-10-24 14:51:04,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:04,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1792 transitions. [2018-10-24 14:51:04,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-24 14:51:04,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:04,010 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:04,010 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:04,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:04,011 INFO L82 PathProgramCache]: Analyzing trace with hash -676454088, now seen corresponding path program 1 times [2018-10-24 14:51:04,011 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:04,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:04,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:04,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:04,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:04,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:04,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:04,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:04,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:04,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:04,334 INFO L87 Difference]: Start difference. First operand 1252 states and 1792 transitions. Second operand 4 states. [2018-10-24 14:51:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:07,667 INFO L93 Difference]: Finished difference Result 2502 states and 3582 transitions. [2018-10-24 14:51:07,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:07,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-10-24 14:51:07,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:07,673 INFO L225 Difference]: With dead ends: 2502 [2018-10-24 14:51:07,673 INFO L226 Difference]: Without dead ends: 1112 [2018-10-24 14:51:07,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:51:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2018-10-24 14:51:07,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1112. [2018-10-24 14:51:07,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2018-10-24 14:51:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1373 transitions. [2018-10-24 14:51:07,697 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1373 transitions. Word has length 124 [2018-10-24 14:51:07,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:07,697 INFO L481 AbstractCegarLoop]: Abstraction has 1112 states and 1373 transitions. [2018-10-24 14:51:07,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1373 transitions. [2018-10-24 14:51:07,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-24 14:51:07,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:07,701 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:07,701 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:07,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:07,702 INFO L82 PathProgramCache]: Analyzing trace with hash -812589422, now seen corresponding path program 1 times [2018-10-24 14:51:07,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:07,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:07,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:07,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:07,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:07,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:07,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:07,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:07,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:07,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:07,800 INFO L87 Difference]: Start difference. First operand 1112 states and 1373 transitions. Second operand 3 states. [2018-10-24 14:51:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:08,730 INFO L93 Difference]: Finished difference Result 3278 states and 4062 transitions. [2018-10-24 14:51:08,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:08,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-10-24 14:51:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:08,744 INFO L225 Difference]: With dead ends: 3278 [2018-10-24 14:51:08,744 INFO L226 Difference]: Without dead ends: 2168 [2018-10-24 14:51:08,746 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:51:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2018-10-24 14:51:08,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2018-10-24 14:51:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2018-10-24 14:51:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 2589 transitions. [2018-10-24 14:51:08,787 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 2589 transitions. Word has length 125 [2018-10-24 14:51:08,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:08,787 INFO L481 AbstractCegarLoop]: Abstraction has 2168 states and 2589 transitions. [2018-10-24 14:51:08,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2589 transitions. [2018-10-24 14:51:08,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-24 14:51:08,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:08,792 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-10-24 14:51:08,792 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:08,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:08,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1480574522, now seen corresponding path program 1 times [2018-10-24 14:51:08,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:08,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:08,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:08,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:08,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 14:51:08,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:08,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:08,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:08,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:08,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:08,904 INFO L87 Difference]: Start difference. First operand 2168 states and 2589 transitions. Second operand 3 states. [2018-10-24 14:51:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:09,631 INFO L93 Difference]: Finished difference Result 6446 states and 7710 transitions. [2018-10-24 14:51:09,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:09,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2018-10-24 14:51:09,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:09,651 INFO L225 Difference]: With dead ends: 6446 [2018-10-24 14:51:09,651 INFO L226 Difference]: Without dead ends: 4280 [2018-10-24 14:51:09,655 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:51:09,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2018-10-24 14:51:09,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2018-10-24 14:51:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4280 states. [2018-10-24 14:51:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5015 transitions. [2018-10-24 14:51:09,724 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5015 transitions. Word has length 130 [2018-10-24 14:51:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:09,724 INFO L481 AbstractCegarLoop]: Abstraction has 4280 states and 5015 transitions. [2018-10-24 14:51:09,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5015 transitions. [2018-10-24 14:51:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-24 14:51:09,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:09,730 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:51:09,731 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:09,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:09,731 INFO L82 PathProgramCache]: Analyzing trace with hash 300478156, now seen corresponding path program 1 times [2018-10-24 14:51:09,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:09,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:09,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:09,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:09,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:51:09,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:09,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:09,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:09,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:09,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:09,851 INFO L87 Difference]: Start difference. First operand 4280 states and 5015 transitions. Second operand 3 states. [2018-10-24 14:51:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:10,795 INFO L93 Difference]: Finished difference Result 9218 states and 10823 transitions. [2018-10-24 14:51:10,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:10,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-10-24 14:51:10,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:10,814 INFO L225 Difference]: With dead ends: 9218 [2018-10-24 14:51:10,815 INFO L226 Difference]: Without dead ends: 4404 [2018-10-24 14:51:10,821 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:51:10,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4404 states. [2018-10-24 14:51:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4404 to 4404. [2018-10-24 14:51:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2018-10-24 14:51:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 5024 transitions. [2018-10-24 14:51:10,891 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 5024 transitions. Word has length 132 [2018-10-24 14:51:10,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:10,891 INFO L481 AbstractCegarLoop]: Abstraction has 4404 states and 5024 transitions. [2018-10-24 14:51:10,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 5024 transitions. [2018-10-24 14:51:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-24 14:51:10,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:10,897 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:10,898 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:10,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:10,898 INFO L82 PathProgramCache]: Analyzing trace with hash 50549412, now seen corresponding path program 1 times [2018-10-24 14:51:10,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:10,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:10,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:10,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:10,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:11,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:11,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:11,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:11,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:11,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:11,056 INFO L87 Difference]: Start difference. First operand 4404 states and 5024 transitions. Second operand 3 states. [2018-10-24 14:51:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:11,613 INFO L93 Difference]: Finished difference Result 8806 states and 10046 transitions. [2018-10-24 14:51:11,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:11,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-10-24 14:51:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:11,630 INFO L225 Difference]: With dead ends: 8806 [2018-10-24 14:51:11,631 INFO L226 Difference]: Without dead ends: 4404 [2018-10-24 14:51:11,636 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:51:11,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4404 states. [2018-10-24 14:51:11,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4404 to 4404. [2018-10-24 14:51:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2018-10-24 14:51:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 5000 transitions. [2018-10-24 14:51:11,699 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 5000 transitions. Word has length 132 [2018-10-24 14:51:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:11,699 INFO L481 AbstractCegarLoop]: Abstraction has 4404 states and 5000 transitions. [2018-10-24 14:51:11,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 5000 transitions. [2018-10-24 14:51:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-24 14:51:11,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:11,705 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:11,706 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:11,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:11,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1440218620, now seen corresponding path program 1 times [2018-10-24 14:51:11,706 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:11,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:11,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:11,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:11,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:12,244 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-10-24 14:51:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:12,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:12,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 14:51:12,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:51:12,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:51:12,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:51:12,338 INFO L87 Difference]: Start difference. First operand 4404 states and 5000 transitions. Second operand 7 states. [2018-10-24 14:51:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:17,796 INFO L93 Difference]: Finished difference Result 8878 states and 10070 transitions. [2018-10-24 14:51:17,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 14:51:17,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2018-10-24 14:51:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:17,815 INFO L225 Difference]: With dead ends: 8878 [2018-10-24 14:51:17,815 INFO L226 Difference]: Without dead ends: 4476 [2018-10-24 14:51:17,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:51:17,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4476 states. [2018-10-24 14:51:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4476 to 4404. [2018-10-24 14:51:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2018-10-24 14:51:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 4988 transitions. [2018-10-24 14:51:17,906 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 4988 transitions. Word has length 137 [2018-10-24 14:51:17,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:17,906 INFO L481 AbstractCegarLoop]: Abstraction has 4404 states and 4988 transitions. [2018-10-24 14:51:17,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:51:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 4988 transitions. [2018-10-24 14:51:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-24 14:51:17,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:17,914 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-10-24 14:51:17,915 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:17,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:17,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1117284746, now seen corresponding path program 1 times [2018-10-24 14:51:17,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:17,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:17,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:17,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:17,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-24 14:51:18,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:18,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:18,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:18,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:18,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:18,077 INFO L87 Difference]: Start difference. First operand 4404 states and 4988 transitions. Second operand 3 states. [2018-10-24 14:51:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:19,161 INFO L93 Difference]: Finished difference Result 8806 states and 9974 transitions. [2018-10-24 14:51:19,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:19,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2018-10-24 14:51:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:19,175 INFO L225 Difference]: With dead ends: 8806 [2018-10-24 14:51:19,175 INFO L226 Difference]: Without dead ends: 3332 [2018-10-24 14:51:19,181 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:51:19,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2018-10-24 14:51:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 3332. [2018-10-24 14:51:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2018-10-24 14:51:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 3654 transitions. [2018-10-24 14:51:19,229 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 3654 transitions. Word has length 162 [2018-10-24 14:51:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:19,230 INFO L481 AbstractCegarLoop]: Abstraction has 3332 states and 3654 transitions. [2018-10-24 14:51:19,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 3654 transitions. [2018-10-24 14:51:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-24 14:51:19,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:19,237 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:51:19,238 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:19,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:19,238 INFO L82 PathProgramCache]: Analyzing trace with hash -672641843, now seen corresponding path program 1 times [2018-10-24 14:51:19,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:19,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:19,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:19,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:19,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-24 14:51:19,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:19,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:51:19,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:19,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:19,507 INFO L87 Difference]: Start difference. First operand 3332 states and 3654 transitions. Second operand 4 states. [2018-10-24 14:51:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:20,365 INFO L93 Difference]: Finished difference Result 6662 states and 7306 transitions. [2018-10-24 14:51:20,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:20,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-10-24 14:51:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:20,379 INFO L225 Difference]: With dead ends: 6662 [2018-10-24 14:51:20,379 INFO L226 Difference]: Without dead ends: 3332 [2018-10-24 14:51:20,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:51:20,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2018-10-24 14:51:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 3332. [2018-10-24 14:51:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2018-10-24 14:51:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 3594 transitions. [2018-10-24 14:51:20,428 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 3594 transitions. Word has length 170 [2018-10-24 14:51:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:20,428 INFO L481 AbstractCegarLoop]: Abstraction has 3332 states and 3594 transitions. [2018-10-24 14:51:20,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 3594 transitions. [2018-10-24 14:51:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-24 14:51:20,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:20,434 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:51:20,435 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:20,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:20,435 INFO L82 PathProgramCache]: Analyzing trace with hash -430861026, now seen corresponding path program 1 times [2018-10-24 14:51:20,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:20,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:20,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:20,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:20,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-24 14:51:20,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:20,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:20,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:20,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:20,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:20,603 INFO L87 Difference]: Start difference. First operand 3332 states and 3594 transitions. Second operand 3 states. [2018-10-24 14:51:21,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:21,453 INFO L93 Difference]: Finished difference Result 8105 states and 8742 transitions. [2018-10-24 14:51:21,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:21,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-10-24 14:51:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:21,454 INFO L225 Difference]: With dead ends: 8105 [2018-10-24 14:51:21,455 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 14:51:21,461 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:51:21,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 14:51:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 14:51:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 14:51:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 14:51:21,462 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2018-10-24 14:51:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:21,462 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 14:51:21,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 14:51:21,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 14:51:21,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 14:51:21,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:21,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:21,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:21,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:21,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:21,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:21,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:21,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:21,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:21,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:21,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:21,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:22,565 WARN L179 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-10-24 14:51:22,869 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-10-24 14:51:22,873 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-24 14:51:22,873 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-24 14:51:22,873 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,873 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,873 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,873 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,873 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,873 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,874 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-24 14:51:22,874 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-24 14:51:22,874 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-24 14:51:22,874 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-24 14:51:22,874 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-24 14:51:22,874 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-24 14:51:22,874 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-24 14:51:22,874 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-24 14:51:22,874 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-24 14:51:22,874 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-24 14:51:22,874 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,874 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,875 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,875 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,875 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,875 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,875 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-24 14:51:22,875 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-24 14:51:22,875 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-24 14:51:22,875 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-24 14:51:22,875 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-24 14:51:22,876 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-24 14:51:22,876 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-24 14:51:22,876 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-24 14:51:22,876 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-24 14:51:22,876 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-24 14:51:22,876 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-24 14:51:22,876 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-24 14:51:22,876 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-24 14:51:22,877 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-24 14:51:22,877 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-24 14:51:22,877 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,877 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,877 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,877 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,878 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,878 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-24 14:51:22,878 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-24 14:51:22,878 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-24 14:51:22,878 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-24 14:51:22,878 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-24 14:51:22,879 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-24 14:51:22,879 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-24 14:51:22,879 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-24 14:51:22,879 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-24 14:51:22,880 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a8~0 13))) (let ((.cse3 (= ~a17~0 1)) (.cse6 (not (= ~a8~0 15))) (.cse5 (not .cse0)) (.cse2 (= ~a16~0 5)) (.cse7 (not (= ~a7~0 1))) (.cse4 (<= ~a17~0 0)) (.cse1 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3) (and .cse4 .cse1 .cse5) (and .cse0 .cse4 (= ~a20~0 1)) (and .cse3 .cse6 .cse1) (and .cse7 .cse3 .cse1) (and .cse6 .cse5 .cse2) (and .cse7 .cse4 .cse1)))) [2018-10-24 14:51:22,880 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,880 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,880 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,880 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,880 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,880 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-24 14:51:22,881 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-24 14:51:22,881 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-24 14:51:22,881 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-24 14:51:22,881 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-24 14:51:22,881 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-24 14:51:22,881 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-24 14:51:22,881 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-24 14:51:22,881 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-24 14:51:22,881 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-24 14:51:22,882 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-24 14:51:22,882 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-24 14:51:22,882 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-24 14:51:22,882 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-24 14:51:22,882 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,882 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,882 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,882 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,883 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,883 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-24 14:51:22,883 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-24 14:51:22,883 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-24 14:51:22,883 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 479) no Hoare annotation was computed. [2018-10-24 14:51:22,883 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-24 14:51:22,883 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-24 14:51:22,884 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-24 14:51:22,884 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-24 14:51:22,884 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-24 14:51:22,884 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-24 14:51:22,884 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,884 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,884 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,884 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,884 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,885 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-24 14:51:22,885 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-24 14:51:22,885 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-24 14:51:22,885 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-24 14:51:22,885 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-24 14:51:22,885 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-24 14:51:22,885 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-24 14:51:22,885 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-24 14:51:22,886 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 14:51:22,886 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-24 14:51:22,886 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-24 14:51:22,886 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-24 14:51:22,886 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-24 14:51:22,886 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-24 14:51:22,886 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-24 14:51:22,886 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-24 14:51:22,887 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,887 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,887 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,887 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a8~0 13))) (let ((.cse3 (= ~a17~0 1)) (.cse6 (not (= ~a8~0 15))) (.cse5 (not .cse0)) (.cse2 (= ~a16~0 5)) (.cse7 (not (= ~a7~0 1))) (.cse4 (<= ~a17~0 0)) (.cse1 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3) (and .cse4 .cse1 .cse5) (and .cse0 .cse4 (= ~a20~0 1)) (and .cse3 .cse6 .cse1) (and .cse7 .cse3 .cse1) (and .cse6 .cse5 .cse2) (and .cse7 .cse4 .cse1)))) [2018-10-24 14:51:22,887 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,887 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,887 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-24 14:51:22,888 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-24 14:51:22,888 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-24 14:51:22,888 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-24 14:51:22,888 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-24 14:51:22,888 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-24 14:51:22,888 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-24 14:51:22,888 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-24 14:51:22,888 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,889 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,889 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,889 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,889 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,889 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-24 14:51:22,889 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 14:51:22,889 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-24 14:51:22,889 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-24 14:51:22,889 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-24 14:51:22,890 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-24 14:51:22,890 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-24 14:51:22,890 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-24 14:51:22,890 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-24 14:51:22,890 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-24 14:51:22,890 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-24 14:51:22,890 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-24 14:51:22,890 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-24 14:51:22,890 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,890 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,890 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,890 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,890 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,891 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-24 14:51:22,891 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,891 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-24 14:51:22,891 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-24 14:51:22,891 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 14:51:22,891 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-24 14:51:22,891 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-24 14:51:22,891 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-24 14:51:22,891 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-24 14:51:22,891 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-24 14:51:22,891 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-24 14:51:22,891 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-24 14:51:22,891 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-24 14:51:22,891 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-24 14:51:22,892 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-24 14:51:22,892 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,892 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,892 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,892 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,892 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,892 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,892 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-24 14:51:22,892 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-24 14:51:22,892 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-24 14:51:22,892 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-24 14:51:22,892 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-24 14:51:22,892 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-24 14:51:22,892 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-24 14:51:22,893 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-24 14:51:22,893 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-24 14:51:22,893 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-24 14:51:22,893 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-24 14:51:22,893 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-24 14:51:22,893 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 14:51:22,893 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-24 14:51:22,893 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-24 14:51:22,893 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-24 14:51:22,893 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,893 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,893 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,893 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,893 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,893 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:22,894 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-24 14:51:22,894 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-24 14:51:22,894 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-24 14:51:22,894 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-24 14:51:22,894 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-24 14:51:22,894 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-24 14:51:22,894 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-24 14:51:22,894 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-24 14:51:22,894 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-24 14:51:22,894 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-24 14:51:22,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:51:22 BoogieIcfgContainer [2018-10-24 14:51:22,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:51:22,917 INFO L168 Benchmark]: Toolchain (without parser) took 28800.40 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -420.0 MB). Peak memory consumption was 621.8 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:22,918 INFO L168 Benchmark]: CDTParser took 0.22 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:51:22,919 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:22,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 205.93 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 696.8 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -784.8 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:22,924 INFO L168 Benchmark]: Boogie Preprocessor took 65.86 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:22,925 INFO L168 Benchmark]: RCFGBuilder took 3051.25 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 121.0 MB). Peak memory consumption was 121.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:22,927 INFO L168 Benchmark]: TraceAbstraction took 24804.69 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 345.0 MB). Free memory was 2.0 GB in the beginning and 1.8 GB in the end (delta: 198.1 MB). Peak memory consumption was 543.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:22,932 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.22 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 667.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 205.93 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 696.8 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -784.8 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.86 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3051.25 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 121.0 MB). Peak memory consumption was 121.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24804.69 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 345.0 MB). Free memory was 2.0 GB in the beginning and 1.8 GB in the end (delta: 198.1 MB). Peak memory consumption was 543.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: 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 == 13 && a21 == 1) && a16 == 5) || (a8 == 13 && a17 == 1)) || ((a17 <= 0 && a21 == 1) && !(a8 == 13))) || ((a8 == 13 && a17 <= 0) && a20 == 1)) || ((a17 == 1 && !(a8 == 15)) && a21 == 1)) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || ((!(a8 == 15) && !(a8 == 13)) && a16 == 5)) || ((!(a7 == 1) && a17 <= 0) && a21 == 1) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((a8 == 13 && a21 == 1) && a16 == 5) || (a8 == 13 && a17 == 1)) || ((a17 <= 0 && a21 == 1) && !(a8 == 13))) || ((a8 == 13 && a17 <= 0) && a20 == 1)) || ((a17 == 1 && !(a8 == 15)) && a21 == 1)) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || ((!(a8 == 15) && !(a8 == 13)) && a16 == 5)) || ((!(a7 == 1) && a17 <= 0) && 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, 24.7s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 19.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1513 SDtfs, 2575 SDslu, 543 SDs, 0 SdLazy, 5762 SolverSat, 1252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4404occurred in iteration=6, 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, 11 MinimizatonAttempts, 72 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 104 NumberOfFragments, 169 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2504 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 258 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1500 NumberOfCodeBlocks, 1500 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1489 ConstructedInterpolants, 0 QuantifiedInterpolants, 496132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 509/509 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...