/usr/bin/java -ea -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 -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:47:12,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:47:12,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:47:12,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:47:12,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:47:12,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:47:12,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:47:12,631 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:47:12,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:47:12,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:47:12,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:47:12,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:47:12,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:47:12,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:47:12,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:47:12,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:47:12,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:47:12,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:47:12,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:47:12,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:47:12,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:47:12,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:47:12,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:47:12,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:47:12,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:47:12,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:47:12,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:47:12,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:47:12,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:47:12,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:47:12,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:47:12,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:47:12,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:47:12,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:47:12,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:47:12,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:47:12,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:47:12,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:47:12,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:47:12,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:47:12,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:47:12,681 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 [2020-07-08 12:47:12,695 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:47:12,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:47:12,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:47:12,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:47:12,697 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:47:12,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:47:12,698 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:47:12,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:47:12,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:47:12,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:47:12,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:47:12,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:47:12,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:47:12,699 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:47:12,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:47:12,700 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:47:12,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:47:12,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:47:12,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:47:12,700 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:47:12,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:47:12,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:47:12,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:47:12,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:47:12,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:47:12,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:47:12,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:47:12,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:47:12,702 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:47:12,702 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:47:13,021 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:47:13,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:47:13,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:47:13,039 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:47:13,040 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:47:13,041 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-07-08 12:47:13,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8079fd982/02d3d39c83174817b2ed4e5a19e29e8a/FLAGb88ae3bca [2020-07-08 12:47:13,552 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:47:13,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-07-08 12:47:13,560 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8079fd982/02d3d39c83174817b2ed4e5a19e29e8a/FLAGb88ae3bca [2020-07-08 12:47:13,898 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8079fd982/02d3d39c83174817b2ed4e5a19e29e8a [2020-07-08 12:47:13,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:47:13,908 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:47:13,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:47:13,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:47:13,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:47:13,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:47:13" (1/1) ... [2020-07-08 12:47:13,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@332d53b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:13, skipping insertion in model container [2020-07-08 12:47:13,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:47:13" (1/1) ... [2020-07-08 12:47:13,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:47:13,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:47:14,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:47:14,136 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:47:14,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:47:14,173 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:47:14,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:14 WrapperNode [2020-07-08 12:47:14,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:47:14,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:47:14,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:47:14,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:47:14,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:14" (1/1) ... [2020-07-08 12:47:14,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:14" (1/1) ... [2020-07-08 12:47:14,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:14" (1/1) ... [2020-07-08 12:47:14,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:14" (1/1) ... [2020-07-08 12:47:14,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:14" (1/1) ... [2020-07-08 12:47:14,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:14" (1/1) ... [2020-07-08 12:47:14,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:14" (1/1) ... [2020-07-08 12:47:14,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:47:14,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:47:14,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:47:14,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:47:14,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:14" (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 [2020-07-08 12:47:14,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:47:14,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:47:14,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:47:14,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:47:14,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:47:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:47:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:47:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:47:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:47:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:47:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:47:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:47:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:47:14,771 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:47:14,771 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 12:47:14,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:47:14 BoogieIcfgContainer [2020-07-08 12:47:14,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:47:14,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:47:14,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:47:14,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:47:14,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:47:13" (1/3) ... [2020-07-08 12:47:14,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc93388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:47:14, skipping insertion in model container [2020-07-08 12:47:14,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:14" (2/3) ... [2020-07-08 12:47:14,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc93388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:47:14, skipping insertion in model container [2020-07-08 12:47:14,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:47:14" (3/3) ... [2020-07-08 12:47:14,783 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2020-07-08 12:47:14,793 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:47:14,801 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:47:14,814 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:47:14,838 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:47:14,839 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:47:14,839 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:47:14,839 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:47:14,839 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:47:14,839 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:47:14,839 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:47:14,839 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:47:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-08 12:47:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:47:14,864 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:14,865 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:14,866 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:14,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:14,871 INFO L82 PathProgramCache]: Analyzing trace with hash 160437665, now seen corresponding path program 1 times [2020-07-08 12:47:14,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:14,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288923630] [2020-07-08 12:47:14,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:15,020 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-08 12:47:15,021 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {38#true} {38#true} #78#return; {38#true} is VALID [2020-07-08 12:47:15,023 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2020-07-08 12:47:15,023 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-08 12:47:15,024 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #78#return; {38#true} is VALID [2020-07-08 12:47:15,024 INFO L263 TraceCheckUtils]: 3: Hoare triple {38#true} call #t~ret7 := main(); {38#true} is VALID [2020-07-08 12:47:15,025 INFO L280 TraceCheckUtils]: 4: Hoare triple {38#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {38#true} is VALID [2020-07-08 12:47:15,025 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} assume ~bufferlen~0 > 1; {38#true} is VALID [2020-07-08 12:47:15,025 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} assume ~inlen~0 > 0; {38#true} is VALID [2020-07-08 12:47:15,026 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#true} assume ~bufferlen~0 < ~inlen~0; {38#true} is VALID [2020-07-08 12:47:15,026 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#true} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {38#true} is VALID [2020-07-08 12:47:15,029 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#true} assume !true; {39#false} is VALID [2020-07-08 12:47:15,029 INFO L263 TraceCheckUtils]: 10: Hoare triple {39#false} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {39#false} is VALID [2020-07-08 12:47:15,030 INFO L280 TraceCheckUtils]: 11: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2020-07-08 12:47:15,030 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2020-07-08 12:47:15,030 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-08 12:47:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:15,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288923630] [2020-07-08 12:47:15,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:15,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 12:47:15,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40681555] [2020-07-08 12:47:15,042 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-08 12:47:15,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:15,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 12:47:15,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:15,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 12:47:15,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:15,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 12:47:15,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:47:15,093 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2020-07-08 12:47:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:15,210 INFO L93 Difference]: Finished difference Result 61 states and 92 transitions. [2020-07-08 12:47:15,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 12:47:15,210 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-08 12:47:15,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:47:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 92 transitions. [2020-07-08 12:47:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:47:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 92 transitions. [2020-07-08 12:47:15,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 92 transitions. [2020-07-08 12:47:15,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:15,446 INFO L225 Difference]: With dead ends: 61 [2020-07-08 12:47:15,447 INFO L226 Difference]: Without dead ends: 29 [2020-07-08 12:47:15,452 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:47:15,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-08 12:47:15,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-08 12:47:15,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:15,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-08 12:47:15,504 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-08 12:47:15,504 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-08 12:47:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:15,511 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2020-07-08 12:47:15,511 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2020-07-08 12:47:15,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:15,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:15,513 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-08 12:47:15,513 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-08 12:47:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:15,519 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2020-07-08 12:47:15,519 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2020-07-08 12:47:15,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:15,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:15,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:15,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-08 12:47:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2020-07-08 12:47:15,528 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 14 [2020-07-08 12:47:15,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:15,528 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-07-08 12:47:15,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 12:47:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2020-07-08 12:47:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-08 12:47:15,530 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:15,530 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:15,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:47:15,531 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:15,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:15,532 INFO L82 PathProgramCache]: Analyzing trace with hash 89152719, now seen corresponding path program 1 times [2020-07-08 12:47:15,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:15,532 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644360200] [2020-07-08 12:47:15,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:15,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {232#true} assume true; {232#true} is VALID [2020-07-08 12:47:15,648 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {232#true} {232#true} #78#return; {232#true} is VALID [2020-07-08 12:47:15,648 INFO L263 TraceCheckUtils]: 0: Hoare triple {232#true} call ULTIMATE.init(); {232#true} is VALID [2020-07-08 12:47:15,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {232#true} assume true; {232#true} is VALID [2020-07-08 12:47:15,649 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {232#true} {232#true} #78#return; {232#true} is VALID [2020-07-08 12:47:15,650 INFO L263 TraceCheckUtils]: 3: Hoare triple {232#true} call #t~ret7 := main(); {232#true} is VALID [2020-07-08 12:47:15,650 INFO L280 TraceCheckUtils]: 4: Hoare triple {232#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {232#true} is VALID [2020-07-08 12:47:15,650 INFO L280 TraceCheckUtils]: 5: Hoare triple {232#true} assume ~bufferlen~0 > 1; {232#true} is VALID [2020-07-08 12:47:15,651 INFO L280 TraceCheckUtils]: 6: Hoare triple {232#true} assume ~inlen~0 > 0; {232#true} is VALID [2020-07-08 12:47:15,651 INFO L280 TraceCheckUtils]: 7: Hoare triple {232#true} assume ~bufferlen~0 < ~inlen~0; {232#true} is VALID [2020-07-08 12:47:15,652 INFO L280 TraceCheckUtils]: 8: Hoare triple {232#true} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {236#(<= 0 main_~buf~0)} is VALID [2020-07-08 12:47:15,668 INFO L280 TraceCheckUtils]: 9: Hoare triple {236#(<= 0 main_~buf~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {236#(<= 0 main_~buf~0)} is VALID [2020-07-08 12:47:15,671 INFO L280 TraceCheckUtils]: 10: Hoare triple {236#(<= 0 main_~buf~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {236#(<= 0 main_~buf~0)} is VALID [2020-07-08 12:47:15,673 INFO L263 TraceCheckUtils]: 11: Hoare triple {236#(<= 0 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {237#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:15,674 INFO L280 TraceCheckUtils]: 12: Hoare triple {237#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {238#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:15,674 INFO L280 TraceCheckUtils]: 13: Hoare triple {238#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {233#false} is VALID [2020-07-08 12:47:15,675 INFO L280 TraceCheckUtils]: 14: Hoare triple {233#false} assume !false; {233#false} is VALID [2020-07-08 12:47:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:15,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644360200] [2020-07-08 12:47:15,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:15,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:47:15,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257731213] [2020-07-08 12:47:15,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-08 12:47:15,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:15,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:47:15,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:15,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:47:15,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:15,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:47:15,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:47:15,702 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2020-07-08 12:47:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:15,927 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-07-08 12:47:15,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:47:15,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-08 12:47:15,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:47:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-08 12:47:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:47:15,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-08 12:47:15,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2020-07-08 12:47:15,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:15,992 INFO L225 Difference]: With dead ends: 35 [2020-07-08 12:47:15,992 INFO L226 Difference]: Without dead ends: 33 [2020-07-08 12:47:15,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:47:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-08 12:47:16,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-08 12:47:16,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:16,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-08 12:47:16,012 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-08 12:47:16,013 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-08 12:47:16,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:16,016 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-07-08 12:47:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2020-07-08 12:47:16,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:16,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:16,018 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-08 12:47:16,018 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-08 12:47:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:16,022 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-07-08 12:47:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2020-07-08 12:47:16,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:16,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:16,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:16,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-08 12:47:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2020-07-08 12:47:16,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 15 [2020-07-08 12:47:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:16,027 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-07-08 12:47:16,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:47:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2020-07-08 12:47:16,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:47:16,029 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:16,029 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:16,029 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:47:16,029 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:16,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:16,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1105875316, now seen corresponding path program 1 times [2020-07-08 12:47:16,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:16,030 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390627401] [2020-07-08 12:47:16,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:16,168 INFO L280 TraceCheckUtils]: 0: Hoare triple {407#true} assume true; {407#true} is VALID [2020-07-08 12:47:16,169 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {407#true} {407#true} #78#return; {407#true} is VALID [2020-07-08 12:47:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:16,198 INFO L280 TraceCheckUtils]: 0: Hoare triple {407#true} ~cond := #in~cond; {407#true} is VALID [2020-07-08 12:47:16,199 INFO L280 TraceCheckUtils]: 1: Hoare triple {407#true} assume !(0 == ~cond); {407#true} is VALID [2020-07-08 12:47:16,199 INFO L280 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2020-07-08 12:47:16,200 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {407#true} {412#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #90#return; {412#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:16,200 INFO L263 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2020-07-08 12:47:16,201 INFO L280 TraceCheckUtils]: 1: Hoare triple {407#true} assume true; {407#true} is VALID [2020-07-08 12:47:16,201 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {407#true} {407#true} #78#return; {407#true} is VALID [2020-07-08 12:47:16,201 INFO L263 TraceCheckUtils]: 3: Hoare triple {407#true} call #t~ret7 := main(); {407#true} is VALID [2020-07-08 12:47:16,202 INFO L280 TraceCheckUtils]: 4: Hoare triple {407#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {407#true} is VALID [2020-07-08 12:47:16,203 INFO L280 TraceCheckUtils]: 5: Hoare triple {407#true} assume ~bufferlen~0 > 1; {411#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:16,204 INFO L280 TraceCheckUtils]: 6: Hoare triple {411#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {411#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:16,204 INFO L280 TraceCheckUtils]: 7: Hoare triple {411#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {411#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:16,205 INFO L280 TraceCheckUtils]: 8: Hoare triple {411#(<= 2 main_~bufferlen~0)} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {412#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:16,206 INFO L280 TraceCheckUtils]: 9: Hoare triple {412#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {412#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:16,207 INFO L280 TraceCheckUtils]: 10: Hoare triple {412#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {412#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:16,207 INFO L263 TraceCheckUtils]: 11: Hoare triple {412#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {407#true} is VALID [2020-07-08 12:47:16,207 INFO L280 TraceCheckUtils]: 12: Hoare triple {407#true} ~cond := #in~cond; {407#true} is VALID [2020-07-08 12:47:16,208 INFO L280 TraceCheckUtils]: 13: Hoare triple {407#true} assume !(0 == ~cond); {407#true} is VALID [2020-07-08 12:47:16,208 INFO L280 TraceCheckUtils]: 14: Hoare triple {407#true} assume true; {407#true} is VALID [2020-07-08 12:47:16,214 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {407#true} {412#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #90#return; {412#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:16,216 INFO L263 TraceCheckUtils]: 16: Hoare triple {412#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {417#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:16,216 INFO L280 TraceCheckUtils]: 17: Hoare triple {417#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {418#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:16,217 INFO L280 TraceCheckUtils]: 18: Hoare triple {418#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {408#false} is VALID [2020-07-08 12:47:16,218 INFO L280 TraceCheckUtils]: 19: Hoare triple {408#false} assume !false; {408#false} is VALID [2020-07-08 12:47:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:16,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390627401] [2020-07-08 12:47:16,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:16,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:47:16,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011118233] [2020-07-08 12:47:16,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-08 12:47:16,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:16,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:47:16,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:16,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:47:16,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:16,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:47:16,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:47:16,260 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 6 states. [2020-07-08 12:47:16,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:16,659 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2020-07-08 12:47:16,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:47:16,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-08 12:47:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:47:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-08 12:47:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:47:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-08 12:47:16,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2020-07-08 12:47:16,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:16,758 INFO L225 Difference]: With dead ends: 48 [2020-07-08 12:47:16,759 INFO L226 Difference]: Without dead ends: 46 [2020-07-08 12:47:16,759 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:47:16,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-08 12:47:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-07-08 12:47:16,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:16,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2020-07-08 12:47:16,793 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2020-07-08 12:47:16,793 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2020-07-08 12:47:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:16,797 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2020-07-08 12:47:16,798 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2020-07-08 12:47:16,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:16,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:16,799 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2020-07-08 12:47:16,799 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2020-07-08 12:47:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:16,803 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2020-07-08 12:47:16,804 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2020-07-08 12:47:16,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:16,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:16,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:16,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-08 12:47:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2020-07-08 12:47:16,809 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 20 [2020-07-08 12:47:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:16,809 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2020-07-08 12:47:16,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:47:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2020-07-08 12:47:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 12:47:16,811 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:16,811 INFO L422 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, 1, 1] [2020-07-08 12:47:16,811 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:47:16,811 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:16,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:16,812 INFO L82 PathProgramCache]: Analyzing trace with hash 726428669, now seen corresponding path program 1 times [2020-07-08 12:47:16,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:16,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277743873] [2020-07-08 12:47:16,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:16,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-08 12:47:16,892 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {651#true} {651#true} #78#return; {651#true} is VALID [2020-07-08 12:47:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:16,899 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} ~cond := #in~cond; {651#true} is VALID [2020-07-08 12:47:16,900 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} assume !(0 == ~cond); {651#true} is VALID [2020-07-08 12:47:16,900 INFO L280 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-08 12:47:16,901 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {651#true} {655#(<= 0 main_~in~0)} #82#return; {655#(<= 0 main_~in~0)} is VALID [2020-07-08 12:47:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:16,909 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} ~cond := #in~cond; {651#true} is VALID [2020-07-08 12:47:16,909 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} assume !(0 == ~cond); {651#true} is VALID [2020-07-08 12:47:16,910 INFO L280 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-08 12:47:16,911 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {651#true} {655#(<= 0 main_~in~0)} #84#return; {655#(<= 0 main_~in~0)} is VALID [2020-07-08 12:47:16,911 INFO L263 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2020-07-08 12:47:16,912 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-08 12:47:16,912 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #78#return; {651#true} is VALID [2020-07-08 12:47:16,912 INFO L263 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret7 := main(); {651#true} is VALID [2020-07-08 12:47:16,912 INFO L280 TraceCheckUtils]: 4: Hoare triple {651#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {651#true} is VALID [2020-07-08 12:47:16,913 INFO L280 TraceCheckUtils]: 5: Hoare triple {651#true} assume ~bufferlen~0 > 1; {651#true} is VALID [2020-07-08 12:47:16,913 INFO L280 TraceCheckUtils]: 6: Hoare triple {651#true} assume ~inlen~0 > 0; {651#true} is VALID [2020-07-08 12:47:16,913 INFO L280 TraceCheckUtils]: 7: Hoare triple {651#true} assume ~bufferlen~0 < ~inlen~0; {651#true} is VALID [2020-07-08 12:47:16,914 INFO L280 TraceCheckUtils]: 8: Hoare triple {651#true} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {655#(<= 0 main_~in~0)} is VALID [2020-07-08 12:47:16,915 INFO L280 TraceCheckUtils]: 9: Hoare triple {655#(<= 0 main_~in~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {655#(<= 0 main_~in~0)} is VALID [2020-07-08 12:47:16,916 INFO L280 TraceCheckUtils]: 10: Hoare triple {655#(<= 0 main_~in~0)} assume !!(0 != #t~nondet2);havoc #t~nondet2; {655#(<= 0 main_~in~0)} is VALID [2020-07-08 12:47:16,916 INFO L280 TraceCheckUtils]: 11: Hoare triple {655#(<= 0 main_~in~0)} assume !(~buf~0 == ~buflim~0); {655#(<= 0 main_~in~0)} is VALID [2020-07-08 12:47:16,917 INFO L263 TraceCheckUtils]: 12: Hoare triple {655#(<= 0 main_~in~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {651#true} is VALID [2020-07-08 12:47:16,917 INFO L280 TraceCheckUtils]: 13: Hoare triple {651#true} ~cond := #in~cond; {651#true} is VALID [2020-07-08 12:47:16,917 INFO L280 TraceCheckUtils]: 14: Hoare triple {651#true} assume !(0 == ~cond); {651#true} is VALID [2020-07-08 12:47:16,917 INFO L280 TraceCheckUtils]: 15: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-08 12:47:16,918 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {651#true} {655#(<= 0 main_~in~0)} #82#return; {655#(<= 0 main_~in~0)} is VALID [2020-07-08 12:47:16,919 INFO L263 TraceCheckUtils]: 17: Hoare triple {655#(<= 0 main_~in~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {651#true} is VALID [2020-07-08 12:47:16,919 INFO L280 TraceCheckUtils]: 18: Hoare triple {651#true} ~cond := #in~cond; {651#true} is VALID [2020-07-08 12:47:16,919 INFO L280 TraceCheckUtils]: 19: Hoare triple {651#true} assume !(0 == ~cond); {651#true} is VALID [2020-07-08 12:47:16,919 INFO L280 TraceCheckUtils]: 20: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-08 12:47:16,920 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {651#true} {655#(<= 0 main_~in~0)} #84#return; {655#(<= 0 main_~in~0)} is VALID [2020-07-08 12:47:16,921 INFO L280 TraceCheckUtils]: 22: Hoare triple {655#(<= 0 main_~in~0)} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {655#(<= 0 main_~in~0)} is VALID [2020-07-08 12:47:16,922 INFO L280 TraceCheckUtils]: 23: Hoare triple {655#(<= 0 main_~in~0)} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {664#(<= 1 main_~in~0)} is VALID [2020-07-08 12:47:16,923 INFO L263 TraceCheckUtils]: 24: Hoare triple {664#(<= 1 main_~in~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {665#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:16,924 INFO L280 TraceCheckUtils]: 25: Hoare triple {665#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {666#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:16,925 INFO L280 TraceCheckUtils]: 26: Hoare triple {666#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {652#false} is VALID [2020-07-08 12:47:16,925 INFO L280 TraceCheckUtils]: 27: Hoare triple {652#false} assume !false; {652#false} is VALID [2020-07-08 12:47:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 12:47:16,927 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277743873] [2020-07-08 12:47:16,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:16,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:47:16,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263521811] [2020-07-08 12:47:16,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-08 12:47:16,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:16,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:47:16,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:16,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:47:16,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:16,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:47:16,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:47:16,958 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 6 states. [2020-07-08 12:47:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:17,255 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2020-07-08 12:47:17,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:47:17,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-08 12:47:17,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:47:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2020-07-08 12:47:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:47:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2020-07-08 12:47:17,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2020-07-08 12:47:17,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:17,360 INFO L225 Difference]: With dead ends: 55 [2020-07-08 12:47:17,360 INFO L226 Difference]: Without dead ends: 53 [2020-07-08 12:47:17,361 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:47:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-08 12:47:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2020-07-08 12:47:17,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:17,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 48 states. [2020-07-08 12:47:17,418 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 48 states. [2020-07-08 12:47:17,418 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 48 states. [2020-07-08 12:47:17,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:17,422 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2020-07-08 12:47:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2020-07-08 12:47:17,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:17,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:17,423 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 53 states. [2020-07-08 12:47:17,424 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 53 states. [2020-07-08 12:47:17,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:17,428 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2020-07-08 12:47:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2020-07-08 12:47:17,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:17,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:17,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:17,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-08 12:47:17,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2020-07-08 12:47:17,433 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 28 [2020-07-08 12:47:17,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:17,433 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2020-07-08 12:47:17,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:47:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2020-07-08 12:47:17,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 12:47:17,434 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:17,435 INFO L422 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] [2020-07-08 12:47:17,435 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 12:47:17,435 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:17,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:17,435 INFO L82 PathProgramCache]: Analyzing trace with hash 239914697, now seen corresponding path program 1 times [2020-07-08 12:47:17,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:17,436 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829375788] [2020-07-08 12:47:17,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:17,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {926#true} assume true; {926#true} is VALID [2020-07-08 12:47:17,569 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {926#true} {926#true} #78#return; {926#true} is VALID [2020-07-08 12:47:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:17,595 INFO L280 TraceCheckUtils]: 0: Hoare triple {926#true} ~cond := #in~cond; {926#true} is VALID [2020-07-08 12:47:17,595 INFO L280 TraceCheckUtils]: 1: Hoare triple {926#true} assume !(0 == ~cond); {926#true} is VALID [2020-07-08 12:47:17,596 INFO L280 TraceCheckUtils]: 2: Hoare triple {926#true} assume true; {926#true} is VALID [2020-07-08 12:47:17,596 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {926#true} {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #90#return; {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:17,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {926#true} ~cond := #in~cond; {926#true} is VALID [2020-07-08 12:47:17,622 INFO L280 TraceCheckUtils]: 1: Hoare triple {926#true} assume !(0 == ~cond); {926#true} is VALID [2020-07-08 12:47:17,623 INFO L280 TraceCheckUtils]: 2: Hoare triple {926#true} assume true; {926#true} is VALID [2020-07-08 12:47:17,624 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {926#true} {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #92#return; {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:17,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {926#true} ~cond := #in~cond; {926#true} is VALID [2020-07-08 12:47:17,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {926#true} assume !(0 == ~cond); {926#true} is VALID [2020-07-08 12:47:17,645 INFO L280 TraceCheckUtils]: 2: Hoare triple {926#true} assume true; {926#true} is VALID [2020-07-08 12:47:17,646 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {926#true} {940#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #94#return; {940#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 12:47:17,646 INFO L263 TraceCheckUtils]: 0: Hoare triple {926#true} call ULTIMATE.init(); {926#true} is VALID [2020-07-08 12:47:17,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {926#true} assume true; {926#true} is VALID [2020-07-08 12:47:17,646 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {926#true} {926#true} #78#return; {926#true} is VALID [2020-07-08 12:47:17,647 INFO L263 TraceCheckUtils]: 3: Hoare triple {926#true} call #t~ret7 := main(); {926#true} is VALID [2020-07-08 12:47:17,647 INFO L280 TraceCheckUtils]: 4: Hoare triple {926#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {926#true} is VALID [2020-07-08 12:47:17,648 INFO L280 TraceCheckUtils]: 5: Hoare triple {926#true} assume ~bufferlen~0 > 1; {930#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:17,648 INFO L280 TraceCheckUtils]: 6: Hoare triple {930#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {930#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:17,649 INFO L280 TraceCheckUtils]: 7: Hoare triple {930#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {930#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:17,650 INFO L280 TraceCheckUtils]: 8: Hoare triple {930#(<= 2 main_~bufferlen~0)} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:17,650 INFO L280 TraceCheckUtils]: 9: Hoare triple {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:17,653 INFO L280 TraceCheckUtils]: 10: Hoare triple {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:17,653 INFO L263 TraceCheckUtils]: 11: Hoare triple {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {926#true} is VALID [2020-07-08 12:47:17,654 INFO L280 TraceCheckUtils]: 12: Hoare triple {926#true} ~cond := #in~cond; {926#true} is VALID [2020-07-08 12:47:17,654 INFO L280 TraceCheckUtils]: 13: Hoare triple {926#true} assume !(0 == ~cond); {926#true} is VALID [2020-07-08 12:47:17,654 INFO L280 TraceCheckUtils]: 14: Hoare triple {926#true} assume true; {926#true} is VALID [2020-07-08 12:47:17,655 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {926#true} {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #90#return; {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:17,655 INFO L263 TraceCheckUtils]: 16: Hoare triple {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {926#true} is VALID [2020-07-08 12:47:17,656 INFO L280 TraceCheckUtils]: 17: Hoare triple {926#true} ~cond := #in~cond; {926#true} is VALID [2020-07-08 12:47:17,656 INFO L280 TraceCheckUtils]: 18: Hoare triple {926#true} assume !(0 == ~cond); {926#true} is VALID [2020-07-08 12:47:17,656 INFO L280 TraceCheckUtils]: 19: Hoare triple {926#true} assume true; {926#true} is VALID [2020-07-08 12:47:17,657 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {926#true} {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #92#return; {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:17,658 INFO L280 TraceCheckUtils]: 21: Hoare triple {931#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post5 := ~buf~0;~buf~0 := 1 + #t~post5;havoc #t~post5; {940#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 12:47:17,658 INFO L263 TraceCheckUtils]: 22: Hoare triple {940#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {926#true} is VALID [2020-07-08 12:47:17,659 INFO L280 TraceCheckUtils]: 23: Hoare triple {926#true} ~cond := #in~cond; {926#true} is VALID [2020-07-08 12:47:17,659 INFO L280 TraceCheckUtils]: 24: Hoare triple {926#true} assume !(0 == ~cond); {926#true} is VALID [2020-07-08 12:47:17,659 INFO L280 TraceCheckUtils]: 25: Hoare triple {926#true} assume true; {926#true} is VALID [2020-07-08 12:47:17,660 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {926#true} {940#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #94#return; {940#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 12:47:17,661 INFO L263 TraceCheckUtils]: 27: Hoare triple {940#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {945#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:17,662 INFO L280 TraceCheckUtils]: 28: Hoare triple {945#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {946#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:17,663 INFO L280 TraceCheckUtils]: 29: Hoare triple {946#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {927#false} is VALID [2020-07-08 12:47:17,663 INFO L280 TraceCheckUtils]: 30: Hoare triple {927#false} assume !false; {927#false} is VALID [2020-07-08 12:47:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-08 12:47:17,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829375788] [2020-07-08 12:47:17,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:17,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:47:17,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731215438] [2020-07-08 12:47:17,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-08 12:47:17,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:17,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:47:17,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:17,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:47:17,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:17,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:47:17,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:47:17,697 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 7 states. [2020-07-08 12:47:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:18,307 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2020-07-08 12:47:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:47:18,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-08 12:47:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:47:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2020-07-08 12:47:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:47:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2020-07-08 12:47:18,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2020-07-08 12:47:18,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:18,439 INFO L225 Difference]: With dead ends: 70 [2020-07-08 12:47:18,439 INFO L226 Difference]: Without dead ends: 63 [2020-07-08 12:47:18,440 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:47:18,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-08 12:47:18,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-07-08 12:47:18,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:18,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2020-07-08 12:47:18,503 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2020-07-08 12:47:18,504 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2020-07-08 12:47:18,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:18,510 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2020-07-08 12:47:18,510 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2020-07-08 12:47:18,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:18,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:18,511 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2020-07-08 12:47:18,512 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2020-07-08 12:47:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:18,516 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2020-07-08 12:47:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2020-07-08 12:47:18,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:18,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:18,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:18,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-08 12:47:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-07-08 12:47:18,522 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 31 [2020-07-08 12:47:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:18,522 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-07-08 12:47:18,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:47:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-07-08 12:47:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 12:47:18,523 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:18,524 INFO L422 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, 1, 1] [2020-07-08 12:47:18,526 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 12:47:18,526 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:18,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:18,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1617190790, now seen corresponding path program 1 times [2020-07-08 12:47:18,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:18,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667435774] [2020-07-08 12:47:18,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:18,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {1272#true} assume true; {1272#true} is VALID [2020-07-08 12:47:18,699 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1272#true} {1272#true} #78#return; {1272#true} is VALID [2020-07-08 12:47:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:18,709 INFO L280 TraceCheckUtils]: 0: Hoare triple {1272#true} ~cond := #in~cond; {1272#true} is VALID [2020-07-08 12:47:18,710 INFO L280 TraceCheckUtils]: 1: Hoare triple {1272#true} assume !(0 == ~cond); {1272#true} is VALID [2020-07-08 12:47:18,710 INFO L280 TraceCheckUtils]: 2: Hoare triple {1272#true} assume true; {1272#true} is VALID [2020-07-08 12:47:18,711 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1272#true} {1278#(<= (+ main_~in~0 3) main_~inlen~0)} #82#return; {1278#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:18,724 INFO L280 TraceCheckUtils]: 0: Hoare triple {1272#true} ~cond := #in~cond; {1272#true} is VALID [2020-07-08 12:47:18,725 INFO L280 TraceCheckUtils]: 1: Hoare triple {1272#true} assume !(0 == ~cond); {1272#true} is VALID [2020-07-08 12:47:18,725 INFO L280 TraceCheckUtils]: 2: Hoare triple {1272#true} assume true; {1272#true} is VALID [2020-07-08 12:47:18,727 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1272#true} {1278#(<= (+ main_~in~0 3) main_~inlen~0)} #84#return; {1278#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:18,738 INFO L280 TraceCheckUtils]: 0: Hoare triple {1272#true} ~cond := #in~cond; {1272#true} is VALID [2020-07-08 12:47:18,739 INFO L280 TraceCheckUtils]: 1: Hoare triple {1272#true} assume !(0 == ~cond); {1272#true} is VALID [2020-07-08 12:47:18,739 INFO L280 TraceCheckUtils]: 2: Hoare triple {1272#true} assume true; {1272#true} is VALID [2020-07-08 12:47:18,740 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1272#true} {1287#(<= (+ main_~in~0 2) main_~inlen~0)} #86#return; {1287#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:18,740 INFO L263 TraceCheckUtils]: 0: Hoare triple {1272#true} call ULTIMATE.init(); {1272#true} is VALID [2020-07-08 12:47:18,741 INFO L280 TraceCheckUtils]: 1: Hoare triple {1272#true} assume true; {1272#true} is VALID [2020-07-08 12:47:18,741 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1272#true} {1272#true} #78#return; {1272#true} is VALID [2020-07-08 12:47:18,741 INFO L263 TraceCheckUtils]: 3: Hoare triple {1272#true} call #t~ret7 := main(); {1272#true} is VALID [2020-07-08 12:47:18,741 INFO L280 TraceCheckUtils]: 4: Hoare triple {1272#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {1272#true} is VALID [2020-07-08 12:47:18,742 INFO L280 TraceCheckUtils]: 5: Hoare triple {1272#true} assume ~bufferlen~0 > 1; {1276#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:18,743 INFO L280 TraceCheckUtils]: 6: Hoare triple {1276#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {1276#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:18,744 INFO L280 TraceCheckUtils]: 7: Hoare triple {1276#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {1277#(<= 3 main_~inlen~0)} is VALID [2020-07-08 12:47:18,745 INFO L280 TraceCheckUtils]: 8: Hoare triple {1277#(<= 3 main_~inlen~0)} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {1278#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:18,745 INFO L280 TraceCheckUtils]: 9: Hoare triple {1278#(<= (+ main_~in~0 3) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1278#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:18,746 INFO L280 TraceCheckUtils]: 10: Hoare triple {1278#(<= (+ main_~in~0 3) main_~inlen~0)} assume !!(0 != #t~nondet2);havoc #t~nondet2; {1278#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:18,746 INFO L280 TraceCheckUtils]: 11: Hoare triple {1278#(<= (+ main_~in~0 3) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {1278#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:18,747 INFO L263 TraceCheckUtils]: 12: Hoare triple {1278#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1272#true} is VALID [2020-07-08 12:47:18,747 INFO L280 TraceCheckUtils]: 13: Hoare triple {1272#true} ~cond := #in~cond; {1272#true} is VALID [2020-07-08 12:47:18,747 INFO L280 TraceCheckUtils]: 14: Hoare triple {1272#true} assume !(0 == ~cond); {1272#true} is VALID [2020-07-08 12:47:18,747 INFO L280 TraceCheckUtils]: 15: Hoare triple {1272#true} assume true; {1272#true} is VALID [2020-07-08 12:47:18,749 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1272#true} {1278#(<= (+ main_~in~0 3) main_~inlen~0)} #82#return; {1278#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:18,749 INFO L263 TraceCheckUtils]: 17: Hoare triple {1278#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1272#true} is VALID [2020-07-08 12:47:18,749 INFO L280 TraceCheckUtils]: 18: Hoare triple {1272#true} ~cond := #in~cond; {1272#true} is VALID [2020-07-08 12:47:18,750 INFO L280 TraceCheckUtils]: 19: Hoare triple {1272#true} assume !(0 == ~cond); {1272#true} is VALID [2020-07-08 12:47:18,750 INFO L280 TraceCheckUtils]: 20: Hoare triple {1272#true} assume true; {1272#true} is VALID [2020-07-08 12:47:18,752 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1272#true} {1278#(<= (+ main_~in~0 3) main_~inlen~0)} #84#return; {1278#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:18,752 INFO L280 TraceCheckUtils]: 22: Hoare triple {1278#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {1278#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:18,753 INFO L280 TraceCheckUtils]: 23: Hoare triple {1278#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {1287#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:18,754 INFO L263 TraceCheckUtils]: 24: Hoare triple {1287#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {1272#true} is VALID [2020-07-08 12:47:18,754 INFO L280 TraceCheckUtils]: 25: Hoare triple {1272#true} ~cond := #in~cond; {1272#true} is VALID [2020-07-08 12:47:18,755 INFO L280 TraceCheckUtils]: 26: Hoare triple {1272#true} assume !(0 == ~cond); {1272#true} is VALID [2020-07-08 12:47:18,755 INFO L280 TraceCheckUtils]: 27: Hoare triple {1272#true} assume true; {1272#true} is VALID [2020-07-08 12:47:18,756 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1272#true} {1287#(<= (+ main_~in~0 2) main_~inlen~0)} #86#return; {1287#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:18,757 INFO L263 TraceCheckUtils]: 29: Hoare triple {1287#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {1292#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:18,757 INFO L280 TraceCheckUtils]: 30: Hoare triple {1292#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1293#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:18,758 INFO L280 TraceCheckUtils]: 31: Hoare triple {1293#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1273#false} is VALID [2020-07-08 12:47:18,759 INFO L280 TraceCheckUtils]: 32: Hoare triple {1273#false} assume !false; {1273#false} is VALID [2020-07-08 12:47:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-08 12:47:18,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667435774] [2020-07-08 12:47:18,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:18,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 12:47:18,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089202674] [2020-07-08 12:47:18,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-07-08 12:47:18,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:18,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:47:18,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:18,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:47:18,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:18,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:47:18,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:47:18,802 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2020-07-08 12:47:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:19,406 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2020-07-08 12:47:19,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:47:19,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-07-08 12:47:19,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:47:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2020-07-08 12:47:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:47:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2020-07-08 12:47:19,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 74 transitions. [2020-07-08 12:47:19,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:19,558 INFO L225 Difference]: With dead ends: 72 [2020-07-08 12:47:19,558 INFO L226 Difference]: Without dead ends: 70 [2020-07-08 12:47:19,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:47:19,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-08 12:47:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2020-07-08 12:47:19,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:19,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 65 states. [2020-07-08 12:47:19,625 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 65 states. [2020-07-08 12:47:19,625 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 65 states. [2020-07-08 12:47:19,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:19,630 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2020-07-08 12:47:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2020-07-08 12:47:19,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:19,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:19,631 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 70 states. [2020-07-08 12:47:19,631 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 70 states. [2020-07-08 12:47:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:19,635 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2020-07-08 12:47:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2020-07-08 12:47:19,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:19,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:19,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:19,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-08 12:47:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2020-07-08 12:47:19,640 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 33 [2020-07-08 12:47:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:19,640 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2020-07-08 12:47:19,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:47:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2020-07-08 12:47:19,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-08 12:47:19,642 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:19,642 INFO L422 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, 1, 1] [2020-07-08 12:47:19,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 12:47:19,643 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:19,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:19,643 INFO L82 PathProgramCache]: Analyzing trace with hash 260855770, now seen corresponding path program 1 times [2020-07-08 12:47:19,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:19,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711967546] [2020-07-08 12:47:19,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:19,807 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,807 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1641#true} {1641#true} #78#return; {1641#true} is VALID [2020-07-08 12:47:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:19,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:19,820 INFO L280 TraceCheckUtils]: 1: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:19,821 INFO L280 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,826 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1647#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #82#return; {1647#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:19,841 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:19,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:19,842 INFO L280 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,843 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1647#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #84#return; {1647#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:19,856 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:19,856 INFO L280 TraceCheckUtils]: 1: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:19,857 INFO L280 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,859 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #86#return; {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:19,865 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:19,866 INFO L280 TraceCheckUtils]: 1: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:19,866 INFO L280 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,867 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #88#return; {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:19,877 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:19,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:19,878 INFO L280 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,879 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #90#return; {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:19,889 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:19,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:19,890 INFO L280 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,891 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #92#return; {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:19,902 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:19,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:19,902 INFO L280 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,903 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1673#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #94#return; {1673#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,904 INFO L263 TraceCheckUtils]: 0: Hoare triple {1641#true} call ULTIMATE.init(); {1641#true} is VALID [2020-07-08 12:47:19,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,904 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1641#true} {1641#true} #78#return; {1641#true} is VALID [2020-07-08 12:47:19,904 INFO L263 TraceCheckUtils]: 3: Hoare triple {1641#true} call #t~ret7 := main(); {1641#true} is VALID [2020-07-08 12:47:19,905 INFO L280 TraceCheckUtils]: 4: Hoare triple {1641#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {1641#true} is VALID [2020-07-08 12:47:19,905 INFO L280 TraceCheckUtils]: 5: Hoare triple {1641#true} assume ~bufferlen~0 > 1; {1645#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,906 INFO L280 TraceCheckUtils]: 6: Hoare triple {1645#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {1645#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,907 INFO L280 TraceCheckUtils]: 7: Hoare triple {1645#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {1645#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,908 INFO L280 TraceCheckUtils]: 8: Hoare triple {1645#(<= 2 main_~bufferlen~0)} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {1646#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:19,909 INFO L280 TraceCheckUtils]: 9: Hoare triple {1646#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1646#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:19,909 INFO L280 TraceCheckUtils]: 10: Hoare triple {1646#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {1646#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:19,910 INFO L280 TraceCheckUtils]: 11: Hoare triple {1646#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} assume !(~buf~0 == ~buflim~0); {1647#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,910 INFO L263 TraceCheckUtils]: 12: Hoare triple {1647#(<= (+ main_~buf~0 3) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1641#true} is VALID [2020-07-08 12:47:19,911 INFO L280 TraceCheckUtils]: 13: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:19,911 INFO L280 TraceCheckUtils]: 14: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:19,911 INFO L280 TraceCheckUtils]: 15: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,912 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1641#true} {1647#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #82#return; {1647#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,912 INFO L263 TraceCheckUtils]: 17: Hoare triple {1647#(<= (+ main_~buf~0 3) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1641#true} is VALID [2020-07-08 12:47:19,912 INFO L280 TraceCheckUtils]: 18: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:19,912 INFO L280 TraceCheckUtils]: 19: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:19,913 INFO L280 TraceCheckUtils]: 20: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,914 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1641#true} {1647#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #84#return; {1647#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,916 INFO L280 TraceCheckUtils]: 22: Hoare triple {1647#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,917 INFO L280 TraceCheckUtils]: 23: Hoare triple {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,917 INFO L263 TraceCheckUtils]: 24: Hoare triple {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {1641#true} is VALID [2020-07-08 12:47:19,918 INFO L280 TraceCheckUtils]: 25: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:19,918 INFO L280 TraceCheckUtils]: 26: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:19,918 INFO L280 TraceCheckUtils]: 27: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,919 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1641#true} {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #86#return; {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,919 INFO L263 TraceCheckUtils]: 29: Hoare triple {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {1641#true} is VALID [2020-07-08 12:47:19,919 INFO L280 TraceCheckUtils]: 30: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:19,920 INFO L280 TraceCheckUtils]: 31: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:19,920 INFO L280 TraceCheckUtils]: 32: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,921 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1641#true} {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #88#return; {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,922 INFO L280 TraceCheckUtils]: 34: Hoare triple {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,923 INFO L280 TraceCheckUtils]: 35: Hoare triple {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,923 INFO L263 TraceCheckUtils]: 36: Hoare triple {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1641#true} is VALID [2020-07-08 12:47:19,924 INFO L280 TraceCheckUtils]: 37: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:19,924 INFO L280 TraceCheckUtils]: 38: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:19,924 INFO L280 TraceCheckUtils]: 39: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,925 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1641#true} {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #90#return; {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,925 INFO L263 TraceCheckUtils]: 41: Hoare triple {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1641#true} is VALID [2020-07-08 12:47:19,925 INFO L280 TraceCheckUtils]: 42: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:19,926 INFO L280 TraceCheckUtils]: 43: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:19,926 INFO L280 TraceCheckUtils]: 44: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,928 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1641#true} {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #92#return; {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,929 INFO L280 TraceCheckUtils]: 46: Hoare triple {1656#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post5 := ~buf~0;~buf~0 := 1 + #t~post5;havoc #t~post5; {1673#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,930 INFO L263 TraceCheckUtils]: 47: Hoare triple {1673#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1641#true} is VALID [2020-07-08 12:47:19,930 INFO L280 TraceCheckUtils]: 48: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:19,930 INFO L280 TraceCheckUtils]: 49: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:19,930 INFO L280 TraceCheckUtils]: 50: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:19,931 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {1641#true} {1673#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #94#return; {1673#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 12:47:19,933 INFO L263 TraceCheckUtils]: 52: Hoare triple {1673#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1678#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:19,934 INFO L280 TraceCheckUtils]: 53: Hoare triple {1678#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1679#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:19,934 INFO L280 TraceCheckUtils]: 54: Hoare triple {1679#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1642#false} is VALID [2020-07-08 12:47:19,935 INFO L280 TraceCheckUtils]: 55: Hoare triple {1642#false} assume !false; {1642#false} is VALID [2020-07-08 12:47:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-08 12:47:19,941 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711967546] [2020-07-08 12:47:19,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634419401] [2020-07-08 12:47:19,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:19,981 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-08 12:47:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:20,002 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:20,692 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:47:20,744 INFO L263 TraceCheckUtils]: 0: Hoare triple {1641#true} call ULTIMATE.init(); {1641#true} is VALID [2020-07-08 12:47:20,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:20,745 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1641#true} {1641#true} #78#return; {1641#true} is VALID [2020-07-08 12:47:20,745 INFO L263 TraceCheckUtils]: 3: Hoare triple {1641#true} call #t~ret7 := main(); {1641#true} is VALID [2020-07-08 12:47:20,745 INFO L280 TraceCheckUtils]: 4: Hoare triple {1641#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {1641#true} is VALID [2020-07-08 12:47:20,746 INFO L280 TraceCheckUtils]: 5: Hoare triple {1641#true} assume ~bufferlen~0 > 1; {1645#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:20,747 INFO L280 TraceCheckUtils]: 6: Hoare triple {1645#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {1645#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:20,747 INFO L280 TraceCheckUtils]: 7: Hoare triple {1645#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {1645#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:20,748 INFO L280 TraceCheckUtils]: 8: Hoare triple {1645#(<= 2 main_~bufferlen~0)} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {1707#(and (<= 2 main_~bufferlen~0) (<= main_~buf~0 0) (= main_~bufferlen~0 (+ main_~buflim~0 2)))} is VALID [2020-07-08 12:47:20,749 INFO L280 TraceCheckUtils]: 9: Hoare triple {1707#(and (<= 2 main_~bufferlen~0) (<= main_~buf~0 0) (= main_~bufferlen~0 (+ main_~buflim~0 2)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1707#(and (<= 2 main_~bufferlen~0) (<= main_~buf~0 0) (= main_~bufferlen~0 (+ main_~buflim~0 2)))} is VALID [2020-07-08 12:47:20,749 INFO L280 TraceCheckUtils]: 10: Hoare triple {1707#(and (<= 2 main_~bufferlen~0) (<= main_~buf~0 0) (= main_~bufferlen~0 (+ main_~buflim~0 2)))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {1707#(and (<= 2 main_~bufferlen~0) (<= main_~buf~0 0) (= main_~bufferlen~0 (+ main_~buflim~0 2)))} is VALID [2020-07-08 12:47:20,750 INFO L280 TraceCheckUtils]: 11: Hoare triple {1707#(and (<= 2 main_~bufferlen~0) (<= main_~buf~0 0) (= main_~bufferlen~0 (+ main_~buflim~0 2)))} assume !(~buf~0 == ~buflim~0); {1717#(and (<= 2 main_~bufferlen~0) (not (= main_~bufferlen~0 (+ main_~buf~0 2))) (<= main_~buf~0 0))} is VALID [2020-07-08 12:47:20,751 INFO L263 TraceCheckUtils]: 12: Hoare triple {1717#(and (<= 2 main_~bufferlen~0) (not (= main_~bufferlen~0 (+ main_~buf~0 2))) (<= main_~buf~0 0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1641#true} is VALID [2020-07-08 12:47:20,751 INFO L280 TraceCheckUtils]: 13: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:20,751 INFO L280 TraceCheckUtils]: 14: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:20,751 INFO L280 TraceCheckUtils]: 15: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:20,753 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1641#true} {1717#(and (<= 2 main_~bufferlen~0) (not (= main_~bufferlen~0 (+ main_~buf~0 2))) (<= main_~buf~0 0))} #82#return; {1717#(and (<= 2 main_~bufferlen~0) (not (= main_~bufferlen~0 (+ main_~buf~0 2))) (<= main_~buf~0 0))} is VALID [2020-07-08 12:47:20,753 INFO L263 TraceCheckUtils]: 17: Hoare triple {1717#(and (<= 2 main_~bufferlen~0) (not (= main_~bufferlen~0 (+ main_~buf~0 2))) (<= main_~buf~0 0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1641#true} is VALID [2020-07-08 12:47:20,753 INFO L280 TraceCheckUtils]: 18: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:20,753 INFO L280 TraceCheckUtils]: 19: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:20,754 INFO L280 TraceCheckUtils]: 20: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:20,754 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1641#true} {1717#(and (<= 2 main_~bufferlen~0) (not (= main_~bufferlen~0 (+ main_~buf~0 2))) (<= main_~buf~0 0))} #84#return; {1717#(and (<= 2 main_~bufferlen~0) (not (= main_~bufferlen~0 (+ main_~buf~0 2))) (<= main_~buf~0 0))} is VALID [2020-07-08 12:47:20,755 INFO L280 TraceCheckUtils]: 22: Hoare triple {1717#(and (<= 2 main_~bufferlen~0) (not (= main_~bufferlen~0 (+ main_~buf~0 2))) (<= main_~buf~0 0))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} is VALID [2020-07-08 12:47:20,756 INFO L280 TraceCheckUtils]: 23: Hoare triple {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} is VALID [2020-07-08 12:47:20,757 INFO L263 TraceCheckUtils]: 24: Hoare triple {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {1641#true} is VALID [2020-07-08 12:47:20,757 INFO L280 TraceCheckUtils]: 25: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:20,757 INFO L280 TraceCheckUtils]: 26: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:20,757 INFO L280 TraceCheckUtils]: 27: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:20,762 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1641#true} {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} #86#return; {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} is VALID [2020-07-08 12:47:20,762 INFO L263 TraceCheckUtils]: 29: Hoare triple {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {1641#true} is VALID [2020-07-08 12:47:20,762 INFO L280 TraceCheckUtils]: 30: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:20,762 INFO L280 TraceCheckUtils]: 31: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:20,763 INFO L280 TraceCheckUtils]: 32: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:20,763 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1641#true} {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} #88#return; {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} is VALID [2020-07-08 12:47:20,764 INFO L280 TraceCheckUtils]: 34: Hoare triple {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} is VALID [2020-07-08 12:47:20,766 INFO L280 TraceCheckUtils]: 35: Hoare triple {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} is VALID [2020-07-08 12:47:20,766 INFO L263 TraceCheckUtils]: 36: Hoare triple {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1641#true} is VALID [2020-07-08 12:47:20,766 INFO L280 TraceCheckUtils]: 37: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:20,766 INFO L280 TraceCheckUtils]: 38: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:20,767 INFO L280 TraceCheckUtils]: 39: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:20,767 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1641#true} {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} #90#return; {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} is VALID [2020-07-08 12:47:20,767 INFO L263 TraceCheckUtils]: 41: Hoare triple {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1641#true} is VALID [2020-07-08 12:47:20,767 INFO L280 TraceCheckUtils]: 42: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:20,768 INFO L280 TraceCheckUtils]: 43: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:20,768 INFO L280 TraceCheckUtils]: 44: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:20,768 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1641#true} {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} #92#return; {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} is VALID [2020-07-08 12:47:20,769 INFO L280 TraceCheckUtils]: 46: Hoare triple {1751#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= main_~buf~0 1))} #t~post5 := ~buf~0;~buf~0 := 1 + #t~post5;havoc #t~post5; {1824#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= main_~buf~0 2))} is VALID [2020-07-08 12:47:20,770 INFO L263 TraceCheckUtils]: 47: Hoare triple {1824#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= main_~buf~0 2))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1641#true} is VALID [2020-07-08 12:47:20,770 INFO L280 TraceCheckUtils]: 48: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2020-07-08 12:47:20,770 INFO L280 TraceCheckUtils]: 49: Hoare triple {1641#true} assume !(0 == ~cond); {1641#true} is VALID [2020-07-08 12:47:20,770 INFO L280 TraceCheckUtils]: 50: Hoare triple {1641#true} assume true; {1641#true} is VALID [2020-07-08 12:47:20,771 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {1641#true} {1824#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= main_~buf~0 2))} #94#return; {1824#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= main_~buf~0 2))} is VALID [2020-07-08 12:47:20,772 INFO L263 TraceCheckUtils]: 52: Hoare triple {1824#(and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= main_~buf~0 2))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:47:20,772 INFO L280 TraceCheckUtils]: 53: Hoare triple {1843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:47:20,773 INFO L280 TraceCheckUtils]: 54: Hoare triple {1847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1642#false} is VALID [2020-07-08 12:47:20,773 INFO L280 TraceCheckUtils]: 55: Hoare triple {1642#false} assume !false; {1642#false} is VALID [2020-07-08 12:47:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-08 12:47:20,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:20,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-07-08 12:47:20,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615136450] [2020-07-08 12:47:20,781 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-07-08 12:47:20,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:20,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-08 12:47:20,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:20,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-08 12:47:20,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:20,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-08 12:47:20,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2020-07-08 12:47:20,876 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 15 states. [2020-07-08 12:47:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:22,438 INFO L93 Difference]: Finished difference Result 110 states and 146 transitions. [2020-07-08 12:47:22,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-08 12:47:22,438 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-07-08 12:47:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 12:47:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 131 transitions. [2020-07-08 12:47:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 12:47:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 131 transitions. [2020-07-08 12:47:22,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 131 transitions. [2020-07-08 12:47:22,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:22,645 INFO L225 Difference]: With dead ends: 110 [2020-07-08 12:47:22,645 INFO L226 Difference]: Without dead ends: 95 [2020-07-08 12:47:22,647 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2020-07-08 12:47:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-08 12:47:22,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2020-07-08 12:47:22,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:22,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 87 states. [2020-07-08 12:47:22,749 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 87 states. [2020-07-08 12:47:22,749 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 87 states. [2020-07-08 12:47:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:22,755 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2020-07-08 12:47:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 119 transitions. [2020-07-08 12:47:22,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:22,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:22,757 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 95 states. [2020-07-08 12:47:22,757 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 95 states. [2020-07-08 12:47:22,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:22,762 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2020-07-08 12:47:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 119 transitions. [2020-07-08 12:47:22,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:22,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:22,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:22,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-08 12:47:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2020-07-08 12:47:22,768 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 56 [2020-07-08 12:47:22,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:22,768 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2020-07-08 12:47:22,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-08 12:47:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2020-07-08 12:47:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-08 12:47:22,769 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:22,770 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:22,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-08 12:47:22,984 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:22,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:22,985 INFO L82 PathProgramCache]: Analyzing trace with hash 266725463, now seen corresponding path program 1 times [2020-07-08 12:47:22,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:22,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201763121] [2020-07-08 12:47:22,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:23,100 INFO L280 TraceCheckUtils]: 0: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,100 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2352#true} {2352#true} #78#return; {2352#true} is VALID [2020-07-08 12:47:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:23,116 INFO L280 TraceCheckUtils]: 0: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,116 INFO L280 TraceCheckUtils]: 1: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,116 INFO L280 TraceCheckUtils]: 2: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,117 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2352#true} {2358#(<= (+ main_~in~0 3) main_~inlen~0)} #82#return; {2358#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:23,129 INFO L280 TraceCheckUtils]: 0: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,130 INFO L280 TraceCheckUtils]: 1: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,130 INFO L280 TraceCheckUtils]: 2: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,131 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2352#true} {2358#(<= (+ main_~in~0 3) main_~inlen~0)} #84#return; {2358#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:23,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,144 INFO L280 TraceCheckUtils]: 2: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,145 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2352#true} {2367#(<= (+ main_~in~0 2) main_~inlen~0)} #86#return; {2367#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:23,154 INFO L280 TraceCheckUtils]: 0: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,155 INFO L280 TraceCheckUtils]: 1: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,155 INFO L280 TraceCheckUtils]: 2: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,157 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2352#true} {2367#(<= (+ main_~in~0 2) main_~inlen~0)} #88#return; {2367#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:23,161 INFO L280 TraceCheckUtils]: 0: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,162 INFO L280 TraceCheckUtils]: 1: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,162 INFO L280 TraceCheckUtils]: 2: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,163 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2352#true} {2367#(<= (+ main_~in~0 2) main_~inlen~0)} #82#return; {2367#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:23,168 INFO L280 TraceCheckUtils]: 0: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,169 INFO L280 TraceCheckUtils]: 1: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,169 INFO L280 TraceCheckUtils]: 2: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,171 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2352#true} {2367#(<= (+ main_~in~0 2) main_~inlen~0)} #84#return; {2367#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:23,178 INFO L280 TraceCheckUtils]: 0: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,179 INFO L280 TraceCheckUtils]: 2: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,180 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2352#true} {2384#(<= (+ main_~in~0 1) main_~inlen~0)} #86#return; {2384#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 12:47:23,180 INFO L263 TraceCheckUtils]: 0: Hoare triple {2352#true} call ULTIMATE.init(); {2352#true} is VALID [2020-07-08 12:47:23,180 INFO L280 TraceCheckUtils]: 1: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,181 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2352#true} {2352#true} #78#return; {2352#true} is VALID [2020-07-08 12:47:23,181 INFO L263 TraceCheckUtils]: 3: Hoare triple {2352#true} call #t~ret7 := main(); {2352#true} is VALID [2020-07-08 12:47:23,181 INFO L280 TraceCheckUtils]: 4: Hoare triple {2352#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {2352#true} is VALID [2020-07-08 12:47:23,182 INFO L280 TraceCheckUtils]: 5: Hoare triple {2352#true} assume ~bufferlen~0 > 1; {2356#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:23,182 INFO L280 TraceCheckUtils]: 6: Hoare triple {2356#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {2356#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:23,186 INFO L280 TraceCheckUtils]: 7: Hoare triple {2356#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {2357#(<= 3 main_~inlen~0)} is VALID [2020-07-08 12:47:23,187 INFO L280 TraceCheckUtils]: 8: Hoare triple {2357#(<= 3 main_~inlen~0)} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {2358#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:23,187 INFO L280 TraceCheckUtils]: 9: Hoare triple {2358#(<= (+ main_~in~0 3) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2358#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:23,188 INFO L280 TraceCheckUtils]: 10: Hoare triple {2358#(<= (+ main_~in~0 3) main_~inlen~0)} assume !!(0 != #t~nondet2);havoc #t~nondet2; {2358#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:23,188 INFO L280 TraceCheckUtils]: 11: Hoare triple {2358#(<= (+ main_~in~0 3) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {2358#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:23,188 INFO L263 TraceCheckUtils]: 12: Hoare triple {2358#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {2352#true} is VALID [2020-07-08 12:47:23,189 INFO L280 TraceCheckUtils]: 13: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,189 INFO L280 TraceCheckUtils]: 14: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,189 INFO L280 TraceCheckUtils]: 15: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,190 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2352#true} {2358#(<= (+ main_~in~0 3) main_~inlen~0)} #82#return; {2358#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:23,190 INFO L263 TraceCheckUtils]: 17: Hoare triple {2358#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {2352#true} is VALID [2020-07-08 12:47:23,190 INFO L280 TraceCheckUtils]: 18: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,190 INFO L280 TraceCheckUtils]: 19: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,191 INFO L280 TraceCheckUtils]: 20: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,194 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2352#true} {2358#(<= (+ main_~in~0 3) main_~inlen~0)} #84#return; {2358#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:23,199 INFO L280 TraceCheckUtils]: 22: Hoare triple {2358#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {2358#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:23,203 INFO L280 TraceCheckUtils]: 23: Hoare triple {2358#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {2367#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:23,203 INFO L263 TraceCheckUtils]: 24: Hoare triple {2367#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {2352#true} is VALID [2020-07-08 12:47:23,204 INFO L280 TraceCheckUtils]: 25: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,204 INFO L280 TraceCheckUtils]: 26: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,204 INFO L280 TraceCheckUtils]: 27: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,205 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2352#true} {2367#(<= (+ main_~in~0 2) main_~inlen~0)} #86#return; {2367#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:23,206 INFO L263 TraceCheckUtils]: 29: Hoare triple {2367#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {2352#true} is VALID [2020-07-08 12:47:23,206 INFO L280 TraceCheckUtils]: 30: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,206 INFO L280 TraceCheckUtils]: 31: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,206 INFO L280 TraceCheckUtils]: 32: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,208 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2352#true} {2367#(<= (+ main_~in~0 2) main_~inlen~0)} #88#return; {2367#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:23,208 INFO L280 TraceCheckUtils]: 34: Hoare triple {2367#(<= (+ main_~in~0 2) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2367#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:23,210 INFO L280 TraceCheckUtils]: 35: Hoare triple {2367#(<= (+ main_~in~0 2) main_~inlen~0)} assume !!(0 != #t~nondet2);havoc #t~nondet2; {2367#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:23,210 INFO L280 TraceCheckUtils]: 36: Hoare triple {2367#(<= (+ main_~in~0 2) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {2367#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:23,211 INFO L263 TraceCheckUtils]: 37: Hoare triple {2367#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {2352#true} is VALID [2020-07-08 12:47:23,211 INFO L280 TraceCheckUtils]: 38: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,211 INFO L280 TraceCheckUtils]: 39: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,211 INFO L280 TraceCheckUtils]: 40: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,212 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2352#true} {2367#(<= (+ main_~in~0 2) main_~inlen~0)} #82#return; {2367#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:23,212 INFO L263 TraceCheckUtils]: 42: Hoare triple {2367#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {2352#true} is VALID [2020-07-08 12:47:23,212 INFO L280 TraceCheckUtils]: 43: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,213 INFO L280 TraceCheckUtils]: 44: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,213 INFO L280 TraceCheckUtils]: 45: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,214 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2352#true} {2367#(<= (+ main_~in~0 2) main_~inlen~0)} #84#return; {2367#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:23,215 INFO L280 TraceCheckUtils]: 47: Hoare triple {2367#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {2367#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:23,216 INFO L280 TraceCheckUtils]: 48: Hoare triple {2367#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {2384#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 12:47:23,216 INFO L263 TraceCheckUtils]: 49: Hoare triple {2384#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {2352#true} is VALID [2020-07-08 12:47:23,216 INFO L280 TraceCheckUtils]: 50: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,216 INFO L280 TraceCheckUtils]: 51: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,216 INFO L280 TraceCheckUtils]: 52: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,217 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2352#true} {2384#(<= (+ main_~in~0 1) main_~inlen~0)} #86#return; {2384#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 12:47:23,218 INFO L263 TraceCheckUtils]: 54: Hoare triple {2384#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {2389#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:23,219 INFO L280 TraceCheckUtils]: 55: Hoare triple {2389#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2390#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:23,220 INFO L280 TraceCheckUtils]: 56: Hoare triple {2390#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2353#false} is VALID [2020-07-08 12:47:23,220 INFO L280 TraceCheckUtils]: 57: Hoare triple {2353#false} assume !false; {2353#false} is VALID [2020-07-08 12:47:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-08 12:47:23,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201763121] [2020-07-08 12:47:23,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304042255] [2020-07-08 12:47:23,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:23,287 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-08 12:47:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:23,300 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:23,489 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:47:23,512 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:47:23,551 INFO L263 TraceCheckUtils]: 0: Hoare triple {2352#true} call ULTIMATE.init(); {2352#true} is VALID [2020-07-08 12:47:23,551 INFO L280 TraceCheckUtils]: 1: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,551 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2352#true} {2352#true} #78#return; {2352#true} is VALID [2020-07-08 12:47:23,551 INFO L263 TraceCheckUtils]: 3: Hoare triple {2352#true} call #t~ret7 := main(); {2352#true} is VALID [2020-07-08 12:47:23,552 INFO L280 TraceCheckUtils]: 4: Hoare triple {2352#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {2352#true} is VALID [2020-07-08 12:47:23,552 INFO L280 TraceCheckUtils]: 5: Hoare triple {2352#true} assume ~bufferlen~0 > 1; {2356#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:23,553 INFO L280 TraceCheckUtils]: 6: Hoare triple {2356#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {2356#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:23,554 INFO L280 TraceCheckUtils]: 7: Hoare triple {2356#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {2357#(<= 3 main_~inlen~0)} is VALID [2020-07-08 12:47:23,554 INFO L280 TraceCheckUtils]: 8: Hoare triple {2357#(<= 3 main_~inlen~0)} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,555 INFO L280 TraceCheckUtils]: 9: Hoare triple {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,556 INFO L280 TraceCheckUtils]: 10: Hoare triple {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,556 INFO L280 TraceCheckUtils]: 11: Hoare triple {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} assume !(~buf~0 == ~buflim~0); {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,557 INFO L263 TraceCheckUtils]: 12: Hoare triple {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {2352#true} is VALID [2020-07-08 12:47:23,557 INFO L280 TraceCheckUtils]: 13: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,557 INFO L280 TraceCheckUtils]: 14: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,557 INFO L280 TraceCheckUtils]: 15: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,558 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2352#true} {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} #82#return; {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,558 INFO L263 TraceCheckUtils]: 17: Hoare triple {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {2352#true} is VALID [2020-07-08 12:47:23,558 INFO L280 TraceCheckUtils]: 18: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,559 INFO L280 TraceCheckUtils]: 19: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,559 INFO L280 TraceCheckUtils]: 20: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,560 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2352#true} {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} #84#return; {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,560 INFO L280 TraceCheckUtils]: 22: Hoare triple {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,561 INFO L280 TraceCheckUtils]: 23: Hoare triple {2418#(and (<= main_~in~0 0) (<= 3 main_~inlen~0))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,561 INFO L263 TraceCheckUtils]: 24: Hoare triple {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {2352#true} is VALID [2020-07-08 12:47:23,562 INFO L280 TraceCheckUtils]: 25: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,562 INFO L280 TraceCheckUtils]: 26: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,562 INFO L280 TraceCheckUtils]: 27: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,563 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2352#true} {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} #86#return; {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,563 INFO L263 TraceCheckUtils]: 29: Hoare triple {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {2352#true} is VALID [2020-07-08 12:47:23,563 INFO L280 TraceCheckUtils]: 30: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,563 INFO L280 TraceCheckUtils]: 31: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,563 INFO L280 TraceCheckUtils]: 32: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,564 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2352#true} {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} #88#return; {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,565 INFO L280 TraceCheckUtils]: 34: Hoare triple {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,565 INFO L280 TraceCheckUtils]: 35: Hoare triple {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,566 INFO L280 TraceCheckUtils]: 36: Hoare triple {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} assume !(~buf~0 == ~buflim~0); {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,566 INFO L263 TraceCheckUtils]: 37: Hoare triple {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {2352#true} is VALID [2020-07-08 12:47:23,566 INFO L280 TraceCheckUtils]: 38: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,567 INFO L280 TraceCheckUtils]: 39: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,567 INFO L280 TraceCheckUtils]: 40: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,568 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2352#true} {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} #82#return; {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,568 INFO L263 TraceCheckUtils]: 42: Hoare triple {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {2352#true} is VALID [2020-07-08 12:47:23,568 INFO L280 TraceCheckUtils]: 43: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,568 INFO L280 TraceCheckUtils]: 44: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,568 INFO L280 TraceCheckUtils]: 45: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,569 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2352#true} {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} #84#return; {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,569 INFO L280 TraceCheckUtils]: 47: Hoare triple {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,570 INFO L280 TraceCheckUtils]: 48: Hoare triple {2464#(and (<= main_~in~0 1) (<= 3 main_~inlen~0))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {2540#(and (<= main_~in~0 2) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,570 INFO L263 TraceCheckUtils]: 49: Hoare triple {2540#(and (<= main_~in~0 2) (<= 3 main_~inlen~0))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {2352#true} is VALID [2020-07-08 12:47:23,570 INFO L280 TraceCheckUtils]: 50: Hoare triple {2352#true} ~cond := #in~cond; {2352#true} is VALID [2020-07-08 12:47:23,570 INFO L280 TraceCheckUtils]: 51: Hoare triple {2352#true} assume !(0 == ~cond); {2352#true} is VALID [2020-07-08 12:47:23,570 INFO L280 TraceCheckUtils]: 52: Hoare triple {2352#true} assume true; {2352#true} is VALID [2020-07-08 12:47:23,571 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2352#true} {2540#(and (<= main_~in~0 2) (<= 3 main_~inlen~0))} #86#return; {2540#(and (<= main_~in~0 2) (<= 3 main_~inlen~0))} is VALID [2020-07-08 12:47:23,572 INFO L263 TraceCheckUtils]: 54: Hoare triple {2540#(and (<= main_~in~0 2) (<= 3 main_~inlen~0))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {2559#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:47:23,572 INFO L280 TraceCheckUtils]: 55: Hoare triple {2559#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2563#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:47:23,573 INFO L280 TraceCheckUtils]: 56: Hoare triple {2563#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2353#false} is VALID [2020-07-08 12:47:23,573 INFO L280 TraceCheckUtils]: 57: Hoare triple {2353#false} assume !false; {2353#false} is VALID [2020-07-08 12:47:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-08 12:47:23,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:23,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2020-07-08 12:47:23,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505054840] [2020-07-08 12:47:23,578 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2020-07-08 12:47:23,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:23,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 12:47:23,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:23,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 12:47:23,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:23,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 12:47:23,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:47:23,666 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand 14 states. [2020-07-08 12:47:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:24,495 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2020-07-08 12:47:24,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:47:24,496 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2020-07-08 12:47:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:47:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2020-07-08 12:47:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:47:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2020-07-08 12:47:24,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 77 transitions. [2020-07-08 12:47:24,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:24,606 INFO L225 Difference]: With dead ends: 93 [2020-07-08 12:47:24,606 INFO L226 Difference]: Without dead ends: 91 [2020-07-08 12:47:24,607 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2020-07-08 12:47:24,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-08 12:47:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-07-08 12:47:24,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:24,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 91 states. [2020-07-08 12:47:24,729 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2020-07-08 12:47:24,729 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2020-07-08 12:47:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:24,736 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2020-07-08 12:47:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2020-07-08 12:47:24,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:24,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:24,737 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2020-07-08 12:47:24,737 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2020-07-08 12:47:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:24,741 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2020-07-08 12:47:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2020-07-08 12:47:24,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:24,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:24,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:24,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-08 12:47:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2020-07-08 12:47:24,748 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 58 [2020-07-08 12:47:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:24,748 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2020-07-08 12:47:24,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 12:47:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2020-07-08 12:47:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-07-08 12:47:24,751 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:24,751 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:24,961 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:24,962 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:24,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:24,962 INFO L82 PathProgramCache]: Analyzing trace with hash 437927078, now seen corresponding path program 2 times [2020-07-08 12:47:24,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:24,964 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723934859] [2020-07-08 12:47:24,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,199 INFO L280 TraceCheckUtils]: 0: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,199 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3027#true} {3027#true} #78#return; {3027#true} is VALID [2020-07-08 12:47:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,208 INFO L280 TraceCheckUtils]: 0: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,208 INFO L280 TraceCheckUtils]: 1: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,208 INFO L280 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,209 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3034#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #82#return; {3034#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-08 12:47:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,220 INFO L280 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,221 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3034#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #84#return; {3034#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-08 12:47:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,227 INFO L280 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,228 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3044#(<= (+ main_~in~0 3) main_~inlen~0)} #86#return; {3044#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,235 INFO L280 TraceCheckUtils]: 0: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,236 INFO L280 TraceCheckUtils]: 1: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,236 INFO L280 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,237 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3044#(<= (+ main_~in~0 3) main_~inlen~0)} #88#return; {3044#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,242 INFO L280 TraceCheckUtils]: 0: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,242 INFO L280 TraceCheckUtils]: 1: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,243 INFO L280 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,243 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3044#(<= (+ main_~in~0 3) main_~inlen~0)} #82#return; {3044#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,251 INFO L280 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,252 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3044#(<= (+ main_~in~0 3) main_~inlen~0)} #84#return; {3044#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,258 INFO L280 TraceCheckUtils]: 0: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,258 INFO L280 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,259 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3061#(<= (+ main_~in~0 2) main_~inlen~0)} #86#return; {3061#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,272 INFO L280 TraceCheckUtils]: 0: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,272 INFO L280 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,273 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3061#(<= (+ main_~in~0 2) main_~inlen~0)} #88#return; {3061#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,285 INFO L280 TraceCheckUtils]: 0: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,285 INFO L280 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,303 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3061#(<= (+ main_~in~0 2) main_~inlen~0)} #82#return; {3061#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,314 INFO L280 TraceCheckUtils]: 1: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,314 INFO L280 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,315 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3061#(<= (+ main_~in~0 2) main_~inlen~0)} #84#return; {3061#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,334 INFO L280 TraceCheckUtils]: 0: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,334 INFO L280 TraceCheckUtils]: 1: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,334 INFO L280 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,335 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3078#(<= (+ main_~in~0 1) main_~inlen~0)} #86#return; {3078#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 12:47:25,335 INFO L263 TraceCheckUtils]: 0: Hoare triple {3027#true} call ULTIMATE.init(); {3027#true} is VALID [2020-07-08 12:47:25,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,336 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3027#true} {3027#true} #78#return; {3027#true} is VALID [2020-07-08 12:47:25,336 INFO L263 TraceCheckUtils]: 3: Hoare triple {3027#true} call #t~ret7 := main(); {3027#true} is VALID [2020-07-08 12:47:25,336 INFO L280 TraceCheckUtils]: 4: Hoare triple {3027#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {3027#true} is VALID [2020-07-08 12:47:25,337 INFO L280 TraceCheckUtils]: 5: Hoare triple {3027#true} assume ~bufferlen~0 > 1; {3031#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:25,338 INFO L280 TraceCheckUtils]: 6: Hoare triple {3031#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {3031#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:25,338 INFO L280 TraceCheckUtils]: 7: Hoare triple {3031#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {3032#(and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))} is VALID [2020-07-08 12:47:25,339 INFO L280 TraceCheckUtils]: 8: Hoare triple {3032#(and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {3033#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:25,340 INFO L280 TraceCheckUtils]: 9: Hoare triple {3033#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3033#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:25,341 INFO L280 TraceCheckUtils]: 10: Hoare triple {3033#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {3033#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:25,342 INFO L280 TraceCheckUtils]: 11: Hoare triple {3033#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} assume !(~buf~0 == ~buflim~0); {3034#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-08 12:47:25,342 INFO L263 TraceCheckUtils]: 12: Hoare triple {3034#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,342 INFO L280 TraceCheckUtils]: 13: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,342 INFO L280 TraceCheckUtils]: 14: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,343 INFO L280 TraceCheckUtils]: 15: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,343 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3027#true} {3034#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #82#return; {3034#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-08 12:47:25,344 INFO L263 TraceCheckUtils]: 17: Hoare triple {3034#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,344 INFO L280 TraceCheckUtils]: 18: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,344 INFO L280 TraceCheckUtils]: 19: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,344 INFO L280 TraceCheckUtils]: 20: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,345 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3027#true} {3034#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #84#return; {3034#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-08 12:47:25,346 INFO L280 TraceCheckUtils]: 22: Hoare triple {3034#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {3043#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-08 12:47:25,347 INFO L280 TraceCheckUtils]: 23: Hoare triple {3043#(<= (+ main_~in~0 4) main_~inlen~0)} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {3044#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:25,347 INFO L263 TraceCheckUtils]: 24: Hoare triple {3044#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,347 INFO L280 TraceCheckUtils]: 25: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,347 INFO L280 TraceCheckUtils]: 26: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,347 INFO L280 TraceCheckUtils]: 27: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,348 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3027#true} {3044#(<= (+ main_~in~0 3) main_~inlen~0)} #86#return; {3044#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:25,348 INFO L263 TraceCheckUtils]: 29: Hoare triple {3044#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,349 INFO L280 TraceCheckUtils]: 30: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,349 INFO L280 TraceCheckUtils]: 31: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,349 INFO L280 TraceCheckUtils]: 32: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,350 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {3027#true} {3044#(<= (+ main_~in~0 3) main_~inlen~0)} #88#return; {3044#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:25,350 INFO L280 TraceCheckUtils]: 34: Hoare triple {3044#(<= (+ main_~in~0 3) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3044#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:25,351 INFO L280 TraceCheckUtils]: 35: Hoare triple {3044#(<= (+ main_~in~0 3) main_~inlen~0)} assume !!(0 != #t~nondet2);havoc #t~nondet2; {3044#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:25,351 INFO L280 TraceCheckUtils]: 36: Hoare triple {3044#(<= (+ main_~in~0 3) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {3044#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:25,351 INFO L263 TraceCheckUtils]: 37: Hoare triple {3044#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,352 INFO L280 TraceCheckUtils]: 38: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,352 INFO L280 TraceCheckUtils]: 39: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,352 INFO L280 TraceCheckUtils]: 40: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,353 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3027#true} {3044#(<= (+ main_~in~0 3) main_~inlen~0)} #82#return; {3044#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:25,353 INFO L263 TraceCheckUtils]: 42: Hoare triple {3044#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,353 INFO L280 TraceCheckUtils]: 43: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,353 INFO L280 TraceCheckUtils]: 44: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,354 INFO L280 TraceCheckUtils]: 45: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,354 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {3027#true} {3044#(<= (+ main_~in~0 3) main_~inlen~0)} #84#return; {3044#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:25,355 INFO L280 TraceCheckUtils]: 47: Hoare triple {3044#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {3044#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:25,356 INFO L280 TraceCheckUtils]: 48: Hoare triple {3044#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {3061#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:25,356 INFO L263 TraceCheckUtils]: 49: Hoare triple {3061#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,356 INFO L280 TraceCheckUtils]: 50: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,356 INFO L280 TraceCheckUtils]: 51: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,357 INFO L280 TraceCheckUtils]: 52: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,357 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {3027#true} {3061#(<= (+ main_~in~0 2) main_~inlen~0)} #86#return; {3061#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:25,358 INFO L263 TraceCheckUtils]: 54: Hoare triple {3061#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,358 INFO L280 TraceCheckUtils]: 55: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,358 INFO L280 TraceCheckUtils]: 56: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,358 INFO L280 TraceCheckUtils]: 57: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,359 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {3027#true} {3061#(<= (+ main_~in~0 2) main_~inlen~0)} #88#return; {3061#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:25,359 INFO L280 TraceCheckUtils]: 59: Hoare triple {3061#(<= (+ main_~in~0 2) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3061#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:25,360 INFO L280 TraceCheckUtils]: 60: Hoare triple {3061#(<= (+ main_~in~0 2) main_~inlen~0)} assume !!(0 != #t~nondet2);havoc #t~nondet2; {3061#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:25,360 INFO L280 TraceCheckUtils]: 61: Hoare triple {3061#(<= (+ main_~in~0 2) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {3061#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:25,360 INFO L263 TraceCheckUtils]: 62: Hoare triple {3061#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,361 INFO L280 TraceCheckUtils]: 63: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,361 INFO L280 TraceCheckUtils]: 64: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,361 INFO L280 TraceCheckUtils]: 65: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,362 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {3027#true} {3061#(<= (+ main_~in~0 2) main_~inlen~0)} #82#return; {3061#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:25,362 INFO L263 TraceCheckUtils]: 67: Hoare triple {3061#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,362 INFO L280 TraceCheckUtils]: 68: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,362 INFO L280 TraceCheckUtils]: 69: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,362 INFO L280 TraceCheckUtils]: 70: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,363 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {3027#true} {3061#(<= (+ main_~in~0 2) main_~inlen~0)} #84#return; {3061#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:25,364 INFO L280 TraceCheckUtils]: 72: Hoare triple {3061#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {3061#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:25,365 INFO L280 TraceCheckUtils]: 73: Hoare triple {3061#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {3078#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 12:47:25,365 INFO L263 TraceCheckUtils]: 74: Hoare triple {3078#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,365 INFO L280 TraceCheckUtils]: 75: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,365 INFO L280 TraceCheckUtils]: 76: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,365 INFO L280 TraceCheckUtils]: 77: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,366 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {3027#true} {3078#(<= (+ main_~in~0 1) main_~inlen~0)} #86#return; {3078#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 12:47:25,367 INFO L263 TraceCheckUtils]: 79: Hoare triple {3078#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3083#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:25,368 INFO L280 TraceCheckUtils]: 80: Hoare triple {3083#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3084#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:25,368 INFO L280 TraceCheckUtils]: 81: Hoare triple {3084#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3028#false} is VALID [2020-07-08 12:47:25,368 INFO L280 TraceCheckUtils]: 82: Hoare triple {3028#false} assume !false; {3028#false} is VALID [2020-07-08 12:47:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-07-08 12:47:25,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723934859] [2020-07-08 12:47:25,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982956042] [2020-07-08 12:47:25,379 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-07-08 12:47:25,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:47:25,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:47:25,429 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-08 12:47:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,449 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:25,746 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:47:25,755 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:47:25,815 INFO L263 TraceCheckUtils]: 0: Hoare triple {3027#true} call ULTIMATE.init(); {3027#true} is VALID [2020-07-08 12:47:25,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,816 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3027#true} {3027#true} #78#return; {3027#true} is VALID [2020-07-08 12:47:25,816 INFO L263 TraceCheckUtils]: 3: Hoare triple {3027#true} call #t~ret7 := main(); {3027#true} is VALID [2020-07-08 12:47:25,816 INFO L280 TraceCheckUtils]: 4: Hoare triple {3027#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {3027#true} is VALID [2020-07-08 12:47:25,817 INFO L280 TraceCheckUtils]: 5: Hoare triple {3027#true} assume ~bufferlen~0 > 1; {3031#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:25,818 INFO L280 TraceCheckUtils]: 6: Hoare triple {3031#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {3031#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:25,819 INFO L280 TraceCheckUtils]: 7: Hoare triple {3031#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {3032#(and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))} is VALID [2020-07-08 12:47:25,820 INFO L280 TraceCheckUtils]: 8: Hoare triple {3032#(and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {3112#(and (<= 0 main_~buflim~0) (<= main_~in~0 0) (= 0 main_~buf~0) (<= (+ main_~buflim~0 3) main_~inlen~0))} is VALID [2020-07-08 12:47:25,820 INFO L280 TraceCheckUtils]: 9: Hoare triple {3112#(and (<= 0 main_~buflim~0) (<= main_~in~0 0) (= 0 main_~buf~0) (<= (+ main_~buflim~0 3) main_~inlen~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3112#(and (<= 0 main_~buflim~0) (<= main_~in~0 0) (= 0 main_~buf~0) (<= (+ main_~buflim~0 3) main_~inlen~0))} is VALID [2020-07-08 12:47:25,821 INFO L280 TraceCheckUtils]: 10: Hoare triple {3112#(and (<= 0 main_~buflim~0) (<= main_~in~0 0) (= 0 main_~buf~0) (<= (+ main_~buflim~0 3) main_~inlen~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {3112#(and (<= 0 main_~buflim~0) (<= main_~in~0 0) (= 0 main_~buf~0) (<= (+ main_~buflim~0 3) main_~inlen~0))} is VALID [2020-07-08 12:47:25,821 INFO L280 TraceCheckUtils]: 11: Hoare triple {3112#(and (<= 0 main_~buflim~0) (<= main_~in~0 0) (= 0 main_~buf~0) (<= (+ main_~buflim~0 3) main_~inlen~0))} assume !(~buf~0 == ~buflim~0); {3122#(and (<= main_~in~0 0) (<= 4 main_~inlen~0))} is VALID [2020-07-08 12:47:25,821 INFO L263 TraceCheckUtils]: 12: Hoare triple {3122#(and (<= main_~in~0 0) (<= 4 main_~inlen~0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,822 INFO L280 TraceCheckUtils]: 13: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,822 INFO L280 TraceCheckUtils]: 14: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,822 INFO L280 TraceCheckUtils]: 15: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,822 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3027#true} {3122#(and (<= main_~in~0 0) (<= 4 main_~inlen~0))} #82#return; {3122#(and (<= main_~in~0 0) (<= 4 main_~inlen~0))} is VALID [2020-07-08 12:47:25,823 INFO L263 TraceCheckUtils]: 17: Hoare triple {3122#(and (<= main_~in~0 0) (<= 4 main_~inlen~0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,823 INFO L280 TraceCheckUtils]: 18: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,823 INFO L280 TraceCheckUtils]: 19: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,823 INFO L280 TraceCheckUtils]: 20: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,823 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3027#true} {3122#(and (<= main_~in~0 0) (<= 4 main_~inlen~0))} #84#return; {3122#(and (<= main_~in~0 0) (<= 4 main_~inlen~0))} is VALID [2020-07-08 12:47:25,824 INFO L280 TraceCheckUtils]: 22: Hoare triple {3122#(and (<= main_~in~0 0) (<= 4 main_~inlen~0))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {3122#(and (<= main_~in~0 0) (<= 4 main_~inlen~0))} is VALID [2020-07-08 12:47:25,825 INFO L280 TraceCheckUtils]: 23: Hoare triple {3122#(and (<= main_~in~0 0) (<= 4 main_~inlen~0))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} is VALID [2020-07-08 12:47:25,825 INFO L263 TraceCheckUtils]: 24: Hoare triple {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,825 INFO L280 TraceCheckUtils]: 25: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,825 INFO L280 TraceCheckUtils]: 26: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,825 INFO L280 TraceCheckUtils]: 27: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,826 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3027#true} {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} #86#return; {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} is VALID [2020-07-08 12:47:25,826 INFO L263 TraceCheckUtils]: 29: Hoare triple {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,826 INFO L280 TraceCheckUtils]: 30: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,826 INFO L280 TraceCheckUtils]: 31: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,827 INFO L280 TraceCheckUtils]: 32: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,827 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {3027#true} {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} #88#return; {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} is VALID [2020-07-08 12:47:25,828 INFO L280 TraceCheckUtils]: 34: Hoare triple {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} is VALID [2020-07-08 12:47:25,828 INFO L280 TraceCheckUtils]: 35: Hoare triple {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} is VALID [2020-07-08 12:47:25,829 INFO L280 TraceCheckUtils]: 36: Hoare triple {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} assume !(~buf~0 == ~buflim~0); {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} is VALID [2020-07-08 12:47:25,829 INFO L263 TraceCheckUtils]: 37: Hoare triple {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,829 INFO L280 TraceCheckUtils]: 38: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,830 INFO L280 TraceCheckUtils]: 39: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,830 INFO L280 TraceCheckUtils]: 40: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,832 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3027#true} {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} #82#return; {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} is VALID [2020-07-08 12:47:25,832 INFO L263 TraceCheckUtils]: 42: Hoare triple {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,832 INFO L280 TraceCheckUtils]: 43: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,832 INFO L280 TraceCheckUtils]: 44: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,832 INFO L280 TraceCheckUtils]: 45: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,842 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {3027#true} {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} #84#return; {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} is VALID [2020-07-08 12:47:25,843 INFO L280 TraceCheckUtils]: 47: Hoare triple {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} is VALID [2020-07-08 12:47:25,844 INFO L280 TraceCheckUtils]: 48: Hoare triple {3159#(and (<= 4 main_~inlen~0) (<= main_~in~0 1))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} is VALID [2020-07-08 12:47:25,844 INFO L263 TraceCheckUtils]: 49: Hoare triple {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,844 INFO L280 TraceCheckUtils]: 50: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,844 INFO L280 TraceCheckUtils]: 51: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,844 INFO L280 TraceCheckUtils]: 52: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,845 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {3027#true} {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} #86#return; {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} is VALID [2020-07-08 12:47:25,845 INFO L263 TraceCheckUtils]: 54: Hoare triple {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,846 INFO L280 TraceCheckUtils]: 55: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,846 INFO L280 TraceCheckUtils]: 56: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,846 INFO L280 TraceCheckUtils]: 57: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,847 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {3027#true} {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} #88#return; {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} is VALID [2020-07-08 12:47:25,847 INFO L280 TraceCheckUtils]: 59: Hoare triple {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} is VALID [2020-07-08 12:47:25,848 INFO L280 TraceCheckUtils]: 60: Hoare triple {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} is VALID [2020-07-08 12:47:25,849 INFO L280 TraceCheckUtils]: 61: Hoare triple {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} assume !(~buf~0 == ~buflim~0); {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} is VALID [2020-07-08 12:47:25,849 INFO L263 TraceCheckUtils]: 62: Hoare triple {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,849 INFO L280 TraceCheckUtils]: 63: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,849 INFO L280 TraceCheckUtils]: 64: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,849 INFO L280 TraceCheckUtils]: 65: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,850 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {3027#true} {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} #82#return; {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} is VALID [2020-07-08 12:47:25,850 INFO L263 TraceCheckUtils]: 67: Hoare triple {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,850 INFO L280 TraceCheckUtils]: 68: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,851 INFO L280 TraceCheckUtils]: 69: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,851 INFO L280 TraceCheckUtils]: 70: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,852 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {3027#true} {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} #84#return; {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} is VALID [2020-07-08 12:47:25,852 INFO L280 TraceCheckUtils]: 72: Hoare triple {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} is VALID [2020-07-08 12:47:25,853 INFO L280 TraceCheckUtils]: 73: Hoare triple {3235#(and (<= 4 main_~inlen~0) (<= main_~in~0 2))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {3311#(and (<= main_~in~0 3) (<= 4 main_~inlen~0))} is VALID [2020-07-08 12:47:25,853 INFO L263 TraceCheckUtils]: 74: Hoare triple {3311#(and (<= main_~in~0 3) (<= 4 main_~inlen~0))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3027#true} is VALID [2020-07-08 12:47:25,854 INFO L280 TraceCheckUtils]: 75: Hoare triple {3027#true} ~cond := #in~cond; {3027#true} is VALID [2020-07-08 12:47:25,854 INFO L280 TraceCheckUtils]: 76: Hoare triple {3027#true} assume !(0 == ~cond); {3027#true} is VALID [2020-07-08 12:47:25,854 INFO L280 TraceCheckUtils]: 77: Hoare triple {3027#true} assume true; {3027#true} is VALID [2020-07-08 12:47:25,855 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {3027#true} {3311#(and (<= main_~in~0 3) (<= 4 main_~inlen~0))} #86#return; {3311#(and (<= main_~in~0 3) (<= 4 main_~inlen~0))} is VALID [2020-07-08 12:47:25,856 INFO L263 TraceCheckUtils]: 79: Hoare triple {3311#(and (<= main_~in~0 3) (<= 4 main_~inlen~0))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:47:25,856 INFO L280 TraceCheckUtils]: 80: Hoare triple {3330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:47:25,857 INFO L280 TraceCheckUtils]: 81: Hoare triple {3334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3028#false} is VALID [2020-07-08 12:47:25,857 INFO L280 TraceCheckUtils]: 82: Hoare triple {3028#false} assume !false; {3028#false} is VALID [2020-07-08 12:47:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-07-08 12:47:25,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:25,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2020-07-08 12:47:25,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981202065] [2020-07-08 12:47:25,868 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 83 [2020-07-08 12:47:25,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:25,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-08 12:47:25,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:25,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-08 12:47:25,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:25,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-08 12:47:25,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2020-07-08 12:47:25,994 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 19 states. [2020-07-08 12:47:27,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:27,908 INFO L93 Difference]: Finished difference Result 112 states and 134 transitions. [2020-07-08 12:47:27,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 12:47:27,908 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 83 [2020-07-08 12:47:27,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:27,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:47:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 110 transitions. [2020-07-08 12:47:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:47:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 110 transitions. [2020-07-08 12:47:27,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 110 transitions. [2020-07-08 12:47:28,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:28,088 INFO L225 Difference]: With dead ends: 112 [2020-07-08 12:47:28,088 INFO L226 Difference]: Without dead ends: 110 [2020-07-08 12:47:28,089 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2020-07-08 12:47:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-08 12:47:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 99. [2020-07-08 12:47:28,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:28,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 99 states. [2020-07-08 12:47:28,207 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 99 states. [2020-07-08 12:47:28,207 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 99 states. [2020-07-08 12:47:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:28,213 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2020-07-08 12:47:28,213 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 132 transitions. [2020-07-08 12:47:28,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:28,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:28,214 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 110 states. [2020-07-08 12:47:28,215 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 110 states. [2020-07-08 12:47:28,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:28,219 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2020-07-08 12:47:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 132 transitions. [2020-07-08 12:47:28,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:28,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:28,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:28,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-08 12:47:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 116 transitions. [2020-07-08 12:47:28,224 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 116 transitions. Word has length 83 [2020-07-08 12:47:28,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:28,224 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 116 transitions. [2020-07-08 12:47:28,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-08 12:47:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2020-07-08 12:47:28,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-07-08 12:47:28,226 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:28,226 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:28,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:28,440 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:28,441 INFO L82 PathProgramCache]: Analyzing trace with hash 314554042, now seen corresponding path program 2 times [2020-07-08 12:47:28,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:28,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845795029] [2020-07-08 12:47:28,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,684 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,685 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3881#true} {3881#true} #78#return; {3881#true} is VALID [2020-07-08 12:47:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,695 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,695 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,696 INFO L280 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,697 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #82#return; {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,701 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,701 INFO L280 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,702 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #84#return; {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,707 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,707 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,707 INFO L280 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,708 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #86#return; {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,713 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,713 INFO L280 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,714 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #88#return; {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,718 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,718 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,719 INFO L280 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,719 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #82#return; {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,724 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,724 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,724 INFO L280 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,725 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #84#return; {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,730 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,730 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,730 INFO L280 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,731 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} #86#return; {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} is VALID [2020-07-08 12:47:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,736 INFO L280 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,737 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} #88#return; {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} is VALID [2020-07-08 12:47:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,752 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,752 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,752 INFO L280 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,753 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3921#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #82#return; {3921#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,758 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,758 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,759 INFO L280 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,759 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3921#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #84#return; {3921#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,764 INFO L280 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,765 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #86#return; {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,769 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,770 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,770 INFO L280 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,771 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #88#return; {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,774 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,775 INFO L280 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,775 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #90#return; {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,789 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,790 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,790 INFO L280 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,790 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #92#return; {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,806 INFO L280 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,806 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3947#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #94#return; {3947#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,807 INFO L263 TraceCheckUtils]: 0: Hoare triple {3881#true} call ULTIMATE.init(); {3881#true} is VALID [2020-07-08 12:47:28,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,807 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3881#true} {3881#true} #78#return; {3881#true} is VALID [2020-07-08 12:47:28,807 INFO L263 TraceCheckUtils]: 3: Hoare triple {3881#true} call #t~ret7 := main(); {3881#true} is VALID [2020-07-08 12:47:28,808 INFO L280 TraceCheckUtils]: 4: Hoare triple {3881#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {3881#true} is VALID [2020-07-08 12:47:28,808 INFO L280 TraceCheckUtils]: 5: Hoare triple {3881#true} assume ~bufferlen~0 > 1; {3885#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,809 INFO L280 TraceCheckUtils]: 6: Hoare triple {3885#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {3885#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,810 INFO L280 TraceCheckUtils]: 7: Hoare triple {3885#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {3885#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,811 INFO L280 TraceCheckUtils]: 8: Hoare triple {3885#(<= 2 main_~bufferlen~0)} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,811 INFO L280 TraceCheckUtils]: 9: Hoare triple {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,812 INFO L280 TraceCheckUtils]: 10: Hoare triple {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,813 INFO L280 TraceCheckUtils]: 11: Hoare triple {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} assume !(~buf~0 == ~buflim~0); {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,813 INFO L263 TraceCheckUtils]: 12: Hoare triple {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:28,813 INFO L280 TraceCheckUtils]: 13: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,813 INFO L280 TraceCheckUtils]: 14: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,814 INFO L280 TraceCheckUtils]: 15: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,814 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3881#true} {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #82#return; {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,815 INFO L263 TraceCheckUtils]: 17: Hoare triple {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:28,815 INFO L280 TraceCheckUtils]: 18: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,815 INFO L280 TraceCheckUtils]: 19: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,815 INFO L280 TraceCheckUtils]: 20: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,816 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3881#true} {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #84#return; {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,817 INFO L280 TraceCheckUtils]: 22: Hoare triple {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,817 INFO L280 TraceCheckUtils]: 23: Hoare triple {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,818 INFO L263 TraceCheckUtils]: 24: Hoare triple {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:28,818 INFO L280 TraceCheckUtils]: 25: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,818 INFO L280 TraceCheckUtils]: 26: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,818 INFO L280 TraceCheckUtils]: 27: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,819 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3881#true} {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #86#return; {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,819 INFO L263 TraceCheckUtils]: 29: Hoare triple {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:28,819 INFO L280 TraceCheckUtils]: 30: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,819 INFO L280 TraceCheckUtils]: 31: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,820 INFO L280 TraceCheckUtils]: 32: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,820 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {3881#true} {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #88#return; {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,821 INFO L280 TraceCheckUtils]: 34: Hoare triple {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,822 INFO L280 TraceCheckUtils]: 35: Hoare triple {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,822 INFO L280 TraceCheckUtils]: 36: Hoare triple {3886#(and (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} assume !(~buf~0 == ~buflim~0); {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,823 INFO L263 TraceCheckUtils]: 37: Hoare triple {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:28,823 INFO L280 TraceCheckUtils]: 38: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,823 INFO L280 TraceCheckUtils]: 39: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,823 INFO L280 TraceCheckUtils]: 40: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,824 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3881#true} {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #82#return; {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,824 INFO L263 TraceCheckUtils]: 42: Hoare triple {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:28,824 INFO L280 TraceCheckUtils]: 43: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,824 INFO L280 TraceCheckUtils]: 44: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,825 INFO L280 TraceCheckUtils]: 45: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,825 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {3881#true} {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #84#return; {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 12:47:28,826 INFO L280 TraceCheckUtils]: 47: Hoare triple {3887#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} is VALID [2020-07-08 12:47:28,827 INFO L280 TraceCheckUtils]: 48: Hoare triple {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} is VALID [2020-07-08 12:47:28,827 INFO L263 TraceCheckUtils]: 49: Hoare triple {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:28,827 INFO L280 TraceCheckUtils]: 50: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,828 INFO L280 TraceCheckUtils]: 51: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,828 INFO L280 TraceCheckUtils]: 52: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,829 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {3881#true} {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} #86#return; {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} is VALID [2020-07-08 12:47:28,829 INFO L263 TraceCheckUtils]: 54: Hoare triple {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:28,829 INFO L280 TraceCheckUtils]: 55: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,829 INFO L280 TraceCheckUtils]: 56: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,829 INFO L280 TraceCheckUtils]: 57: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,830 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {3881#true} {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} #88#return; {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} is VALID [2020-07-08 12:47:28,831 INFO L280 TraceCheckUtils]: 59: Hoare triple {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} is VALID [2020-07-08 12:47:28,831 INFO L280 TraceCheckUtils]: 60: Hoare triple {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} is VALID [2020-07-08 12:47:28,832 INFO L280 TraceCheckUtils]: 61: Hoare triple {3912#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= main_~buflim~0 main_~buf~0)))} assume !(~buf~0 == ~buflim~0); {3921#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,832 INFO L263 TraceCheckUtils]: 62: Hoare triple {3921#(<= (+ main_~buf~0 3) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:28,833 INFO L280 TraceCheckUtils]: 63: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,833 INFO L280 TraceCheckUtils]: 64: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,833 INFO L280 TraceCheckUtils]: 65: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,834 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {3881#true} {3921#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #82#return; {3921#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,834 INFO L263 TraceCheckUtils]: 67: Hoare triple {3921#(<= (+ main_~buf~0 3) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:28,834 INFO L280 TraceCheckUtils]: 68: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,834 INFO L280 TraceCheckUtils]: 69: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,834 INFO L280 TraceCheckUtils]: 70: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,835 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {3881#true} {3921#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #84#return; {3921#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,836 INFO L280 TraceCheckUtils]: 72: Hoare triple {3921#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,836 INFO L280 TraceCheckUtils]: 73: Hoare triple {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,837 INFO L263 TraceCheckUtils]: 74: Hoare triple {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:28,837 INFO L280 TraceCheckUtils]: 75: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,837 INFO L280 TraceCheckUtils]: 76: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,837 INFO L280 TraceCheckUtils]: 77: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,838 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {3881#true} {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #86#return; {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,838 INFO L263 TraceCheckUtils]: 79: Hoare triple {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:28,838 INFO L280 TraceCheckUtils]: 80: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,838 INFO L280 TraceCheckUtils]: 81: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,838 INFO L280 TraceCheckUtils]: 82: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,839 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {3881#true} {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #88#return; {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,840 INFO L280 TraceCheckUtils]: 84: Hoare triple {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,840 INFO L280 TraceCheckUtils]: 85: Hoare triple {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,840 INFO L263 TraceCheckUtils]: 86: Hoare triple {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:28,840 INFO L280 TraceCheckUtils]: 87: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,841 INFO L280 TraceCheckUtils]: 88: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,841 INFO L280 TraceCheckUtils]: 89: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,841 INFO L275 TraceCheckUtils]: 90: Hoare quadruple {3881#true} {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #90#return; {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,842 INFO L263 TraceCheckUtils]: 91: Hoare triple {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:28,842 INFO L280 TraceCheckUtils]: 92: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,842 INFO L280 TraceCheckUtils]: 93: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,842 INFO L280 TraceCheckUtils]: 94: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,843 INFO L275 TraceCheckUtils]: 95: Hoare quadruple {3881#true} {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #92#return; {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,844 INFO L280 TraceCheckUtils]: 96: Hoare triple {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post5 := ~buf~0;~buf~0 := 1 + #t~post5;havoc #t~post5; {3947#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,844 INFO L263 TraceCheckUtils]: 97: Hoare triple {3947#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:28,844 INFO L280 TraceCheckUtils]: 98: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:28,844 INFO L280 TraceCheckUtils]: 99: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:28,845 INFO L280 TraceCheckUtils]: 100: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:28,845 INFO L275 TraceCheckUtils]: 101: Hoare quadruple {3881#true} {3947#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #94#return; {3947#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 12:47:28,846 INFO L263 TraceCheckUtils]: 102: Hoare triple {3947#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3952#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:28,847 INFO L280 TraceCheckUtils]: 103: Hoare triple {3952#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3953#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:28,847 INFO L280 TraceCheckUtils]: 104: Hoare triple {3953#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3882#false} is VALID [2020-07-08 12:47:28,847 INFO L280 TraceCheckUtils]: 105: Hoare triple {3882#false} assume !false; {3882#false} is VALID [2020-07-08 12:47:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2020-07-08 12:47:28,861 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845795029] [2020-07-08 12:47:28,861 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693569965] [2020-07-08 12:47:28,861 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:28,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:47:28,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:47:28,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-08 12:47:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,933 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:29,170 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:47:29,222 INFO L263 TraceCheckUtils]: 0: Hoare triple {3881#true} call ULTIMATE.init(); {3881#true} is VALID [2020-07-08 12:47:29,223 INFO L280 TraceCheckUtils]: 1: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:29,223 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3881#true} {3881#true} #78#return; {3881#true} is VALID [2020-07-08 12:47:29,223 INFO L263 TraceCheckUtils]: 3: Hoare triple {3881#true} call #t~ret7 := main(); {3881#true} is VALID [2020-07-08 12:47:29,223 INFO L280 TraceCheckUtils]: 4: Hoare triple {3881#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {3881#true} is VALID [2020-07-08 12:47:29,224 INFO L280 TraceCheckUtils]: 5: Hoare triple {3881#true} assume ~bufferlen~0 > 1; {3881#true} is VALID [2020-07-08 12:47:29,224 INFO L280 TraceCheckUtils]: 6: Hoare triple {3881#true} assume ~inlen~0 > 0; {3881#true} is VALID [2020-07-08 12:47:29,224 INFO L280 TraceCheckUtils]: 7: Hoare triple {3881#true} assume ~bufferlen~0 < ~inlen~0; {3881#true} is VALID [2020-07-08 12:47:29,225 INFO L280 TraceCheckUtils]: 8: Hoare triple {3881#true} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,225 INFO L280 TraceCheckUtils]: 9: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,226 INFO L280 TraceCheckUtils]: 10: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,226 INFO L280 TraceCheckUtils]: 11: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} assume !(~buf~0 == ~buflim~0); {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,226 INFO L263 TraceCheckUtils]: 12: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:29,226 INFO L280 TraceCheckUtils]: 13: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:29,226 INFO L280 TraceCheckUtils]: 14: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:29,227 INFO L280 TraceCheckUtils]: 15: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:29,227 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3881#true} {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} #82#return; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,227 INFO L263 TraceCheckUtils]: 17: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:29,227 INFO L280 TraceCheckUtils]: 18: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:29,228 INFO L280 TraceCheckUtils]: 19: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:29,228 INFO L280 TraceCheckUtils]: 20: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:29,228 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3881#true} {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} #84#return; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,229 INFO L280 TraceCheckUtils]: 22: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,229 INFO L280 TraceCheckUtils]: 23: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,229 INFO L263 TraceCheckUtils]: 24: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:29,229 INFO L280 TraceCheckUtils]: 25: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:29,229 INFO L280 TraceCheckUtils]: 26: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:29,229 INFO L280 TraceCheckUtils]: 27: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:29,230 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3881#true} {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} #86#return; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,230 INFO L263 TraceCheckUtils]: 29: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:29,230 INFO L280 TraceCheckUtils]: 30: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:29,230 INFO L280 TraceCheckUtils]: 31: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:29,230 INFO L280 TraceCheckUtils]: 32: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:29,231 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {3881#true} {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} #88#return; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,231 INFO L280 TraceCheckUtils]: 34: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,232 INFO L280 TraceCheckUtils]: 35: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,232 INFO L280 TraceCheckUtils]: 36: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} assume !(~buf~0 == ~buflim~0); {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,232 INFO L263 TraceCheckUtils]: 37: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:29,232 INFO L280 TraceCheckUtils]: 38: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:29,233 INFO L280 TraceCheckUtils]: 39: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:29,233 INFO L280 TraceCheckUtils]: 40: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:29,233 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3881#true} {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} #82#return; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,233 INFO L263 TraceCheckUtils]: 42: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:29,233 INFO L280 TraceCheckUtils]: 43: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:29,234 INFO L280 TraceCheckUtils]: 44: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:29,234 INFO L280 TraceCheckUtils]: 45: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:29,234 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {3881#true} {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} #84#return; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,234 INFO L280 TraceCheckUtils]: 47: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,240 INFO L280 TraceCheckUtils]: 48: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,240 INFO L263 TraceCheckUtils]: 49: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:29,240 INFO L280 TraceCheckUtils]: 50: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:29,240 INFO L280 TraceCheckUtils]: 51: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:29,240 INFO L280 TraceCheckUtils]: 52: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:29,241 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {3881#true} {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} #86#return; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,241 INFO L263 TraceCheckUtils]: 54: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:29,241 INFO L280 TraceCheckUtils]: 55: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:29,242 INFO L280 TraceCheckUtils]: 56: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:29,242 INFO L280 TraceCheckUtils]: 57: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:29,242 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {3881#true} {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} #88#return; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,243 INFO L280 TraceCheckUtils]: 59: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,243 INFO L280 TraceCheckUtils]: 60: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} is VALID [2020-07-08 12:47:29,244 INFO L280 TraceCheckUtils]: 61: Hoare triple {3981#(= main_~bufferlen~0 (+ main_~buflim~0 2))} assume !(~buf~0 == ~buflim~0); {4141#(not (= main_~bufferlen~0 (+ main_~buf~0 2)))} is VALID [2020-07-08 12:47:29,244 INFO L263 TraceCheckUtils]: 62: Hoare triple {4141#(not (= main_~bufferlen~0 (+ main_~buf~0 2)))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:29,244 INFO L280 TraceCheckUtils]: 63: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:29,244 INFO L280 TraceCheckUtils]: 64: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:29,244 INFO L280 TraceCheckUtils]: 65: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:29,246 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {3881#true} {4141#(not (= main_~bufferlen~0 (+ main_~buf~0 2)))} #82#return; {4141#(not (= main_~bufferlen~0 (+ main_~buf~0 2)))} is VALID [2020-07-08 12:47:29,246 INFO L263 TraceCheckUtils]: 67: Hoare triple {4141#(not (= main_~bufferlen~0 (+ main_~buf~0 2)))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:29,246 INFO L280 TraceCheckUtils]: 68: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:29,246 INFO L280 TraceCheckUtils]: 69: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:29,246 INFO L280 TraceCheckUtils]: 70: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:29,256 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {3881#true} {4141#(not (= main_~bufferlen~0 (+ main_~buf~0 2)))} #84#return; {4141#(not (= main_~bufferlen~0 (+ main_~buf~0 2)))} is VALID [2020-07-08 12:47:29,257 INFO L280 TraceCheckUtils]: 72: Hoare triple {4141#(not (= main_~bufferlen~0 (+ main_~buf~0 2)))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} is VALID [2020-07-08 12:47:29,258 INFO L280 TraceCheckUtils]: 73: Hoare triple {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} is VALID [2020-07-08 12:47:29,258 INFO L263 TraceCheckUtils]: 74: Hoare triple {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:29,258 INFO L280 TraceCheckUtils]: 75: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:29,258 INFO L280 TraceCheckUtils]: 76: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:29,259 INFO L280 TraceCheckUtils]: 77: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:29,259 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {3881#true} {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} #86#return; {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} is VALID [2020-07-08 12:47:29,259 INFO L263 TraceCheckUtils]: 79: Hoare triple {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:29,260 INFO L280 TraceCheckUtils]: 80: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:29,260 INFO L280 TraceCheckUtils]: 81: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:29,260 INFO L280 TraceCheckUtils]: 82: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:29,261 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {3881#true} {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} #88#return; {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} is VALID [2020-07-08 12:47:29,261 INFO L280 TraceCheckUtils]: 84: Hoare triple {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} is VALID [2020-07-08 12:47:29,262 INFO L280 TraceCheckUtils]: 85: Hoare triple {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} is VALID [2020-07-08 12:47:29,262 INFO L263 TraceCheckUtils]: 86: Hoare triple {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:29,262 INFO L280 TraceCheckUtils]: 87: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:29,262 INFO L280 TraceCheckUtils]: 88: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:29,262 INFO L280 TraceCheckUtils]: 89: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:29,263 INFO L275 TraceCheckUtils]: 90: Hoare quadruple {3881#true} {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} #90#return; {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} is VALID [2020-07-08 12:47:29,263 INFO L263 TraceCheckUtils]: 91: Hoare triple {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:29,264 INFO L280 TraceCheckUtils]: 92: Hoare triple {3881#true} ~cond := #in~cond; {4236#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:47:29,264 INFO L280 TraceCheckUtils]: 93: Hoare triple {4236#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3952#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:29,265 INFO L280 TraceCheckUtils]: 94: Hoare triple {3952#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {3952#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:29,266 INFO L275 TraceCheckUtils]: 95: Hoare quadruple {3952#(not (= 0 |__VERIFIER_assert_#in~cond|))} {4175#(not (= main_~bufferlen~0 (+ main_~buf~0 1)))} #92#return; {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 12:47:29,267 INFO L280 TraceCheckUtils]: 96: Hoare triple {3930#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post5 := ~buf~0;~buf~0 := 1 + #t~post5;havoc #t~post5; {3947#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 12:47:29,267 INFO L263 TraceCheckUtils]: 97: Hoare triple {3947#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3881#true} is VALID [2020-07-08 12:47:29,267 INFO L280 TraceCheckUtils]: 98: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2020-07-08 12:47:29,267 INFO L280 TraceCheckUtils]: 99: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2020-07-08 12:47:29,267 INFO L280 TraceCheckUtils]: 100: Hoare triple {3881#true} assume true; {3881#true} is VALID [2020-07-08 12:47:29,268 INFO L275 TraceCheckUtils]: 101: Hoare quadruple {3881#true} {3947#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #94#return; {3947#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 12:47:29,269 INFO L263 TraceCheckUtils]: 102: Hoare triple {3947#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4267#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:47:29,270 INFO L280 TraceCheckUtils]: 103: Hoare triple {4267#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4271#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:47:29,270 INFO L280 TraceCheckUtils]: 104: Hoare triple {4271#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3882#false} is VALID [2020-07-08 12:47:29,270 INFO L280 TraceCheckUtils]: 105: Hoare triple {3882#false} assume !false; {3882#false} is VALID [2020-07-08 12:47:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 68 proven. 22 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2020-07-08 12:47:29,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:29,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2020-07-08 12:47:29,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290322689] [2020-07-08 12:47:29,283 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2020-07-08 12:47:29,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:29,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-08 12:47:29,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:29,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-08 12:47:29,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:29,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-08 12:47:29,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-07-08 12:47:29,412 INFO L87 Difference]: Start difference. First operand 99 states and 116 transitions. Second operand 17 states. [2020-07-08 12:47:30,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:30,355 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2020-07-08 12:47:30,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:47:30,356 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2020-07-08 12:47:30,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 12:47:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-08 12:47:30,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 12:47:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-08 12:47:30,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2020-07-08 12:47:30,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:30,424 INFO L225 Difference]: With dead ends: 105 [2020-07-08 12:47:30,425 INFO L226 Difference]: Without dead ends: 96 [2020-07-08 12:47:30,425 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2020-07-08 12:47:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-08 12:47:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2020-07-08 12:47:30,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:30,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 96 states. [2020-07-08 12:47:30,540 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2020-07-08 12:47:30,541 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2020-07-08 12:47:30,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:30,544 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2020-07-08 12:47:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-08 12:47:30,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:30,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:30,545 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2020-07-08 12:47:30,545 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2020-07-08 12:47:30,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:30,548 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2020-07-08 12:47:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-08 12:47:30,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:30,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:30,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:30,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-08 12:47:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2020-07-08 12:47:30,552 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 106 [2020-07-08 12:47:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:30,555 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2020-07-08 12:47:30,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-08 12:47:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-08 12:47:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-08 12:47:30,557 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:30,557 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:30,771 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:30,771 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:30,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:30,772 INFO L82 PathProgramCache]: Analyzing trace with hash 331157303, now seen corresponding path program 3 times [2020-07-08 12:47:30,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:30,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441305606] [2020-07-08 12:47:30,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,099 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,099 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4762#true} {4762#true} #78#return; {4762#true} is VALID [2020-07-08 12:47:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,107 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,108 INFO L280 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,109 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #82#return; {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-08 12:47:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,114 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,114 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,114 INFO L280 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,118 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #84#return; {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-08 12:47:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,136 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,136 INFO L280 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,137 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} #86#return; {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,159 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,159 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,160 INFO L280 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,160 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} #88#return; {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,168 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,168 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,169 INFO L280 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,170 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #82#return; {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-08 12:47:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,177 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,177 INFO L280 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,178 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #84#return; {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-08 12:47:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,184 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,184 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,184 INFO L280 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,185 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4796#(<= (+ main_~in~0 3) main_~inlen~0)} #86#return; {4796#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,190 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,191 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4796#(<= (+ main_~in~0 3) main_~inlen~0)} #88#return; {4796#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,198 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4796#(<= (+ main_~in~0 3) main_~inlen~0)} #82#return; {4796#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,202 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,203 INFO L280 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,204 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4796#(<= (+ main_~in~0 3) main_~inlen~0)} #84#return; {4796#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,208 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,208 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,208 INFO L280 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,209 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4813#(<= (+ main_~in~0 2) main_~inlen~0)} #86#return; {4813#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,213 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,215 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4813#(<= (+ main_~in~0 2) main_~inlen~0)} #88#return; {4813#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,220 INFO L280 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,221 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4813#(<= (+ main_~in~0 2) main_~inlen~0)} #82#return; {4813#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,225 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,226 INFO L280 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,227 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4813#(<= (+ main_~in~0 2) main_~inlen~0)} #84#return; {4813#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,231 INFO L280 TraceCheckUtils]: 0: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,231 INFO L280 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,232 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4830#(<= (+ main_~in~0 1) main_~inlen~0)} #86#return; {4830#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 12:47:31,233 INFO L263 TraceCheckUtils]: 0: Hoare triple {4762#true} call ULTIMATE.init(); {4762#true} is VALID [2020-07-08 12:47:31,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,233 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4762#true} {4762#true} #78#return; {4762#true} is VALID [2020-07-08 12:47:31,233 INFO L263 TraceCheckUtils]: 3: Hoare triple {4762#true} call #t~ret7 := main(); {4762#true} is VALID [2020-07-08 12:47:31,233 INFO L280 TraceCheckUtils]: 4: Hoare triple {4762#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {4762#true} is VALID [2020-07-08 12:47:31,234 INFO L280 TraceCheckUtils]: 5: Hoare triple {4762#true} assume ~bufferlen~0 > 1; {4766#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:31,235 INFO L280 TraceCheckUtils]: 6: Hoare triple {4766#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {4766#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 12:47:31,235 INFO L280 TraceCheckUtils]: 7: Hoare triple {4766#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {4767#(and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))} is VALID [2020-07-08 12:47:31,237 INFO L280 TraceCheckUtils]: 8: Hoare triple {4767#(and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:31,237 INFO L280 TraceCheckUtils]: 9: Hoare triple {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:31,238 INFO L280 TraceCheckUtils]: 10: Hoare triple {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:31,239 INFO L280 TraceCheckUtils]: 11: Hoare triple {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} assume !(~buf~0 == ~buflim~0); {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-08 12:47:31,239 INFO L263 TraceCheckUtils]: 12: Hoare triple {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:31,239 INFO L280 TraceCheckUtils]: 13: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,240 INFO L280 TraceCheckUtils]: 14: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,240 INFO L280 TraceCheckUtils]: 15: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,241 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {4762#true} {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #82#return; {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-08 12:47:31,241 INFO L263 TraceCheckUtils]: 17: Hoare triple {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:31,241 INFO L280 TraceCheckUtils]: 18: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,241 INFO L280 TraceCheckUtils]: 19: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,242 INFO L280 TraceCheckUtils]: 20: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,243 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {4762#true} {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #84#return; {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-08 12:47:31,244 INFO L280 TraceCheckUtils]: 22: Hoare triple {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {4778#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)))} is VALID [2020-07-08 12:47:31,245 INFO L280 TraceCheckUtils]: 23: Hoare triple {4778#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:31,245 INFO L263 TraceCheckUtils]: 24: Hoare triple {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:31,245 INFO L280 TraceCheckUtils]: 25: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,245 INFO L280 TraceCheckUtils]: 26: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,246 INFO L280 TraceCheckUtils]: 27: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,247 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4762#true} {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} #86#return; {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:31,247 INFO L263 TraceCheckUtils]: 29: Hoare triple {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:31,247 INFO L280 TraceCheckUtils]: 30: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,247 INFO L280 TraceCheckUtils]: 31: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,247 INFO L280 TraceCheckUtils]: 32: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,248 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {4762#true} {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} #88#return; {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:31,249 INFO L280 TraceCheckUtils]: 34: Hoare triple {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:31,250 INFO L280 TraceCheckUtils]: 35: Hoare triple {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 12:47:31,251 INFO L280 TraceCheckUtils]: 36: Hoare triple {4768#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} assume !(~buf~0 == ~buflim~0); {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-08 12:47:31,251 INFO L263 TraceCheckUtils]: 37: Hoare triple {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:31,251 INFO L280 TraceCheckUtils]: 38: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,252 INFO L280 TraceCheckUtils]: 39: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,252 INFO L280 TraceCheckUtils]: 40: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,253 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {4762#true} {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #82#return; {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-08 12:47:31,253 INFO L263 TraceCheckUtils]: 42: Hoare triple {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:31,253 INFO L280 TraceCheckUtils]: 43: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,253 INFO L280 TraceCheckUtils]: 44: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,254 INFO L280 TraceCheckUtils]: 45: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,255 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {4762#true} {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #84#return; {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-08 12:47:31,256 INFO L280 TraceCheckUtils]: 47: Hoare triple {4769#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {4795#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-08 12:47:31,257 INFO L280 TraceCheckUtils]: 48: Hoare triple {4795#(<= (+ main_~in~0 4) main_~inlen~0)} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {4796#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:31,257 INFO L263 TraceCheckUtils]: 49: Hoare triple {4796#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:31,257 INFO L280 TraceCheckUtils]: 50: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,257 INFO L280 TraceCheckUtils]: 51: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,257 INFO L280 TraceCheckUtils]: 52: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,258 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {4762#true} {4796#(<= (+ main_~in~0 3) main_~inlen~0)} #86#return; {4796#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:31,258 INFO L263 TraceCheckUtils]: 54: Hoare triple {4796#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:31,259 INFO L280 TraceCheckUtils]: 55: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,259 INFO L280 TraceCheckUtils]: 56: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,259 INFO L280 TraceCheckUtils]: 57: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,260 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {4762#true} {4796#(<= (+ main_~in~0 3) main_~inlen~0)} #88#return; {4796#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:31,260 INFO L280 TraceCheckUtils]: 59: Hoare triple {4796#(<= (+ main_~in~0 3) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4796#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:31,261 INFO L280 TraceCheckUtils]: 60: Hoare triple {4796#(<= (+ main_~in~0 3) main_~inlen~0)} assume !!(0 != #t~nondet2);havoc #t~nondet2; {4796#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:31,261 INFO L280 TraceCheckUtils]: 61: Hoare triple {4796#(<= (+ main_~in~0 3) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {4796#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:31,262 INFO L263 TraceCheckUtils]: 62: Hoare triple {4796#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:31,262 INFO L280 TraceCheckUtils]: 63: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,262 INFO L280 TraceCheckUtils]: 64: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,262 INFO L280 TraceCheckUtils]: 65: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,263 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {4762#true} {4796#(<= (+ main_~in~0 3) main_~inlen~0)} #82#return; {4796#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:31,263 INFO L263 TraceCheckUtils]: 67: Hoare triple {4796#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:31,263 INFO L280 TraceCheckUtils]: 68: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,263 INFO L280 TraceCheckUtils]: 69: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,264 INFO L280 TraceCheckUtils]: 70: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,264 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {4762#true} {4796#(<= (+ main_~in~0 3) main_~inlen~0)} #84#return; {4796#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:31,265 INFO L280 TraceCheckUtils]: 72: Hoare triple {4796#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {4796#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 12:47:31,266 INFO L280 TraceCheckUtils]: 73: Hoare triple {4796#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {4813#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:31,266 INFO L263 TraceCheckUtils]: 74: Hoare triple {4813#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:31,266 INFO L280 TraceCheckUtils]: 75: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,267 INFO L280 TraceCheckUtils]: 76: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,267 INFO L280 TraceCheckUtils]: 77: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,267 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {4762#true} {4813#(<= (+ main_~in~0 2) main_~inlen~0)} #86#return; {4813#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:31,268 INFO L263 TraceCheckUtils]: 79: Hoare triple {4813#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:31,268 INFO L280 TraceCheckUtils]: 80: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,268 INFO L280 TraceCheckUtils]: 81: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,268 INFO L280 TraceCheckUtils]: 82: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,269 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {4762#true} {4813#(<= (+ main_~in~0 2) main_~inlen~0)} #88#return; {4813#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:31,270 INFO L280 TraceCheckUtils]: 84: Hoare triple {4813#(<= (+ main_~in~0 2) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4813#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:31,270 INFO L280 TraceCheckUtils]: 85: Hoare triple {4813#(<= (+ main_~in~0 2) main_~inlen~0)} assume !!(0 != #t~nondet2);havoc #t~nondet2; {4813#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:31,271 INFO L280 TraceCheckUtils]: 86: Hoare triple {4813#(<= (+ main_~in~0 2) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {4813#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:31,271 INFO L263 TraceCheckUtils]: 87: Hoare triple {4813#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:31,271 INFO L280 TraceCheckUtils]: 88: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,272 INFO L280 TraceCheckUtils]: 89: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,272 INFO L280 TraceCheckUtils]: 90: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,273 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {4762#true} {4813#(<= (+ main_~in~0 2) main_~inlen~0)} #82#return; {4813#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:31,273 INFO L263 TraceCheckUtils]: 92: Hoare triple {4813#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:31,273 INFO L280 TraceCheckUtils]: 93: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,273 INFO L280 TraceCheckUtils]: 94: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,274 INFO L280 TraceCheckUtils]: 95: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,275 INFO L275 TraceCheckUtils]: 96: Hoare quadruple {4762#true} {4813#(<= (+ main_~in~0 2) main_~inlen~0)} #84#return; {4813#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:31,275 INFO L280 TraceCheckUtils]: 97: Hoare triple {4813#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {4813#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 12:47:31,276 INFO L280 TraceCheckUtils]: 98: Hoare triple {4813#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {4830#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 12:47:31,276 INFO L263 TraceCheckUtils]: 99: Hoare triple {4830#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:31,276 INFO L280 TraceCheckUtils]: 100: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:31,277 INFO L280 TraceCheckUtils]: 101: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:31,277 INFO L280 TraceCheckUtils]: 102: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:31,278 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {4762#true} {4830#(<= (+ main_~in~0 1) main_~inlen~0)} #86#return; {4830#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 12:47:31,279 INFO L263 TraceCheckUtils]: 104: Hoare triple {4830#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {4835#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:31,279 INFO L280 TraceCheckUtils]: 105: Hoare triple {4835#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4836#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:31,280 INFO L280 TraceCheckUtils]: 106: Hoare triple {4836#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4763#false} is VALID [2020-07-08 12:47:31,280 INFO L280 TraceCheckUtils]: 107: Hoare triple {4763#false} assume !false; {4763#false} is VALID [2020-07-08 12:47:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 30 proven. 48 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2020-07-08 12:47:31,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441305606] [2020-07-08 12:47:31,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941895888] [2020-07-08 12:47:31,311 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:31,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-07-08 12:47:31,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:47:31,374 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-08 12:47:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:31,420 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:32,062 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:47:32,072 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:47:32,128 INFO L263 TraceCheckUtils]: 0: Hoare triple {4762#true} call ULTIMATE.init(); {4762#true} is VALID [2020-07-08 12:47:32,129 INFO L280 TraceCheckUtils]: 1: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:32,129 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4762#true} {4762#true} #78#return; {4762#true} is VALID [2020-07-08 12:47:32,129 INFO L263 TraceCheckUtils]: 3: Hoare triple {4762#true} call #t~ret7 := main(); {4762#true} is VALID [2020-07-08 12:47:32,129 INFO L280 TraceCheckUtils]: 4: Hoare triple {4762#true} havoc ~in~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~inlen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufferlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~buf~0;havoc ~buflim~0; {4762#true} is VALID [2020-07-08 12:47:32,129 INFO L280 TraceCheckUtils]: 5: Hoare triple {4762#true} assume ~bufferlen~0 > 1; {4762#true} is VALID [2020-07-08 12:47:32,130 INFO L280 TraceCheckUtils]: 6: Hoare triple {4762#true} assume ~inlen~0 > 0; {4762#true} is VALID [2020-07-08 12:47:32,130 INFO L280 TraceCheckUtils]: 7: Hoare triple {4762#true} assume ~bufferlen~0 < ~inlen~0; {4861#(< main_~bufferlen~0 main_~inlen~0)} is VALID [2020-07-08 12:47:32,131 INFO L280 TraceCheckUtils]: 8: Hoare triple {4861#(< main_~bufferlen~0 main_~inlen~0)} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {4865#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 0 main_~buf~0))} is VALID [2020-07-08 12:47:32,132 INFO L280 TraceCheckUtils]: 9: Hoare triple {4865#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 0 main_~buf~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4865#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 0 main_~buf~0))} is VALID [2020-07-08 12:47:32,132 INFO L280 TraceCheckUtils]: 10: Hoare triple {4865#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 0 main_~buf~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {4865#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 0 main_~buf~0))} is VALID [2020-07-08 12:47:32,133 INFO L280 TraceCheckUtils]: 11: Hoare triple {4865#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 0 main_~buf~0))} assume !(~buf~0 == ~buflim~0); {4865#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 0 main_~buf~0))} is VALID [2020-07-08 12:47:32,133 INFO L263 TraceCheckUtils]: 12: Hoare triple {4865#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 0 main_~buf~0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:32,133 INFO L280 TraceCheckUtils]: 13: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:32,134 INFO L280 TraceCheckUtils]: 14: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:32,134 INFO L280 TraceCheckUtils]: 15: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:32,135 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {4762#true} {4865#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 0 main_~buf~0))} #82#return; {4865#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 0 main_~buf~0))} is VALID [2020-07-08 12:47:32,135 INFO L263 TraceCheckUtils]: 17: Hoare triple {4865#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 0 main_~buf~0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:32,135 INFO L280 TraceCheckUtils]: 18: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:32,135 INFO L280 TraceCheckUtils]: 19: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:32,135 INFO L280 TraceCheckUtils]: 20: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:32,136 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {4762#true} {4865#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 0 main_~buf~0))} #84#return; {4865#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 0 main_~buf~0))} is VALID [2020-07-08 12:47:32,137 INFO L280 TraceCheckUtils]: 22: Hoare triple {4865#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 0 main_~buf~0))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {4908#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 1 main_~buf~0))} is VALID [2020-07-08 12:47:32,138 INFO L280 TraceCheckUtils]: 23: Hoare triple {4908#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 0) (<= 1 main_~buf~0))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} is VALID [2020-07-08 12:47:32,138 INFO L263 TraceCheckUtils]: 24: Hoare triple {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:32,139 INFO L280 TraceCheckUtils]: 25: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:32,139 INFO L280 TraceCheckUtils]: 26: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:32,139 INFO L280 TraceCheckUtils]: 27: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:32,140 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4762#true} {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} #86#return; {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} is VALID [2020-07-08 12:47:32,140 INFO L263 TraceCheckUtils]: 29: Hoare triple {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:32,140 INFO L280 TraceCheckUtils]: 30: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:32,140 INFO L280 TraceCheckUtils]: 31: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:32,140 INFO L280 TraceCheckUtils]: 32: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:32,141 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {4762#true} {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} #88#return; {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} is VALID [2020-07-08 12:47:32,142 INFO L280 TraceCheckUtils]: 34: Hoare triple {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} is VALID [2020-07-08 12:47:32,143 INFO L280 TraceCheckUtils]: 35: Hoare triple {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} is VALID [2020-07-08 12:47:32,143 INFO L280 TraceCheckUtils]: 36: Hoare triple {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} assume !(~buf~0 == ~buflim~0); {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} is VALID [2020-07-08 12:47:32,143 INFO L263 TraceCheckUtils]: 37: Hoare triple {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:32,144 INFO L280 TraceCheckUtils]: 38: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:32,144 INFO L280 TraceCheckUtils]: 39: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:32,144 INFO L280 TraceCheckUtils]: 40: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:32,145 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {4762#true} {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} #82#return; {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} is VALID [2020-07-08 12:47:32,145 INFO L263 TraceCheckUtils]: 42: Hoare triple {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:32,145 INFO L280 TraceCheckUtils]: 43: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:32,145 INFO L280 TraceCheckUtils]: 44: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:32,145 INFO L280 TraceCheckUtils]: 45: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:32,146 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {4762#true} {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} #84#return; {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} is VALID [2020-07-08 12:47:32,147 INFO L280 TraceCheckUtils]: 47: Hoare triple {4912#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 1 main_~buf~0))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {4985#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 2 main_~buf~0))} is VALID [2020-07-08 12:47:32,148 INFO L280 TraceCheckUtils]: 48: Hoare triple {4985#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 1) (<= 2 main_~buf~0))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} is VALID [2020-07-08 12:47:32,148 INFO L263 TraceCheckUtils]: 49: Hoare triple {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:32,148 INFO L280 TraceCheckUtils]: 50: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:32,149 INFO L280 TraceCheckUtils]: 51: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:32,149 INFO L280 TraceCheckUtils]: 52: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:32,150 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {4762#true} {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} #86#return; {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} is VALID [2020-07-08 12:47:32,150 INFO L263 TraceCheckUtils]: 54: Hoare triple {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:32,150 INFO L280 TraceCheckUtils]: 55: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:32,150 INFO L280 TraceCheckUtils]: 56: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:32,150 INFO L280 TraceCheckUtils]: 57: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:32,151 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {4762#true} {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} #88#return; {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} is VALID [2020-07-08 12:47:32,152 INFO L280 TraceCheckUtils]: 59: Hoare triple {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} is VALID [2020-07-08 12:47:32,153 INFO L280 TraceCheckUtils]: 60: Hoare triple {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} is VALID [2020-07-08 12:47:32,153 INFO L280 TraceCheckUtils]: 61: Hoare triple {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} assume !(~buf~0 == ~buflim~0); {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} is VALID [2020-07-08 12:47:32,154 INFO L263 TraceCheckUtils]: 62: Hoare triple {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:32,154 INFO L280 TraceCheckUtils]: 63: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:32,154 INFO L280 TraceCheckUtils]: 64: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:32,154 INFO L280 TraceCheckUtils]: 65: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:32,155 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {4762#true} {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} #82#return; {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} is VALID [2020-07-08 12:47:32,155 INFO L263 TraceCheckUtils]: 67: Hoare triple {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:32,156 INFO L280 TraceCheckUtils]: 68: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:32,156 INFO L280 TraceCheckUtils]: 69: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:32,156 INFO L280 TraceCheckUtils]: 70: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:32,157 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {4762#true} {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} #84#return; {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} is VALID [2020-07-08 12:47:32,158 INFO L280 TraceCheckUtils]: 72: Hoare triple {4989#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 2 main_~buf~0))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {5062#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 3 main_~buf~0))} is VALID [2020-07-08 12:47:32,159 INFO L280 TraceCheckUtils]: 73: Hoare triple {5062#(and (< main_~bufferlen~0 main_~inlen~0) (<= main_~in~0 2) (<= 3 main_~buf~0))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} is VALID [2020-07-08 12:47:32,159 INFO L263 TraceCheckUtils]: 74: Hoare triple {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:32,159 INFO L280 TraceCheckUtils]: 75: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:32,159 INFO L280 TraceCheckUtils]: 76: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:32,159 INFO L280 TraceCheckUtils]: 77: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:32,160 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {4762#true} {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} #86#return; {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} is VALID [2020-07-08 12:47:32,161 INFO L263 TraceCheckUtils]: 79: Hoare triple {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:32,161 INFO L280 TraceCheckUtils]: 80: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:32,161 INFO L280 TraceCheckUtils]: 81: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:32,161 INFO L280 TraceCheckUtils]: 82: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:32,162 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {4762#true} {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} #88#return; {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} is VALID [2020-07-08 12:47:32,163 INFO L280 TraceCheckUtils]: 84: Hoare triple {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} is VALID [2020-07-08 12:47:32,164 INFO L280 TraceCheckUtils]: 85: Hoare triple {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2; {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} is VALID [2020-07-08 12:47:32,164 INFO L280 TraceCheckUtils]: 86: Hoare triple {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} assume !(~buf~0 == ~buflim~0); {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} is VALID [2020-07-08 12:47:32,165 INFO L263 TraceCheckUtils]: 87: Hoare triple {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:32,165 INFO L280 TraceCheckUtils]: 88: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:32,165 INFO L280 TraceCheckUtils]: 89: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:32,165 INFO L280 TraceCheckUtils]: 90: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:32,166 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {4762#true} {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} #82#return; {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} is VALID [2020-07-08 12:47:32,166 INFO L263 TraceCheckUtils]: 92: Hoare triple {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:32,167 INFO L280 TraceCheckUtils]: 93: Hoare triple {4762#true} ~cond := #in~cond; {5127#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:47:32,167 INFO L280 TraceCheckUtils]: 94: Hoare triple {5127#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4835#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:32,168 INFO L280 TraceCheckUtils]: 95: Hoare triple {4835#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {4835#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:32,169 INFO L275 TraceCheckUtils]: 96: Hoare quadruple {4835#(not (= 0 |__VERIFIER_assert_#in~cond|))} {5066#(and (<= main_~in~0 3) (< main_~bufferlen~0 main_~inlen~0) (<= 3 main_~buf~0))} #84#return; {5137#(and (<= main_~in~0 3) (<= 5 main_~inlen~0))} is VALID [2020-07-08 12:47:32,170 INFO L280 TraceCheckUtils]: 97: Hoare triple {5137#(and (<= main_~in~0 3) (<= 5 main_~inlen~0))} #t~post3 := ~buf~0;~buf~0 := 1 + #t~post3;havoc #t~post3; {5137#(and (<= main_~in~0 3) (<= 5 main_~inlen~0))} is VALID [2020-07-08 12:47:32,171 INFO L280 TraceCheckUtils]: 98: Hoare triple {5137#(and (<= main_~in~0 3) (<= 5 main_~inlen~0))} #t~post4 := ~in~0;~in~0 := 1 + #t~post4;havoc #t~post4; {5144#(and (<= main_~in~0 4) (<= 5 main_~inlen~0))} is VALID [2020-07-08 12:47:32,171 INFO L263 TraceCheckUtils]: 99: Hoare triple {5144#(and (<= main_~in~0 4) (<= 5 main_~inlen~0))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {4762#true} is VALID [2020-07-08 12:47:32,171 INFO L280 TraceCheckUtils]: 100: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2020-07-08 12:47:32,171 INFO L280 TraceCheckUtils]: 101: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2020-07-08 12:47:32,172 INFO L280 TraceCheckUtils]: 102: Hoare triple {4762#true} assume true; {4762#true} is VALID [2020-07-08 12:47:32,172 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {4762#true} {5144#(and (<= main_~in~0 4) (<= 5 main_~inlen~0))} #86#return; {5144#(and (<= main_~in~0 4) (<= 5 main_~inlen~0))} is VALID [2020-07-08 12:47:32,173 INFO L263 TraceCheckUtils]: 104: Hoare triple {5144#(and (<= main_~in~0 4) (<= 5 main_~inlen~0))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {5163#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:47:32,174 INFO L280 TraceCheckUtils]: 105: Hoare triple {5163#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5167#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:47:32,175 INFO L280 TraceCheckUtils]: 106: Hoare triple {5167#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4763#false} is VALID [2020-07-08 12:47:32,175 INFO L280 TraceCheckUtils]: 107: Hoare triple {4763#false} assume !false; {4763#false} is VALID [2020-07-08 12:47:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2020-07-08 12:47:32,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:32,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 26 [2020-07-08 12:47:32,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437839945] [2020-07-08 12:47:32,193 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 108 [2020-07-08 12:47:32,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:32,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2020-07-08 12:47:32,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:32,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-07-08 12:47:32,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:32,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-07-08 12:47:32,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2020-07-08 12:47:32,364 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 26 states. [2020-07-08 12:47:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:36,404 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2020-07-08 12:47:36,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-08 12:47:36,404 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 108 [2020-07-08 12:47:36,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-08 12:47:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 91 transitions. [2020-07-08 12:47:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-08 12:47:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 91 transitions. [2020-07-08 12:47:36,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 91 transitions. [2020-07-08 12:47:36,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:36,554 INFO L225 Difference]: With dead ends: 111 [2020-07-08 12:47:36,554 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:47:36,557 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=366, Invalid=1796, Unknown=0, NotChecked=0, Total=2162 [2020-07-08 12:47:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:47:36,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:47:36,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:36,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:36,558 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:36,559 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:36,559 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:47:36,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:47:36,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:36,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:36,559 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:36,560 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:36,560 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:47:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:47:36,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:36,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:36,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:36,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:47:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:47:36,561 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2020-07-08 12:47:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:36,561 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:47:36,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-07-08 12:47:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:47:36,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:36,771 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-08 12:47:36,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:47:37,488 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:47:37,488 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:47:37,488 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:47:37,488 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:47:37,488 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:47:37,489 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:47:37,489 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:47:37,489 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 12:47:37,489 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:47:37,489 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:47:37,489 INFO L268 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2020-07-08 12:47:37,489 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 45) no Hoare annotation was computed. [2020-07-08 12:47:37,489 INFO L271 CegarLoopResult]: At program point L44(lines 14 45) the Hoare annotation is: true [2020-07-08 12:47:37,490 INFO L264 CegarLoopResult]: At program point L36(lines 26 37) the Hoare annotation is: (let ((.cse0 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse1 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= main_~in~0 0) (= 0 main_~buf~0) (<= 0 main_~in~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) .cse0 .cse1) (and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0) (<= 1 main_~in~0) .cse0 .cse1 (<= 0 main_~buf~0)))) [2020-07-08 12:47:37,490 INFO L268 CegarLoopResult]: For program point L28(lines 28 29) no Hoare annotation was computed. [2020-07-08 12:47:37,490 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-08 12:47:37,490 INFO L268 CegarLoopResult]: For program point L20-1(lines 14 45) no Hoare annotation was computed. [2020-07-08 12:47:37,490 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= 0 main_~in~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-08 12:47:37,490 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= 0 main_~in~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-08 12:47:37,490 INFO L268 CegarLoopResult]: For program point L33(lines 33 34) no Hoare annotation was computed. [2020-07-08 12:47:37,491 INFO L268 CegarLoopResult]: For program point L21(lines 14 45) no Hoare annotation was computed. [2020-07-08 12:47:37,491 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 45) no Hoare annotation was computed. [2020-07-08 12:47:37,491 INFO L268 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2020-07-08 12:47:37,491 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0)) [2020-07-08 12:47:37,491 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (let ((.cse0 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse1 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) .cse0 (<= 1 main_~in~0) .cse1 .cse2 (<= 0 main_~buf~0)) (and (<= main_~in~0 0) (= 0 main_~buf~0) (<= 0 main_~in~0) .cse0 .cse1 .cse2))) [2020-07-08 12:47:37,491 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 45) the Hoare annotation is: true [2020-07-08 12:47:37,492 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (let ((.cse0 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse1 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) .cse0 (<= 1 main_~in~0) .cse1 .cse2 (<= 0 main_~buf~0)) (and (<= main_~in~0 0) (= 0 main_~buf~0) (<= 0 main_~in~0) .cse0 .cse1 .cse2))) [2020-07-08 12:47:37,492 INFO L268 CegarLoopResult]: For program point L26-1(lines 26 37) no Hoare annotation was computed. [2020-07-08 12:47:37,492 INFO L264 CegarLoopResult]: At program point L26-3(lines 26 37) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0)) [2020-07-08 12:47:37,492 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-08 12:47:37,492 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-07-08 12:47:37,492 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0) (<= 1 main_~in~0) (= main_~bufferlen~0 (+ main_~buflim~0 2)) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 0 main_~buf~0)) [2020-07-08 12:47:37,493 INFO L264 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0) (<= 1 main_~in~0) (= main_~bufferlen~0 (+ main_~buflim~0 2)) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 0 main_~buf~0)) [2020-07-08 12:47:37,493 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 12:47:37,493 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-08 12:47:37,493 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-08 12:47:37,493 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-08 12:47:37,493 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-08 12:47:37,494 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-08 12:47:37,499 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:47:37,499 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:47:37,499 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 12:47:37,499 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:47:37,499 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:47:37,499 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:47:37,500 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:47:37,500 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:47:37,500 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 12:47:37,500 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 12:47:37,500 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:47:37,500 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:47:37,501 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:47:37,501 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 12:47:37,501 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-08 12:47:37,501 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-08 12:47:37,501 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:47:37,501 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:47:37,501 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:47:37,501 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-08 12:47:37,502 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 12:47:37,502 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 12:47:37,502 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:47:37,502 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:47:37,502 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:47:37,502 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:47:37,502 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:47:37,502 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:47:37,503 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:47:37,503 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:47:37,503 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:47:37,503 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:47:37,503 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:47:37,503 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-08 12:47:37,503 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-08 12:47:37,507 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 12:47:37,508 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 12:47:37,508 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 12:47:37,508 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-08 12:47:37,508 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-08 12:47:37,508 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 12:47:37,508 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 12:47:37,508 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 12:47:37,508 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-08 12:47:37,509 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-08 12:47:37,509 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:47:37,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:47:37 BoogieIcfgContainer [2020-07-08 12:47:37,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:47:37,525 INFO L168 Benchmark]: Toolchain (without parser) took 23616.07 ms. Allocated memory was 145.2 MB in the beginning and 400.0 MB in the end (delta: 254.8 MB). Free memory was 103.1 MB in the beginning and 181.4 MB in the end (delta: -78.3 MB). Peak memory consumption was 176.5 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:37,526 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:47:37,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.82 ms. Allocated memory is still 145.2 MB. Free memory was 102.9 MB in the beginning and 92.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:37,527 INFO L168 Benchmark]: Boogie Preprocessor took 128.29 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 92.7 MB in the beginning and 182.6 MB in the end (delta: -89.9 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:37,527 INFO L168 Benchmark]: RCFGBuilder took 471.84 ms. Allocated memory is still 203.4 MB. Free memory was 182.6 MB in the beginning and 158.1 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:37,528 INFO L168 Benchmark]: TraceAbstraction took 22745.64 ms. Allocated memory was 203.4 MB in the beginning and 400.0 MB in the end (delta: 196.6 MB). Free memory was 157.4 MB in the beginning and 181.4 MB in the end (delta: -23.9 MB). Peak memory consumption was 172.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:37,531 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 264.82 ms. Allocated memory is still 145.2 MB. Free memory was 102.9 MB in the beginning and 92.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.29 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 92.7 MB in the beginning and 182.6 MB in the end (delta: -89.9 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 471.84 ms. Allocated memory is still 203.4 MB. Free memory was 182.6 MB in the beginning and 158.1 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22745.64 ms. Allocated memory was 203.4 MB in the beginning and 400.0 MB in the end (delta: 196.6 MB). Free memory was 157.4 MB in the beginning and 181.4 MB in the end (delta: -23.9 MB). Peak memory consumption was 172.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((in <= 0 && 0 == buf) && 0 <= in) && buf + 2 <= bufferlen) && bufferlen == buflim + 2) && bufferlen + 1 <= inlen) || (((((in + buflim + 3 <= buf + inlen && buf <= buflim) && 1 <= in) && bufferlen == buflim + 2) && bufferlen + 1 <= inlen) && 0 <= buf) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 21.9s, OverallIterations: 11, TraceHistogramMax: 16, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 448 SDtfs, 484 SDslu, 1894 SDs, 0 SdLazy, 1510 SolverSat, 552 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 708 GetRequests, 536 SyntacticMatches, 9 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 33 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 64 PreInvPairs, 113 NumberOfFragments, 282 HoareAnnotationTreeSize, 64 FomulaSimplifications, 1686 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 930 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 963 NumberOfCodeBlocks, 958 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 947 ConstructedInterpolants, 0 QuantifiedInterpolants, 253429 SizeOfPredicates, 20 NumberOfNonLiveVariables, 782 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 2741/2972 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...