/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/Problem02_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:32:16,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:32:16,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:32:16,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:32:16,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:32:16,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:32:16,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:32:16,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:32:16,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:32:16,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:32:16,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:32:16,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:32:16,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:32:16,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:32:16,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:32:16,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:32:16,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:32:16,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:32:16,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:32:16,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:32:16,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:32:16,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:32:16,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:32:16,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:32:16,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:32:16,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:32:16,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:32:16,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:32:16,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:32:16,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:32:16,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:32:16,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:32:16,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:32:16,126 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:32:16,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:32:16,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:32:16,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:32:16,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:32:16,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:32:16,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:32:16,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:32:16,135 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:32:16,156 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:32:16,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:32:16,157 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:32:16,157 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:32:16,157 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:32:16,157 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:32:16,158 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:32:16,158 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:32:16,158 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:32:16,158 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:32:16,158 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:32:16,158 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:32:16,159 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:32:16,159 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:32:16,159 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:32:16,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:32:16,160 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:32:16,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:32:16,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:32:16,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:32:16,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:32:16,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:32:16,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:32:16,161 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:32:16,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:32:16,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:32:16,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:32:16,162 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:32:16,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:32:16,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:32:16,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:32:16,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:32:16,163 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:32:16,163 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:32:16,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:32:16,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:32:16,164 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:32:16,164 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:32:16,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:32:16,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:32:16,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:32:16,489 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:32:16,490 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:32:16,490 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label15.c [2019-11-23 23:32:16,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104ca567e/a90b084ec9ca4c3db061f5eef2787fba/FLAGf95fca2be [2019-11-23 23:32:17,167 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:32:17,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label15.c [2019-11-23 23:32:17,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104ca567e/a90b084ec9ca4c3db061f5eef2787fba/FLAGf95fca2be [2019-11-23 23:32:17,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104ca567e/a90b084ec9ca4c3db061f5eef2787fba [2019-11-23 23:32:17,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:32:17,427 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:32:17,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:17,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:32:17,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:32:17,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:17" (1/1) ... [2019-11-23 23:32:17,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18bcd91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:17, skipping insertion in model container [2019-11-23 23:32:17,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:17" (1/1) ... [2019-11-23 23:32:17,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:32:17,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:32:17,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:17,983 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:32:18,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:18,147 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:32:18,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18 WrapperNode [2019-11-23 23:32:18,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:18,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:18,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:32:18,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:32:18,156 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:32:18" (1/1) ... [2019-11-23 23:32:18,175 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:32:18" (1/1) ... [2019-11-23 23:32:18,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:18,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:32:18,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:32:18,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:32:18,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ... [2019-11-23 23:32:18,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ... [2019-11-23 23:32:18,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ... [2019-11-23 23:32:18,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ... [2019-11-23 23:32:18,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ... [2019-11-23 23:32:18,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ... [2019-11-23 23:32:18,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ... [2019-11-23 23:32:18,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:32:18,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:32:18,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:32:18,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:32:18,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (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:32:18,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:32:18,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:32:20,334 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:32:20,334 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:32:20,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:20 BoogieIcfgContainer [2019-11-23 23:32:20,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:32:20,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:32:20,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:32:20,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:32:20,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:17" (1/3) ... [2019-11-23 23:32:20,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f25cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:20, skipping insertion in model container [2019-11-23 23:32:20,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (2/3) ... [2019-11-23 23:32:20,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f25cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:20, skipping insertion in model container [2019-11-23 23:32:20,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:20" (3/3) ... [2019-11-23 23:32:20,344 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label15.c [2019-11-23 23:32:20,355 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:32:20,363 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:32:20,375 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:32:20,402 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:32:20,403 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:32:20,403 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:32:20,403 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:32:20,403 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:32:20,404 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:32:20,404 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:32:20,404 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:32:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:32:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:32:20,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:20,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:20,434 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:20,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:20,441 INFO L82 PathProgramCache]: Analyzing trace with hash 925960975, now seen corresponding path program 1 times [2019-11-23 23:32:20,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:20,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861887231] [2019-11-23 23:32:20,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:20,881 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:32:20,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861887231] [2019-11-23 23:32:20,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:20,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:20,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929448044] [2019-11-23 23:32:20,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:20,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:20,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:20,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:20,913 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:32:21,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:21,747 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:32:21,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:21,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:32:21,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:21,767 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:32:21,767 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:32:21,771 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:32:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:32:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 163. [2019-11-23 23:32:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-23 23:32:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 298 transitions. [2019-11-23 23:32:21,828 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 298 transitions. Word has length 80 [2019-11-23 23:32:21,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:21,829 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 298 transitions. [2019-11-23 23:32:21,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 298 transitions. [2019-11-23 23:32:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 23:32:21,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:21,834 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:21,834 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:21,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:21,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1028681732, now seen corresponding path program 1 times [2019-11-23 23:32:21,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:21,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877045012] [2019-11-23 23:32:21,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 23:32:22,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877045012] [2019-11-23 23:32:22,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:22,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:22,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844340621] [2019-11-23 23:32:22,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:22,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:22,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:22,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:22,018 INFO L87 Difference]: Start difference. First operand 163 states and 298 transitions. Second operand 3 states. [2019-11-23 23:32:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:22,426 INFO L93 Difference]: Finished difference Result 485 states and 891 transitions. [2019-11-23 23:32:22,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:22,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 23:32:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:22,431 INFO L225 Difference]: With dead ends: 485 [2019-11-23 23:32:22,431 INFO L226 Difference]: Without dead ends: 323 [2019-11-23 23:32:22,433 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:32:22,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-23 23:32:22,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2019-11-23 23:32:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-23 23:32:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 548 transitions. [2019-11-23 23:32:22,456 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 548 transitions. Word has length 84 [2019-11-23 23:32:22,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:22,457 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 548 transitions. [2019-11-23 23:32:22,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 548 transitions. [2019-11-23 23:32:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-23 23:32:22,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:22,461 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:22,462 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:22,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:22,462 INFO L82 PathProgramCache]: Analyzing trace with hash -450005109, now seen corresponding path program 1 times [2019-11-23 23:32:22,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:22,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702588219] [2019-11-23 23:32:22,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:22,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702588219] [2019-11-23 23:32:22,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:22,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:22,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276838068] [2019-11-23 23:32:22,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:22,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:22,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:22,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:22,585 INFO L87 Difference]: Start difference. First operand 323 states and 548 transitions. Second operand 4 states. [2019-11-23 23:32:23,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:23,319 INFO L93 Difference]: Finished difference Result 1285 states and 2187 transitions. [2019-11-23 23:32:23,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:23,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-23 23:32:23,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:23,326 INFO L225 Difference]: With dead ends: 1285 [2019-11-23 23:32:23,326 INFO L226 Difference]: Without dead ends: 963 [2019-11-23 23:32:23,328 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:32:23,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-11-23 23:32:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 803. [2019-11-23 23:32:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-11-23 23:32:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1249 transitions. [2019-11-23 23:32:23,379 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1249 transitions. Word has length 109 [2019-11-23 23:32:23,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:23,379 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1249 transitions. [2019-11-23 23:32:23,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:23,379 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1249 transitions. [2019-11-23 23:32:23,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-23 23:32:23,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:23,387 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:23,387 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:23,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:23,388 INFO L82 PathProgramCache]: Analyzing trace with hash -400980539, now seen corresponding path program 1 times [2019-11-23 23:32:23,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:23,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255054634] [2019-11-23 23:32:23,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:23,517 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 23:32:23,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255054634] [2019-11-23 23:32:23,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:23,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:23,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263462643] [2019-11-23 23:32:23,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:23,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:23,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:23,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:23,520 INFO L87 Difference]: Start difference. First operand 803 states and 1249 transitions. Second operand 4 states. [2019-11-23 23:32:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:24,303 INFO L93 Difference]: Finished difference Result 2885 states and 4419 transitions. [2019-11-23 23:32:24,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:24,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-11-23 23:32:24,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:24,315 INFO L225 Difference]: With dead ends: 2885 [2019-11-23 23:32:24,316 INFO L226 Difference]: Without dead ends: 2083 [2019-11-23 23:32:24,318 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:32:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2019-11-23 23:32:24,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1283. [2019-11-23 23:32:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-23 23:32:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1858 transitions. [2019-11-23 23:32:24,366 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1858 transitions. Word has length 125 [2019-11-23 23:32:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:24,366 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1858 transitions. [2019-11-23 23:32:24,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:24,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1858 transitions. [2019-11-23 23:32:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-23 23:32:24,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:24,371 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:24,371 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:24,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:24,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1423411985, now seen corresponding path program 1 times [2019-11-23 23:32:24,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:24,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185069887] [2019-11-23 23:32:24,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-23 23:32:24,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185069887] [2019-11-23 23:32:24,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:24,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:24,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160151298] [2019-11-23 23:32:24,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:24,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:24,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:24,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:24,427 INFO L87 Difference]: Start difference. First operand 1283 states and 1858 transitions. Second operand 3 states. [2019-11-23 23:32:24,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:24,897 INFO L93 Difference]: Finished difference Result 2805 states and 4060 transitions. [2019-11-23 23:32:24,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:24,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-23 23:32:24,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:24,905 INFO L225 Difference]: With dead ends: 2805 [2019-11-23 23:32:24,905 INFO L226 Difference]: Without dead ends: 1523 [2019-11-23 23:32:24,907 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:32:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-11-23 23:32:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1363. [2019-11-23 23:32:24,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-23 23:32:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1908 transitions. [2019-11-23 23:32:24,941 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1908 transitions. Word has length 133 [2019-11-23 23:32:24,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:24,941 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1908 transitions. [2019-11-23 23:32:24,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1908 transitions. [2019-11-23 23:32:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 23:32:24,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:24,945 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-23 23:32:24,945 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:24,946 INFO L82 PathProgramCache]: Analyzing trace with hash 440375020, now seen corresponding path program 1 times [2019-11-23 23:32:24,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:24,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550163982] [2019-11-23 23:32:24,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-23 23:32:25,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550163982] [2019-11-23 23:32:25,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:25,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:25,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583487857] [2019-11-23 23:32:25,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:25,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:25,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:25,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:25,013 INFO L87 Difference]: Start difference. First operand 1363 states and 1908 transitions. Second operand 4 states. [2019-11-23 23:32:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:25,590 INFO L93 Difference]: Finished difference Result 3125 states and 4340 transitions. [2019-11-23 23:32:25,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:25,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-23 23:32:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:25,598 INFO L225 Difference]: With dead ends: 3125 [2019-11-23 23:32:25,599 INFO L226 Difference]: Without dead ends: 1523 [2019-11-23 23:32:25,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:32:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-11-23 23:32:25,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1363. [2019-11-23 23:32:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-23 23:32:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1651 transitions. [2019-11-23 23:32:25,662 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1651 transitions. Word has length 150 [2019-11-23 23:32:25,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:25,662 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1651 transitions. [2019-11-23 23:32:25,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1651 transitions. [2019-11-23 23:32:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 23:32:25,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:25,667 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-23 23:32:25,667 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:25,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:25,668 INFO L82 PathProgramCache]: Analyzing trace with hash -118808606, now seen corresponding path program 1 times [2019-11-23 23:32:25,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:25,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392241814] [2019-11-23 23:32:25,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-23 23:32:25,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392241814] [2019-11-23 23:32:25,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:25,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:25,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061390326] [2019-11-23 23:32:25,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:25,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:25,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:25,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:25,748 INFO L87 Difference]: Start difference. First operand 1363 states and 1651 transitions. Second operand 3 states. [2019-11-23 23:32:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:26,059 INFO L93 Difference]: Finished difference Result 2965 states and 3565 transitions. [2019-11-23 23:32:26,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:26,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-23 23:32:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:26,067 INFO L225 Difference]: With dead ends: 2965 [2019-11-23 23:32:26,067 INFO L226 Difference]: Without dead ends: 1523 [2019-11-23 23:32:26,070 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:32:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-11-23 23:32:26,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1523. [2019-11-23 23:32:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-11-23 23:32:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1734 transitions. [2019-11-23 23:32:26,102 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1734 transitions. Word has length 154 [2019-11-23 23:32:26,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:26,103 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 1734 transitions. [2019-11-23 23:32:26,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1734 transitions. [2019-11-23 23:32:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 23:32:26,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:26,109 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:26,110 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:26,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:26,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1933238742, now seen corresponding path program 1 times [2019-11-23 23:32:26,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:26,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163857239] [2019-11-23 23:32:26,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:26,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163857239] [2019-11-23 23:32:26,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:26,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:26,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379774824] [2019-11-23 23:32:26,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:26,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:26,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:26,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:26,292 INFO L87 Difference]: Start difference. First operand 1523 states and 1734 transitions. Second operand 4 states. [2019-11-23 23:32:26,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:26,837 INFO L93 Difference]: Finished difference Result 3045 states and 3467 transitions. [2019-11-23 23:32:26,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:26,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-23 23:32:26,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:26,845 INFO L225 Difference]: With dead ends: 3045 [2019-11-23 23:32:26,845 INFO L226 Difference]: Without dead ends: 1523 [2019-11-23 23:32:26,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:32:26,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-11-23 23:32:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1523. [2019-11-23 23:32:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-11-23 23:32:26,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1714 transitions. [2019-11-23 23:32:26,882 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1714 transitions. Word has length 157 [2019-11-23 23:32:26,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:26,882 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 1714 transitions. [2019-11-23 23:32:26,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1714 transitions. [2019-11-23 23:32:26,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-23 23:32:26,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:26,887 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:32:26,887 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:26,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:26,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1296450364, now seen corresponding path program 1 times [2019-11-23 23:32:26,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:26,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42984407] [2019-11-23 23:32:26,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 23:32:27,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42984407] [2019-11-23 23:32:27,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:27,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:27,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064367024] [2019-11-23 23:32:27,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:27,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:27,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:27,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:27,052 INFO L87 Difference]: Start difference. First operand 1523 states and 1714 transitions. Second operand 4 states. [2019-11-23 23:32:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:27,554 INFO L93 Difference]: Finished difference Result 3123 states and 3531 transitions. [2019-11-23 23:32:27,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:27,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-23 23:32:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:27,555 INFO L225 Difference]: With dead ends: 3123 [2019-11-23 23:32:27,555 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:32:27,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:32:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:32:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:32:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:32:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:32:27,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2019-11-23 23:32:27,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:27,560 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:32:27,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:32:27,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:32:27,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:32:27,946 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2019-11-23 23:32:28,186 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2019-11-23 23:32:28,190 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:32:28,191 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:32:28,191 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:32:28,191 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:32:28,191 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:32:28,191 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:32:28,192 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:32:28,192 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:32:28,192 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:32:28,192 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:32:28,193 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:32:28,193 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:32:28,193 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:32:28,193 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:32:28,193 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:32:28,194 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:32:28,194 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:32:28,194 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:32:28,194 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:32:28,194 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:32:28,194 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:32:28,194 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:32:28,195 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:32:28,195 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:32:28,195 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:32:28,195 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:32:28,195 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:32:28,195 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:32:28,195 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:32:28,195 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:32:28,196 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:32:28,196 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:32:28,196 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:32:28,196 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:32:28,196 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:32:28,196 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:32:28,196 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 562) no Hoare annotation was computed. [2019-11-23 23:32:28,197 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:32:28,197 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:32:28,197 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:32:28,197 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:32:28,197 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse0 (not .cse4)) (.cse1 (not (= ~a11~0 1))) (.cse2 (= ~a28~0 9)) (.cse3 (= ~a19~0 1)) (.cse5 (not (= ~a28~0 11)))) (or (and .cse0 .cse1) (and (<= 10 ~a28~0) .cse0) (and .cse2 .cse3) (and (= ~a28~0 10) .cse1) (and .cse3 .cse1) (= ~a28~0 7) (and .cse2 .cse4) (and .cse3 .cse4 .cse5) (and (<= ~a11~0 0) .cse5)))) [2019-11-23 23:32:28,198 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:32:28,198 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:32:28,198 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:32:28,198 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:32:28,198 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:32:28,198 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:32:28,198 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:32:28,199 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:32:28,199 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:32:28,199 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:32:28,199 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse0 (not .cse4)) (.cse1 (not (= ~a11~0 1))) (.cse2 (= ~a28~0 9)) (.cse3 (= ~a19~0 1)) (.cse5 (not (= ~a28~0 11)))) (or (and .cse0 .cse1) (and (<= 10 ~a28~0) .cse0) (and .cse2 .cse3) (and (= ~a28~0 10) .cse1) (and .cse3 .cse1) (= ~a28~0 7) (and .cse2 .cse4) (and .cse3 .cse4 .cse5) (and (<= ~a11~0 0) .cse5)))) [2019-11-23 23:32:28,199 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:32:28,199 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:32:28,199 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:32:28,200 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:32:28,200 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:32:28,200 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:32:28,200 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:32:28,200 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:32:28,200 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:32:28,200 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:32:28,200 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:32:28,200 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:32:28,201 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:32:28,201 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:32:28,201 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:32:28,201 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:32:28,201 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:32:28,201 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:32:28,201 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:32:28,201 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:32:28,201 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:32:28,202 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:32:28,202 INFO L444 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:28,202 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:32:28,202 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:32:28,202 INFO L444 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:28,202 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:32:28,202 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:32:28,202 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:32:28,202 INFO L444 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-23 23:32:28,203 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:32:28,203 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:32:28,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:28 BoogieIcfgContainer [2019-11-23 23:32:28,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:32:28,224 INFO L168 Benchmark]: Toolchain (without parser) took 10797.32 ms. Allocated memory was 146.3 MB in the beginning and 370.1 MB in the end (delta: 223.9 MB). Free memory was 101.1 MB in the beginning and 245.6 MB in the end (delta: -144.6 MB). Peak memory consumption was 237.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:28,225 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 23:32:28,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.48 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 100.8 MB in the beginning and 171.3 MB in the end (delta: -70.4 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:28,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.54 ms. Allocated memory is still 204.5 MB. Free memory was 171.3 MB in the beginning and 165.7 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:28,232 INFO L168 Benchmark]: Boogie Preprocessor took 69.99 ms. Allocated memory is still 204.5 MB. Free memory was 165.7 MB in the beginning and 161.0 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:32:28,233 INFO L168 Benchmark]: RCFGBuilder took 2033.64 ms. Allocated memory was 204.5 MB in the beginning and 249.0 MB in the end (delta: 44.6 MB). Free memory was 161.0 MB in the beginning and 190.0 MB in the end (delta: -29.0 MB). Peak memory consumption was 114.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:28,235 INFO L168 Benchmark]: TraceAbstraction took 7885.64 ms. Allocated memory was 249.0 MB in the beginning and 370.1 MB in the end (delta: 121.1 MB). Free memory was 190.0 MB in the beginning and 245.6 MB in the end (delta: -55.6 MB). Peak memory consumption was 223.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:28,245 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.33 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 719.48 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 100.8 MB in the beginning and 171.3 MB in the end (delta: -70.4 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.54 ms. Allocated memory is still 204.5 MB. Free memory was 171.3 MB in the beginning and 165.7 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.99 ms. Allocated memory is still 204.5 MB. Free memory was 165.7 MB in the beginning and 161.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2033.64 ms. Allocated memory was 204.5 MB in the beginning and 249.0 MB in the end (delta: 44.6 MB). Free memory was 161.0 MB in the beginning and 190.0 MB in the end (delta: -29.0 MB). Peak memory consumption was 114.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7885.64 ms. Allocated memory was 249.0 MB in the beginning and 370.1 MB in the end (delta: 121.1 MB). Free memory was 190.0 MB in the beginning and 245.6 MB in the end (delta: -55.6 MB). Peak memory consumption was 223.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 562]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((!(a25 == 1) && !(a11 == 1)) || (10 <= a28 && !(a25 == 1))) || (a28 == 9 && a19 == 1)) || (a28 == 10 && !(a11 == 1))) || (a19 == 1 && !(a11 == 1))) || a28 == 7) || (a28 == 9 && a25 == 1)) || ((a19 == 1 && a25 == 1) && !(a28 == 11))) || (a11 <= 0 && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((!(a25 == 1) && !(a11 == 1)) || (10 <= a28 && !(a25 == 1))) || (a28 == 9 && a19 == 1)) || (a28 == 10 && !(a11 == 1))) || (a19 == 1 && !(a11 == 1))) || a28 == 7) || (a28 == 9 && a25 == 1)) || ((a19 == 1 && a25 == 1) && !(a28 == 11))) || (a11 <= 0 && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 7.8s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 576 SDtfs, 978 SDslu, 109 SDs, 0 SdLazy, 3255 SolverSat, 754 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1523occurred in iteration=7, 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, 9 MinimizatonAttempts, 1360 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 54 NumberOfFragments, 141 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1136 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1188 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1170 NumberOfCodeBlocks, 1170 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1161 ConstructedInterpolants, 0 QuantifiedInterpolants, 339351 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 678/678 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...