java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label51.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:56:57,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:56:57,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:56:57,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:56:57,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:56:57,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:56:57,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:56:57,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:56:57,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:56:57,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:56:57,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:56:57,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:56:57,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:56:57,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:56:57,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:56:57,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:56:57,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:56:57,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:56:57,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:56:57,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:56:57,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:56:57,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:56:57,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:56:57,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:56:57,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:56:57,823 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:56:57,823 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:56:57,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:56:57,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:56:57,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:56:57,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:56:57,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:56:57,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:56:57,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:56:57,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:56:57,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:56:57,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:56:57,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:56:57,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:56:57,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:56:57,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:56:57,839 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:56:57,873 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:56:57,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:56:57,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:56:57,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:56:57,877 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:56:57,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:56:57,877 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:56:57,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:56:57,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:56:57,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:56:57,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:56:57,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:56:57,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:56:57,879 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:56:57,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:56:57,879 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:56:57,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:56:57,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:56:57,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:56:57,883 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:56:57,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:56:57,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:56:57,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:56:57,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:56:57,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:56:57,884 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:56:57,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:56:57,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:56:57,885 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:56:58,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:56:58,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:56:58,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:56:58,207 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:56:58,207 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:56:58,208 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label51.c [2019-10-07 00:56:58,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2813261d/2726557f13e34507a0b7a2162a18767d/FLAG9e6b63769 [2019-10-07 00:56:58,927 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:56:58,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label51.c [2019-10-07 00:56:58,942 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2813261d/2726557f13e34507a0b7a2162a18767d/FLAG9e6b63769 [2019-10-07 00:56:59,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2813261d/2726557f13e34507a0b7a2162a18767d [2019-10-07 00:56:59,164 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:56:59,165 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:56:59,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:56:59,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:56:59,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:56:59,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:56:59" (1/1) ... [2019-10-07 00:56:59,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c679016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:59, skipping insertion in model container [2019-10-07 00:56:59,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:56:59" (1/1) ... [2019-10-07 00:56:59,185 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:56:59,245 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:56:59,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:56:59,692 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:56:59,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:56:59,968 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:56:59,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:59 WrapperNode [2019-10-07 00:56:59,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:56:59,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:56:59,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:56:59,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:56:59,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:59" (1/1) ... [2019-10-07 00:56:59,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:59" (1/1) ... [2019-10-07 00:57:00,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:59" (1/1) ... [2019-10-07 00:57:00,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:59" (1/1) ... [2019-10-07 00:57:00,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:59" (1/1) ... [2019-10-07 00:57:00,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:59" (1/1) ... [2019-10-07 00:57:00,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:59" (1/1) ... [2019-10-07 00:57:00,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:57:00,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:57:00,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:57:00,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:57:00,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:59" (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-10-07 00:57:00,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:57:00,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:57:00,184 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:57:00,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:57:00,185 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:57:00,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:57:00,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:57:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:57:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:57:00,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:57:00,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:57:02,317 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:57:02,320 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:57:02,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:57:02 BoogieIcfgContainer [2019-10-07 00:57:02,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:57:02,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:57:02,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:57:02,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:57:02,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:56:59" (1/3) ... [2019-10-07 00:57:02,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104025fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:57:02, skipping insertion in model container [2019-10-07 00:57:02,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:59" (2/3) ... [2019-10-07 00:57:02,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104025fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:57:02, skipping insertion in model container [2019-10-07 00:57:02,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:57:02" (3/3) ... [2019-10-07 00:57:02,333 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label51.c [2019-10-07 00:57:02,345 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:57:02,357 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:57:02,369 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:57:02,418 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:57:02,418 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:57:02,419 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:57:02,419 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:57:02,419 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:57:02,419 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:57:02,419 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:57:02,420 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:57:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-07 00:57:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-07 00:57:02,467 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:02,468 INFO L385 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] [2019-10-07 00:57:02,471 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash 826819940, now seen corresponding path program 1 times [2019-10-07 00:57:02,490 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:02,490 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:02,491 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:02,491 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:02,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:03,028 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:03,028 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:03,029 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:57:03,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:57:03,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:57:03,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:57:03,052 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-10-07 00:57:03,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:03,654 INFO L93 Difference]: Finished difference Result 246 states and 454 transitions. [2019-10-07 00:57:03,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:57:03,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-07 00:57:03,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:03,680 INFO L225 Difference]: With dead ends: 246 [2019-10-07 00:57:03,681 INFO L226 Difference]: Without dead ends: 157 [2019-10-07 00:57:03,687 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-07 00:57:03,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-07 00:57:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-07 00:57:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-07 00:57:03,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 291 transitions. [2019-10-07 00:57:03,801 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 291 transitions. Word has length 77 [2019-10-07 00:57:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:03,803 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 291 transitions. [2019-10-07 00:57:03,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:57:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 291 transitions. [2019-10-07 00:57:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-07 00:57:03,813 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:03,813 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:03,814 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:03,815 INFO L82 PathProgramCache]: Analyzing trace with hash 579794891, now seen corresponding path program 1 times [2019-10-07 00:57:03,816 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:03,816 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:03,816 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:03,816 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:03,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:04,050 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:04,050 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:04,051 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 00:57:04,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:57:04,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:57:04,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:57:04,053 INFO L87 Difference]: Start difference. First operand 157 states and 291 transitions. Second operand 4 states. [2019-10-07 00:57:04,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:04,790 INFO L93 Difference]: Finished difference Result 534 states and 1025 transitions. [2019-10-07 00:57:04,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:57:04,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-07 00:57:04,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:04,796 INFO L225 Difference]: With dead ends: 534 [2019-10-07 00:57:04,797 INFO L226 Difference]: Without dead ends: 382 [2019-10-07 00:57:04,799 INFO L606 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-10-07 00:57:04,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-10-07 00:57:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 307. [2019-10-07 00:57:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-07 00:57:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-10-07 00:57:04,823 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 94 [2019-10-07 00:57:04,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:04,824 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-10-07 00:57:04,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:57:04,825 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-10-07 00:57:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-07 00:57:04,828 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:04,829 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-07 00:57:04,829 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:04,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:04,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1740718389, now seen corresponding path program 1 times [2019-10-07 00:57:04,830 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:04,830 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:04,830 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:04,830 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:04,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:04,970 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:04,970 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:04,970 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:57:04,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:57:04,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:57:04,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:57:04,972 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 3 states. [2019-10-07 00:57:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:05,416 INFO L93 Difference]: Finished difference Result 909 states and 1630 transitions. [2019-10-07 00:57:05,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:57:05,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-07 00:57:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:05,422 INFO L225 Difference]: With dead ends: 909 [2019-10-07 00:57:05,422 INFO L226 Difference]: Without dead ends: 607 [2019-10-07 00:57:05,425 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-07 00:57:05,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-07 00:57:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 457. [2019-10-07 00:57:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-10-07 00:57:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 740 transitions. [2019-10-07 00:57:05,458 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 740 transitions. Word has length 111 [2019-10-07 00:57:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:05,459 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 740 transitions. [2019-10-07 00:57:05,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:57:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 740 transitions. [2019-10-07 00:57:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-07 00:57:05,464 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:05,464 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:05,465 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:05,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:05,465 INFO L82 PathProgramCache]: Analyzing trace with hash 315252867, now seen corresponding path program 1 times [2019-10-07 00:57:05,465 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:05,466 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:05,466 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:05,466 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:05,620 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:05,621 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:05,621 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:57:05,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:57:05,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:57:05,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:57:05,622 INFO L87 Difference]: Start difference. First operand 457 states and 740 transitions. Second operand 6 states. [2019-10-07 00:57:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:06,270 INFO L93 Difference]: Finished difference Result 1245 states and 2039 transitions. [2019-10-07 00:57:06,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:57:06,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-10-07 00:57:06,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:06,277 INFO L225 Difference]: With dead ends: 1245 [2019-10-07 00:57:06,277 INFO L226 Difference]: Without dead ends: 793 [2019-10-07 00:57:06,280 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:57:06,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-10-07 00:57:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 706. [2019-10-07 00:57:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-10-07 00:57:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1058 transitions. [2019-10-07 00:57:06,324 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1058 transitions. Word has length 147 [2019-10-07 00:57:06,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:06,325 INFO L462 AbstractCegarLoop]: Abstraction has 706 states and 1058 transitions. [2019-10-07 00:57:06,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:57:06,325 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1058 transitions. [2019-10-07 00:57:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-07 00:57:06,332 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:06,332 INFO L385 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, 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] [2019-10-07 00:57:06,332 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:06,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:06,333 INFO L82 PathProgramCache]: Analyzing trace with hash -757795538, now seen corresponding path program 1 times [2019-10-07 00:57:06,333 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:06,333 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:06,333 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:06,333 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:06,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:57:06,533 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:06,533 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:06,533 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:57:06,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:57:06,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:57:06,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:57:06,534 INFO L87 Difference]: Start difference. First operand 706 states and 1058 transitions. Second operand 3 states. [2019-10-07 00:57:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:07,060 INFO L93 Difference]: Finished difference Result 1863 states and 2844 transitions. [2019-10-07 00:57:07,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:57:07,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-07 00:57:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:07,062 INFO L225 Difference]: With dead ends: 1863 [2019-10-07 00:57:07,062 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 00:57:07,066 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-07 00:57:07,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 00:57:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 00:57:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 00:57:07,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 00:57:07,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 162 [2019-10-07 00:57:07,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:07,068 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 00:57:07,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:57:07,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 00:57:07,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 00:57:07,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 00:57:07,442 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2019-10-07 00:57:07,493 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~a8~0 |old(~a8~0)|) [2019-10-07 00:57:07,493 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:57:07,493 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-07 00:57:07,493 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-07 00:57:07,494 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-07 00:57:07,494 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-07 00:57:07,494 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-07 00:57:07,494 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-07 00:57:07,494 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-07 00:57:07,494 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-07 00:57:07,495 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-07 00:57:07,495 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-07 00:57:07,495 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-07 00:57:07,495 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-07 00:57:07,495 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-07 00:57:07,495 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-07 00:57:07,495 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-07 00:57:07,496 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-07 00:57:07,496 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 494) no Hoare annotation was computed. [2019-10-07 00:57:07,496 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-07 00:57:07,496 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-07 00:57:07,496 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-07 00:57:07,496 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-07 00:57:07,496 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-07 00:57:07,497 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-07 00:57:07,497 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-07 00:57:07,497 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-07 00:57:07,497 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-07 00:57:07,497 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-07 00:57:07,497 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-07 00:57:07,497 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-07 00:57:07,498 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-07 00:57:07,498 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:57:07,498 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:57:07,498 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-07 00:57:07,498 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-07 00:57:07,498 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-07 00:57:07,499 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-07 00:57:07,499 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-07 00:57:07,499 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-07 00:57:07,499 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-07 00:57:07,501 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-07 00:57:07,501 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-07 00:57:07,502 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-07 00:57:07,502 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-07 00:57:07,502 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-07 00:57:07,502 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-07 00:57:07,502 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-07 00:57:07,502 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-07 00:57:07,502 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-07 00:57:07,503 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-07 00:57:07,503 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse2 (= 14 |old(~a8~0)|)) (.cse4 (= 5 |old(~a16~0)|)) (.cse1 (not (= 1 |old(~a7~0)|))) (.cse5 (not (= 4 |old(~a16~0)|))) (.cse6 (not (= ~a20~0 1))) (.cse0 (= ~a8~0 |old(~a8~0)|)) (.cse3 (= 13 |old(~a8~0)|)) (.cse7 (= 1 |old(~a20~0)|))) (and (or (and (= 1 ~a7~0) .cse0) .cse1) (or .cse0 .cse2 .cse3) (or (and .cse0 (not (= ~a16~0 5))) .cse4 .cse2) (or (and (= ~a16~0 4) .cse0) .cse5) (or .cse6 (or .cse4 .cse1) .cse7) (or .cse5 .cse6 .cse7) (or (and .cse6 .cse0) .cse3 .cse7))) [2019-10-07 00:57:07,503 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-07 00:57:07,503 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:57:07,504 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-07 00:57:07,504 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-07 00:57:07,504 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-07 00:57:07,504 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-07 00:57:07,504 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-07 00:57:07,504 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-07 00:57:07,504 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:57:07,505 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-07 00:57:07,505 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-07 00:57:07,505 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-07 00:57:07,505 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-07 00:57:07,505 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-07 00:57:07,505 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-07 00:57:07,505 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-07 00:57:07,505 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-07 00:57:07,506 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-07 00:57:07,506 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-07 00:57:07,506 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-07 00:57:07,506 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-07 00:57:07,506 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-07 00:57:07,506 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-07 00:57:07,506 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:57:07,507 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 14 ~a8~0)) (not (= ~a8~0 13))) [2019-10-07 00:57:07,507 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 00:57:07,507 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 00:57:07,507 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= ~a8~0 |old(~a8~0)|) (= 14 |old(~a8~0)|) (= 13 |old(~a8~0)|)) [2019-10-07 00:57:07,507 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-07 00:57:07,507 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (not (= 14 ~a8~0))) (.cse1 (not (= ~a8~0 13)))) (or (= 1 ~a7~0) (and .cse0 .cse1) (and .cse0 (not (= ~a16~0 5))) (= ~a16~0 4) (= 14 |old(~a8~0)|) (= 13 |old(~a8~0)|) (and (not (= ~a20~0 1)) .cse1))) [2019-10-07 00:57:07,508 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-07 00:57:07,508 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-07 00:57:07,508 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (not (= 14 ~a8~0))) (.cse1 (not (= ~a8~0 13)))) (or (= 1 ~a7~0) (and .cse0 .cse1) (and .cse0 (not (= ~a16~0 5))) (= ~a16~0 4) (= 14 |old(~a8~0)|) (= 13 |old(~a8~0)|) (and (not (= ~a20~0 1)) .cse1))) [2019-10-07 00:57:07,508 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-07 00:57:07,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 12:57:07 BoogieIcfgContainer [2019-10-07 00:57:07,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 00:57:07,541 INFO L168 Benchmark]: Toolchain (without parser) took 8375.37 ms. Allocated memory was 138.4 MB in the beginning and 327.7 MB in the end (delta: 189.3 MB). Free memory was 101.5 MB in the beginning and 196.4 MB in the end (delta: -94.9 MB). Peak memory consumption was 94.4 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:07,543 INFO L168 Benchmark]: CDTParser took 1.67 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:57:07,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.61 ms. Allocated memory was 138.4 MB in the beginning and 206.6 MB in the end (delta: 68.2 MB). Free memory was 101.3 MB in the beginning and 172.5 MB in the end (delta: -71.3 MB). Peak memory consumption was 36.7 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:07,546 INFO L168 Benchmark]: Boogie Preprocessor took 136.60 ms. Allocated memory is still 206.6 MB. Free memory was 172.5 MB in the beginning and 167.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:07,548 INFO L168 Benchmark]: RCFGBuilder took 2215.44 ms. Allocated memory was 206.6 MB in the beginning and 251.1 MB in the end (delta: 44.6 MB). Free memory was 167.7 MB in the beginning and 217.7 MB in the end (delta: -50.1 MB). Peak memory consumption was 117.6 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:07,549 INFO L168 Benchmark]: TraceAbstraction took 5215.81 ms. Allocated memory was 251.1 MB in the beginning and 327.7 MB in the end (delta: 76.5 MB). Free memory was 217.7 MB in the beginning and 196.4 MB in the end (delta: 21.3 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:07,566 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.67 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 802.61 ms. Allocated memory was 138.4 MB in the beginning and 206.6 MB in the end (delta: 68.2 MB). Free memory was 101.3 MB in the beginning and 172.5 MB in the end (delta: -71.3 MB). Peak memory consumption was 36.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.60 ms. Allocated memory is still 206.6 MB. Free memory was 172.5 MB in the beginning and 167.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2215.44 ms. Allocated memory was 206.6 MB in the beginning and 251.1 MB in the end (delta: 44.6 MB). Free memory was 167.7 MB in the beginning and 217.7 MB in the end (delta: -50.1 MB). Peak memory consumption was 117.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5215.81 ms. Allocated memory was 251.1 MB in the beginning and 327.7 MB in the end (delta: 76.5 MB). Free memory was 217.7 MB in the beginning and 196.4 MB in the end (delta: 21.3 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 494]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((1 == a7 || (!(14 == a8) && !(a8 == 13))) || (!(14 == a8) && !(a16 == 5))) || a16 == 4) || 14 == \old(a8)) || 13 == \old(a8)) || (!(a20 == 1) && !(a8 == 13)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 1 error locations. Result: SAFE, OverallTime: 5.1s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 512 SDtfs, 410 SDslu, 107 SDs, 0 SdLazy, 1588 SolverSat, 366 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=706occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 312 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 43 PreInvPairs, 73 NumberOfFragments, 196 HoareAnnotationTreeSize, 43 FomulaSimplifications, 929 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 444 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 586 ConstructedInterpolants, 0 QuantifiedInterpolants, 228988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 206/206 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...