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_label03.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:54:55,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:54:55,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:54:55,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:54:55,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:54:55,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:54:55,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:54:55,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:54:55,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:54:55,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:54:55,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:54:55,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:54:55,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:54:55,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:54:55,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:54:55,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:54:55,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:54:55,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:54:55,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:54:55,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:54:55,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:54:55,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:54:55,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:54:55,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:54:55,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:54:55,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:54:55,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:54:55,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:54:55,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:54:55,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:54:55,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:54:55,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:54:55,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:54:55,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:54:55,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:54:55,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:54:55,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:54:55,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:54:55,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:54:55,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:54:55,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:54:55,550 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:54:55,582 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:54:55,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:54:55,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:54:55,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:54:55,584 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:54:55,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:54:55,585 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:54:55,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:54:55,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:54:55,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:54:55,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:54:55,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:54:55,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:54:55,586 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:54:55,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:54:55,586 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:54:55,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:54:55,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:54:55,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:54:55,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:54:55,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:54:55,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:54:55,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:54:55,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:54:55,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:54:55,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:54:55,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:54:55,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:54:55,589 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:54:55,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:54:55,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:54:55,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:54:55,887 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:54:55,887 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:54:55,888 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label03.c [2019-10-07 00:54:55,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa331a554/85beffa62f854063a85667fe7653716b/FLAGa9dc6483f [2019-10-07 00:54:56,517 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:54:56,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label03.c [2019-10-07 00:54:56,532 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa331a554/85beffa62f854063a85667fe7653716b/FLAGa9dc6483f [2019-10-07 00:54:56,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa331a554/85beffa62f854063a85667fe7653716b [2019-10-07 00:54:56,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:54:56,817 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:54:56,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:54:56,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:54:56,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:54:56,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:54:56" (1/1) ... [2019-10-07 00:54:56,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbd8e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:54:56, skipping insertion in model container [2019-10-07 00:54:56,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:54:56" (1/1) ... [2019-10-07 00:54:56,833 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:54:56,879 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:54:57,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:54:57,373 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:54:57,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:54:57,519 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:54:57,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:54:57 WrapperNode [2019-10-07 00:54:57,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:54:57,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:54:57,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:54:57,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:54:57,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:54:57" (1/1) ... [2019-10-07 00:54:57,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:54:57" (1/1) ... [2019-10-07 00:54:57,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:54:57" (1/1) ... [2019-10-07 00:54:57,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:54:57" (1/1) ... [2019-10-07 00:54:57,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:54:57" (1/1) ... [2019-10-07 00:54:57,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:54:57" (1/1) ... [2019-10-07 00:54:57,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:54:57" (1/1) ... [2019-10-07 00:54:57,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:54:57,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:54:57,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:54:57,628 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:54:57,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:54:57" (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:54:57,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:54:57,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:54:57,682 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:54:57,682 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:54:57,682 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:54:57,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:54:57,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:54:57,683 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:54:57,683 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:54:57,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:54:57,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:54:59,586 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:54:59,586 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:54:59,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:54:59 BoogieIcfgContainer [2019-10-07 00:54:59,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:54:59,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:54:59,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:54:59,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:54:59,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:54:56" (1/3) ... [2019-10-07 00:54:59,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2403e8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:54:59, skipping insertion in model container [2019-10-07 00:54:59,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:54:57" (2/3) ... [2019-10-07 00:54:59,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2403e8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:54:59, skipping insertion in model container [2019-10-07 00:54:59,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:54:59" (3/3) ... [2019-10-07 00:54:59,597 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label03.c [2019-10-07 00:54:59,607 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:54:59,616 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:54:59,627 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:54:59,654 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:54:59,655 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:54:59,655 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:54:59,655 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:54:59,657 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:54:59,657 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:54:59,657 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:54:59,658 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:54:59,685 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-07 00:54:59,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-07 00:54:59,693 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:54:59,694 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:54:59,696 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:54:59,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:54:59,701 INFO L82 PathProgramCache]: Analyzing trace with hash -281988410, now seen corresponding path program 1 times [2019-10-07 00:54:59,707 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:54:59,708 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:54:59,708 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:54:59,708 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:54:59,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:54:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:55:00,163 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:55:00,163 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:00,164 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:55:00,164 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 00:55:00,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:55:00,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:55:00,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:55:00,187 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 4 states. [2019-10-07 00:55:00,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:55:00,984 INFO L93 Difference]: Finished difference Result 325 states and 606 transitions. [2019-10-07 00:55:00,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:55:00,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-10-07 00:55:00,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:55:01,005 INFO L225 Difference]: With dead ends: 325 [2019-10-07 00:55:01,006 INFO L226 Difference]: Without dead ends: 232 [2019-10-07 00:55:01,011 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:55:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-07 00:55:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 157. [2019-10-07 00:55:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-07 00:55:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2019-10-07 00:55:01,130 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 77 [2019-10-07 00:55:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:55:01,131 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2019-10-07 00:55:01,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:55:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2019-10-07 00:55:01,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-07 00:55:01,140 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:55:01,141 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:55:01,141 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:55:01,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:55:01,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1931111197, now seen corresponding path program 1 times [2019-10-07 00:55:01,142 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:55:01,143 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:01,143 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:01,143 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:01,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:55:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:55:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:55:01,306 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:01,306 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:55:01,307 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:55:01,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:55:01,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:55:01,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:55:01,310 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand 6 states. [2019-10-07 00:55:01,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:55:01,909 INFO L93 Difference]: Finished difference Result 479 states and 882 transitions. [2019-10-07 00:55:01,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:55:01,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-07 00:55:01,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:55:01,922 INFO L225 Difference]: With dead ends: 479 [2019-10-07 00:55:01,922 INFO L226 Difference]: Without dead ends: 327 [2019-10-07 00:55:01,929 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 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:55:01,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-07 00:55:01,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 315. [2019-10-07 00:55:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-10-07 00:55:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 558 transitions. [2019-10-07 00:55:01,977 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 558 transitions. Word has length 87 [2019-10-07 00:55:01,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:55:01,977 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 558 transitions. [2019-10-07 00:55:01,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:55:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 558 transitions. [2019-10-07 00:55:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-07 00:55:01,981 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:55:01,982 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:55:01,982 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:55:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:55:01,982 INFO L82 PathProgramCache]: Analyzing trace with hash 311940311, now seen corresponding path program 1 times [2019-10-07 00:55:01,983 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:55:01,983 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:01,983 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:01,983 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:01,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:55:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:55:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:55:02,075 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:02,075 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:55:02,076 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 00:55:02,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:55:02,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:55:02,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:55:02,077 INFO L87 Difference]: Start difference. First operand 315 states and 558 transitions. Second operand 4 states. [2019-10-07 00:55:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:55:02,689 INFO L93 Difference]: Finished difference Result 775 states and 1399 transitions. [2019-10-07 00:55:02,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:55:02,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-07 00:55:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:55:02,695 INFO L225 Difference]: With dead ends: 775 [2019-10-07 00:55:02,695 INFO L226 Difference]: Without dead ends: 465 [2019-10-07 00:55:02,698 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:55:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-10-07 00:55:02,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2019-10-07 00:55:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-10-07 00:55:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 761 transitions. [2019-10-07 00:55:02,734 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 761 transitions. Word has length 88 [2019-10-07 00:55:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:55:02,735 INFO L462 AbstractCegarLoop]: Abstraction has 465 states and 761 transitions. [2019-10-07 00:55:02,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:55:02,735 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 761 transitions. [2019-10-07 00:55:02,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-07 00:55:02,740 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:55:02,740 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:55:02,741 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:55:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:55:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1766793137, now seen corresponding path program 1 times [2019-10-07 00:55:02,741 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:55:02,742 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:02,742 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:02,742 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:55:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:55:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:55:02,861 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:02,862 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:55:02,862 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:55:02,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:55:02,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:55:02,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:55:02,863 INFO L87 Difference]: Start difference. First operand 465 states and 761 transitions. Second operand 3 states. [2019-10-07 00:55:03,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:55:03,278 INFO L93 Difference]: Finished difference Result 1150 states and 1923 transitions. [2019-10-07 00:55:03,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:55:03,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-07 00:55:03,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:55:03,292 INFO L225 Difference]: With dead ends: 1150 [2019-10-07 00:55:03,292 INFO L226 Difference]: Without dead ends: 690 [2019-10-07 00:55:03,295 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:55:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-10-07 00:55:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2019-10-07 00:55:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-10-07 00:55:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1044 transitions. [2019-10-07 00:55:03,341 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1044 transitions. Word has length 92 [2019-10-07 00:55:03,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:55:03,341 INFO L462 AbstractCegarLoop]: Abstraction has 688 states and 1044 transitions. [2019-10-07 00:55:03,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:55:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1044 transitions. [2019-10-07 00:55:03,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-07 00:55:03,348 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:55:03,348 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:55:03,348 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:55:03,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:55:03,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1472447469, now seen corresponding path program 1 times [2019-10-07 00:55:03,349 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:55:03,349 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:03,349 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:03,350 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:55:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:55:03,453 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:55:03,454 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:03,454 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:55:03,454 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:55:03,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:55:03,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:55:03,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:55:03,456 INFO L87 Difference]: Start difference. First operand 688 states and 1044 transitions. Second operand 3 states. [2019-10-07 00:55:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:55:03,865 INFO L93 Difference]: Finished difference Result 1521 states and 2345 transitions. [2019-10-07 00:55:03,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:55:03,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-07 00:55:03,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:55:03,868 INFO L225 Difference]: With dead ends: 1521 [2019-10-07 00:55:03,869 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 00:55:03,872 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:55:03,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 00:55:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 00:55:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 00:55:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 00:55:03,873 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2019-10-07 00:55:03,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:55:03,874 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 00:55:03,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:55:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 00:55:03,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 00:55:03,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 00:55:04,200 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-10-07 00:55:04,299 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~a16~0 |old(~a16~0)|) [2019-10-07 00:55:04,300 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:55:04,300 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-07 00:55:04,300 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-07 00:55:04,300 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-07 00:55:04,300 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-07 00:55:04,301 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-07 00:55:04,301 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-07 00:55:04,301 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-07 00:55:04,301 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-07 00:55:04,301 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 563) no Hoare annotation was computed. [2019-10-07 00:55:04,301 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-07 00:55:04,302 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-07 00:55:04,302 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-07 00:55:04,302 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-07 00:55:04,302 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-07 00:55:04,302 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-07 00:55:04,302 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-07 00:55:04,302 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-07 00:55:04,303 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-07 00:55:04,303 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-07 00:55:04,303 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-07 00:55:04,303 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-07 00:55:04,303 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-07 00:55:04,303 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-07 00:55:04,303 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-07 00:55:04,304 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-07 00:55:04,304 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-07 00:55:04,304 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-07 00:55:04,304 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-07 00:55:04,304 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-07 00:55:04,304 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-07 00:55:04,304 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:55:04,305 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:55:04,305 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-07 00:55:04,305 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-07 00:55:04,305 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-07 00:55:04,305 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-07 00:55:04,305 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-07 00:55:04,306 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-07 00:55:04,306 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-07 00:55:04,306 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-07 00:55:04,306 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-07 00:55:04,306 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-07 00:55:04,306 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-07 00:55:04,306 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-07 00:55:04,307 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-07 00:55:04,307 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-07 00:55:04,307 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-07 00:55:04,307 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-07 00:55:04,307 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-07 00:55:04,308 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse1 (or (not (= ~a7~0 ~a20~0)) (not (= 1 ~a7~0)))) (.cse2 (and (= |old(~a7~0)| |old(~a20~0)|) (= 1 |old(~a20~0)|))) (.cse4 (= ~a16~0 |old(~a16~0)|)) (.cse3 (not (= ~a8~0 13))) (.cse0 (= 13 |old(~a8~0)|))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse0 .cse2) (or (and (not (= ~a21~0 1)) .cse4) (= 1 |old(~a21~0)|)) (or (= 5 |old(~a16~0)|) (and .cse4 .cse1) .cse2) (or .cse4 (not (= 4 |old(~a16~0)|))) (or (= 6 |old(~a16~0)|) (and .cse4 .cse3) .cse0))) [2019-10-07 00:55:04,308 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-07 00:55:04,308 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-07 00:55:04,308 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-07 00:55:04,308 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-07 00:55:04,308 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-07 00:55:04,308 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-07 00:55:04,309 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-07 00:55:04,309 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:55:04,309 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-07 00:55:04,309 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-07 00:55:04,309 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-07 00:55:04,309 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-07 00:55:04,310 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-07 00:55:04,310 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-07 00:55:04,310 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-07 00:55:04,310 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-07 00:55:04,310 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-07 00:55:04,310 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:55:04,311 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-07 00:55:04,311 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-07 00:55:04,311 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-07 00:55:04,311 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-07 00:55:04,311 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-07 00:55:04,311 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:55:04,311 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a7~0 ~a20~0)) (not (= ~a16~0 6)) (not (= ~a8~0 13))) [2019-10-07 00:55:04,312 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 00:55:04,312 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 00:55:04,312 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 13 |old(~a8~0)|) (= |old(~a7~0)| |old(~a20~0)|) (and (not (= ~a7~0 ~a20~0)) (= ~a16~0 |old(~a16~0)|) (not (= ~a8~0 13)))) [2019-10-07 00:55:04,312 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-07 00:55:04,312 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (or (= ~a16~0 4) (= 6 |old(~a16~0)|) (and (not (= ~a16~0 6)) (not (= ~a8~0 13))) (not (= ~a21~0 1)) (= 13 |old(~a8~0)|) (= |old(~a7~0)| |old(~a20~0)|) (and (or (not (= ~a7~0 ~a20~0)) (not (= 1 ~a7~0))) (not (= ~a16~0 5)))) [2019-10-07 00:55:04,313 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-07 00:55:04,313 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-07 00:55:04,313 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (or (= ~a16~0 4) (= 6 |old(~a16~0)|) (and (not (= ~a16~0 6)) (not (= ~a8~0 13))) (not (= ~a21~0 1)) (= 13 |old(~a8~0)|) (= |old(~a7~0)| |old(~a20~0)|) (and (or (not (= ~a7~0 ~a20~0)) (not (= 1 ~a7~0))) (not (= ~a16~0 5)))) [2019-10-07 00:55:04,313 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-07 00:55:04,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 12:55:04 BoogieIcfgContainer [2019-10-07 00:55:04,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 00:55:04,334 INFO L168 Benchmark]: Toolchain (without parser) took 7516.93 ms. Allocated memory was 146.3 MB in the beginning and 320.3 MB in the end (delta: 174.1 MB). Free memory was 101.1 MB in the beginning and 198.9 MB in the end (delta: -97.8 MB). Peak memory consumption was 76.3 MB. Max. memory is 7.1 GB. [2019-10-07 00:55:04,335 INFO L168 Benchmark]: CDTParser took 0.21 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-10-07 00:55:04,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.47 ms. Allocated memory was 146.3 MB in the beginning and 206.0 MB in the end (delta: 59.8 MB). Free memory was 100.6 MB in the beginning and 171.7 MB in the end (delta: -71.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. [2019-10-07 00:55:04,337 INFO L168 Benchmark]: Boogie Preprocessor took 107.06 ms. Allocated memory is still 206.0 MB. Free memory was 171.7 MB in the beginning and 167.0 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-10-07 00:55:04,338 INFO L168 Benchmark]: RCFGBuilder took 1960.32 ms. Allocated memory was 206.0 MB in the beginning and 248.5 MB in the end (delta: 42.5 MB). Free memory was 167.0 MB in the beginning and 204.5 MB in the end (delta: -37.5 MB). Peak memory consumption was 114.4 MB. Max. memory is 7.1 GB. [2019-10-07 00:55:04,339 INFO L168 Benchmark]: TraceAbstraction took 4742.59 ms. Allocated memory was 248.5 MB in the beginning and 320.3 MB in the end (delta: 71.8 MB). Free memory was 204.5 MB in the beginning and 198.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 77.4 MB. Max. memory is 7.1 GB. [2019-10-07 00:55:04,343 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 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 702.47 ms. Allocated memory was 146.3 MB in the beginning and 206.0 MB in the end (delta: 59.8 MB). Free memory was 100.6 MB in the beginning and 171.7 MB in the end (delta: -71.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.06 ms. Allocated memory is still 206.0 MB. Free memory was 171.7 MB in the beginning and 167.0 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1960.32 ms. Allocated memory was 206.0 MB in the beginning and 248.5 MB in the end (delta: 42.5 MB). Free memory was 167.0 MB in the beginning and 204.5 MB in the end (delta: -37.5 MB). Peak memory consumption was 114.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4742.59 ms. Allocated memory was 248.5 MB in the beginning and 320.3 MB in the end (delta: 71.8 MB). Free memory was 204.5 MB in the beginning and 198.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 77.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 563]: 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: (((((a16 == 4 || 6 == \old(a16)) || (!(a16 == 6) && !(a8 == 13))) || !(a21 == 1)) || 13 == \old(a8)) || \old(a7) == \old(a20)) || ((!(a7 == a20) || !(1 == a7)) && !(a16 == 5)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 1 error locations. Result: SAFE, OverallTime: 4.6s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 382 SDtfs, 516 SDslu, 110 SDs, 0 SdLazy, 1592 SolverSat, 414 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=688occurred 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.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 89 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 39 PreInvPairs, 61 NumberOfFragments, 214 HoareAnnotationTreeSize, 39 FomulaSimplifications, 510 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 317 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 455 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 450 ConstructedInterpolants, 0 QuantifiedInterpolants, 149754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 58/58 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...