java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:51:05,337 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:51:05,341 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:51:05,354 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:51:05,354 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:51:05,355 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:51:05,358 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:51:05,361 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:51:05,363 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:51:05,364 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:51:05,371 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:51:05,372 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:51:05,373 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:51:05,375 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:51:05,376 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:51:05,376 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:51:05,377 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:51:05,379 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:51:05,381 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:51:05,383 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:51:05,385 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:51:05,386 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:51:05,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:51:05,391 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:51:05,391 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:51:05,392 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:51:05,395 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:51:05,396 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:51:05,396 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:51:05,399 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:51:05,400 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:51:05,400 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:51:05,400 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:51:05,401 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:51:05,402 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:51:05,404 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:51:05,404 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:51:05,428 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:51:05,428 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:51:05,430 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:51:05,430 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:51:05,431 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:51:05,434 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:51:05,434 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:51:05,434 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:51:05,435 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:51:05,435 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:51:05,435 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:51:05,435 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:51:05,435 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:51:05,435 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:51:05,436 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:51:05,436 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:51:05,436 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:51:05,436 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:51:05,436 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:51:05,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:51:05,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:51:05,438 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:51:05,439 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:51:05,439 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:51:05,439 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:51:05,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:51:05,440 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:51:05,440 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:51:05,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:51:05,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:51:05,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:51:05,530 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:51:05,530 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:51:05,531 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c [2018-11-06 19:51:05,598 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f09e13e/9079bc7bb78a43889a66e788ce3bf4fb/FLAGe6e5ae18d [2018-11-06 19:51:06,155 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:51:06,156 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c [2018-11-06 19:51:06,181 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f09e13e/9079bc7bb78a43889a66e788ce3bf4fb/FLAGe6e5ae18d [2018-11-06 19:51:06,204 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f09e13e/9079bc7bb78a43889a66e788ce3bf4fb [2018-11-06 19:51:06,217 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:51:06,219 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:51:06,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:51:06,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:51:06,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:51:06,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:51:06" (1/1) ... [2018-11-06 19:51:06,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e72aa2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06, skipping insertion in model container [2018-11-06 19:51:06,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:51:06" (1/1) ... [2018-11-06 19:51:06,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:51:06,294 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:51:06,788 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:51:06,801 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:51:06,948 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:51:06,972 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:51:06,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06 WrapperNode [2018-11-06 19:51:06,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:51:06,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:51:06,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:51:06,974 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:51:06,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2018-11-06 19:51:07,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2018-11-06 19:51:07,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:51:07,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:51:07,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:51:07,150 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:51:07,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2018-11-06 19:51:07,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2018-11-06 19:51:07,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2018-11-06 19:51:07,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2018-11-06 19:51:07,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2018-11-06 19:51:07,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2018-11-06 19:51:07,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2018-11-06 19:51:07,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:51:07,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:51:07,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:51:07,216 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:51:07,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:51:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:51:07,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:51:07,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:51:10,827 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:51:10,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:51:10 BoogieIcfgContainer [2018-11-06 19:51:10,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:51:10,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:51:10,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:51:10,834 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:51:10,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:51:06" (1/3) ... [2018-11-06 19:51:10,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688968d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:51:10, skipping insertion in model container [2018-11-06 19:51:10,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (2/3) ... [2018-11-06 19:51:10,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688968d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:51:10, skipping insertion in model container [2018-11-06 19:51:10,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:51:10" (3/3) ... [2018-11-06 19:51:10,838 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label14_true-unreach-call_false-termination.c [2018-11-06 19:51:10,851 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:51:10,863 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:51:10,881 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:51:10,929 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:51:10,930 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:51:10,930 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:51:10,930 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:51:10,931 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:51:10,931 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:51:10,931 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:51:10,931 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:51:10,932 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:51:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states. [2018-11-06 19:51:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-06 19:51:10,985 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:10,986 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:10,989 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:10,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:10,995 INFO L82 PathProgramCache]: Analyzing trace with hash -848083396, now seen corresponding path program 1 times [2018-11-06 19:51:10,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:10,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:11,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:11,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:11,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:51:11,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:11,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:51:11,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:51:11,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:51:11,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:11,750 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 4 states. [2018-11-06 19:51:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:14,358 INFO L93 Difference]: Finished difference Result 743 states and 1315 transitions. [2018-11-06 19:51:14,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:51:14,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-11-06 19:51:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:14,383 INFO L225 Difference]: With dead ends: 743 [2018-11-06 19:51:14,383 INFO L226 Difference]: Without dead ends: 508 [2018-11-06 19:51:14,388 INFO L604 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-11-06 19:51:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-11-06 19:51:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2018-11-06 19:51:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-11-06 19:51:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 829 transitions. [2018-11-06 19:51:14,488 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 829 transitions. Word has length 118 [2018-11-06 19:51:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:14,489 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 829 transitions. [2018-11-06 19:51:14,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 829 transitions. [2018-11-06 19:51:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-06 19:51:14,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:14,497 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:14,498 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:14,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:14,499 INFO L82 PathProgramCache]: Analyzing trace with hash 434759549, now seen corresponding path program 1 times [2018-11-06 19:51:14,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:14,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:14,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:14,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:14,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:51:14,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:14,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:51:14,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:51:14,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:51:14,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:14,812 INFO L87 Difference]: Start difference. First operand 508 states and 829 transitions. Second operand 4 states. [2018-11-06 19:51:16,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:16,201 INFO L93 Difference]: Finished difference Result 1629 states and 2718 transitions. [2018-11-06 19:51:16,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:51:16,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-11-06 19:51:16,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:16,210 INFO L225 Difference]: With dead ends: 1629 [2018-11-06 19:51:16,210 INFO L226 Difference]: Without dead ends: 1123 [2018-11-06 19:51:16,214 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-11-06 19:51:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 794. [2018-11-06 19:51:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-11-06 19:51:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1259 transitions. [2018-11-06 19:51:16,277 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1259 transitions. Word has length 137 [2018-11-06 19:51:16,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:16,278 INFO L480 AbstractCegarLoop]: Abstraction has 794 states and 1259 transitions. [2018-11-06 19:51:16,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1259 transitions. [2018-11-06 19:51:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-06 19:51:16,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:16,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:16,290 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:16,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:16,290 INFO L82 PathProgramCache]: Analyzing trace with hash 176948723, now seen corresponding path program 1 times [2018-11-06 19:51:16,291 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:16,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:16,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:16,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:16,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:51:16,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:16,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:51:16,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:51:16,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:51:16,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:16,402 INFO L87 Difference]: Start difference. First operand 794 states and 1259 transitions. Second operand 3 states. [2018-11-06 19:51:19,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:19,767 INFO L93 Difference]: Finished difference Result 2153 states and 3445 transitions. [2018-11-06 19:51:19,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:19,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2018-11-06 19:51:19,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:19,776 INFO L225 Difference]: With dead ends: 2153 [2018-11-06 19:51:19,776 INFO L226 Difference]: Without dead ends: 1361 [2018-11-06 19:51:19,778 INFO L604 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-11-06 19:51:19,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-11-06 19:51:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1361. [2018-11-06 19:51:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2018-11-06 19:51:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2002 transitions. [2018-11-06 19:51:19,825 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2002 transitions. Word has length 141 [2018-11-06 19:51:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:19,825 INFO L480 AbstractCegarLoop]: Abstraction has 1361 states and 2002 transitions. [2018-11-06 19:51:19,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:51:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2002 transitions. [2018-11-06 19:51:19,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-06 19:51:19,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:19,832 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:19,833 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:19,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:19,833 INFO L82 PathProgramCache]: Analyzing trace with hash -425071790, now seen corresponding path program 1 times [2018-11-06 19:51:19,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:19,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:19,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:19,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:19,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:51:20,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:20,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:51:20,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:51:20,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:51:20,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:20,189 INFO L87 Difference]: Start difference. First operand 1361 states and 2002 transitions. Second operand 4 states. [2018-11-06 19:51:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:21,740 INFO L93 Difference]: Finished difference Result 4404 states and 6392 transitions. [2018-11-06 19:51:21,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:51:21,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-11-06 19:51:21,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:21,756 INFO L225 Difference]: With dead ends: 4404 [2018-11-06 19:51:21,757 INFO L226 Difference]: Without dead ends: 3045 [2018-11-06 19:51:21,760 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2018-11-06 19:51:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 3042. [2018-11-06 19:51:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3042 states. [2018-11-06 19:51:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 3904 transitions. [2018-11-06 19:51:21,820 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 3904 transitions. Word has length 142 [2018-11-06 19:51:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:21,821 INFO L480 AbstractCegarLoop]: Abstraction has 3042 states and 3904 transitions. [2018-11-06 19:51:21,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 3904 transitions. [2018-11-06 19:51:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-06 19:51:21,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:21,827 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:21,827 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:21,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash -678146469, now seen corresponding path program 1 times [2018-11-06 19:51:21,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:21,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:21,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:21,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:21,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-06 19:51:22,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:22,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:51:22,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:51:22,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:51:22,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:22,124 INFO L87 Difference]: Start difference. First operand 3042 states and 3904 transitions. Second operand 4 states. [2018-11-06 19:51:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:23,262 INFO L93 Difference]: Finished difference Result 6929 states and 8940 transitions. [2018-11-06 19:51:23,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:51:23,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-11-06 19:51:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:23,279 INFO L225 Difference]: With dead ends: 6929 [2018-11-06 19:51:23,279 INFO L226 Difference]: Without dead ends: 3315 [2018-11-06 19:51:23,284 INFO L604 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-11-06 19:51:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2018-11-06 19:51:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 3312. [2018-11-06 19:51:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2018-11-06 19:51:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 3803 transitions. [2018-11-06 19:51:23,343 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 3803 transitions. Word has length 147 [2018-11-06 19:51:23,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:23,344 INFO L480 AbstractCegarLoop]: Abstraction has 3312 states and 3803 transitions. [2018-11-06 19:51:23,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 3803 transitions. [2018-11-06 19:51:23,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-06 19:51:23,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:23,352 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:23,352 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:23,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:23,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1797222684, now seen corresponding path program 1 times [2018-11-06 19:51:23,353 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:23,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:23,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:23,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:23,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:23,611 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 19:51:23,894 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-11-06 19:51:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:51:24,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:24,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:51:24,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:51:24,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:51:24,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:51:24,110 INFO L87 Difference]: Start difference. First operand 3312 states and 3803 transitions. Second operand 7 states. [2018-11-06 19:51:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:27,551 INFO L93 Difference]: Finished difference Result 7918 states and 9073 transitions. [2018-11-06 19:51:27,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 19:51:27,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 187 [2018-11-06 19:51:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:27,566 INFO L225 Difference]: With dead ends: 7918 [2018-11-06 19:51:27,566 INFO L226 Difference]: Without dead ends: 4038 [2018-11-06 19:51:27,571 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:51:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4038 states. [2018-11-06 19:51:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4038 to 4011. [2018-11-06 19:51:27,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4011 states. [2018-11-06 19:51:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4011 states to 4011 states and 4534 transitions. [2018-11-06 19:51:27,643 INFO L78 Accepts]: Start accepts. Automaton has 4011 states and 4534 transitions. Word has length 187 [2018-11-06 19:51:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:27,643 INFO L480 AbstractCegarLoop]: Abstraction has 4011 states and 4534 transitions. [2018-11-06 19:51:27,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:51:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4011 states and 4534 transitions. [2018-11-06 19:51:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-06 19:51:27,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:27,651 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:27,651 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:27,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:27,652 INFO L82 PathProgramCache]: Analyzing trace with hash -729202110, now seen corresponding path program 1 times [2018-11-06 19:51:27,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:27,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:27,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:27,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:27,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:28,174 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 19:51:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:51:28,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:28,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:51:28,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:51:28,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:51:28,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:28,221 INFO L87 Difference]: Start difference. First operand 4011 states and 4534 transitions. Second operand 4 states. [2018-11-06 19:51:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:29,958 INFO L93 Difference]: Finished difference Result 7447 states and 8403 transitions. [2018-11-06 19:51:29,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:51:29,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-11-06 19:51:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:29,973 INFO L225 Difference]: With dead ends: 7447 [2018-11-06 19:51:29,973 INFO L226 Difference]: Without dead ends: 3153 [2018-11-06 19:51:29,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:29,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2018-11-06 19:51:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 3152. [2018-11-06 19:51:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3152 states. [2018-11-06 19:51:30,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 3438 transitions. [2018-11-06 19:51:30,031 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 3438 transitions. Word has length 197 [2018-11-06 19:51:30,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:30,031 INFO L480 AbstractCegarLoop]: Abstraction has 3152 states and 3438 transitions. [2018-11-06 19:51:30,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:30,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 3438 transitions. [2018-11-06 19:51:30,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-06 19:51:30,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:30,037 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:30,037 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:30,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:30,038 INFO L82 PathProgramCache]: Analyzing trace with hash -6690783, now seen corresponding path program 1 times [2018-11-06 19:51:30,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:30,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:30,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:30,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:30,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-06 19:51:30,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:30,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:51:30,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:51:30,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:51:30,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:30,236 INFO L87 Difference]: Start difference. First operand 3152 states and 3438 transitions. Second operand 3 states. [2018-11-06 19:51:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:31,855 INFO L93 Difference]: Finished difference Result 6305 states and 6878 transitions. [2018-11-06 19:51:31,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:31,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-11-06 19:51:31,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:31,871 INFO L225 Difference]: With dead ends: 6305 [2018-11-06 19:51:31,871 INFO L226 Difference]: Without dead ends: 3155 [2018-11-06 19:51:31,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:31,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2018-11-06 19:51:31,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 3152. [2018-11-06 19:51:31,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3152 states. [2018-11-06 19:51:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 3406 transitions. [2018-11-06 19:51:31,923 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 3406 transitions. Word has length 218 [2018-11-06 19:51:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:31,924 INFO L480 AbstractCegarLoop]: Abstraction has 3152 states and 3406 transitions. [2018-11-06 19:51:31,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:51:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 3406 transitions. [2018-11-06 19:51:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-11-06 19:51:31,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:31,932 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:31,932 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:31,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash 425851221, now seen corresponding path program 1 times [2018-11-06 19:51:31,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:31,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:31,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:31,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:31,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-06 19:51:32,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:32,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:51:32,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:51:32,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:51:32,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:32,193 INFO L87 Difference]: Start difference. First operand 3152 states and 3406 transitions. Second operand 4 states. [2018-11-06 19:51:32,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:32,766 INFO L93 Difference]: Finished difference Result 5303 states and 5747 transitions. [2018-11-06 19:51:32,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:32,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 280 [2018-11-06 19:51:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:32,774 INFO L225 Difference]: With dead ends: 5303 [2018-11-06 19:51:32,774 INFO L226 Difference]: Without dead ends: 1868 [2018-11-06 19:51:32,777 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2018-11-06 19:51:32,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1727. [2018-11-06 19:51:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1727 states. [2018-11-06 19:51:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 1815 transitions. [2018-11-06 19:51:32,803 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 1815 transitions. Word has length 280 [2018-11-06 19:51:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:32,803 INFO L480 AbstractCegarLoop]: Abstraction has 1727 states and 1815 transitions. [2018-11-06 19:51:32,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:32,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 1815 transitions. [2018-11-06 19:51:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-06 19:51:32,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:32,810 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:32,810 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:32,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:32,811 INFO L82 PathProgramCache]: Analyzing trace with hash -428675868, now seen corresponding path program 1 times [2018-11-06 19:51:32,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:32,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:32,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:32,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:32,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 312 proven. 61 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-06 19:51:33,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:51:33,494 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:51:33,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:33,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:51:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-06 19:51:33,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:51:33,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-11-06 19:51:33,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 19:51:33,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 19:51:33,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:51:33,890 INFO L87 Difference]: Start difference. First operand 1727 states and 1815 transitions. Second operand 10 states. [2018-11-06 19:51:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:39,299 INFO L93 Difference]: Finished difference Result 3481 states and 3660 transitions. [2018-11-06 19:51:39,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 19:51:39,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 306 [2018-11-06 19:51:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:39,301 INFO L225 Difference]: With dead ends: 3481 [2018-11-06 19:51:39,301 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:51:39,304 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2018-11-06 19:51:39,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:51:39,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:51:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:51:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:51:39,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 306 [2018-11-06 19:51:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:39,306 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:51:39,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 19:51:39,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:51:39,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:51:39,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:51:40,487 WARN L179 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-11-06 19:51:40,884 WARN L179 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-11-06 19:51:40,888 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,888 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,888 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,888 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-06 19:51:40,888 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-06 19:51:40,889 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-06 19:51:40,890 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-06 19:51:40,890 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-06 19:51:40,890 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-06 19:51:40,890 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-06 19:51:40,890 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,890 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,890 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,891 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-06 19:51:40,891 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-06 19:51:40,891 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-06 19:51:40,891 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-06 19:51:40,891 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-06 19:51:40,891 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-06 19:51:40,891 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-06 19:51:40,891 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,891 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,892 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,892 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-06 19:51:40,892 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-06 19:51:40,892 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-06 19:51:40,892 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-06 19:51:40,892 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-06 19:51:40,892 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,892 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,892 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,892 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-06 19:51:40,892 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-06 19:51:40,893 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-06 19:51:40,893 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-06 19:51:40,893 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-06 19:51:40,893 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-06 19:51:40,893 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-06 19:51:40,893 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-06 19:51:40,893 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,893 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,893 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,893 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-06 19:51:40,893 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-06 19:51:40,893 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-06 19:51:40,893 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-06 19:51:40,893 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-06 19:51:40,894 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-06 19:51:40,894 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-06 19:51:40,894 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-06 19:51:40,894 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,894 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,894 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,894 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-06 19:51:40,894 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-06 19:51:40,894 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-06 19:51:40,894 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-06 19:51:40,894 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-06 19:51:40,894 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-06 19:51:40,894 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-06 19:51:40,894 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-06 19:51:40,895 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-06 19:51:40,895 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,895 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,895 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,895 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-06 19:51:40,895 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-06 19:51:40,896 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-06 19:51:40,896 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-06 19:51:40,896 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-06 19:51:40,896 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-06 19:51:40,896 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,896 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,896 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,896 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-06 19:51:40,896 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-06 19:51:40,897 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-06 19:51:40,897 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-06 19:51:40,897 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-06 19:51:40,897 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 19:51:40,897 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-06 19:51:40,897 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-06 19:51:40,897 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-06 19:51:40,897 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,897 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,897 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,897 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-06 19:51:40,897 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-06 19:51:40,898 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-06 19:51:40,898 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-06 19:51:40,898 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-06 19:51:40,898 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,898 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,898 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,898 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-06 19:51:40,898 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-06 19:51:40,898 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-06 19:51:40,898 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-06 19:51:40,898 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-06 19:51:40,898 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-06 19:51:40,898 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-06 19:51:40,898 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-06 19:51:40,899 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-06 19:51:40,899 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 523) no Hoare annotation was computed. [2018-11-06 19:51:40,899 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-06 19:51:40,899 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 19:51:40,899 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-06 19:51:40,899 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,899 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,899 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-06 19:51:40,899 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-06 19:51:40,899 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-06 19:51:40,899 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-06 19:51:40,899 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-06 19:51:40,900 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-06 19:51:40,900 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-06 19:51:40,900 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-06 19:51:40,900 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-06 19:51:40,900 INFO L421 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse3 (= ~a25~0 1))) (let ((.cse15 (not .cse3)) (.cse8 (= ~a11~0 1)) (.cse7 (not (= ULTIMATE.start_calculate_output_~input 5))) (.cse9 (= ~a17~0 8)) (.cse5 (= ~a19~0 1)) (.cse10 (= ~a28~0 7)) (.cse11 (= ~a21~0 1)) (.cse0 (= ~a28~0 9))) (let ((.cse1 (<= ~a17~0 7)) (.cse4 (= ~a28~0 11)) (.cse6 (not .cse0)) (.cse2 (<= ~a19~0 0)) (.cse13 (or .cse8 (and .cse7 .cse9 .cse5 .cse10 .cse11))) (.cse14 (= ~a28~0 10)) (.cse12 (and .cse15 .cse9))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse3) (and .cse1 .cse5 .cse3 .cse6) (and (or .cse7 .cse8) .cse9 .cse5 .cse10 .cse11 (<= ~a25~0 0)) (and .cse2 .cse9 .cse11 .cse6 (not .cse4)) (and (and .cse12 .cse2 .cse6) .cse11) (and .cse13 .cse2 .cse12) (and .cse0 .cse13 .cse12) (and .cse9 .cse5 .cse11 .cse3) (and .cse13 .cse14 .cse15) (and .cse14 .cse5) (and .cse0 .cse12 .cse5 .cse11))))) [2018-11-06 19:51:40,901 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,901 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,901 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-06 19:51:40,901 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-06 19:51:40,901 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-06 19:51:40,901 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-06 19:51:40,901 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-06 19:51:40,901 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-06 19:51:40,901 INFO L428 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2018-11-06 19:51:40,901 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,901 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,901 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-06 19:51:40,901 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-06 19:51:40,901 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-06 19:51:40,903 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-06 19:51:40,903 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-06 19:51:40,903 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-06 19:51:40,903 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-06 19:51:40,903 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-06 19:51:40,903 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-06 19:51:40,903 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,904 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,904 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-06 19:51:40,904 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-06 19:51:40,904 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-06 19:51:40,904 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-06 19:51:40,904 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-06 19:51:40,904 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-06 19:51:40,904 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-06 19:51:40,904 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,905 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse3 (= ~a25~0 1))) (let ((.cse12 (not .cse3)) (.cse7 (= ~a17~0 8)) (.cse5 (= ~a19~0 1)) (.cse13 (= ~a28~0 7)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a28~0 9))) (let ((.cse1 (<= ~a17~0 7)) (.cse4 (= ~a28~0 11)) (.cse6 (not .cse0)) (.cse2 (<= ~a19~0 0)) (.cse10 (or (= ~a11~0 1) (and (not (= ULTIMATE.start_calculate_output_~input 5)) .cse7 .cse5 .cse13 .cse8))) (.cse11 (= ~a28~0 10)) (.cse9 (and .cse12 .cse7))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse3) (and .cse1 .cse5 .cse3 .cse6) (and .cse2 .cse7 .cse8 .cse6 (not .cse4)) (and (and .cse9 .cse2 .cse6) .cse8) (and .cse10 .cse2 .cse9) (and .cse0 .cse10 .cse9) (and .cse7 .cse5 .cse8 .cse3) (and .cse10 .cse11 .cse12) (and .cse5 .cse7 .cse13 (<= ~a25~0 0) .cse8) (and .cse11 .cse5) (and .cse0 .cse9 .cse5 .cse8))))) [2018-11-06 19:51:40,905 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,905 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-06 19:51:40,905 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-06 19:51:40,905 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-06 19:51:40,906 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-06 19:51:40,906 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-06 19:51:40,906 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,906 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,906 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-06 19:51:40,906 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-06 19:51:40,906 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-06 19:51:40,906 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-06 19:51:40,906 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-06 19:51:40,906 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-06 19:51:40,906 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-06 19:51:40,906 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-06 19:51:40,907 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-06 19:51:40,907 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,907 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,907 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-06 19:51:40,907 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,907 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-06 19:51:40,907 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-06 19:51:40,907 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-06 19:51:40,907 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-06 19:51:40,907 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-06 19:51:40,907 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 19:51:40,907 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-06 19:51:40,907 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,907 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,908 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,908 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-06 19:51:40,908 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-06 19:51:40,908 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-06 19:51:40,908 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-06 19:51:40,908 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-06 19:51:40,908 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,908 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,908 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,908 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-06 19:51:40,908 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-06 19:51:40,908 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-06 19:51:40,908 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-06 19:51:40,908 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-06 19:51:40,909 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-06 19:51:40,909 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,909 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,909 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,909 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-06 19:51:40,909 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-06 19:51:40,909 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-06 19:51:40,909 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-06 19:51:40,909 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-06 19:51:40,909 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-06 19:51:40,909 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 19:51:40,909 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-06 19:51:40,909 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-06 19:51:40,910 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,910 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,910 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,910 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-06 19:51:40,910 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-06 19:51:40,910 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-06 19:51:40,910 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-06 19:51:40,910 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-06 19:51:40,910 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,910 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,910 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:40,910 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-06 19:51:40,910 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-06 19:51:40,910 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-06 19:51:40,911 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-06 19:51:40,911 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-06 19:51:40,911 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-06 19:51:40,911 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-06 19:51:40,911 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-06 19:51:40,911 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-06 19:51:40,911 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-06 19:51:40,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:51:40 BoogieIcfgContainer [2018-11-06 19:51:40,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:51:40,938 INFO L168 Benchmark]: Toolchain (without parser) took 34720.08 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -530.6 MB). Peak memory consumption was 572.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:40,939 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:51:40,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:40,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 176.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:40,942 INFO L168 Benchmark]: Boogie Preprocessor took 65.33 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:51:40,942 INFO L168 Benchmark]: RCFGBuilder took 3613.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.7 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:40,943 INFO L168 Benchmark]: TraceAbstraction took 30106.45 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 365.4 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 131.5 MB). Peak memory consumption was 496.9 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:40,949 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 753.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 176.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.33 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3613.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.7 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30106.45 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 365.4 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 131.5 MB). Peak memory consumption was 496.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 523]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((a28 == 9 && a17 <= 7) && a19 <= 0) && a25 == 1) || ((a28 == 11 && a19 == 1) && a25 == 1)) || (((a17 <= 7 && a19 == 1) && a25 == 1) && !(a28 == 9))) || ((((a19 <= 0 && a17 == 8) && a21 == 1) && !(a28 == 9)) && !(a28 == 11))) || ((((!(a25 == 1) && a17 == 8) && a19 <= 0) && !(a28 == 9)) && a21 == 1)) || (((a11 == 1 || ((((!(input == 5) && a17 == 8) && a19 == 1) && a28 == 7) && a21 == 1)) && a19 <= 0) && !(a25 == 1) && a17 == 8)) || ((a28 == 9 && (a11 == 1 || ((((!(input == 5) && a17 == 8) && a19 == 1) && a28 == 7) && a21 == 1))) && !(a25 == 1) && a17 == 8)) || (((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1)) || (((a11 == 1 || ((((!(input == 5) && a17 == 8) && a19 == 1) && a28 == 7) && a21 == 1)) && a28 == 10) && !(a25 == 1))) || ((((a19 == 1 && a17 == 8) && a28 == 7) && a25 <= 0) && a21 == 1)) || (a28 == 10 && a19 == 1)) || (((a28 == 9 && !(a25 == 1) && a17 == 8) && a19 == 1) && a21 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((a28 == 9 && a17 <= 7) && a19 <= 0) && a25 == 1) || ((a28 == 11 && a19 == 1) && a25 == 1)) || (((a17 <= 7 && a19 == 1) && a25 == 1) && !(a28 == 9))) || ((((((!(input == 5) || a11 == 1) && a17 == 8) && a19 == 1) && a28 == 7) && a21 == 1) && a25 <= 0)) || ((((a19 <= 0 && a17 == 8) && a21 == 1) && !(a28 == 9)) && !(a28 == 11))) || ((((!(a25 == 1) && a17 == 8) && a19 <= 0) && !(a28 == 9)) && a21 == 1)) || (((a11 == 1 || ((((!(input == 5) && a17 == 8) && a19 == 1) && a28 == 7) && a21 == 1)) && a19 <= 0) && !(a25 == 1) && a17 == 8)) || ((a28 == 9 && (a11 == 1 || ((((!(input == 5) && a17 == 8) && a19 == 1) && a28 == 7) && a21 == 1))) && !(a25 == 1) && a17 == 8)) || (((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1)) || (((a11 == 1 || ((((!(input == 5) && a17 == 8) && a19 == 1) && a28 == 7) && a21 == 1)) && a28 == 10) && !(a25 == 1))) || (a28 == 10 && a19 == 1)) || (((a28 == 9 && !(a25 == 1) && a17 == 8) && a19 == 1) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 228 locations, 1 error locations. SAFE Result, 29.9s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 23.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1676 SDtfs, 3727 SDslu, 898 SDs, 0 SdLazy, 8749 SolverSat, 1302 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 324 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4011occurred 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, 10 MinimizatonAttempts, 507 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 74 NumberOfFragments, 459 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1581 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 466 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2179 NumberOfCodeBlocks, 2179 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2168 ConstructedInterpolants, 0 QuantifiedInterpolants, 1465138 SizeOfPredicates, 1 NumberOfNonLiveVariables, 475 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1471/1532 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...