/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label14.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:30:19,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:30:19,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:30:19,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:30:19,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:30:19,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:30:19,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:30:19,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:30:19,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:30:19,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:30:19,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:30:19,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:30:19,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:30:19,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:30:19,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:30:19,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:30:19,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:30:19,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:30:19,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:30:19,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:30:19,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:30:19,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:30:19,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:30:19,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:30:19,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:30:19,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:30:19,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:30:19,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:30:19,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:30:19,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:30:19,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:30:19,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:30:19,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:30:19,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:30:19,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:30:19,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:30:19,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:30:19,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:30:19,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:30:19,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:30:19,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:30:19,062 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:30:19,078 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:30:19,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:30:19,079 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:30:19,079 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:30:19,079 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:30:19,079 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:30:19,080 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:30:19,080 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:30:19,080 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:30:19,080 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:30:19,080 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:30:19,081 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:30:19,081 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:30:19,081 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:30:19,081 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:30:19,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:30:19,082 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:30:19,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:30:19,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:30:19,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:30:19,083 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:30:19,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:30:19,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:30:19,083 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:30:19,084 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:30:19,084 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:30:19,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:30:19,084 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:30:19,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:30:19,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:19,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:30:19,085 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:30:19,085 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:30:19,085 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:30:19,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:30:19,086 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:30:19,086 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:30:19,086 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:30:19,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:30:19,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:30:19,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:30:19,366 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:30:19,367 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:30:19,367 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label14.c [2019-11-23 23:30:19,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62af6f0d2/db8368766bd44ed8998236408a78bd10/FLAGf7b72e8ec [2019-11-23 23:30:20,001 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:30:20,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label14.c [2019-11-23 23:30:20,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62af6f0d2/db8368766bd44ed8998236408a78bd10/FLAGf7b72e8ec [2019-11-23 23:30:20,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62af6f0d2/db8368766bd44ed8998236408a78bd10 [2019-11-23 23:30:20,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:30:20,337 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:30:20,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:20,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:30:20,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:30:20,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:20" (1/1) ... [2019-11-23 23:30:20,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b98ce2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:20, skipping insertion in model container [2019-11-23 23:30:20,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:20" (1/1) ... [2019-11-23 23:30:20,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:30:20,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:30:20,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:20,885 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:30:20,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:21,011 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:30:21,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:21 WrapperNode [2019-11-23 23:30:21,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:21,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:21,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:30:21,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:30:21,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:21" (1/1) ... [2019-11-23 23:30:21,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:21" (1/1) ... [2019-11-23 23:30:21,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:21,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:30:21,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:30:21,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:30:21,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:21" (1/1) ... [2019-11-23 23:30:21,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:21" (1/1) ... [2019-11-23 23:30:21,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:21" (1/1) ... [2019-11-23 23:30:21,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:21" (1/1) ... [2019-11-23 23:30:21,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:21" (1/1) ... [2019-11-23 23:30:21,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:21" (1/1) ... [2019-11-23 23:30:21,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:21" (1/1) ... [2019-11-23 23:30:21,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:30:21,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:30:21,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:30:21,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:30:21,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:21,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:30:21,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:30:23,343 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:30:23,343 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:30:23,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:23 BoogieIcfgContainer [2019-11-23 23:30:23,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:30:23,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:30:23,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:30:23,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:30:23,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:20" (1/3) ... [2019-11-23 23:30:23,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a87c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:23, skipping insertion in model container [2019-11-23 23:30:23,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:21" (2/3) ... [2019-11-23 23:30:23,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a87c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:23, skipping insertion in model container [2019-11-23 23:30:23,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:23" (3/3) ... [2019-11-23 23:30:23,357 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label14.c [2019-11-23 23:30:23,366 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:30:23,374 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:30:23,385 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:30:23,417 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:30:23,417 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:30:23,417 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:30:23,417 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:30:23,418 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:30:23,418 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:30:23,418 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:30:23,418 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:30:23,439 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:30:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:30:23,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:23,451 INFO L410 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] [2019-11-23 23:30:23,452 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:23,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:23,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1323228825, now seen corresponding path program 1 times [2019-11-23 23:30:23,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:23,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384806972] [2019-11-23 23:30:23,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:23,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384806972] [2019-11-23 23:30:23,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:23,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:23,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423607339] [2019-11-23 23:30:23,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:23,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:23,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:23,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:23,851 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-11-23 23:30:24,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:24,439 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2019-11-23 23:30:24,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:24,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-23 23:30:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:24,462 INFO L225 Difference]: With dead ends: 224 [2019-11-23 23:30:24,462 INFO L226 Difference]: Without dead ends: 145 [2019-11-23 23:30:24,466 INFO L630 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 [2019-11-23 23:30:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-23 23:30:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-11-23 23:30:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:30:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:30:24,518 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:30:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:24,519 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:30:24,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:30:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 23:30:24,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:24,522 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:30:24,523 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:24,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:24,523 INFO L82 PathProgramCache]: Analyzing trace with hash 585788895, now seen corresponding path program 1 times [2019-11-23 23:30:24,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:24,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198173940] [2019-11-23 23:30:24,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:24,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198173940] [2019-11-23 23:30:24,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:24,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:24,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655111674] [2019-11-23 23:30:24,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:24,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:24,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:24,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:24,602 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:30:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:25,037 INFO L93 Difference]: Finished difference Result 431 states and 774 transitions. [2019-11-23 23:30:25,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:25,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-23 23:30:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:25,041 INFO L225 Difference]: With dead ends: 431 [2019-11-23 23:30:25,041 INFO L226 Difference]: Without dead ends: 287 [2019-11-23 23:30:25,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:25,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-23 23:30:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-11-23 23:30:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-23 23:30:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 479 transitions. [2019-11-23 23:30:25,064 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 479 transitions. Word has length 76 [2019-11-23 23:30:25,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:25,064 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 479 transitions. [2019-11-23 23:30:25,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 479 transitions. [2019-11-23 23:30:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 23:30:25,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:25,069 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:30:25,069 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:25,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1566174005, now seen corresponding path program 1 times [2019-11-23 23:30:25,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:25,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309987356] [2019-11-23 23:30:25,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:25,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309987356] [2019-11-23 23:30:25,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:25,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:25,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714380467] [2019-11-23 23:30:25,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:25,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:25,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:25,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:25,156 INFO L87 Difference]: Start difference. First operand 287 states and 479 transitions. Second operand 3 states. [2019-11-23 23:30:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:25,606 INFO L93 Difference]: Finished difference Result 644 states and 1076 transitions. [2019-11-23 23:30:25,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:25,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 23:30:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:25,609 INFO L225 Difference]: With dead ends: 644 [2019-11-23 23:30:25,609 INFO L226 Difference]: Without dead ends: 358 [2019-11-23 23:30:25,611 INFO L630 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 [2019-11-23 23:30:25,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-23 23:30:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 287. [2019-11-23 23:30:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-23 23:30:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 473 transitions. [2019-11-23 23:30:25,631 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 473 transitions. Word has length 84 [2019-11-23 23:30:25,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:25,632 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 473 transitions. [2019-11-23 23:30:25,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 473 transitions. [2019-11-23 23:30:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 23:30:25,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:25,636 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:25,636 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:25,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:25,636 INFO L82 PathProgramCache]: Analyzing trace with hash -81006691, now seen corresponding path program 1 times [2019-11-23 23:30:25,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:25,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160234460] [2019-11-23 23:30:25,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:30:25,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160234460] [2019-11-23 23:30:25,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:25,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:25,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788062329] [2019-11-23 23:30:25,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:25,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:25,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:25,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:25,692 INFO L87 Difference]: Start difference. First operand 287 states and 473 transitions. Second operand 4 states. [2019-11-23 23:30:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:26,246 INFO L93 Difference]: Finished difference Result 1070 states and 1768 transitions. [2019-11-23 23:30:26,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:26,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-23 23:30:26,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:26,250 INFO L225 Difference]: With dead ends: 1070 [2019-11-23 23:30:26,251 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:30:26,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:26,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:30:26,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 713. [2019-11-23 23:30:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:30:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1104 transitions. [2019-11-23 23:30:26,287 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1104 transitions. Word has length 93 [2019-11-23 23:30:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:26,288 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1104 transitions. [2019-11-23 23:30:26,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1104 transitions. [2019-11-23 23:30:26,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 23:30:26,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:26,298 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:26,298 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:26,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:26,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2009845772, now seen corresponding path program 1 times [2019-11-23 23:30:26,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:26,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793491320] [2019-11-23 23:30:26,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:30:26,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793491320] [2019-11-23 23:30:26,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:26,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:26,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082515001] [2019-11-23 23:30:26,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:26,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:26,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:26,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:26,466 INFO L87 Difference]: Start difference. First operand 713 states and 1104 transitions. Second operand 4 states. [2019-11-23 23:30:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:26,921 INFO L93 Difference]: Finished difference Result 1513 states and 2313 transitions. [2019-11-23 23:30:26,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:30:26,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-23 23:30:26,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:26,926 INFO L225 Difference]: With dead ends: 1513 [2019-11-23 23:30:26,926 INFO L226 Difference]: Without dead ends: 801 [2019-11-23 23:30:26,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:30:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-11-23 23:30:26,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 784. [2019-11-23 23:30:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:30:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1181 transitions. [2019-11-23 23:30:26,952 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1181 transitions. Word has length 99 [2019-11-23 23:30:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:26,952 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1181 transitions. [2019-11-23 23:30:26,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1181 transitions. [2019-11-23 23:30:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 23:30:26,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:26,955 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:26,955 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:26,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:26,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1788105284, now seen corresponding path program 1 times [2019-11-23 23:30:26,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:26,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29024382] [2019-11-23 23:30:26,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:30:27,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29024382] [2019-11-23 23:30:27,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:27,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:27,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166350714] [2019-11-23 23:30:27,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:27,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:27,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:27,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:27,020 INFO L87 Difference]: Start difference. First operand 784 states and 1181 transitions. Second operand 4 states. [2019-11-23 23:30:27,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:27,530 INFO L93 Difference]: Finished difference Result 1567 states and 2373 transitions. [2019-11-23 23:30:27,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:27,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-23 23:30:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:27,535 INFO L225 Difference]: With dead ends: 1567 [2019-11-23 23:30:27,535 INFO L226 Difference]: Without dead ends: 855 [2019-11-23 23:30:27,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:27,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-23 23:30:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2019-11-23 23:30:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:30:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1252 transitions. [2019-11-23 23:30:27,557 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1252 transitions. Word has length 103 [2019-11-23 23:30:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:27,558 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1252 transitions. [2019-11-23 23:30:27,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1252 transitions. [2019-11-23 23:30:27,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 23:30:27,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:27,561 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:27,561 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1752329663, now seen corresponding path program 1 times [2019-11-23 23:30:27,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:27,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679217512] [2019-11-23 23:30:27,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:30:27,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679217512] [2019-11-23 23:30:27,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:27,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:27,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622770236] [2019-11-23 23:30:27,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:27,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:27,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:27,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:27,616 INFO L87 Difference]: Start difference. First operand 855 states and 1252 transitions. Second operand 3 states. [2019-11-23 23:30:27,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:27,961 INFO L93 Difference]: Finished difference Result 1993 states and 2962 transitions. [2019-11-23 23:30:27,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:27,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-23 23:30:27,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:27,967 INFO L225 Difference]: With dead ends: 1993 [2019-11-23 23:30:27,967 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:30:27,969 INFO L630 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 [2019-11-23 23:30:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:30:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 997. [2019-11-23 23:30:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:30:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1241 transitions. [2019-11-23 23:30:27,993 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1241 transitions. Word has length 106 [2019-11-23 23:30:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:27,993 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1241 transitions. [2019-11-23 23:30:27,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1241 transitions. [2019-11-23 23:30:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 23:30:27,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:27,996 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:27,996 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:27,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:27,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1472778845, now seen corresponding path program 1 times [2019-11-23 23:30:27,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:27,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870101337] [2019-11-23 23:30:27,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:28,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870101337] [2019-11-23 23:30:28,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:28,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:28,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334569688] [2019-11-23 23:30:28,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:30:28,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:28,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:30:28,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:30:28,132 INFO L87 Difference]: Start difference. First operand 997 states and 1241 transitions. Second operand 5 states. [2019-11-23 23:30:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:28,813 INFO L93 Difference]: Finished difference Result 2634 states and 3343 transitions. [2019-11-23 23:30:28,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:30:28,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-23 23:30:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:28,821 INFO L225 Difference]: With dead ends: 2634 [2019-11-23 23:30:28,821 INFO L226 Difference]: Without dead ends: 1709 [2019-11-23 23:30:28,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:30:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2019-11-23 23:30:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1423. [2019-11-23 23:30:28,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2019-11-23 23:30:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1720 transitions. [2019-11-23 23:30:28,855 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1720 transitions. Word has length 121 [2019-11-23 23:30:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:28,856 INFO L462 AbstractCegarLoop]: Abstraction has 1423 states and 1720 transitions. [2019-11-23 23:30:28,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:30:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1720 transitions. [2019-11-23 23:30:28,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 23:30:28,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:28,859 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-23 23:30:28,860 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:28,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:28,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1169271607, now seen corresponding path program 1 times [2019-11-23 23:30:28,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:28,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002408555] [2019-11-23 23:30:28,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-23 23:30:28,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002408555] [2019-11-23 23:30:28,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:28,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:28,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618226667] [2019-11-23 23:30:28,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:28,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:28,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:28,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:28,979 INFO L87 Difference]: Start difference. First operand 1423 states and 1720 transitions. Second operand 4 states. [2019-11-23 23:30:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:29,494 INFO L93 Difference]: Finished difference Result 2989 states and 3642 transitions. [2019-11-23 23:30:29,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:29,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-23 23:30:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:29,503 INFO L225 Difference]: With dead ends: 2989 [2019-11-23 23:30:29,503 INFO L226 Difference]: Without dead ends: 1567 [2019-11-23 23:30:29,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2019-11-23 23:30:29,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1423. [2019-11-23 23:30:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2019-11-23 23:30:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1625 transitions. [2019-11-23 23:30:29,565 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1625 transitions. Word has length 150 [2019-11-23 23:30:29,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:29,566 INFO L462 AbstractCegarLoop]: Abstraction has 1423 states and 1625 transitions. [2019-11-23 23:30:29,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1625 transitions. [2019-11-23 23:30:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-23 23:30:29,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:29,570 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:30:29,570 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1219974953, now seen corresponding path program 1 times [2019-11-23 23:30:29,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:29,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32024694] [2019-11-23 23:30:29,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-23 23:30:29,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32024694] [2019-11-23 23:30:29,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:29,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:29,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827179988] [2019-11-23 23:30:29,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:29,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:29,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:29,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:29,709 INFO L87 Difference]: Start difference. First operand 1423 states and 1625 transitions. Second operand 3 states. [2019-11-23 23:30:30,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:30,002 INFO L93 Difference]: Finished difference Result 2916 states and 3345 transitions. [2019-11-23 23:30:30,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:30,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-23 23:30:30,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:30,018 INFO L225 Difference]: With dead ends: 2916 [2019-11-23 23:30:30,018 INFO L226 Difference]: Without dead ends: 1423 [2019-11-23 23:30:30,020 INFO L630 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 [2019-11-23 23:30:30,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-11-23 23:30:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1281. [2019-11-23 23:30:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2019-11-23 23:30:30,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1425 transitions. [2019-11-23 23:30:30,052 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1425 transitions. Word has length 175 [2019-11-23 23:30:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:30,052 INFO L462 AbstractCegarLoop]: Abstraction has 1281 states and 1425 transitions. [2019-11-23 23:30:30,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:30,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1425 transitions. [2019-11-23 23:30:30,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-23 23:30:30,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:30,056 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:30:30,056 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:30,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:30,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2139720188, now seen corresponding path program 1 times [2019-11-23 23:30:30,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:30,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669871185] [2019-11-23 23:30:30,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-23 23:30:30,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669871185] [2019-11-23 23:30:30,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:30,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:30,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369477148] [2019-11-23 23:30:30,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:30,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:30,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:30,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:30,165 INFO L87 Difference]: Start difference. First operand 1281 states and 1425 transitions. Second operand 4 states. [2019-11-23 23:30:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:30,634 INFO L93 Difference]: Finished difference Result 2561 states and 2853 transitions. [2019-11-23 23:30:30,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:30,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-23 23:30:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:30,639 INFO L225 Difference]: With dead ends: 2561 [2019-11-23 23:30:30,639 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 23:30:30,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 23:30:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 784. [2019-11-23 23:30:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:30:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 851 transitions. [2019-11-23 23:30:30,659 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 851 transitions. Word has length 177 [2019-11-23 23:30:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:30,659 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 851 transitions. [2019-11-23 23:30:30,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 851 transitions. [2019-11-23 23:30:30,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-23 23:30:30,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:30,662 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:30:30,662 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:30,663 INFO L82 PathProgramCache]: Analyzing trace with hash -238276965, now seen corresponding path program 1 times [2019-11-23 23:30:30,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:30,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422588297] [2019-11-23 23:30:30,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-23 23:30:30,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422588297] [2019-11-23 23:30:30,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:30,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:30,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724955928] [2019-11-23 23:30:30,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:30,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:30,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:30,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:30,828 INFO L87 Difference]: Start difference. First operand 784 states and 851 transitions. Second operand 4 states. [2019-11-23 23:30:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:31,084 INFO L93 Difference]: Finished difference Result 1567 states and 1701 transitions. [2019-11-23 23:30:31,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:31,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-11-23 23:30:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:31,087 INFO L225 Difference]: With dead ends: 1567 [2019-11-23 23:30:31,087 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:30:31,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:31,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:30:31,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 713. [2019-11-23 23:30:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:30:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 773 transitions. [2019-11-23 23:30:31,104 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 773 transitions. Word has length 199 [2019-11-23 23:30:31,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:31,104 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 773 transitions. [2019-11-23 23:30:31,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:31,105 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 773 transitions. [2019-11-23 23:30:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-23 23:30:31,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:31,108 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:31,108 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:31,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:31,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1066068012, now seen corresponding path program 1 times [2019-11-23 23:30:31,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:31,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968259855] [2019-11-23 23:30:31,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-23 23:30:31,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968259855] [2019-11-23 23:30:31,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:31,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:31,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232549114] [2019-11-23 23:30:31,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:31,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:31,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:31,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:31,290 INFO L87 Difference]: Start difference. First operand 713 states and 773 transitions. Second operand 4 states. [2019-11-23 23:30:31,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:31,664 INFO L93 Difference]: Finished difference Result 1707 states and 1832 transitions. [2019-11-23 23:30:31,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:31,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2019-11-23 23:30:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:31,665 INFO L225 Difference]: With dead ends: 1707 [2019-11-23 23:30:31,665 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:30:31,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:30:31,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:30:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:30:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:30:31,668 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 222 [2019-11-23 23:30:31,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:31,668 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:30:31,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:31,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:30:31,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:30:31,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:30:32,129 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-11-23 23:30:32,464 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-11-23 23:30:32,468 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:30:32,468 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:30:32,468 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:32,468 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:30:32,469 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:30:32,469 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:30:32,469 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:30:32,469 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:32,469 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:30:32,469 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:30:32,469 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 23:30:32,469 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:30:32,470 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:30:32,470 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:30:32,470 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:30:32,470 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:30:32,470 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:30:32,470 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:30:32,470 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:30:32,470 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:30:32,471 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse12 (= ~a16~0 6))) (let ((.cse1 (= 15 ~a8~0)) (.cse9 (= ~a21~0 1)) (.cse5 (<= ~a7~0 0)) (.cse2 (= ~a16~0 5)) (.cse7 (not .cse12)) (.cse0 (= 1 ~a7~0)) (.cse13 (= 13 ~a8~0)) (.cse4 (<= ~a17~0 0)) (.cse6 (not .cse10)) (.cse3 (= ~a16~0 4)) (.cse11 (not .cse8))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse1) (and .cse10 .cse1 .cse11 .cse12) (and .cse6 .cse1 .cse12 .cse5) (and .cse0 .cse13 .cse4 .cse10 .cse12) (and .cse4 .cse1 .cse2) (and .cse0 .cse4 .cse2) (and .cse0 .cse7 .cse8 .cse9) (and .cse8 (not (= 14 ~a8~0)) .cse9 .cse5) (and .cse8 .cse9 .cse10 .cse5) (and .cse6 .cse2) (and .cse0 .cse13 .cse7 .cse8) (and .cse0 .cse13 .cse3 .cse4) (and .cse6 .cse3 .cse11)))) [2019-11-23 23:30:32,471 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:30:32,471 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:30:32,471 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:30:32,471 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:30:32,472 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:30:32,472 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:30:32,472 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:30:32,472 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:30:32,472 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:30:32,472 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:30:32,472 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:30:32,472 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:30:32,472 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:30:32,473 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:30:32,473 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:30:32,473 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:30:32,473 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:30:32,473 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:30:32,473 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:30:32,473 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:30:32,473 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:30:32,474 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:30:32,474 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:30:32,474 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse12 (= ~a16~0 6))) (let ((.cse1 (= 15 ~a8~0)) (.cse9 (= ~a21~0 1)) (.cse5 (<= ~a7~0 0)) (.cse2 (= ~a16~0 5)) (.cse7 (not .cse12)) (.cse0 (= 1 ~a7~0)) (.cse13 (= 13 ~a8~0)) (.cse4 (<= ~a17~0 0)) (.cse6 (not .cse10)) (.cse3 (= ~a16~0 4)) (.cse11 (not .cse8))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse1) (and .cse10 .cse1 .cse11 .cse12) (and .cse6 .cse1 .cse12 .cse5) (and .cse0 .cse13 .cse4 .cse10 .cse12) (and .cse4 .cse1 .cse2) (and .cse0 .cse4 .cse2) (and .cse0 .cse7 .cse8 .cse9) (and .cse8 (not (= 14 ~a8~0)) .cse9 .cse5) (and .cse8 .cse9 .cse10 .cse5) (and .cse6 .cse2) (and .cse0 .cse13 .cse7 .cse8) (and .cse0 .cse13 .cse3 .cse4) (and .cse6 .cse3 .cse11)))) [2019-11-23 23:30:32,474 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:30:32,474 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:30:32,474 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:30:32,474 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:30:32,474 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:30:32,474 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:30:32,475 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:30:32,475 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:30:32,475 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:30:32,475 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:30:32,475 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:30:32,475 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:30:32,475 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:30:32,475 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:30:32,475 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:30:32,475 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:30:32,475 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:30:32,475 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:30:32,475 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:30:32,475 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:30:32,476 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:30:32,476 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:30:32,476 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:30:32,476 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 569) no Hoare annotation was computed. [2019-11-23 23:30:32,476 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:30:32,476 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:30:32,476 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:30:32,476 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:30:32,476 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:30:32,476 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:30:32,476 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:30:32,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:32 BoogieIcfgContainer [2019-11-23 23:30:32,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:30:32,502 INFO L168 Benchmark]: Toolchain (without parser) took 12164.86 ms. Allocated memory was 139.5 MB in the beginning and 433.1 MB in the end (delta: 293.6 MB). Free memory was 101.8 MB in the beginning and 174.6 MB in the end (delta: -72.8 MB). Peak memory consumption was 220.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:32,503 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 23:30:32,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.99 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 101.6 MB in the beginning and 164.9 MB in the end (delta: -63.2 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:32,504 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.14 ms. Allocated memory is still 204.5 MB. Free memory was 164.9 MB in the beginning and 158.7 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:32,505 INFO L168 Benchmark]: Boogie Preprocessor took 95.13 ms. Allocated memory is still 204.5 MB. Free memory was 158.7 MB in the beginning and 153.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:32,506 INFO L168 Benchmark]: RCFGBuilder took 2143.38 ms. Allocated memory was 204.5 MB in the beginning and 248.0 MB in the end (delta: 43.5 MB). Free memory was 153.9 MB in the beginning and 190.8 MB in the end (delta: -36.9 MB). Peak memory consumption was 107.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:32,507 INFO L168 Benchmark]: TraceAbstraction took 9151.55 ms. Allocated memory was 248.0 MB in the beginning and 433.1 MB in the end (delta: 185.1 MB). Free memory was 190.8 MB in the beginning and 174.6 MB in the end (delta: 16.2 MB). Peak memory consumption was 201.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:32,511 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 672.99 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 101.6 MB in the beginning and 164.9 MB in the end (delta: -63.2 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 95.14 ms. Allocated memory is still 204.5 MB. Free memory was 164.9 MB in the beginning and 158.7 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.13 ms. Allocated memory is still 204.5 MB. Free memory was 158.7 MB in the beginning and 153.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2143.38 ms. Allocated memory was 204.5 MB in the beginning and 248.0 MB in the end (delta: 43.5 MB). Free memory was 153.9 MB in the beginning and 190.8 MB in the end (delta: -36.9 MB). Peak memory consumption was 107.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9151.55 ms. Allocated memory was 248.0 MB in the beginning and 433.1 MB in the end (delta: 185.1 MB). Free memory was 190.8 MB in the beginning and 174.6 MB in the end (delta: 16.2 MB). Peak memory consumption was 201.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 569]: 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: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == a7 && 15 == a8) && a16 == 5) || ((a16 == 4 && a17 <= 0) && a7 <= 0)) || (((!(a20 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((1 == a7 && a16 == 4) && a17 <= 0) && 15 == a8)) || (((a20 == 1 && 15 == a8) && !(a17 == 1)) && a16 == 6)) || (((!(a20 == 1) && 15 == a8) && a16 == 6) && a7 <= 0)) || ((((1 == a7 && 13 == a8) && a17 <= 0) && a20 == 1) && a16 == 6)) || ((a17 <= 0 && 15 == a8) && a16 == 5)) || ((1 == a7 && a17 <= 0) && a16 == 5)) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((a17 == 1 && !(14 == a8)) && a21 == 1) && a7 <= 0)) || (((a17 == 1 && a21 == 1) && a20 == 1) && a7 <= 0)) || (!(a20 == 1) && a16 == 5)) || (((1 == a7 && 13 == a8) && !(a16 == 6)) && a17 == 1)) || (((1 == a7 && 13 == a8) && a16 == 4) && a17 <= 0)) || ((!(a20 == 1) && a16 == 4) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == a7 && 15 == a8) && a16 == 5) || ((a16 == 4 && a17 <= 0) && a7 <= 0)) || (((!(a20 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((1 == a7 && a16 == 4) && a17 <= 0) && 15 == a8)) || (((a20 == 1 && 15 == a8) && !(a17 == 1)) && a16 == 6)) || (((!(a20 == 1) && 15 == a8) && a16 == 6) && a7 <= 0)) || ((((1 == a7 && 13 == a8) && a17 <= 0) && a20 == 1) && a16 == 6)) || ((a17 <= 0 && 15 == a8) && a16 == 5)) || ((1 == a7 && a17 <= 0) && a16 == 5)) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((a17 == 1 && !(14 == a8)) && a21 == 1) && a7 <= 0)) || (((a17 == 1 && a21 == 1) && a20 == 1) && a7 <= 0)) || (!(a20 == 1) && a16 == 5)) || (((1 == a7 && 13 == a8) && !(a16 == 6)) && a17 == 1)) || (((1 == a7 && 13 == a8) && a16 == 4) && a17 <= 0)) || ((!(a20 == 1) && a16 == 4) && !(a17 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 9.0s, OverallIterations: 13, TraceHistogramMax: 6, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 679 SDtfs, 1270 SDslu, 91 SDs, 0 SdLazy, 3896 SolverSat, 771 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1423occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 1015 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 55 NumberOfFragments, 403 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4557 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 798 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1676 NumberOfCodeBlocks, 1676 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1663 ConstructedInterpolants, 0 QuantifiedInterpolants, 501243 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 1268/1268 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...