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/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:41:29,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:41:29,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:41:29,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:41:29,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:41:29,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:41:29,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:41:29,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:41:29,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:41:29,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:41:29,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:41:29,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:41:29,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:41:29,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:41:29,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:41:29,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:41:29,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:41:29,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:41:29,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:41:29,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:41:29,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:41:29,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:41:29,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:41:29,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:41:29,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:41:29,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:41:29,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:41:29,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:41:29,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:41:29,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:41:29,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:41:29,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:41:29,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:41:29,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:41:29,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:41:29,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:41:29,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:41:29,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:41:29,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:41:29,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:41:29,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:41:29,371 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:41:29,385 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:41:29,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:41:29,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:41:29,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:41:29,387 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:41:29,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:41:29,387 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:41:29,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:41:29,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:41:29,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:41:29,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:41:29,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:41:29,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:41:29,388 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:41:29,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:41:29,389 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:41:29,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:41:29,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:41:29,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:41:29,390 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:41:29,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:41:29,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:41:29,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:41:29,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:41:29,391 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:41:29,391 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:41:29,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:41:29,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:41:29,391 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:41:29,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:41:29,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:41:29,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:41:29,722 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:41:29,723 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:41:29,723 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-10-07 13:41:29,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3955cbf0a/3c0045db887e47f89b01cb04705c2f67/FLAG34a16eae4 [2019-10-07 13:41:30,295 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:41:30,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-10-07 13:41:30,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3955cbf0a/3c0045db887e47f89b01cb04705c2f67/FLAG34a16eae4 [2019-10-07 13:41:30,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3955cbf0a/3c0045db887e47f89b01cb04705c2f67 [2019-10-07 13:41:30,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:41:30,732 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:41:30,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:41:30,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:41:30,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:41:30,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:41:30" (1/1) ... [2019-10-07 13:41:30,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260aba50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:30, skipping insertion in model container [2019-10-07 13:41:30,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:41:30" (1/1) ... [2019-10-07 13:41:30,753 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:41:30,775 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:41:30,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:41:30,935 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:41:30,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:41:30,965 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:41:30,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:30 WrapperNode [2019-10-07 13:41:30,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:41:30,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:41:30,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:41:30,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:41:31,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:30" (1/1) ... [2019-10-07 13:41:31,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:30" (1/1) ... [2019-10-07 13:41:31,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:30" (1/1) ... [2019-10-07 13:41:31,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:30" (1/1) ... [2019-10-07 13:41:31,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:30" (1/1) ... [2019-10-07 13:41:31,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:30" (1/1) ... [2019-10-07 13:41:31,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:30" (1/1) ... [2019-10-07 13:41:31,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:41:31,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:41:31,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:41:31,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:41:31,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:41:31,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:41:31,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:41:31,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:41:31,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:41:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:41:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:41:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:41:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:41:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:41:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:41:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:41:31,376 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:41:31,376 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:41:31,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:41:31 BoogieIcfgContainer [2019-10-07 13:41:31,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:41:31,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:41:31,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:41:31,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:41:31,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:41:30" (1/3) ... [2019-10-07 13:41:31,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73492d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:41:31, skipping insertion in model container [2019-10-07 13:41:31,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:30" (2/3) ... [2019-10-07 13:41:31,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73492d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:41:31, skipping insertion in model container [2019-10-07 13:41:31,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:41:31" (3/3) ... [2019-10-07 13:41:31,402 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2019-10-07 13:41:31,418 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:41:31,447 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:41:31,477 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:41:31,516 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:41:31,517 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:41:31,517 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:41:31,517 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:41:31,517 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:41:31,518 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:41:31,518 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:41:31,518 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:41:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-07 13:41:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:41:31,543 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:31,544 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:31,546 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:31,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:31,552 INFO L82 PathProgramCache]: Analyzing trace with hash 345773710, now seen corresponding path program 1 times [2019-10-07 13:41:31,558 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:31,559 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:31,559 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:31,559 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:31,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:41:31,670 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:31,670 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:41:31,671 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 13:41:31,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 13:41:31,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 13:41:31,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 13:41:31,686 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-10-07 13:41:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:31,715 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2019-10-07 13:41:31,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 13:41:31,716 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-07 13:41:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:31,724 INFO L225 Difference]: With dead ends: 56 [2019-10-07 13:41:31,725 INFO L226 Difference]: Without dead ends: 27 [2019-10-07 13:41:31,728 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 13:41:31,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-07 13:41:31,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-07 13:41:31,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 13:41:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-10-07 13:41:31,768 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 13 [2019-10-07 13:41:31,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:31,769 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-07 13:41:31,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 13:41:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-10-07 13:41:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:41:31,771 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:31,771 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:31,771 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:31,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1539602810, now seen corresponding path program 1 times [2019-10-07 13:41:31,772 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:31,772 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:31,773 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:31,773 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:31,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:41:31,872 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:31,872 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:41:31,872 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:41:31,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:41:31,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:41:31,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:41:31,875 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 5 states. [2019-10-07 13:41:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:31,983 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-07 13:41:31,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:41:31,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-07 13:41:31,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:31,986 INFO L225 Difference]: With dead ends: 33 [2019-10-07 13:41:31,986 INFO L226 Difference]: Without dead ends: 31 [2019-10-07 13:41:31,988 INFO L606 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-07 13:41:31,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-07 13:41:32,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-07 13:41:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 13:41:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-10-07 13:41:32,002 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 14 [2019-10-07 13:41:32,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:32,002 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-10-07 13:41:32,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:41:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-10-07 13:41:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 13:41:32,004 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:32,004 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:32,004 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:32,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:32,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1090524767, now seen corresponding path program 1 times [2019-10-07 13:41:32,005 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:32,005 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:32,006 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:32,006 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:32,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:32,122 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-07 13:41:32,122 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:32,122 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:41:32,123 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:41:32,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:41:32,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:41:32,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:41:32,124 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 6 states. [2019-10-07 13:41:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:32,261 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-10-07 13:41:32,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:41:32,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-07 13:41:32,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:32,263 INFO L225 Difference]: With dead ends: 46 [2019-10-07 13:41:32,263 INFO L226 Difference]: Without dead ends: 44 [2019-10-07 13:41:32,264 INFO L606 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-07 13:41:32,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-07 13:41:32,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-10-07 13:41:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-07 13:41:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2019-10-07 13:41:32,276 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 19 [2019-10-07 13:41:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:32,277 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2019-10-07 13:41:32,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:41:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2019-10-07 13:41:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-07 13:41:32,278 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:32,278 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:32,279 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:32,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:32,279 INFO L82 PathProgramCache]: Analyzing trace with hash 809711761, now seen corresponding path program 1 times [2019-10-07 13:41:32,279 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:32,280 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:32,280 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:32,280 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:32,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:32,352 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-07 13:41:32,353 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:32,353 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:41:32,353 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:41:32,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:41:32,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:41:32,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:41:32,355 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand 6 states. [2019-10-07 13:41:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:32,477 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2019-10-07 13:41:32,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:41:32,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-10-07 13:41:32,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:32,479 INFO L225 Difference]: With dead ends: 52 [2019-10-07 13:41:32,479 INFO L226 Difference]: Without dead ends: 50 [2019-10-07 13:41:32,480 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:41:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-07 13:41:32,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2019-10-07 13:41:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-07 13:41:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2019-10-07 13:41:32,492 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 26 [2019-10-07 13:41:32,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:32,493 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2019-10-07 13:41:32,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:41:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2019-10-07 13:41:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-07 13:41:32,494 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:32,495 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:32,495 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:32,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:32,495 INFO L82 PathProgramCache]: Analyzing trace with hash -157864588, now seen corresponding path program 1 times [2019-10-07 13:41:32,496 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:32,496 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:32,496 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:32,496 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:32,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:32,597 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-07 13:41:32,598 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:32,598 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:41:32,599 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:41:32,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:41:32,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:41:32,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:41:32,601 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand 7 states. [2019-10-07 13:41:32,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:32,777 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2019-10-07 13:41:32,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:41:32,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-10-07 13:41:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:32,779 INFO L225 Difference]: With dead ends: 67 [2019-10-07 13:41:32,779 INFO L226 Difference]: Without dead ends: 60 [2019-10-07 13:41:32,780 INFO L606 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-07 13:41:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-07 13:41:32,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-10-07 13:41:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-07 13:41:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-10-07 13:41:32,793 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 30 [2019-10-07 13:41:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:32,793 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-10-07 13:41:32,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:41:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-10-07 13:41:32,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-07 13:41:32,794 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:32,794 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:32,795 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:32,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:32,795 INFO L82 PathProgramCache]: Analyzing trace with hash 501600618, now seen corresponding path program 1 times [2019-10-07 13:41:32,795 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:32,796 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:32,796 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:32,796 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:32,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:32,873 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-07 13:41:32,873 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:32,874 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:41:32,874 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:41:32,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:41:32,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:41:32,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:41:32,875 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 7 states. [2019-10-07 13:41:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:32,978 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2019-10-07 13:41:32,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:41:32,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-10-07 13:41:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:32,981 INFO L225 Difference]: With dead ends: 68 [2019-10-07 13:41:32,981 INFO L226 Difference]: Without dead ends: 66 [2019-10-07 13:41:32,981 INFO L606 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-07 13:41:32,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-07 13:41:32,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2019-10-07 13:41:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-07 13:41:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2019-10-07 13:41:32,993 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 31 [2019-10-07 13:41:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:32,993 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2019-10-07 13:41:32,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:41:32,994 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2019-10-07 13:41:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:41:32,996 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:32,996 INFO L385 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:32,996 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:32,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:32,997 INFO L82 PathProgramCache]: Analyzing trace with hash 397668462, now seen corresponding path program 1 times [2019-10-07 13:41:32,997 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:32,997 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:32,997 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:32,998 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:32,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-07 13:41:33,191 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:33,196 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:41:33,196 INFO L95 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-07 13:41:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:33,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-07 13:41:33,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:41:33,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:41:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-07 13:41:33,478 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:41:33,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:41:33,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:41:33,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:41:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-07 13:41:33,679 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:41:33,714 INFO L162 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-10-07 13:41:33,715 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:41:33,721 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:41:33,728 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:41:33,729 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:41:33,780 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:41:44,038 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-10-07 13:41:44,053 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:41:44,054 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:41:44,055 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:41:44,055 INFO L193 IcfgInterpreter]: Reachable states at location L4-2 satisfy 3728#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:41:44,055 INFO L193 IcfgInterpreter]: Reachable states at location L23-1 satisfy 3683#(and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= |main_#t~nondet3| 2147483647) (<= 1 main_~bufferlen~0) (<= 0 (+ |main_#t~nondet3| 2147483648)) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:44,055 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 3737#true [2019-10-07 13:41:44,056 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 3723#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:44,056 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 3733#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:41:44,056 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 3061#(and (<= 0 main_~buf~0) (or (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= main_~in~0 0) (<= 0 (+ main_~buflim~0 1)) (= (+ main_~bufferlen~0 (- 2)) main_~buflim~0) (= 0 main_~in~0) (< main_~bufferlen~0 main_~inlen~0) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= main_~buf~0 0) (<= main_~in~0 2147483647) (= main_~buf~0 0) (<= 0 (+ main_~inlen~0 2147483648)) (<= main_~bufferlen~0 2147483647) (< 0 main_~inlen~0)) (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= 0 main_~in~0) (< main_~in~0 main_~inlen~0) (<= 1 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647))) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:44,056 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 3713#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1)))) [2019-10-07 13:41:44,057 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 2854#(and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= main_~buf~0 2147483647) (<= 0 (+ main_~buflim~0 1)) (< main_~buf~0 main_~bufferlen~0) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:44,057 INFO L193 IcfgInterpreter]: Reachable states at location L27-1 satisfy 3704#(and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:44,057 INFO L193 IcfgInterpreter]: Reachable states at location L38-1 satisfy 2391#(and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= 0 main_~buf~0) (< main_~buf~0 (+ main_~bufferlen~0 1)) (<= 1 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~buf~0 2147483648) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:44,058 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:41:44,058 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:41:44,058 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 2600#(and (or (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (not (= main_~buf~0 main_~buflim~0)) (<= main_~in~0 0) (= (+ main_~bufferlen~0 (- 2)) main_~buflim~0) (= 0 main_~in~0) (< main_~bufferlen~0 main_~inlen~0) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= main_~buf~0 0) (= main_~buf~0 0) (<= 0 (+ main_~inlen~0 2147483648)) (< 0 main_~inlen~0)) (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (< main_~in~0 main_~inlen~0) (not (= main_~buf~0 main_~buflim~0)) (<= 1 main_~buf~0))) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:44,058 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 2379#(and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~bufferlen~0 1)) (<= 0 (+ main_~buflim~0 1)) (<= main_~buf~0 2147483648) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:44,058 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 48#(and (<= main_~inlen~0 2147483647) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= 0 main_~inlen~0) (<= main_~bufferlen~0 2147483647) (<= 0 (+ main_~inlen~0 2147483648)) (< 0 main_~inlen~0) (<= 1 main_~bufferlen~0)) [2019-10-07 13:41:44,059 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 3718#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:44,059 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 3669#(and (<= 0 main_~buf~0) (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= 0 (+ main_~buflim~0 1))) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:44,059 INFO L193 IcfgInterpreter]: Reachable states at location L35 satisfy 3288#(and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:44,059 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 43#(and (<= main_~inlen~0 2147483647) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= main_~bufferlen~0 2147483647) (<= 0 (+ main_~inlen~0 2147483648)) (<= 1 main_~bufferlen~0)) [2019-10-07 13:41:44,059 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 3742#true [2019-10-07 13:41:44,060 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 38#(and (<= main_~inlen~0 2147483647) (<= 0 (+ main_~bufferlen~0 2147483648)) (<= main_~bufferlen~0 2147483647) (<= 0 (+ main_~inlen~0 2147483648))) [2019-10-07 13:41:44,060 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:41:44,060 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 3490#(and (or (and (not (= main_~buf~0 main_~buflim~0)) (<= main_~in~0 0) (< main_~buf~0 main_~bufferlen~0) (= (+ main_~bufferlen~0 (- 2)) main_~buflim~0) (= 0 main_~in~0) (< main_~bufferlen~0 main_~inlen~0) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= main_~buf~0 0) (= main_~buf~0 0) (<= 0 (+ main_~inlen~0 2147483648)) (< 0 main_~inlen~0)) (and (<= 1 main_~in~0) (not (= main_~buf~0 main_~buflim~0)) (< main_~buf~0 main_~bufferlen~0) (< main_~in~0 main_~inlen~0) (<= 1 main_~buf~0))) (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= main_~buf~0 2147483647) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:44,060 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 3708#(and (or (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-07 13:41:44,061 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 3262#(and (<= 0 main_~buf~0) (or (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= main_~in~0 0) (<= 0 (+ main_~buflim~0 1)) (= (+ main_~bufferlen~0 (- 2)) main_~buflim~0) (= 0 main_~in~0) (< main_~bufferlen~0 main_~inlen~0) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= main_~buf~0 0) (<= main_~in~0 2147483647) (= main_~buf~0 0) (<= 0 (+ main_~inlen~0 2147483648)) (<= main_~bufferlen~0 2147483647) (< 0 main_~inlen~0)) (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= 0 main_~in~0) (< main_~in~0 main_~inlen~0) (<= 1 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647))) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:44,061 INFO L193 IcfgInterpreter]: Reachable states at location L32-1 satisfy 3649#(and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= 0 main_~in~0) (<= 1 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:44,061 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 3637#(and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= 1 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:44,983 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:41:44,984 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11, 16] total 34 [2019-10-07 13:41:44,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-07 13:41:44,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-07 13:41:44,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 13:41:44,987 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 34 states. [2019-10-07 13:41:46,250 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 26 [2019-10-07 13:41:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:47,047 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2019-10-07 13:41:47,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-07 13:41:47,048 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 54 [2019-10-07 13:41:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:47,050 INFO L225 Difference]: With dead ends: 81 [2019-10-07 13:41:47,050 INFO L226 Difference]: Without dead ends: 66 [2019-10-07 13:41:47,053 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 130 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=458, Invalid=1992, Unknown=0, NotChecked=0, Total=2450 [2019-10-07 13:41:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-07 13:41:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2019-10-07 13:41:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-07 13:41:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-10-07 13:41:47,062 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 54 [2019-10-07 13:41:47,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:47,063 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-10-07 13:41:47,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-07 13:41:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-10-07 13:41:47,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-07 13:41:47,065 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:47,065 INFO L385 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:47,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:47,266 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:47,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:47,267 INFO L82 PathProgramCache]: Analyzing trace with hash 543255984, now seen corresponding path program 1 times [2019-10-07 13:41:47,267 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:47,268 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:47,268 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:47,268 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:47,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-07 13:41:47,360 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:47,360 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:41:47,360 INFO L95 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-07 13:41:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:47,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 13:41:47,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:41:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-07 13:41:47,573 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:41:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-07 13:41:47,612 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:41:47,613 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-07 13:41:47,614 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:41:47,614 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:41:47,614 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:41:47,615 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:41:47,635 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:41:52,846 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-10-07 13:41:52,858 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:41:52,859 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:41:52,860 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:41:52,860 INFO L193 IcfgInterpreter]: Reachable states at location L4-2 satisfy 2185#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:41:52,860 INFO L193 IcfgInterpreter]: Reachable states at location L23-1 satisfy 2130#(or (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= 0 main_~in~0) (<= 0 (+ main_~buflim~0 1)) (<= |main_#t~nondet3| 2147483647) (< main_~in~0 main_~inlen~0) (<= 1 main_~buf~0) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= 0 (+ |main_#t~nondet3| 2147483648)) (<= main_~buflim~0 2147483645)) (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= |main_#t~nondet3| 2147483647) (<= 1 main_~bufferlen~0) (<= 0 (+ |main_#t~nondet3| 2147483648)) (<= main_~buflim~0 2147483645))) [2019-10-07 13:41:52,860 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 2121#(and (<= 0 main_~buf~0) (<= main_~in~0 2147483647) (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~bufferlen~0 2147483647)) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:52,860 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 2194#true [2019-10-07 13:41:52,864 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 2180#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:52,864 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 2190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:41:52,865 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 2135#(and (<= 0 main_~buf~0) (or (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= main_~in~0 0) (<= 0 (+ main_~buflim~0 1)) (= (+ main_~bufferlen~0 (- 2)) main_~buflim~0) (= 0 main_~in~0) (< main_~bufferlen~0 main_~inlen~0) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= main_~buf~0 0) (<= main_~in~0 2147483647) (= main_~buf~0 0) (<= 0 (+ main_~inlen~0 2147483648)) (<= main_~bufferlen~0 2147483647) (< 0 main_~inlen~0)) (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= 0 main_~in~0) (< main_~in~0 main_~inlen~0) (<= 1 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647))) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:52,865 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 2170#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1)))) [2019-10-07 13:41:52,865 INFO L193 IcfgInterpreter]: Reachable states at location L27-1 satisfy 2161#(and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:52,865 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 43#(and (<= main_~inlen~0 2147483647) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= main_~bufferlen~0 2147483647) (<= 0 (+ main_~inlen~0 2147483648)) (<= 1 main_~bufferlen~0)) [2019-10-07 13:41:52,865 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:41:52,866 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:41:52,866 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 2140#(and (or (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (not (= main_~buf~0 main_~buflim~0)) (<= main_~in~0 0) (= (+ main_~bufferlen~0 (- 2)) main_~buflim~0) (= 0 main_~in~0) (< main_~bufferlen~0 main_~inlen~0) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= main_~buf~0 0) (= main_~buf~0 0) (<= 0 (+ main_~inlen~0 2147483648)) (< 0 main_~inlen~0)) (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (< main_~in~0 main_~inlen~0) (not (= main_~buf~0 main_~buflim~0)) (<= 1 main_~buf~0))) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:52,866 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 2199#true [2019-10-07 13:41:52,866 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 38#(and (<= main_~inlen~0 2147483647) (<= 0 (+ main_~bufferlen~0 2147483648)) (<= main_~bufferlen~0 2147483647) (<= 0 (+ main_~inlen~0 2147483648))) [2019-10-07 13:41:52,866 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:41:52,866 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 1946#(and (or (and (not (= main_~buf~0 main_~buflim~0)) (<= main_~in~0 0) (< main_~buf~0 main_~bufferlen~0) (= (+ main_~bufferlen~0 (- 2)) main_~buflim~0) (= 0 main_~in~0) (< main_~bufferlen~0 main_~inlen~0) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= main_~buf~0 0) (= main_~buf~0 0) (<= 0 (+ main_~inlen~0 2147483648)) (< 0 main_~inlen~0)) (and (<= 1 main_~in~0) (not (= main_~buf~0 main_~buflim~0)) (< main_~buf~0 main_~bufferlen~0) (< main_~in~0 main_~inlen~0) (<= 1 main_~buf~0))) (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= main_~buf~0 2147483647) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:52,866 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 48#(and (<= main_~inlen~0 2147483647) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= 0 main_~inlen~0) (<= main_~bufferlen~0 2147483647) (<= 0 (+ main_~inlen~0 2147483648)) (< 0 main_~inlen~0) (<= 1 main_~bufferlen~0)) [2019-10-07 13:41:52,867 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 2175#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:52,867 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 2165#(and (or (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-07 13:41:52,867 INFO L193 IcfgInterpreter]: Reachable states at location L32-1 satisfy 2105#(and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= 0 main_~in~0) (<= 1 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:52,868 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 2093#(and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= 1 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:41:53,586 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:41:53,586 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 14] total 26 [2019-10-07 13:41:53,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-07 13:41:53,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-07 13:41:53,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2019-10-07 13:41:53,588 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 26 states. [2019-10-07 13:41:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:55,059 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-10-07 13:41:55,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-07 13:41:55,060 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-10-07 13:41:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:55,064 INFO L225 Difference]: With dead ends: 72 [2019-10-07 13:41:55,064 INFO L226 Difference]: Without dead ends: 70 [2019-10-07 13:41:55,065 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 141 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=356, Invalid=1366, Unknown=0, NotChecked=0, Total=1722 [2019-10-07 13:41:55,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-07 13:41:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-10-07 13:41:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-07 13:41:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2019-10-07 13:41:55,075 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 55 [2019-10-07 13:41:55,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:55,075 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2019-10-07 13:41:55,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-07 13:41:55,076 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2019-10-07 13:41:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-07 13:41:55,078 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:55,078 INFO L385 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:55,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:55,282 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:55,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:55,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1878118460, now seen corresponding path program 2 times [2019-10-07 13:41:55,284 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:55,284 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:55,284 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:55,285 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:55,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-10-07 13:41:55,527 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:55,527 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:41:55,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-07 13:41:55,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-07 13:41:55,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:41:55,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-07 13:41:55,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:41:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 100 proven. 56 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-07 13:41:55,940 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:41:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 100 proven. 56 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-07 13:41:56,258 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:41:56,259 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-07 13:41:56,259 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:41:56,260 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:41:56,260 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:41:56,260 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:41:56,266 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:42:01,106 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-10-07 13:42:01,120 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:42:01,122 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:42:01,122 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:42:01,122 INFO L193 IcfgInterpreter]: Reachable states at location L4-2 satisfy 2194#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:42:01,122 INFO L193 IcfgInterpreter]: Reachable states at location L23-1 satisfy 2139#(or (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= 0 main_~in~0) (<= 0 (+ main_~buflim~0 1)) (<= |main_#t~nondet3| 2147483647) (< main_~in~0 main_~inlen~0) (<= 1 main_~buf~0) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= 0 (+ |main_#t~nondet3| 2147483648)) (<= main_~buflim~0 2147483645)) (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= |main_#t~nondet3| 2147483647) (<= 1 main_~bufferlen~0) (<= 0 (+ |main_#t~nondet3| 2147483648)) (<= main_~buflim~0 2147483645))) [2019-10-07 13:42:01,123 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 2130#(and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:42:01,123 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 2189#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:42:01,123 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 2203#true [2019-10-07 13:42:01,123 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 2199#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:42:01,124 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 2144#(and (<= 0 main_~buf~0) (or (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= main_~in~0 0) (<= 0 (+ main_~buflim~0 1)) (= (+ main_~bufferlen~0 (- 2)) main_~buflim~0) (= 0 main_~in~0) (< main_~bufferlen~0 main_~inlen~0) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= main_~buf~0 0) (<= main_~in~0 2147483647) (= main_~buf~0 0) (<= 0 (+ main_~inlen~0 2147483648)) (<= main_~bufferlen~0 2147483647) (< 0 main_~inlen~0)) (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= 0 main_~in~0) (< main_~in~0 main_~inlen~0) (<= 1 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647))) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:42:01,124 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 2179#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1)))) [2019-10-07 13:42:01,124 INFO L193 IcfgInterpreter]: Reachable states at location L27-1 satisfy 2170#(and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:42:01,124 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 43#(and (<= main_~inlen~0 2147483647) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= 0 (+ main_~inlen~0 2147483648)) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0)) [2019-10-07 13:42:01,124 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:42:01,125 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:42:01,125 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 2149#(and (or (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (not (= main_~buf~0 main_~buflim~0)) (<= main_~in~0 0) (= (+ main_~bufferlen~0 (- 2)) main_~buflim~0) (= 0 main_~in~0) (< main_~bufferlen~0 main_~inlen~0) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= main_~buf~0 0) (= main_~buf~0 0) (<= 0 (+ main_~inlen~0 2147483648)) (< 0 main_~inlen~0)) (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (< main_~in~0 main_~inlen~0) (not (= main_~buf~0 main_~buflim~0)) (<= 1 main_~buf~0))) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:42:01,125 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 2208#true [2019-10-07 13:42:01,125 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 38#(and (<= main_~inlen~0 2147483647) (<= 0 (+ main_~bufferlen~0 2147483648)) (<= 0 (+ main_~inlen~0 2147483648)) (<= main_~bufferlen~0 2147483647)) [2019-10-07 13:42:01,125 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:42:01,125 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 1952#(and (<= main_~buf~0 2147483647) (or (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 0 main_~in~0) (not (= main_~buf~0 main_~buflim~0)) (<= main_~in~0 0) (< main_~buf~0 main_~bufferlen~0) (= (+ main_~bufferlen~0 (- 2)) main_~buflim~0) (= 0 main_~in~0) (< main_~bufferlen~0 main_~inlen~0) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= main_~buf~0 0) (<= 0 main_~buf~0) (= main_~buf~0 0) (<= 0 (+ main_~inlen~0 2147483648)) (< 0 main_~inlen~0)) (and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= 0 main_~in~0) (not (= main_~buf~0 main_~buflim~0)) (< main_~buf~0 main_~bufferlen~0) (< main_~in~0 main_~inlen~0) (<= 0 main_~buf~0) (<= 1 main_~buf~0))) (<= 0 (+ main_~buflim~0 1)) (<= main_~in~0 2147483647) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:42:01,125 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 48#(and (<= main_~inlen~0 2147483647) (<= 0 (+ main_~bufferlen~0 2147483648)) (< 1 main_~bufferlen~0) (<= 0 main_~inlen~0) (<= 0 (+ main_~inlen~0 2147483648)) (<= main_~bufferlen~0 2147483647) (< 0 main_~inlen~0) (<= 1 main_~bufferlen~0)) [2019-10-07 13:42:01,126 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 2184#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:42:01,126 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 2174#(and (or (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-07 13:42:01,126 INFO L193 IcfgInterpreter]: Reachable states at location L32-1 satisfy 2111#(and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= 0 main_~in~0) (<= 1 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:42:01,126 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 2099#(and (<= 1 main_~inlen~0) (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= 1 main_~buf~0) (<= 0 (+ main_~buflim~0 1)) (<= main_~bufferlen~0 2147483647) (<= 1 main_~bufferlen~0) (<= main_~buflim~0 2147483645)) [2019-10-07 13:42:02,038 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:42:02,038 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13, 14] total 39 [2019-10-07 13:42:02,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-07 13:42:02,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-07 13:42:02,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2019-10-07 13:42:02,040 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 39 states. [2019-10-07 13:42:02,298 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 25 [2019-10-07 13:42:03,508 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-10-07 13:42:03,921 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-10-07 13:42:04,183 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2019-10-07 13:42:04,566 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 27 [2019-10-07 13:42:04,800 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2019-10-07 13:42:05,267 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2019-10-07 13:42:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:42:05,275 INFO L93 Difference]: Finished difference Result 89 states and 107 transitions. [2019-10-07 13:42:05,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-07 13:42:05,275 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 103 [2019-10-07 13:42:05,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:42:05,277 INFO L225 Difference]: With dead ends: 89 [2019-10-07 13:42:05,277 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:42:05,279 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 275 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=747, Invalid=3035, Unknown=0, NotChecked=0, Total=3782 [2019-10-07 13:42:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:42:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:42:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:42:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:42:05,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2019-10-07 13:42:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:42:05,280 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:42:05,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-07 13:42:05,281 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:42:05,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:42:05,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:42:05,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:42:05,762 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2019-10-07 13:42:05,950 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2019-10-07 13:42:06,157 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:42:06,157 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:42:06,157 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:42:06,157 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:42:06,158 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:42:06,158 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:42:06,158 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (<= main_~inlen~0 2147483647)) (.cse1 (+ main_~buflim~0 2))) (or (and .cse0 (not (= main_~bufferlen~0 (+ main_~buf~0 2))) (= 0 main_~in~0) (< main_~bufferlen~0 main_~inlen~0) (= main_~bufferlen~0 .cse1) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)) (and .cse0 (<= 1 main_~in~0) (<= .cse1 main_~bufferlen~0) (< main_~buf~0 main_~buflim~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= 1 main_~buf~0) (<= main_~bufferlen~0 2147483647)))) [2019-10-07 13:42:06,158 INFO L439 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse0 (<= main_~inlen~0 2147483647)) (.cse1 (+ main_~buflim~0 2))) (or (and .cse0 (not (= main_~bufferlen~0 (+ main_~buf~0 2))) (= 0 main_~in~0) (< main_~bufferlen~0 main_~inlen~0) (= main_~bufferlen~0 .cse1) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)) (and .cse0 (<= 1 main_~in~0) (<= .cse1 main_~bufferlen~0) (< main_~buf~0 main_~buflim~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= 1 main_~buf~0) (<= main_~bufferlen~0 2147483647)))) [2019-10-07 13:42:06,158 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2019-10-07 13:42:06,159 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2019-10-07 13:42:06,159 INFO L439 ceAbstractionStarter]: At program point L23-3(lines 23 34) the Hoare annotation is: (and (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2019-10-07 13:42:06,159 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-10-07 13:42:06,159 INFO L439 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (and (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)) (<= main_~bufferlen~0 2147483647)) [2019-10-07 13:42:06,159 INFO L439 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (and (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)) (<= main_~bufferlen~0 2147483647)) [2019-10-07 13:42:06,160 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-07 13:42:06,160 INFO L446 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2019-10-07 13:42:06,160 INFO L439 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse0 (<= main_~inlen~0 2147483647)) (.cse1 (+ main_~buflim~0 2))) (or (and .cse0 (<= 1 main_~in~0) (<= .cse1 main_~bufferlen~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)) (<= main_~bufferlen~0 2147483647)) (and (= 0 main_~in~0) .cse0 (< main_~bufferlen~0 main_~inlen~0) (= main_~bufferlen~0 .cse1) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)))) [2019-10-07 13:42:06,160 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2019-10-07 13:42:06,160 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-10-07 13:42:06,160 INFO L443 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2019-10-07 13:42:06,160 INFO L439 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)) [2019-10-07 13:42:06,161 INFO L439 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)) [2019-10-07 13:42:06,161 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2019-10-07 13:42:06,161 INFO L443 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2019-10-07 13:42:06,161 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-07 13:42:06,161 INFO L439 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2019-10-07 13:42:06,161 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-07 13:42:06,162 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-07 13:42:06,162 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:42:06,162 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-07 13:42:06,162 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-07 13:42:06,162 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:42:06,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:42:06 BoogieIcfgContainer [2019-10-07 13:42:06,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:42:06,184 INFO L168 Benchmark]: Toolchain (without parser) took 35452.24 ms. Allocated memory was 136.3 MB in the beginning and 685.2 MB in the end (delta: 548.9 MB). Free memory was 101.3 MB in the beginning and 416.7 MB in the end (delta: -315.4 MB). Peak memory consumption was 233.6 MB. Max. memory is 7.1 GB. [2019-10-07 13:42:06,185 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 136.3 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-07 13:42:06,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.29 ms. Allocated memory is still 136.3 MB. Free memory was 101.1 MB in the beginning and 91.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:42:06,187 INFO L168 Benchmark]: Boogie Preprocessor took 110.01 ms. Allocated memory was 136.3 MB in the beginning and 198.2 MB in the end (delta: 61.9 MB). Free memory was 91.4 MB in the beginning and 176.4 MB in the end (delta: -85.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2019-10-07 13:42:06,188 INFO L168 Benchmark]: RCFGBuilder took 304.27 ms. Allocated memory is still 198.2 MB. Free memory was 176.4 MB in the beginning and 162.1 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:42:06,188 INFO L168 Benchmark]: TraceAbstraction took 34800.80 ms. Allocated memory was 198.2 MB in the beginning and 685.2 MB in the end (delta: 487.1 MB). Free memory was 161.4 MB in the beginning and 416.7 MB in the end (delta: -255.3 MB). Peak memory consumption was 231.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:42:06,192 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.23 ms. Allocated memory is still 136.3 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 231.29 ms. Allocated memory is still 136.3 MB. Free memory was 101.1 MB in the beginning and 91.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.01 ms. Allocated memory was 136.3 MB in the beginning and 198.2 MB in the end (delta: 61.9 MB). Free memory was 91.4 MB in the beginning and 176.4 MB in the end (delta: -85.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 304.27 ms. Allocated memory is still 198.2 MB. Free memory was 176.4 MB in the beginning and 162.1 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34800.80 ms. Allocated memory was 198.2 MB in the beginning and 685.2 MB in the end (delta: 487.1 MB). Free memory was 161.4 MB in the beginning and 416.7 MB in the end (delta: -255.3 MB). Peak memory consumption was 231.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: 23]: Loop Invariant Derived loop invariant: ((((((inlen <= 2147483647 && 1 <= in) && buflim + 2 <= bufferlen) && in + buflim + 3 <= buf + inlen) && 1 <= buf) && buf < buflim + 1) && bufferlen <= 2147483647) || (((((0 == in && inlen <= 2147483647) && bufferlen < inlen) && bufferlen == buflim + 2) && buf == 0) && 2 <= bufferlen) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 34.6s, OverallIterations: 9, TraceHistogramMax: 16, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 291 SDtfs, 441 SDslu, 1079 SDs, 0 SdLazy, 1489 SolverSat, 1043 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 759 GetRequests, 558 SyntacticMatches, 22 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred 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, 23 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 60 PreInvPairs, 106 NumberOfFragments, 291 HoareAnnotationTreeSize, 60 FomulaSimplifications, 2534 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1282 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 557 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 754 ConstructedInterpolants, 0 QuantifiedInterpolants, 242701 SizeOfPredicates, 19 NumberOfNonLiveVariables, 422 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 1936/2158 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 20469, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 2169, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 580, TOOLS_POST_TIME[ms]: 204, TOOLS_POST_CALL_APPLICATIONS: 1130, TOOLS_POST_CALL_TIME[ms]: 9563, TOOLS_POST_RETURN_APPLICATIONS: 1108, TOOLS_POST_RETURN_TIME[ms]: 692, TOOLS_QUANTIFIERELIM_APPLICATIONS: 2818, TOOLS_QUANTIFIERELIM_TIME[ms]: 9977, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 84, FLUID_QUERY_TIME[ms]: 40, FLUID_QUERIES: 2277, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1157, DOMAIN_JOIN_TIME[ms]: 7727, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 72, DOMAIN_WIDEN_TIME[ms]: 841, DOMAIN_ISSUBSETEQ_APPLICATIONS: 108, DOMAIN_ISSUBSETEQ_TIME[ms]: 215, DOMAIN_ISBOTTOM_APPLICATIONS: 573, DOMAIN_ISBOTTOM_TIME[ms]: 853, LOOP_SUMMARIZER_APPLICATIONS: 36, LOOP_SUMMARIZER_CACHE_MISSES: 36, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 14200, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 14199, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 108, CALL_SUMMARIZER_APPLICATIONS: 1108, CALL_SUMMARIZER_CACHE_MISSES: 6, CALL_SUMMARIZER_OVERALL_TIME[ms]: 24, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 21, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 7, PATH_EXPR_TIME[ms]: 5, REGEX_TO_DAG_TIME[ms]: 6, DAG_COMPRESSION_TIME[ms]: 68, DAG_COMPRESSION_PROCESSED_NODES: 1363, DAG_COMPRESSION_RETAINED_NODES: 680, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...