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_label06.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:39:55,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:39:55,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:39:55,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:39:55,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:39:55,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:39:55,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:39:55,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:39:55,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:39:55,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:39:55,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:39:55,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:39:55,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:39:55,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:39:55,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:39:55,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:39:55,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:39:55,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:39:55,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:39:55,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:39:55,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:39:55,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:39:55,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:39:55,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:39:55,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:39:55,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:39:55,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:39:55,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:39:55,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:39:55,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:39:55,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:39:55,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:39:55,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:39:55,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:39:55,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:39:55,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:39:55,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:39:55,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:39:55,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:39:55,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:39:55,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:39:55,241 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-13 21:39:55,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:39:55,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:39:55,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:39:55,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:39:55,261 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:39:55,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:39:55,262 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:39:55,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:39:55,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:39:55,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:39:55,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:39:55,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:39:55,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:39:55,263 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:39:55,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:39:55,263 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:39:55,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:39:55,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:39:55,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:39:55,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:39:55,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:39:55,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:39:55,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:39:55,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:39:55,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:39:55,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:39:55,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:39:55,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:39:55,266 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-13 21:39:55,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:39:55,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:39:55,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:39:55,594 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:39:55,594 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:39:55,595 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label06.c [2019-10-13 21:39:55,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb65e956/11681e91f8784b3f977c0937d57fe721/FLAGa1202231b [2019-10-13 21:39:56,215 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:39:56,216 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label06.c [2019-10-13 21:39:56,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb65e956/11681e91f8784b3f977c0937d57fe721/FLAGa1202231b [2019-10-13 21:39:56,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb65e956/11681e91f8784b3f977c0937d57fe721 [2019-10-13 21:39:56,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:39:56,513 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:39:56,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:39:56,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:39:56,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:39:56,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:39:56" (1/1) ... [2019-10-13 21:39:56,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52da3fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:56, skipping insertion in model container [2019-10-13 21:39:56,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:39:56" (1/1) ... [2019-10-13 21:39:56,530 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:39:56,577 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:39:57,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:39:57,143 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:39:57,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:39:57,300 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:39:57,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:57 WrapperNode [2019-10-13 21:39:57,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:39:57,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:39:57,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:39:57,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:39:57,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:57" (1/1) ... [2019-10-13 21:39:57,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:57" (1/1) ... [2019-10-13 21:39:57,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:57" (1/1) ... [2019-10-13 21:39:57,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:57" (1/1) ... [2019-10-13 21:39:57,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:57" (1/1) ... [2019-10-13 21:39:57,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:57" (1/1) ... [2019-10-13 21:39:57,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:57" (1/1) ... [2019-10-13 21:39:57,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:39:57,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:39:57,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:39:57,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:39:57,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39: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-13 21:39:57,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:39:57,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:39:57,526 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:39:57,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:39:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:39:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:39:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:39:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:39:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:39:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:39:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:39:59,464 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:39:59,464 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:39:59,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:39:59 BoogieIcfgContainer [2019-10-13 21:39:59,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:39:59,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:39:59,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:39:59,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:39:59,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:39:56" (1/3) ... [2019-10-13 21:39:59,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d8004c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:39:59, skipping insertion in model container [2019-10-13 21:39:59,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:57" (2/3) ... [2019-10-13 21:39:59,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d8004c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:39:59, skipping insertion in model container [2019-10-13 21:39:59,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:39:59" (3/3) ... [2019-10-13 21:39:59,480 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label06.c [2019-10-13 21:39:59,494 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:39:59,503 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:39:59,515 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:39:59,541 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:39:59,542 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:39:59,542 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:39:59,542 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:39:59,542 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:39:59,542 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:39:59,543 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:39:59,543 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:39:59,564 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-13 21:39:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 21:39:59,573 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:59,574 INFO L380 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-13 21:39:59,576 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:59,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:59,581 INFO L82 PathProgramCache]: Analyzing trace with hash 826824548, now seen corresponding path program 1 times [2019-10-13 21:39:59,591 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:59,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280370029] [2019-10-13 21:39:59,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:59,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:59,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:00,095 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-13 21:40:00,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280370029] [2019-10-13 21:40:00,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:00,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:00,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265270890] [2019-10-13 21:40:00,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:00,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:00,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:00,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:00,125 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-10-13 21:40:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:00,637 INFO L93 Difference]: Finished difference Result 246 states and 454 transitions. [2019-10-13 21:40:00,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:00,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-13 21:40:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:00,668 INFO L225 Difference]: With dead ends: 246 [2019-10-13 21:40:00,668 INFO L226 Difference]: Without dead ends: 157 [2019-10-13 21:40:00,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-13 21:40:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-13 21:40:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-13 21:40:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 273 transitions. [2019-10-13 21:40:00,787 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 273 transitions. Word has length 77 [2019-10-13 21:40:00,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:00,789 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 273 transitions. [2019-10-13 21:40:00,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:00,791 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 273 transitions. [2019-10-13 21:40:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 21:40:00,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:00,799 INFO L380 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-13 21:40:00,799 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:00,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1195662085, now seen corresponding path program 1 times [2019-10-13 21:40:00,801 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:00,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194288926] [2019-10-13 21:40:00,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:00,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:00,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:00,980 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-13 21:40:00,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194288926] [2019-10-13 21:40:00,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:00,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:40:00,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840958064] [2019-10-13 21:40:00,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:40:00,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:00,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:40:00,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:40:00,984 INFO L87 Difference]: Start difference. First operand 157 states and 273 transitions. Second operand 6 states. [2019-10-13 21:40:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:01,605 INFO L93 Difference]: Finished difference Result 479 states and 861 transitions. [2019-10-13 21:40:01,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:40:01,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-13 21:40:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:01,611 INFO L225 Difference]: With dead ends: 479 [2019-10-13 21:40:01,611 INFO L226 Difference]: Without dead ends: 327 [2019-10-13 21:40:01,614 INFO L600 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-13 21:40:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-13 21:40:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 315. [2019-10-13 21:40:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-10-13 21:40:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 544 transitions. [2019-10-13 21:40:01,654 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 544 transitions. Word has length 87 [2019-10-13 21:40:01,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:01,654 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 544 transitions. [2019-10-13 21:40:01,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:40:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 544 transitions. [2019-10-13 21:40:01,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 21:40:01,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:01,658 INFO L380 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-13 21:40:01,658 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:01,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:01,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2128683689, now seen corresponding path program 1 times [2019-10-13 21:40:01,659 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:01,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862560572] [2019-10-13 21:40:01,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:01,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:01,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:01,811 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-13 21:40:01,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862560572] [2019-10-13 21:40:01,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:01,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:40:01,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568433505] [2019-10-13 21:40:01,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:40:01,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:01,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:40:01,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:40:01,814 INFO L87 Difference]: Start difference. First operand 315 states and 544 transitions. Second operand 4 states. [2019-10-13 21:40:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:02,495 INFO L93 Difference]: Finished difference Result 775 states and 1364 transitions. [2019-10-13 21:40:02,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:40:02,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-13 21:40:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:02,502 INFO L225 Difference]: With dead ends: 775 [2019-10-13 21:40:02,502 INFO L226 Difference]: Without dead ends: 465 [2019-10-13 21:40:02,504 INFO L600 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-13 21:40:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-10-13 21:40:02,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2019-10-13 21:40:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-10-13 21:40:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 740 transitions. [2019-10-13 21:40:02,548 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 740 transitions. Word has length 88 [2019-10-13 21:40:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:02,550 INFO L462 AbstractCegarLoop]: Abstraction has 465 states and 740 transitions. [2019-10-13 21:40:02,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:40:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 740 transitions. [2019-10-13 21:40:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:40:02,563 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:02,564 INFO L380 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-13 21:40:02,564 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:02,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:02,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1557880911, now seen corresponding path program 1 times [2019-10-13 21:40:02,565 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:02,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010535195] [2019-10-13 21:40:02,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:02,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:02,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:02,691 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-13 21:40:02,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010535195] [2019-10-13 21:40:02,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:02,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:02,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937960045] [2019-10-13 21:40:02,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:02,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:02,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:02,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:02,695 INFO L87 Difference]: Start difference. First operand 465 states and 740 transitions. Second operand 3 states. [2019-10-13 21:40:03,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:03,155 INFO L93 Difference]: Finished difference Result 1302 states and 2142 transitions. [2019-10-13 21:40:03,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:03,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-13 21:40:03,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:03,162 INFO L225 Difference]: With dead ends: 1302 [2019-10-13 21:40:03,163 INFO L226 Difference]: Without dead ends: 842 [2019-10-13 21:40:03,164 INFO L600 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-13 21:40:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-10-13 21:40:03,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 840. [2019-10-13 21:40:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-10-13 21:40:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1308 transitions. [2019-10-13 21:40:03,204 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1308 transitions. Word has length 92 [2019-10-13 21:40:03,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:03,204 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1308 transitions. [2019-10-13 21:40:03,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:03,205 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1308 transitions. [2019-10-13 21:40:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 21:40:03,209 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:03,210 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:40:03,210 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:03,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:03,210 INFO L82 PathProgramCache]: Analyzing trace with hash 773418834, now seen corresponding path program 1 times [2019-10-13 21:40:03,211 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:03,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161547507] [2019-10-13 21:40:03,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:03,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:03,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:40:03,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161547507] [2019-10-13 21:40:03,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:03,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:40:03,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626882546] [2019-10-13 21:40:03,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:40:03,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:03,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:40:03,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:40:03,375 INFO L87 Difference]: Start difference. First operand 840 states and 1308 transitions. Second operand 4 states. [2019-10-13 21:40:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:03,951 INFO L93 Difference]: Finished difference Result 2425 states and 3876 transitions. [2019-10-13 21:40:03,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:40:03,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-13 21:40:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:03,952 INFO L225 Difference]: With dead ends: 2425 [2019-10-13 21:40:03,952 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:40:03,960 INFO L600 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-13 21:40:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:40:03,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:40:03,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:40:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:40:03,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2019-10-13 21:40:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:03,962 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:40:03,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:40:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:40:03,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:40:03,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:40:04,439 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2019-10-13 21:40:04,536 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~a16~0 |old(~a16~0)|) [2019-10-13 21:40:04,537 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:40:04,537 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-13 21:40:04,537 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-13 21:40:04,537 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-13 21:40:04,537 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-13 21:40:04,537 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-13 21:40:04,537 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-13 21:40:04,538 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-13 21:40:04,538 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-13 21:40:04,538 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-13 21:40:04,538 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-13 21:40:04,538 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-13 21:40:04,538 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-13 21:40:04,538 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-13 21:40:04,539 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-13 21:40:04,539 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-13 21:40:04,539 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-13 21:40:04,541 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-13 21:40:04,541 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-13 21:40:04,541 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-13 21:40:04,542 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-13 21:40:04,542 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-13 21:40:04,542 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-13 21:40:04,542 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-13 21:40:04,542 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-13 21:40:04,545 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-13 21:40:04,545 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:04,545 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2019-10-13 21:40:04,545 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-13 21:40:04,545 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-13 21:40:04,546 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-13 21:40:04,546 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-13 21:40:04,546 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:04,546 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:04,546 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:04,546 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-13 21:40:04,546 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-13 21:40:04,547 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-13 21:40:04,547 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-13 21:40:04,547 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-13 21:40:04,547 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-13 21:40:04,552 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-13 21:40:04,552 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-13 21:40:04,552 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-13 21:40:04,552 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-13 21:40:04,553 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-13 21:40:04,553 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-13 21:40:04,553 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-13 21:40:04,553 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-13 21:40:04,553 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-13 21:40:04,553 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-13 21:40:04,553 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-13 21:40:04,553 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-13 21:40:04,554 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse6 (not (= 1 |old(~a20~0)|))) (.cse5 (not (= 4 |old(~a16~0)|))) (.cse3 (= 1 |old(~a7~0)|)) (.cse1 (not (= 15 |old(~a8~0)|))) (.cse4 (not (= ~a7~0 1))) (.cse2 (= 15 ~a8~0)) (.cse0 (= 6 |old(~a16~0)|)) (.cse8 (= ~a16~0 |old(~a16~0)|)) (.cse7 (= 13 |old(~a8~0)|))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5) (or .cse3 (= 5 |old(~a16~0)|) .cse6 .cse4) (or .cse0 .cse3 .cse4 .cse7) (or (and .cse8 (= ~a20~0 1)) .cse6) (or .cse8 .cse5) (or .cse3 .cse1 (and .cse4 .cse8 .cse2)) (or .cse0 (and .cse8 (not (= 13 ~a8~0))) .cse7))) [2019-10-13 21:40:04,554 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-13 21:40:04,554 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-13 21:40:04,554 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-13 21:40:04,554 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-13 21:40:04,554 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-13 21:40:04,555 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-13 21:40:04,555 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-13 21:40:04,555 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-13 21:40:04,555 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-13 21:40:04,557 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-13 21:40:04,557 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-13 21:40:04,557 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-13 21:40:04,557 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-13 21:40:04,557 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-13 21:40:04,557 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-13 21:40:04,557 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-13 21:40:04,558 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-13 21:40:04,558 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-13 21:40:04,558 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-13 21:40:04,558 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-13 21:40:04,558 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:40:04,558 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a7~0 1)) (not (= ~a16~0 6)) (= ~a20~0 1) (= 15 ~a8~0)) [2019-10-13 21:40:04,559 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:40:04,559 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:40:04,559 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (and (not (= ~a7~0 1)) (= ~a16~0 |old(~a16~0)|) (= ~a20~0 1) (= 15 ~a8~0))) [2019-10-13 21:40:04,559 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-13 21:40:04,559 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (or (= ~a16~0 4) (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (= ~a20~0 1) (and (not (= ~a16~0 6)) (not (= 13 ~a8~0))) (and (not (= ~a7~0 1)) (= 15 ~a8~0))) [2019-10-13 21:40:04,559 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-13 21:40:04,559 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-13 21:40:04,560 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (or (= ~a16~0 4) (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (= ~a20~0 1) (and (not (= ~a16~0 6)) (not (= 13 ~a8~0))) (and (not (= ~a7~0 1)) (= 15 ~a8~0))) [2019-10-13 21:40:04,560 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-13 21:40:04,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:40:04 BoogieIcfgContainer [2019-10-13 21:40:04,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:40:04,595 INFO L168 Benchmark]: Toolchain (without parser) took 8079.55 ms. Allocated memory was 146.8 MB in the beginning and 324.5 MB in the end (delta: 177.7 MB). Free memory was 102.3 MB in the beginning and 207.0 MB in the end (delta: -104.7 MB). Peak memory consumption was 154.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:04,597 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:40:04,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.32 ms. Allocated memory was 146.8 MB in the beginning and 206.6 MB in the end (delta: 59.8 MB). Free memory was 102.0 MB in the beginning and 171.7 MB in the end (delta: -69.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:04,601 INFO L168 Benchmark]: Boogie Preprocessor took 157.85 ms. Allocated memory is still 206.6 MB. Free memory was 171.7 MB in the beginning and 166.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:04,608 INFO L168 Benchmark]: RCFGBuilder took 2007.84 ms. Allocated memory was 206.6 MB in the beginning and 250.1 MB in the end (delta: 43.5 MB). Free memory was 166.9 MB in the beginning and 206.1 MB in the end (delta: -39.2 MB). Peak memory consumption was 114.2 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:04,609 INFO L168 Benchmark]: TraceAbstraction took 5119.87 ms. Allocated memory was 250.1 MB in the beginning and 324.5 MB in the end (delta: 74.4 MB). Free memory was 206.1 MB in the beginning and 207.0 MB in the end (delta: -837.7 kB). Peak memory consumption was 154.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:04,623 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.20 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.32 ms. Allocated memory was 146.8 MB in the beginning and 206.6 MB in the end (delta: 59.8 MB). Free memory was 102.0 MB in the beginning and 171.7 MB in the end (delta: -69.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 157.85 ms. Allocated memory is still 206.6 MB. Free memory was 171.7 MB in the beginning and 166.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2007.84 ms. Allocated memory was 206.6 MB in the beginning and 250.1 MB in the end (delta: 43.5 MB). Free memory was 166.9 MB in the beginning and 206.1 MB in the end (delta: -39.2 MB). Peak memory consumption was 114.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5119.87 ms. Allocated memory was 250.1 MB in the beginning and 324.5 MB in the end (delta: 74.4 MB). Free memory was 206.1 MB in the beginning and 207.0 MB in the end (delta: -837.7 kB). Peak memory consumption was 154.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: 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)) || 1 == \old(a7)) || !(1 == \old(a20))) || !(15 == \old(a8))) || a20 == 1) || (!(a16 == 6) && !(13 == a8))) || (!(a7 == 1) && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 1 error locations. Result: SAFE, OverallTime: 5.0s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 269 SDtfs, 523 SDslu, 112 SDs, 0 SdLazy, 1622 SolverSat, 407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=840occurred 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, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 51 PreInvPairs, 93 NumberOfFragments, 231 HoareAnnotationTreeSize, 51 FomulaSimplifications, 812 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 532 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 117384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 71/71 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...