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_label11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:55:22,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:55:22,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:55:22,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:55:22,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:55:22,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:55:22,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:55:22,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:55:22,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:55:22,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:55:22,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:55:22,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:55:22,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:55:22,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:55:22,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:55:22,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:55:22,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:55:22,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:55:22,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:55:22,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:55:22,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:55:22,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:55:22,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:55:22,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:55:22,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:55:22,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:55:22,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:55:22,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:55:22,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:55:22,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:55:22,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:55:22,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:55:22,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:55:22,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:55:22,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:55:22,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:55:22,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:55:22,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:55:22,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:55:22,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:55:22,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:55:22,975 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:55:22,995 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:55:22,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:55:22,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:55:22,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:55:22,998 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:55:22,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:55:22,999 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:55:22,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:55:22,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:55:22,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:55:23,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:55:23,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:55:23,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:55:23,001 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:55:23,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:55:23,002 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:55:23,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:55:23,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:55:23,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:55:23,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:55:23,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:55:23,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:55:23,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:55:23,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:55:23,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:55:23,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:55:23,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:55:23,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:55:23,004 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:55:23,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:55:23,293 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:55:23,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:55:23,298 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:55:23,299 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:55:23,299 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11.c [2019-10-07 00:55:23,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e20b4d15/c98fd94871824b4799543ca80d8e41aa/FLAG99f010015 [2019-10-07 00:55:24,019 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:55:24,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label11.c [2019-10-07 00:55:24,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e20b4d15/c98fd94871824b4799543ca80d8e41aa/FLAG99f010015 [2019-10-07 00:55:24,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e20b4d15/c98fd94871824b4799543ca80d8e41aa [2019-10-07 00:55:24,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:55:24,266 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:55:24,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:55:24,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:55:24,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:55:24,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:55:24" (1/1) ... [2019-10-07 00:55:24,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@221df6b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:24, skipping insertion in model container [2019-10-07 00:55:24,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:55:24" (1/1) ... [2019-10-07 00:55:24,286 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:55:24,359 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:55:24,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:55:24,955 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:55:25,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:55:25,206 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:55:25,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:25 WrapperNode [2019-10-07 00:55:25,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:55:25,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:55:25,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:55:25,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:55:25,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:25" (1/1) ... [2019-10-07 00:55:25,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:25" (1/1) ... [2019-10-07 00:55:25,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:25" (1/1) ... [2019-10-07 00:55:25,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:25" (1/1) ... [2019-10-07 00:55:25,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:25" (1/1) ... [2019-10-07 00:55:25,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:25" (1/1) ... [2019-10-07 00:55:25,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:25" (1/1) ... [2019-10-07 00:55:25,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:55:25,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:55:25,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:55:25,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:55:25,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:25" (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:55:25,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:55:25,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:55:25,417 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:55:25,417 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:55:25,417 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:55:25,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:55:25,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:55:25,419 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:55:25,419 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:55:25,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:55:25,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:55:27,550 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:55:27,551 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:55:27,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:55:27 BoogieIcfgContainer [2019-10-07 00:55:27,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:55:27,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:55:27,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:55:27,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:55:27,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:55:24" (1/3) ... [2019-10-07 00:55:27,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16df460d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:55:27, skipping insertion in model container [2019-10-07 00:55:27,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:25" (2/3) ... [2019-10-07 00:55:27,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16df460d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:55:27, skipping insertion in model container [2019-10-07 00:55:27,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:55:27" (3/3) ... [2019-10-07 00:55:27,573 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label11.c [2019-10-07 00:55:27,586 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:55:27,601 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:55:27,611 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:55:27,642 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:55:27,642 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:55:27,642 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:55:27,642 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:55:27,642 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:55:27,643 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:55:27,643 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:55:27,643 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:55:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-07 00:55:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-07 00:55:27,684 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:55:27,686 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:55:27,687 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:55:27,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:55:27,693 INFO L82 PathProgramCache]: Analyzing trace with hash 826820708, now seen corresponding path program 1 times [2019-10-07 00:55:27,703 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:55:27,703 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:27,703 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:27,703 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:27,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:55:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:55:28,193 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:28,194 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:28,195 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:55:28,195 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:55:28,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:55:28,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:55:28,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:55:28,218 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-10-07 00:55:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:55:28,745 INFO L93 Difference]: Finished difference Result 246 states and 454 transitions. [2019-10-07 00:55:28,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:55:28,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-07 00:55:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:55:28,771 INFO L225 Difference]: With dead ends: 246 [2019-10-07 00:55:28,772 INFO L226 Difference]: Without dead ends: 157 [2019-10-07 00:55:28,778 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:28,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-07 00:55:28,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-07 00:55:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-07 00:55:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2019-10-07 00:55:28,846 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 77 [2019-10-07 00:55:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:55:28,847 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2019-10-07 00:55:28,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:55:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2019-10-07 00:55:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-07 00:55:28,852 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:55:28,852 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:28,853 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:55:28,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:55:28,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1195665925, now seen corresponding path program 1 times [2019-10-07 00:55:28,854 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:55:28,854 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:28,854 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:28,854 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:28,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:55:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:55:28,999 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:29,000 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:29,000 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:55:29,000 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:55:29,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:55:29,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:55:29,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:55:29,003 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand 6 states. [2019-10-07 00:55:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:55:29,622 INFO L93 Difference]: Finished difference Result 402 states and 725 transitions. [2019-10-07 00:55:29,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:55:29,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-07 00:55:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:55:29,634 INFO L225 Difference]: With dead ends: 402 [2019-10-07 00:55:29,635 INFO L226 Difference]: Without dead ends: 250 [2019-10-07 00:55:29,637 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:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-07 00:55:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-10-07 00:55:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-07 00:55:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 407 transitions. [2019-10-07 00:55:29,664 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 407 transitions. Word has length 87 [2019-10-07 00:55:29,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:55:29,664 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 407 transitions. [2019-10-07 00:55:29,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:55:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 407 transitions. [2019-10-07 00:55:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-07 00:55:29,669 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:55:29,669 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:29,670 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:55:29,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:55:29,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2128687529, now seen corresponding path program 1 times [2019-10-07 00:55:29,670 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:55:29,671 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:29,671 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:29,671 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:29,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:55:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:55:29,894 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:29,895 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:29,896 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:55:29,896 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 00:55:29,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:55:29,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:55:29,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:55:29,898 INFO L87 Difference]: Start difference. First operand 238 states and 407 transitions. Second operand 4 states. [2019-10-07 00:55:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:55:30,606 INFO L93 Difference]: Finished difference Result 852 states and 1533 transitions. [2019-10-07 00:55:30,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:55:30,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-07 00:55:30,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:55:30,613 INFO L225 Difference]: With dead ends: 852 [2019-10-07 00:55:30,613 INFO L226 Difference]: Without dead ends: 619 [2019-10-07 00:55:30,616 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:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-07 00:55:30,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 544. [2019-10-07 00:55:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-07 00:55:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 888 transitions. [2019-10-07 00:55:30,685 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 888 transitions. Word has length 88 [2019-10-07 00:55:30,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:55:30,686 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 888 transitions. [2019-10-07 00:55:30,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:55:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 888 transitions. [2019-10-07 00:55:30,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-07 00:55:30,693 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:55:30,693 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:55:30,693 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:55:30,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:55:30,694 INFO L82 PathProgramCache]: Analyzing trace with hash 579795659, now seen corresponding path program 1 times [2019-10-07 00:55:30,694 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:55:30,694 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:30,694 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:30,695 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:30,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:55:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:55:30,845 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:55:30,845 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:30,845 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:55:30,846 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:55:30,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:55:30,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:55:30,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:55:30,848 INFO L87 Difference]: Start difference. First operand 544 states and 888 transitions. Second operand 3 states. [2019-10-07 00:55:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:55:31,310 INFO L93 Difference]: Finished difference Result 1543 states and 2645 transitions. [2019-10-07 00:55:31,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:55:31,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-07 00:55:31,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:55:31,328 INFO L225 Difference]: With dead ends: 1543 [2019-10-07 00:55:31,329 INFO L226 Difference]: Without dead ends: 1004 [2019-10-07 00:55:31,334 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:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-10-07 00:55:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2019-10-07 00:55:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-10-07 00:55:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1637 transitions. [2019-10-07 00:55:31,389 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1637 transitions. Word has length 94 [2019-10-07 00:55:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:55:31,389 INFO L462 AbstractCegarLoop]: Abstraction has 1004 states and 1637 transitions. [2019-10-07 00:55:31,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:55:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1637 transitions. [2019-10-07 00:55:31,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-07 00:55:31,399 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:55:31,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,400 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:55:31,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:55:31,400 INFO L82 PathProgramCache]: Analyzing trace with hash 95151799, now seen corresponding path program 1 times [2019-10-07 00:55:31,401 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:55:31,401 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:31,401 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:31,401 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:31,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:55:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:55:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:55:31,554 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:31,554 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:55:31,555 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:55:31,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:55:31,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:55:31,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:55:31,556 INFO L87 Difference]: Start difference. First operand 1004 states and 1637 transitions. Second operand 6 states. [2019-10-07 00:55:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:55:32,164 INFO L93 Difference]: Finished difference Result 2442 states and 4169 transitions. [2019-10-07 00:55:32,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:55:32,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-10-07 00:55:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:55:32,166 INFO L225 Difference]: With dead ends: 2442 [2019-10-07 00:55:32,166 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 00:55:32,172 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:55:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 00:55:32,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 00:55:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 00:55:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 00:55:32,173 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2019-10-07 00:55:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:55:32,173 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 00:55:32,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:55:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 00:55:32,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 00:55:32,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 00:55:32,695 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 39 [2019-10-07 00:55:32,860 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= ~a16~0 |old(~a16~0)|)) [2019-10-07 00:55:32,861 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:55:32,861 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-07 00:55:32,861 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-07 00:55:32,861 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:55:32,861 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-07 00:55:32,861 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-07 00:55:32,861 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-07 00:55:32,862 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-07 00:55:32,862 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:55:32,862 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-07 00:55:32,862 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-07 00:55:32,862 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-07 00:55:32,862 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-07 00:55:32,862 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-07 00:55:32,863 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-07 00:55:32,863 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-07 00:55:32,863 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-07 00:55:32,863 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-07 00:55:32,863 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-07 00:55:32,863 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-07 00:55:32,864 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-07 00:55:32,864 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-07 00:55:32,864 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 503) no Hoare annotation was computed. [2019-10-07 00:55:32,864 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-07 00:55:32,864 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-07 00:55:32,864 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-07 00:55:32,865 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-07 00:55:32,865 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-07 00:55:32,865 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-07 00:55:32,865 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-07 00:55:32,865 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-07 00:55:32,865 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-07 00:55:32,865 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-07 00:55:32,865 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-07 00:55:32,866 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:55:32,866 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:55:32,866 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-07 00:55:32,866 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-07 00:55:32,866 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-07 00:55:32,866 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-07 00:55:32,867 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-07 00:55:32,867 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-07 00:55:32,867 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-07 00:55:32,867 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-07 00:55:32,867 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-07 00:55:32,867 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-07 00:55:32,867 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-07 00:55:32,867 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-07 00:55:32,868 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-07 00:55:32,868 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-07 00:55:32,868 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-07 00:55:32,868 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-07 00:55:32,868 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-07 00:55:32,869 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse1 (= ~a7~0 |old(~a7~0)|)) (.cse3 (= ~a16~0 |old(~a16~0)|))) (let ((.cse5 (not (= 14 ~a8~0))) (.cse9 (not (= ~a17~0 1))) (.cse7 (= 1 |old(~a17~0)|)) (.cse6 (= 14 |old(~a8~0)|)) (.cse0 (= 6 |old(~a16~0)|)) (.cse10 (and .cse1 .cse3)) (.cse8 (= 1 |old(~a7~0)|)) (.cse2 (= 13 ~a8~0)) (.cse4 (not (= 13 |old(~a8~0)|)))) (and (or .cse0 (and .cse1 .cse2 .cse3) .cse4) (or .cse0 .cse5 .cse6 .cse7) (or .cse8 .cse6 .cse5) (or .cse0 .cse7 (and .cse1 .cse3 .cse9)) (or .cse8 .cse6 .cse7 .cse9) (or (and .cse1 .cse2 .cse3 .cse9) .cse7 .cse4) (or .cse8 .cse10 .cse6) (or .cse0 .cse8 .cse10) (or .cse8 .cse2 .cse4)))) [2019-10-07 00:55:32,869 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-07 00:55:32,869 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-07 00:55:32,869 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-07 00:55:32,869 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-07 00:55:32,869 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-07 00:55:32,870 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-07 00:55:32,870 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-07 00:55:32,870 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-07 00:55:32,870 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-07 00:55:32,870 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-07 00:55:32,870 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-07 00:55:32,870 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-07 00:55:32,870 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-07 00:55:32,871 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-07 00:55:32,871 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-07 00:55:32,871 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-07 00:55:32,871 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-07 00:55:32,871 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-07 00:55:32,871 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-07 00:55:32,871 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-07 00:55:32,872 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:55:32,872 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a7~0 1)) (not (= ~a16~0 6)) (not (= 14 ~a8~0)) (not (= ~a16~0 4))) [2019-10-07 00:55:32,872 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 00:55:32,872 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 00:55:32,872 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (= 4 |old(~a16~0)|) (= 14 |old(~a8~0)|) (and (= ~a7~0 |old(~a7~0)|) (= ~a16~0 |old(~a16~0)|) (not (= 14 ~a8~0)))) [2019-10-07 00:55:32,873 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-07 00:55:32,873 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse2 (not (= ~a7~0 1))) (.cse0 (not (= ~a16~0 6))) (.cse3 (= 13 ~a8~0)) (.cse1 (not (= ~a17~0 1)))) (or (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (and .cse0 .cse1) (= 4 |old(~a16~0)|) (and .cse2 .cse0) (= 14 |old(~a8~0)|) (and .cse2 (not (= 14 ~a8~0))) (and .cse3 .cse0) (and .cse3 .cse1))) [2019-10-07 00:55:32,873 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-07 00:55:32,873 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-07 00:55:32,873 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (not (= ~a7~0 1))) (.cse0 (not (= ~a16~0 6))) (.cse3 (= 13 ~a8~0)) (.cse1 (not (= ~a17~0 1)))) (or (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (and .cse0 .cse1) (= 4 |old(~a16~0)|) (and .cse2 .cse0) (= 14 |old(~a8~0)|) (and .cse2 (not (= 14 ~a8~0))) (and .cse3 .cse0) (and .cse3 .cse1))) [2019-10-07 00:55:32,874 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-07 00:55:32,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 12:55:32 BoogieIcfgContainer [2019-10-07 00:55:32,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 00:55:32,901 INFO L168 Benchmark]: Toolchain (without parser) took 8636.24 ms. Allocated memory was 146.3 MB in the beginning and 323.0 MB in the end (delta: 176.7 MB). Free memory was 103.0 MB in the beginning and 163.1 MB in the end (delta: -60.1 MB). Peak memory consumption was 116.6 MB. Max. memory is 7.1 GB. [2019-10-07 00:55:32,902 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 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:32,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 940.54 ms. Allocated memory was 146.3 MB in the beginning and 205.5 MB in the end (delta: 59.2 MB). Free memory was 102.8 MB in the beginning and 172.2 MB in the end (delta: -69.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2019-10-07 00:55:32,906 INFO L168 Benchmark]: Boogie Preprocessor took 128.63 ms. Allocated memory is still 205.5 MB. Free memory was 172.2 MB in the beginning and 167.3 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:55:32,908 INFO L168 Benchmark]: RCFGBuilder took 2216.86 ms. Allocated memory was 205.5 MB in the beginning and 248.0 MB in the end (delta: 42.5 MB). Free memory was 167.3 MB in the beginning and 206.0 MB in the end (delta: -38.7 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. [2019-10-07 00:55:32,909 INFO L168 Benchmark]: TraceAbstraction took 5343.16 ms. Allocated memory was 248.0 MB in the beginning and 323.0 MB in the end (delta: 75.0 MB). Free memory was 206.0 MB in the beginning and 163.1 MB in the end (delta: 42.9 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:55:32,923 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.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 940.54 ms. Allocated memory was 146.3 MB in the beginning and 205.5 MB in the end (delta: 59.2 MB). Free memory was 102.8 MB in the beginning and 172.2 MB in the end (delta: -69.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.63 ms. Allocated memory is still 205.5 MB. Free memory was 172.2 MB in the beginning and 167.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2216.86 ms. Allocated memory was 205.5 MB in the beginning and 248.0 MB in the end (delta: 42.5 MB). Free memory was 167.3 MB in the beginning and 206.0 MB in the end (delta: -38.7 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5343.16 ms. Allocated memory was 248.0 MB in the beginning and 323.0 MB in the end (delta: 75.0 MB). Free memory was 206.0 MB in the beginning and 163.1 MB in the end (delta: 42.9 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 503]: 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: (((((((6 == \old(a16) || 1 == \old(a7)) || (!(a16 == 6) && !(a17 == 1))) || 4 == \old(a16)) || (!(a7 == 1) && !(a16 == 6))) || 14 == \old(a8)) || (!(a7 == 1) && !(14 == a8))) || (13 == a8 && !(a16 == 6))) || (13 == a8 && !(a17 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 1 error locations. Result: SAFE, OverallTime: 5.2s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 246 SDtfs, 685 SDslu, 111 SDs, 0 SdLazy, 1696 SolverSat, 429 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1004occurred 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, 87 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 57 PreInvPairs, 107 NumberOfFragments, 298 HoareAnnotationTreeSize, 57 FomulaSimplifications, 1347 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 481 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 467 NumberOfCodeBlocks, 467 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 462 ConstructedInterpolants, 0 QuantifiedInterpolants, 131071 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 70/70 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...