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/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:02:09,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:02:09,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:02:09,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:02:09,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:02:09,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:02:09,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:02:09,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:02:09,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:02:09,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:02:09,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:02:09,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:02:09,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:02:09,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:02:09,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:02:09,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:02:09,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:02:09,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:02:09,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:02:09,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:02:09,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:02:09,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:02:09,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:02:09,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:02:09,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:02:09,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:02:09,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:02:09,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:02:09,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:02:09,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:02:09,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:02:09,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:02:09,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:02:09,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:02:09,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:02:09,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:02:09,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:02:09,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:02:09,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:02:09,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:02:09,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:02:09,526 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:02:09,550 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:02:09,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:02:09,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:02:09,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:02:09,552 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:02:09,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:02:09,553 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:02:09,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:02:09,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:02:09,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:02:09,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:02:09,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:02:09,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:02:09,555 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:02:09,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:02:09,555 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:02:09,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:02:09,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:02:09,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:02:09,556 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:02:09,557 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:02:09,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:02:09,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:02:09,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:02:09,557 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:02:09,558 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:02:09,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:02:09,558 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:02:09,558 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:02:09,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:02:09,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:02:09,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:02:09,890 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:02:09,890 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:02:09,891 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2019-10-15 03:02:09,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d721f33f9/8842f596669a4b64ab16ce6d14ec8856/FLAGc2f0f9518 [2019-10-15 03:02:10,407 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:02:10,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2019-10-15 03:02:10,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d721f33f9/8842f596669a4b64ab16ce6d14ec8856/FLAGc2f0f9518 [2019-10-15 03:02:10,787 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d721f33f9/8842f596669a4b64ab16ce6d14ec8856 [2019-10-15 03:02:10,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:02:10,799 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:02:10,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:02:10,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:02:10,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:02:10,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:02:10" (1/1) ... [2019-10-15 03:02:10,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57118955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:10, skipping insertion in model container [2019-10-15 03:02:10,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:02:10" (1/1) ... [2019-10-15 03:02:10,815 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:02:10,832 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:02:10,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:02:11,001 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:02:11,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:02:11,055 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:02:11,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:11 WrapperNode [2019-10-15 03:02:11,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:02:11,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:02:11,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:02:11,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:02:11,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:11" (1/1) ... [2019-10-15 03:02:11,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:11" (1/1) ... [2019-10-15 03:02:11,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:11" (1/1) ... [2019-10-15 03:02:11,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:11" (1/1) ... [2019-10-15 03:02:11,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:11" (1/1) ... [2019-10-15 03:02:11,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:11" (1/1) ... [2019-10-15 03:02:11,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:11" (1/1) ... [2019-10-15 03:02:11,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:02:11,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:02:11,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:02:11,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:02:11,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02: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:02:11,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:02:11,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:02:11,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 03:02:11,224 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:02:11,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:02:11,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:02:11,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 03:02:11,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:02:11,224 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:02:11,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:02:11,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:02:11,530 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:02:11,531 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 03:02:11,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:02:11 BoogieIcfgContainer [2019-10-15 03:02:11,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:02:11,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:02:11,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:02:11,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:02:11,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:02:10" (1/3) ... [2019-10-15 03:02:11,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8eb2465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:02:11, skipping insertion in model container [2019-10-15 03:02:11,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:11" (2/3) ... [2019-10-15 03:02:11,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8eb2465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:02:11, skipping insertion in model container [2019-10-15 03:02:11,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:02:11" (3/3) ... [2019-10-15 03:02:11,540 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2019-10-15 03:02:11,554 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:02:11,565 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:02:11,577 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:02:11,610 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:02:11,610 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:02:11,611 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:02:11,612 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:02:11,612 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:02:11,613 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:02:11,613 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:02:11,613 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:02:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-10-15 03:02:11,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:02:11,633 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:11,633 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:11,635 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:11,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:11,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1778619980, now seen corresponding path program 1 times [2019-10-15 03:02:11,646 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:11,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992126090] [2019-10-15 03:02:11,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:11,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:11,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:11,831 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:02:11,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992126090] [2019-10-15 03:02:11,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:11,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:11,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790379154] [2019-10-15 03:02:11,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:11,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:11,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:11,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:11,850 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 5 states. [2019-10-15 03:02:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:12,024 INFO L93 Difference]: Finished difference Result 82 states and 139 transitions. [2019-10-15 03:02:12,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:12,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-15 03:02:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:12,038 INFO L225 Difference]: With dead ends: 82 [2019-10-15 03:02:12,039 INFO L226 Difference]: Without dead ends: 43 [2019-10-15 03:02:12,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-15 03:02:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-10-15 03:02:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-15 03:02:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-10-15 03:02:12,094 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 13 [2019-10-15 03:02:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:12,094 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-10-15 03:02:12,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-10-15 03:02:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:02:12,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:12,098 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:12,099 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:12,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:12,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1756664013, now seen corresponding path program 1 times [2019-10-15 03:02:12,100 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:12,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75865341] [2019-10-15 03:02:12,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:12,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:12,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:12,153 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:02:12,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75865341] [2019-10-15 03:02:12,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:12,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:12,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343469929] [2019-10-15 03:02:12,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:12,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:12,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:12,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:12,161 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 5 states. [2019-10-15 03:02:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:12,305 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2019-10-15 03:02:12,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:12,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-15 03:02:12,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:12,308 INFO L225 Difference]: With dead ends: 56 [2019-10-15 03:02:12,308 INFO L226 Difference]: Without dead ends: 54 [2019-10-15 03:02:12,309 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-15 03:02:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-10-15 03:02:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-15 03:02:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2019-10-15 03:02:12,325 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2019-10-15 03:02:12,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:12,325 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2019-10-15 03:02:12,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:12,325 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2019-10-15 03:02:12,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:02:12,326 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:12,326 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:12,327 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:12,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:12,327 INFO L82 PathProgramCache]: Analyzing trace with hash -276218857, now seen corresponding path program 1 times [2019-10-15 03:02:12,328 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:12,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102864186] [2019-10-15 03:02:12,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:12,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:12,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:12,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102864186] [2019-10-15 03:02:12,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:12,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:12,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917787707] [2019-10-15 03:02:12,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:12,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:12,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:12,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:12,421 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand 5 states. [2019-10-15 03:02:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:12,534 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2019-10-15 03:02:12,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:12,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-15 03:02:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:12,539 INFO L225 Difference]: With dead ends: 56 [2019-10-15 03:02:12,539 INFO L226 Difference]: Without dead ends: 54 [2019-10-15 03:02:12,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:12,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-15 03:02:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-15 03:02:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-15 03:02:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2019-10-15 03:02:12,554 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 18 [2019-10-15 03:02:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:12,554 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2019-10-15 03:02:12,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2019-10-15 03:02:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 03:02:12,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:12,556 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:12,556 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:12,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:12,557 INFO L82 PathProgramCache]: Analyzing trace with hash -12086036, now seen corresponding path program 1 times [2019-10-15 03:02:12,557 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:12,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415554930] [2019-10-15 03:02:12,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:12,558 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:12,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:02:12,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415554930] [2019-10-15 03:02:12,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:12,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:02:12,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957547786] [2019-10-15 03:02:12,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:02:12,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:12,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:02:12,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:12,631 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 6 states. [2019-10-15 03:02:12,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:12,782 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2019-10-15 03:02:12,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:02:12,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-15 03:02:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:12,784 INFO L225 Difference]: With dead ends: 60 [2019-10-15 03:02:12,784 INFO L226 Difference]: Without dead ends: 58 [2019-10-15 03:02:12,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:02:12,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-15 03:02:12,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-15 03:02:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-15 03:02:12,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-10-15 03:02:12,799 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 23 [2019-10-15 03:02:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:12,800 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-10-15 03:02:12,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:02:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-10-15 03:02:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 03:02:12,801 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:12,801 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:12,802 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:12,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1403678473, now seen corresponding path program 1 times [2019-10-15 03:02:12,802 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:12,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928284801] [2019-10-15 03:02:12,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:12,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:12,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 03:02:12,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928284801] [2019-10-15 03:02:12,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:12,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:12,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263271493] [2019-10-15 03:02:12,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:12,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:12,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:12,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:12,863 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 5 states. [2019-10-15 03:02:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:12,950 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2019-10-15 03:02:12,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:12,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-15 03:02:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:12,952 INFO L225 Difference]: With dead ends: 65 [2019-10-15 03:02:12,952 INFO L226 Difference]: Without dead ends: 63 [2019-10-15 03:02:12,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:12,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-15 03:02:12,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-10-15 03:02:12,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-15 03:02:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2019-10-15 03:02:12,964 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 28 [2019-10-15 03:02:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:12,964 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2019-10-15 03:02:12,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2019-10-15 03:02:12,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 03:02:12,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:12,966 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 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-15 03:02:12,967 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:12,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:12,967 INFO L82 PathProgramCache]: Analyzing trace with hash -869865180, now seen corresponding path program 1 times [2019-10-15 03:02:12,967 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:12,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022682103] [2019-10-15 03:02:12,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:12,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:12,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-15 03:02:13,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022682103] [2019-10-15 03:02:13,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:13,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:02:13,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047529497] [2019-10-15 03:02:13,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:02:13,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:13,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:02:13,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:13,068 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 6 states. [2019-10-15 03:02:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:13,286 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2019-10-15 03:02:13,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:02:13,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-15 03:02:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:13,289 INFO L225 Difference]: With dead ends: 74 [2019-10-15 03:02:13,289 INFO L226 Difference]: Without dead ends: 72 [2019-10-15 03:02:13,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:13,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-15 03:02:13,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2019-10-15 03:02:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-15 03:02:13,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2019-10-15 03:02:13,315 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 46 [2019-10-15 03:02:13,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:13,315 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2019-10-15 03:02:13,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:02:13,316 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2019-10-15 03:02:13,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:02:13,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:13,327 INFO L380 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-15 03:02:13,328 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:13,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:13,328 INFO L82 PathProgramCache]: Analyzing trace with hash -863098428, now seen corresponding path program 1 times [2019-10-15 03:02:13,328 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:13,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198476987] [2019-10-15 03:02:13,329 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:13,329 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:13,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 03:02:13,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198476987] [2019-10-15 03:02:13,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:13,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:02:13,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480510468] [2019-10-15 03:02:13,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:02:13,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:13,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:02:13,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:13,460 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 7 states. [2019-10-15 03:02:13,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:13,622 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2019-10-15 03:02:13,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:02:13,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-10-15 03:02:13,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:13,624 INFO L225 Difference]: With dead ends: 74 [2019-10-15 03:02:13,624 INFO L226 Difference]: Without dead ends: 72 [2019-10-15 03:02:13,625 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:02:13,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-15 03:02:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-10-15 03:02:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-15 03:02:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-10-15 03:02:13,638 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 56 [2019-10-15 03:02:13,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:13,638 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-10-15 03:02:13,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:02:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2019-10-15 03:02:13,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-15 03:02:13,640 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:13,640 INFO L380 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 03:02:13,641 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:13,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:13,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1349635161, now seen corresponding path program 1 times [2019-10-15 03:02:13,641 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:13,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619071037] [2019-10-15 03:02:13,642 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:13,642 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:13,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-15 03:02:13,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619071037] [2019-10-15 03:02:13,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:13,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:02:13,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083287343] [2019-10-15 03:02:13,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:02:13,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:13,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:02:13,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:02:13,754 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 8 states. [2019-10-15 03:02:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:14,069 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2019-10-15 03:02:14,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:02:14,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-10-15 03:02:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:14,070 INFO L225 Difference]: With dead ends: 72 [2019-10-15 03:02:14,071 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:02:14,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:02:14,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:02:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:02:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:02:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:02:14,073 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2019-10-15 03:02:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:14,073 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:02:14,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:02:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:02:14,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:02:14,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:02:14,472 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 03:02:14,472 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:02:14,472 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:02:14,472 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:02:14,473 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:02:14,473 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:02:14,473 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,473 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 53) no Hoare annotation was computed. [2019-10-15 03:02:14,473 INFO L439 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,473 INFO L439 ceAbstractionStarter]: At program point L23-1(line 23) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,474 INFO L439 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,474 INFO L439 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,474 INFO L439 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,474 INFO L439 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,474 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-10-15 03:02:14,474 INFO L439 ceAbstractionStarter]: At program point L20-2(lines 20 51) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,474 INFO L439 ceAbstractionStarter]: At program point L45(line 45) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,474 INFO L439 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,475 INFO L443 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-10-15 03:02:14,475 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-15 03:02:14,475 INFO L439 ceAbstractionStarter]: At program point L21-2(lines 21 50) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,475 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-10-15 03:02:14,475 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-15 03:02:14,475 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 53) no Hoare annotation was computed. [2019-10-15 03:02:14,475 INFO L439 ceAbstractionStarter]: At program point L42(lines 22 49) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,476 INFO L439 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,476 INFO L439 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,476 INFO L439 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,476 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 53) the Hoare annotation is: true [2019-10-15 03:02:14,476 INFO L439 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,477 INFO L439 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,477 INFO L443 ceAbstractionStarter]: For program point L22(lines 22 49) no Hoare annotation was computed. [2019-10-15 03:02:14,477 INFO L439 ceAbstractionStarter]: At program point L43(line 43) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-10-15 03:02:14,477 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-15 03:02:14,477 INFO L443 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-10-15 03:02:14,477 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-15 03:02:14,478 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-15 03:02:14,478 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-15 03:02:14,478 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-15 03:02:14,478 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-15 03:02:14,478 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-15 03:02:14,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:02:14 BoogieIcfgContainer [2019-10-15 03:02:14,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:02:14,499 INFO L168 Benchmark]: Toolchain (without parser) took 3698.90 ms. Allocated memory was 136.8 MB in the beginning and 249.0 MB in the end (delta: 112.2 MB). Free memory was 101.4 MB in the beginning and 158.2 MB in the end (delta: -56.7 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2019-10-15 03:02:14,500 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 03:02:14,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.88 ms. Allocated memory is still 136.8 MB. Free memory was 101.2 MB in the beginning and 91.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-10-15 03:02:14,502 INFO L168 Benchmark]: Boogie Preprocessor took 113.49 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 91.3 MB in the beginning and 178.0 MB in the end (delta: -86.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2019-10-15 03:02:14,502 INFO L168 Benchmark]: RCFGBuilder took 362.06 ms. Allocated memory is still 199.8 MB. Free memory was 178.0 MB in the beginning and 161.7 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2019-10-15 03:02:14,503 INFO L168 Benchmark]: TraceAbstraction took 2962.98 ms. Allocated memory was 199.8 MB in the beginning and 249.0 MB in the end (delta: 49.3 MB). Free memory was 161.7 MB in the beginning and 158.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2019-10-15 03:02:14,507 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 136.8 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 255.88 ms. Allocated memory is still 136.8 MB. Free memory was 101.2 MB in the beginning and 91.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.49 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 91.3 MB in the beginning and 178.0 MB in the end (delta: -86.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 362.06 ms. Allocated memory is still 199.8 MB. Free memory was 178.0 MB in the beginning and 161.7 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2962.98 ms. Allocated memory was 199.8 MB in the beginning and 249.0 MB in the end (delta: 49.3 MB). Free memory was 161.7 MB in the beginning and 158.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 20]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((0 <= j && 0 <= i) && i + 1 <= len) && j + 5 <= bufsize) && limit + 4 <= bufsize - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 41 locations, 1 error locations. Result: SAFE, OverallTime: 2.8s, OverallIterations: 8, TraceHistogramMax: 11, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 394 SDtfs, 102 SDslu, 1023 SDs, 0 SdLazy, 528 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, 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, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 55 PreInvPairs, 76 NumberOfFragments, 369 HoareAnnotationTreeSize, 55 FomulaSimplifications, 621 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 43 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 23798 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 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...