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/ssh-simplified/s3_srvr_1a.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:31:09,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:31:09,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:31:09,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:31:09,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:31:09,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:31:09,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:31:09,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:31:09,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:31:09,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:31:09,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:31:09,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:31:09,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:31:09,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:31:09,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:31:09,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:31:09,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:31:09,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:31:09,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:31:09,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:31:09,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:31:09,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:31:09,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:31:09,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:31:09,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:31:09,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:31:09,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:31:09,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:31:09,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:31:09,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:31:09,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:31:09,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:31:09,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:31:09,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:31:09,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:31:09,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:31:09,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:31:09,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:31:09,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:31:09,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:31:09,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:31:09,728 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-15 03:31:09,742 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:31:09,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:31:09,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:31:09,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:31:09,744 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:31:09,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:31:09,745 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:31:09,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:31:09,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:31:09,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:31:09,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:31:09,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:31:09,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:31:09,746 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:31:09,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:31:09,746 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:31:09,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:31:09,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:31:09,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:31:09,747 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:31:09,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:31:09,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:31:09,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:31:09,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:31:09,748 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:31:09,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:31:09,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:31:09,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:31:09,749 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-15 03:31:10,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:31:10,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:31:10,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:31:10,069 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:31:10,070 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:31:10,070 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1a.cil.c [2019-10-15 03:31:10,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41755dd29/c3466001bb804e76802668f01a089898/FLAG550593f41 [2019-10-15 03:31:10,651 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:31:10,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1a.cil.c [2019-10-15 03:31:10,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41755dd29/c3466001bb804e76802668f01a089898/FLAG550593f41 [2019-10-15 03:31:11,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41755dd29/c3466001bb804e76802668f01a089898 [2019-10-15 03:31:11,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:31:11,028 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:31:11,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:31:11,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:31:11,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:31:11,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:31:11" (1/1) ... [2019-10-15 03:31:11,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6226574d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:11, skipping insertion in model container [2019-10-15 03:31:11,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:31:11" (1/1) ... [2019-10-15 03:31:11,045 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:31:11,080 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:31:11,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:31:11,270 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:31:11,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:31:11,397 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:31:11,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:11 WrapperNode [2019-10-15 03:31:11,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:31:11,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:31:11,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:31:11,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:31:11,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:11" (1/1) ... [2019-10-15 03:31:11,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:11" (1/1) ... [2019-10-15 03:31:11,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:11" (1/1) ... [2019-10-15 03:31:11,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:11" (1/1) ... [2019-10-15 03:31:11,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:11" (1/1) ... [2019-10-15 03:31:11,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:11" (1/1) ... [2019-10-15 03:31:11,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:11" (1/1) ... [2019-10-15 03:31:11,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:31:11,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:31:11,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:31:11,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:31:11,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:11" (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-15 03:31:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:31:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:31:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:31:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:31:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:31:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:31:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:31:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:31:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:31:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:31:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:31:11,997 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:31:11,997 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:31:11,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:11 BoogieIcfgContainer [2019-10-15 03:31:11,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:31:12,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:31:12,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:31:12,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:31:12,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:31:11" (1/3) ... [2019-10-15 03:31:12,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623bfec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:12, skipping insertion in model container [2019-10-15 03:31:12,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:11" (2/3) ... [2019-10-15 03:31:12,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623bfec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:12, skipping insertion in model container [2019-10-15 03:31:12,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:11" (3/3) ... [2019-10-15 03:31:12,009 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2019-10-15 03:31:12,020 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:31:12,030 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:31:12,042 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:31:12,069 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:31:12,069 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:31:12,070 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:31:12,070 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:31:12,070 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:31:12,070 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:31:12,070 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:31:12,071 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:31:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-10-15 03:31:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-15 03:31:12,100 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:12,101 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:12,104 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:12,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:12,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2008919768, now seen corresponding path program 1 times [2019-10-15 03:31:12,118 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:12,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993699825] [2019-10-15 03:31:12,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:12,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:12,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:12,256 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-15 03:31:12,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993699825] [2019-10-15 03:31:12,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:12,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:12,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173959974] [2019-10-15 03:31:12,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:12,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:12,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:12,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:12,284 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-10-15 03:31:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:12,414 INFO L93 Difference]: Finished difference Result 94 states and 161 transitions. [2019-10-15 03:31:12,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:12,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-10-15 03:31:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:12,429 INFO L225 Difference]: With dead ends: 94 [2019-10-15 03:31:12,430 INFO L226 Difference]: Without dead ends: 55 [2019-10-15 03:31:12,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-15 03:31:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-15 03:31:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-15 03:31:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 89 transitions. [2019-10-15 03:31:12,505 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 89 transitions. Word has length 8 [2019-10-15 03:31:12,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:12,506 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 89 transitions. [2019-10-15 03:31:12,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 89 transitions. [2019-10-15 03:31:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 03:31:12,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:12,507 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:12,508 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:12,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:12,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1657111023, now seen corresponding path program 1 times [2019-10-15 03:31:12,509 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:12,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058751044] [2019-10-15 03:31:12,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:12,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:12,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:12,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058751044] [2019-10-15 03:31:12,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924835649] [2019-10-15 03:31:12,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:12,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 03:31:12,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:12,639 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:12,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:31:12,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:31:12,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2019-10-15 03:31:12,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100897927] [2019-10-15 03:31:12,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:12,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:12,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:12,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:12,686 INFO L87 Difference]: Start difference. First operand 55 states and 89 transitions. Second operand 3 states. [2019-10-15 03:31:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:12,784 INFO L93 Difference]: Finished difference Result 129 states and 216 transitions. [2019-10-15 03:31:12,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:12,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-15 03:31:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:12,788 INFO L225 Difference]: With dead ends: 129 [2019-10-15 03:31:12,788 INFO L226 Difference]: Without dead ends: 103 [2019-10-15 03:31:12,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-15 03:31:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-10-15 03:31:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-15 03:31:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 169 transitions. [2019-10-15 03:31:12,831 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 169 transitions. Word has length 11 [2019-10-15 03:31:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:12,832 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 169 transitions. [2019-10-15 03:31:12,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 169 transitions. [2019-10-15 03:31:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 03:31:12,836 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:12,836 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:13,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:13,038 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:13,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:13,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1997098005, now seen corresponding path program 1 times [2019-10-15 03:31:13,039 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:13,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465255729] [2019-10-15 03:31:13,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:13,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:13,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:31:13,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465255729] [2019-10-15 03:31:13,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:13,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:13,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141975724] [2019-10-15 03:31:13,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:13,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:13,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:13,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:13,078 INFO L87 Difference]: Start difference. First operand 103 states and 169 transitions. Second operand 3 states. [2019-10-15 03:31:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:13,178 INFO L93 Difference]: Finished difference Result 156 states and 257 transitions. [2019-10-15 03:31:13,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:13,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 03:31:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:13,180 INFO L225 Difference]: With dead ends: 156 [2019-10-15 03:31:13,180 INFO L226 Difference]: Without dead ends: 58 [2019-10-15 03:31:13,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-15 03:31:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-15 03:31:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-15 03:31:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 92 transitions. [2019-10-15 03:31:13,191 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 92 transitions. Word has length 24 [2019-10-15 03:31:13,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:13,191 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 92 transitions. [2019-10-15 03:31:13,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 92 transitions. [2019-10-15 03:31:13,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 03:31:13,192 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:13,193 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:13,193 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:13,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:13,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1295036603, now seen corresponding path program 2 times [2019-10-15 03:31:13,194 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:13,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97155452] [2019-10-15 03:31:13,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:13,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:13,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:13,236 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-15 03:31:13,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97155452] [2019-10-15 03:31:13,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:13,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:13,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890916169] [2019-10-15 03:31:13,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:13,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:13,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:13,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:13,242 INFO L87 Difference]: Start difference. First operand 58 states and 92 transitions. Second operand 3 states. [2019-10-15 03:31:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:13,342 INFO L93 Difference]: Finished difference Result 118 states and 190 transitions. [2019-10-15 03:31:13,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:13,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 03:31:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:13,345 INFO L225 Difference]: With dead ends: 118 [2019-10-15 03:31:13,345 INFO L226 Difference]: Without dead ends: 68 [2019-10-15 03:31:13,346 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:13,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-15 03:31:13,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-15 03:31:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-15 03:31:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 101 transitions. [2019-10-15 03:31:13,356 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 101 transitions. Word has length 24 [2019-10-15 03:31:13,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:13,356 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 101 transitions. [2019-10-15 03:31:13,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:13,356 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 101 transitions. [2019-10-15 03:31:13,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 03:31:13,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:13,358 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:13,358 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:13,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:13,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1290755397, now seen corresponding path program 1 times [2019-10-15 03:31:13,359 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:13,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688597019] [2019-10-15 03:31:13,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:13,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:13,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:13,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 03:31:13,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688597019] [2019-10-15 03:31:13,404 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:13,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:13,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072271673] [2019-10-15 03:31:13,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:13,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:13,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:13,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:13,406 INFO L87 Difference]: Start difference. First operand 66 states and 101 transitions. Second operand 3 states. [2019-10-15 03:31:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:13,503 INFO L93 Difference]: Finished difference Result 112 states and 177 transitions. [2019-10-15 03:31:13,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:13,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 03:31:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:13,505 INFO L225 Difference]: With dead ends: 112 [2019-10-15 03:31:13,505 INFO L226 Difference]: Without dead ends: 82 [2019-10-15 03:31:13,506 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-15 03:31:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-10-15 03:31:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-15 03:31:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2019-10-15 03:31:13,517 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 28 [2019-10-15 03:31:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:13,517 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. [2019-10-15 03:31:13,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2019-10-15 03:31:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:31:13,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:13,519 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:13,520 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:13,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:13,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1550170716, now seen corresponding path program 1 times [2019-10-15 03:31:13,520 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:13,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360997393] [2019-10-15 03:31:13,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:13,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:13,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:13,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360997393] [2019-10-15 03:31:13,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855436861] [2019-10-15 03:31:13,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:13,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 03:31:13,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:13,718 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:13,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:13,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:13,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 03:31:13,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:31:13,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 6] total 8 [2019-10-15 03:31:13,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381097568] [2019-10-15 03:31:13,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:13,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:13,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:13,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:31:13,766 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand 3 states. [2019-10-15 03:31:13,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:13,823 INFO L93 Difference]: Finished difference Result 124 states and 177 transitions. [2019-10-15 03:31:13,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:13,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-15 03:31:13,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:13,825 INFO L225 Difference]: With dead ends: 124 [2019-10-15 03:31:13,826 INFO L226 Difference]: Without dead ends: 122 [2019-10-15 03:31:13,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:31:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-15 03:31:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-10-15 03:31:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-15 03:31:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2019-10-15 03:31:13,840 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 42 [2019-10-15 03:31:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:13,841 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2019-10-15 03:31:13,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2019-10-15 03:31:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:31:13,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:13,843 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:14,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:14,047 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:14,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:14,048 INFO L82 PathProgramCache]: Analyzing trace with hash 637753049, now seen corresponding path program 1 times [2019-10-15 03:31:14,048 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:14,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121055586] [2019-10-15 03:31:14,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:14,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:14,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:14,143 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:14,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121055586] [2019-10-15 03:31:14,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315913942] [2019-10-15 03:31:14,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:14,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 03:31:14,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 03:31:14,203 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 03:31:14,221 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 03:31:14,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-10-15 03:31:14,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652115594] [2019-10-15 03:31:14,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:14,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:14,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:14,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:31:14,223 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand 4 states. [2019-10-15 03:31:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:14,374 INFO L93 Difference]: Finished difference Result 240 states and 358 transitions. [2019-10-15 03:31:14,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:14,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-15 03:31:14,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:14,376 INFO L225 Difference]: With dead ends: 240 [2019-10-15 03:31:14,377 INFO L226 Difference]: Without dead ends: 128 [2019-10-15 03:31:14,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:31:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-15 03:31:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-10-15 03:31:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-15 03:31:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2019-10-15 03:31:14,406 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 44 [2019-10-15 03:31:14,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:14,407 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2019-10-15 03:31:14,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2019-10-15 03:31:14,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:31:14,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:14,411 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:14,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:14,612 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:14,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:14,613 INFO L82 PathProgramCache]: Analyzing trace with hash -56628168, now seen corresponding path program 1 times [2019-10-15 03:31:14,614 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:14,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831588713] [2019-10-15 03:31:14,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:14,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:14,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 35 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:14,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831588713] [2019-10-15 03:31:14,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830959995] [2019-10-15 03:31:14,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:14,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:31:14,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 03:31:14,798 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:14,818 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 03:31:14,819 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 03:31:14,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 03:31:14,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751535703] [2019-10-15 03:31:14,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:14,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:14,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:14,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:14,823 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand 3 states. [2019-10-15 03:31:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:14,903 INFO L93 Difference]: Finished difference Result 234 states and 267 transitions. [2019-10-15 03:31:14,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:14,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 03:31:14,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:14,905 INFO L225 Difference]: With dead ends: 234 [2019-10-15 03:31:14,906 INFO L226 Difference]: Without dead ends: 152 [2019-10-15 03:31:14,908 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-15 03:31:14,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-10-15 03:31:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-15 03:31:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2019-10-15 03:31:14,928 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 58 [2019-10-15 03:31:14,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:14,928 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2019-10-15 03:31:14,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2019-10-15 03:31:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-15 03:31:14,936 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:14,936 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:15,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:15,137 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:15,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:15,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1340330638, now seen corresponding path program 1 times [2019-10-15 03:31:15,138 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:15,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148730006] [2019-10-15 03:31:15,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:15,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:15,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 66 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 03:31:15,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148730006] [2019-10-15 03:31:15,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776246952] [2019-10-15 03:31:15,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:15,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:31:15,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 03:31:15,299 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 03:31:15,311 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 03:31:15,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 03:31:15,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468502009] [2019-10-15 03:31:15,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:15,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:15,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:15,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:15,313 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand 3 states. [2019-10-15 03:31:15,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:15,328 INFO L93 Difference]: Finished difference Result 239 states and 264 transitions. [2019-10-15 03:31:15,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:15,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-15 03:31:15,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:15,330 INFO L225 Difference]: With dead ends: 239 [2019-10-15 03:31:15,331 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:31:15,332 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:15,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:31:15,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:31:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:31:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:31:15,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2019-10-15 03:31:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:15,334 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:31:15,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:31:15,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:31:15,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:15,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:31:15,974 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 03:31:15,974 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:31:15,974 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:31:15,975 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:31:15,975 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:31:15,975 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:31:15,975 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 218) no Hoare annotation was computed. [2019-10-15 03:31:15,975 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 216) no Hoare annotation was computed. [2019-10-15 03:31:15,975 INFO L439 ceAbstractionStarter]: At program point L69(lines 69 186) the Hoare annotation is: (or (and (<= 8672 main_~s__state~0) (< main_~blastFlag~0 5)) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:15,975 INFO L439 ceAbstractionStarter]: At program point L61(lines 61 190) the Hoare annotation is: (or (and (= 8640 main_~s__state~0) (not (= 0 main_~s__hit~0))) (and (<= 8672 main_~s__state~0) (< main_~blastFlag~0 5)) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:15,976 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 75 184) no Hoare annotation was computed. [2019-10-15 03:31:15,976 INFO L439 ceAbstractionStarter]: At program point L53(lines 53 194) the Hoare annotation is: (or (and (= 8640 main_~s__state~0) (not (= 0 main_~s__hit~0))) (and (<= 8672 main_~s__state~0) (< main_~blastFlag~0 5)) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:15,976 INFO L439 ceAbstractionStarter]: At program point L177(lines 23 212) the Hoare annotation is: (or (and (= 8640 main_~s__state~0) (not (= 0 main_~s__hit~0))) (and (<= 8672 main_~s__state~0) (< main_~blastFlag~0 5)) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:15,976 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 198) no Hoare annotation was computed. [2019-10-15 03:31:15,976 INFO L439 ceAbstractionStarter]: At program point L37(lines 37 202) the Hoare annotation is: (or (and (= 8640 main_~s__state~0) (not (= 0 main_~s__hit~0))) (and (<= 8672 main_~s__state~0) (< main_~blastFlag~0 5)) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:15,977 INFO L439 ceAbstractionStarter]: At program point L46(lines 45 198) the Hoare annotation is: (and (< 8512 main_~s__state~0) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:15,977 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 218) no Hoare annotation was computed. [2019-10-15 03:31:15,977 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 75 184) no Hoare annotation was computed. [2019-10-15 03:31:15,977 INFO L439 ceAbstractionStarter]: At program point L30(lines 30 205) the Hoare annotation is: (or (and (= 8640 main_~s__state~0) (not (= 0 main_~s__hit~0))) (and (<= 8672 main_~s__state~0) (< main_~blastFlag~0 5)) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:15,977 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 9 218) the Hoare annotation is: true [2019-10-15 03:31:15,977 INFO L439 ceAbstractionStarter]: At program point L121(lines 114 123) the Hoare annotation is: (and (< 8512 main_~s__state~0) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:15,978 INFO L439 ceAbstractionStarter]: At program point L113(lines 106 124) the Hoare annotation is: (and (< 8512 main_~s__state~0) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:15,978 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 124) no Hoare annotation was computed. [2019-10-15 03:31:15,978 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 184) no Hoare annotation was computed. [2019-10-15 03:31:15,978 INFO L439 ceAbstractionStarter]: At program point L65(lines 65 188) the Hoare annotation is: (or (and (= 8640 main_~s__state~0) (not (= 0 main_~s__hit~0))) (and (<= 8672 main_~s__state~0) (< main_~blastFlag~0 5)) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:15,978 INFO L439 ceAbstractionStarter]: At program point L57(lines 57 192) the Hoare annotation is: (or (and (= 8640 main_~s__state~0) (not (= 0 main_~s__hit~0))) (and (<= 8672 main_~s__state~0) (< main_~blastFlag~0 5)) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:15,978 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-10-15 03:31:15,978 INFO L446 ceAbstractionStarter]: At program point L214(lines 9 218) the Hoare annotation is: true [2019-10-15 03:31:15,979 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 119) no Hoare annotation was computed. [2019-10-15 03:31:15,979 INFO L439 ceAbstractionStarter]: At program point L49(lines 49 196) the Hoare annotation is: (or (and (= 8640 main_~s__state~0) (not (= 0 main_~s__hit~0))) (and (<= 8672 main_~s__state~0) (< main_~blastFlag~0 5)) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:15,979 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 175) no Hoare annotation was computed. [2019-10-15 03:31:15,979 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2019-10-15 03:31:15,979 INFO L439 ceAbstractionStarter]: At program point L74(lines 73 184) the Hoare annotation is: (and (<= 8672 main_~s__state~0) (< main_~blastFlag~0 5)) [2019-10-15 03:31:15,979 INFO L439 ceAbstractionStarter]: At program point L41(lines 41 200) the Hoare annotation is: (or (and (= 8640 main_~s__state~0) (not (= 0 main_~s__hit~0))) (and (<= 8672 main_~s__state~0) (< main_~blastFlag~0 5)) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:15,980 INFO L439 ceAbstractionStarter]: At program point L33(lines 33 204) the Hoare annotation is: (or (and (= 8640 main_~s__state~0) (not (= 0 main_~s__hit~0))) (and (<= 8672 main_~s__state~0) (< main_~blastFlag~0 5)) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:15,980 INFO L439 ceAbstractionStarter]: At program point L174(lines 9 218) the Hoare annotation is: false [2019-10-15 03:31:16,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:31:16 BoogieIcfgContainer [2019-10-15 03:31:16,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:31:16,012 INFO L168 Benchmark]: Toolchain (without parser) took 4980.35 ms. Allocated memory was 137.9 MB in the beginning and 246.9 MB in the end (delta: 109.1 MB). Free memory was 102.4 MB in the beginning and 216.6 MB in the end (delta: -114.2 MB). Peak memory consumption was 118.0 MB. Max. memory is 7.1 GB. [2019-10-15 03:31:16,015 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-15 03:31:16,016 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.00 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.0 MB in the beginning and 180.8 MB in the end (delta: -78.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-10-15 03:31:16,017 INFO L168 Benchmark]: Boogie Preprocessor took 45.14 ms. Allocated memory is still 201.9 MB. Free memory was 180.8 MB in the beginning and 178.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-15 03:31:16,018 INFO L168 Benchmark]: RCFGBuilder took 554.82 ms. Allocated memory is still 201.9 MB. Free memory was 178.4 MB in the beginning and 152.0 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-10-15 03:31:16,020 INFO L168 Benchmark]: TraceAbstraction took 4005.51 ms. Allocated memory was 201.9 MB in the beginning and 246.9 MB in the end (delta: 45.1 MB). Free memory was 152.0 MB in the beginning and 216.6 MB in the end (delta: -64.7 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. [2019-10-15 03:31:16,027 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 369.00 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.0 MB in the beginning and 180.8 MB in the end (delta: -78.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.14 ms. Allocated memory is still 201.9 MB. Free memory was 180.8 MB in the beginning and 178.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 554.82 ms. Allocated memory is still 201.9 MB. Free memory was 178.4 MB in the beginning and 152.0 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4005.51 ms. Allocated memory was 201.9 MB in the beginning and 246.9 MB in the end (delta: 45.1 MB). Free memory was 152.0 MB in the beginning and 216.6 MB in the end (delta: -64.7 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 216]: 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: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((8640 == s__state && !(0 == s__hit)) || (8672 <= s__state && blastFlag < 5)) || blastFlag <= 2 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((8640 == s__state && !(0 == s__hit)) || (8672 <= s__state && blastFlag < 5)) || blastFlag <= 2 - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 8512 < s__state && blastFlag <= 2 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((8640 == s__state && !(0 == s__hit)) || (8672 <= s__state && blastFlag < 5)) || blastFlag <= 2 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: 8512 < s__state && blastFlag <= 2 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((8640 == s__state && !(0 == s__hit)) || (8672 <= s__state && blastFlag < 5)) || blastFlag <= 2 - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: (8672 <= s__state && blastFlag < 5) || blastFlag <= 2 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((8640 == s__state && !(0 == s__hit)) || (8672 <= s__state && blastFlag < 5)) || blastFlag <= 2 - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: 8512 < s__state && blastFlag <= 2 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((8640 == s__state && !(0 == s__hit)) || (8672 <= s__state && blastFlag < 5)) || blastFlag <= 2 - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((8640 == s__state && !(0 == s__hit)) || (8672 <= s__state && blastFlag < 5)) || blastFlag <= 2 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((8640 == s__state && !(0 == s__hit)) || (8672 <= s__state && blastFlag < 5)) || blastFlag <= 2 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((8640 == s__state && !(0 == s__hit)) || (8672 <= s__state && blastFlag < 5)) || blastFlag <= 2 - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 8672 <= s__state && blastFlag < 5 - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((8640 == s__state && !(0 == s__hit)) || (8672 <= s__state && blastFlag < 5)) || blastFlag <= 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 1 error locations. Result: SAFE, OverallTime: 3.9s, OverallIterations: 9, TraceHistogramMax: 6, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 436 SDtfs, 157 SDslu, 240 SDs, 0 SdLazy, 284 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 487 GetRequests, 453 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 108 NumberOfFragments, 235 HoareAnnotationTreeSize, 21 FomulaSimplifications, 768 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 119 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 536 NumberOfCodeBlocks, 536 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 743 ConstructedInterpolants, 0 QuantifiedInterpolants, 67227 SizeOfPredicates, 3 NumberOfNonLiveVariables, 430 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 605/759 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...