/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:40:21,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:40:21,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:40:21,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:40:21,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:40:21,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:40:21,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:40:21,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:40:21,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:40:21,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:40:21,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:40:21,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:40:21,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:40:21,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:40:21,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:40:21,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:40:21,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:40:21,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:40:21,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:40:21,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:40:21,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:40:21,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:40:21,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:40:21,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:40:21,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:40:21,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:40:21,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:40:21,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:40:21,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:40:21,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:40:21,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:40:21,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:40:21,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:40:21,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:40:21,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:40:21,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:40:21,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:40:21,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:40:21,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:40:21,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:40:21,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:40:21,587 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:40:21,597 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:40:21,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:40:21,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:40:21,599 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:40:21,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:40:21,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:40:21,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:40:21,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:40:21,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:40:21,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:40:21,600 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:40:21,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:40:21,600 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:40:21,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:40:21,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:40:21,601 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:40:21,601 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:40:21,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:40:21,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:40:21,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:40:21,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:40:21,602 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:40:21,602 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 23:40:21,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:40:21,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:40:21,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:40:21,924 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:40:21,925 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:40:21,925 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 23:40:22,007 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f966aec32/71354c2f3c3e48a3bbbe469ee2a856e5/FLAG1edcae201 [2020-07-08 23:40:22,483 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:40:22,483 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-07-08 23:40:22,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f966aec32/71354c2f3c3e48a3bbbe469ee2a856e5/FLAG1edcae201 [2020-07-08 23:40:22,844 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f966aec32/71354c2f3c3e48a3bbbe469ee2a856e5 [2020-07-08 23:40:22,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:40:22,855 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:40:22,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:40:22,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:40:22,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:40:22,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:40:22" (1/1) ... [2020-07-08 23:40:22,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74465d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:22, skipping insertion in model container [2020-07-08 23:40:22,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:40:22" (1/1) ... [2020-07-08 23:40:22,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:40:22,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:40:23,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:40:23,187 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:40:23,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:40:23,243 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:40:23,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:23 WrapperNode [2020-07-08 23:40:23,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:40:23,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:40:23,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:40:23,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:40:23,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:23" (1/1) ... [2020-07-08 23:40:23,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:23" (1/1) ... [2020-07-08 23:40:23,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:23" (1/1) ... [2020-07-08 23:40:23,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:23" (1/1) ... [2020-07-08 23:40:23,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:23" (1/1) ... [2020-07-08 23:40:23,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:23" (1/1) ... [2020-07-08 23:40:23,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:23" (1/1) ... [2020-07-08 23:40:23,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:40:23,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:40:23,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:40:23,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:40:23,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:23" (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 23:40:23,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:40:23,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:40:23,474 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:40:23,474 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:40:23,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:40:23,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:40:23,475 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:40:23,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:40:23,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:40:23,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:40:23,476 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:40:23,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:40:23,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:40:23,906 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:40:23,906 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 23:40:23,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:40:23 BoogieIcfgContainer [2020-07-08 23:40:23,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:40:23,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:40:23,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:40:23,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:40:23,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:40:22" (1/3) ... [2020-07-08 23:40:23,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382368ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:40:23, skipping insertion in model container [2020-07-08 23:40:23,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:23" (2/3) ... [2020-07-08 23:40:23,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382368ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:40:23, skipping insertion in model container [2020-07-08 23:40:23,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:40:23" (3/3) ... [2020-07-08 23:40:23,919 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2020-07-08 23:40:23,930 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:40:23,938 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:40:23,950 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:40:23,973 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:40:23,973 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:40:23,973 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:40:23,973 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:40:23,974 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:40:23,974 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:40:23,974 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:40:23,974 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:40:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-07-08 23:40:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 23:40:24,003 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:24,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:24,005 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:24,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:24,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1122321079, now seen corresponding path program 1 times [2020-07-08 23:40:24,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:24,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1104557666] [2020-07-08 23:40:24,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:24,184 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-08 23:40:24,185 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {58#true} {58#true} #99#return; {58#true} is VALID [2020-07-08 23:40:24,187 INFO L263 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {58#true} is VALID [2020-07-08 23:40:24,187 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-08 23:40:24,188 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {58#true} {58#true} #99#return; {58#true} is VALID [2020-07-08 23:40:24,188 INFO L263 TraceCheckUtils]: 3: Hoare triple {58#true} call #t~ret7 := main(); {58#true} is VALID [2020-07-08 23:40:24,188 INFO L280 TraceCheckUtils]: 4: Hoare triple {58#true} havoc ~in~0; {58#true} is VALID [2020-07-08 23:40:24,189 INFO L280 TraceCheckUtils]: 5: Hoare triple {58#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {58#true} is VALID [2020-07-08 23:40:24,189 INFO L280 TraceCheckUtils]: 6: Hoare triple {58#true} ~inlen~0 := #t~nondet0; {58#true} is VALID [2020-07-08 23:40:24,190 INFO L280 TraceCheckUtils]: 7: Hoare triple {58#true} havoc #t~nondet0; {58#true} is VALID [2020-07-08 23:40:24,190 INFO L280 TraceCheckUtils]: 8: Hoare triple {58#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {58#true} is VALID [2020-07-08 23:40:24,190 INFO L280 TraceCheckUtils]: 9: Hoare triple {58#true} ~bufferlen~0 := #t~nondet1; {58#true} is VALID [2020-07-08 23:40:24,191 INFO L280 TraceCheckUtils]: 10: Hoare triple {58#true} havoc #t~nondet1; {58#true} is VALID [2020-07-08 23:40:24,191 INFO L280 TraceCheckUtils]: 11: Hoare triple {58#true} havoc ~buf~0; {58#true} is VALID [2020-07-08 23:40:24,191 INFO L280 TraceCheckUtils]: 12: Hoare triple {58#true} havoc ~buflim~0; {58#true} is VALID [2020-07-08 23:40:24,191 INFO L280 TraceCheckUtils]: 13: Hoare triple {58#true} assume ~bufferlen~0 > 1; {58#true} is VALID [2020-07-08 23:40:24,192 INFO L280 TraceCheckUtils]: 14: Hoare triple {58#true} assume ~inlen~0 > 0; {58#true} is VALID [2020-07-08 23:40:24,192 INFO L280 TraceCheckUtils]: 15: Hoare triple {58#true} assume ~bufferlen~0 < ~inlen~0; {58#true} is VALID [2020-07-08 23:40:24,192 INFO L280 TraceCheckUtils]: 16: Hoare triple {58#true} ~buf~0 := 0; {58#true} is VALID [2020-07-08 23:40:24,193 INFO L280 TraceCheckUtils]: 17: Hoare triple {58#true} ~in~0 := 0; {58#true} is VALID [2020-07-08 23:40:24,193 INFO L280 TraceCheckUtils]: 18: Hoare triple {58#true} ~buflim~0 := ~bufferlen~0 - 2; {58#true} is VALID [2020-07-08 23:40:24,195 INFO L280 TraceCheckUtils]: 19: Hoare triple {58#true} assume !true; {59#false} is VALID [2020-07-08 23:40:24,195 INFO L263 TraceCheckUtils]: 20: Hoare triple {59#false} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {59#false} is VALID [2020-07-08 23:40:24,196 INFO L280 TraceCheckUtils]: 21: Hoare triple {59#false} ~cond := #in~cond; {59#false} is VALID [2020-07-08 23:40:24,196 INFO L280 TraceCheckUtils]: 22: Hoare triple {59#false} assume 0 == ~cond; {59#false} is VALID [2020-07-08 23:40:24,197 INFO L280 TraceCheckUtils]: 23: Hoare triple {59#false} assume !false; {59#false} is VALID [2020-07-08 23:40:24,203 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 23:40:24,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1104557666] [2020-07-08 23:40:24,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:24,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 23:40:24,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223293018] [2020-07-08 23:40:24,214 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2020-07-08 23:40:24,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:24,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 23:40:24,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:24,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 23:40:24,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:24,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 23:40:24,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 23:40:24,284 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2020-07-08 23:40:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:24,458 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2020-07-08 23:40:24,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 23:40:24,458 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2020-07-08 23:40:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 23:40:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 122 transitions. [2020-07-08 23:40:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 23:40:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 122 transitions. [2020-07-08 23:40:24,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 122 transitions. [2020-07-08 23:40:24,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:24,707 INFO L225 Difference]: With dead ends: 91 [2020-07-08 23:40:24,707 INFO L226 Difference]: Without dead ends: 47 [2020-07-08 23:40:24,712 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 23:40:24,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-08 23:40:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-08 23:40:24,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:24,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-08 23:40:24,801 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-08 23:40:24,801 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-08 23:40:24,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:24,809 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-08 23:40:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-08 23:40:24,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:24,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:24,811 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-08 23:40:24,811 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-08 23:40:24,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:24,817 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-08 23:40:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-08 23:40:24,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:24,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:24,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:24,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:24,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-08 23:40:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-07-08 23:40:24,827 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2020-07-08 23:40:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:24,827 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-07-08 23:40:24,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 23:40:24,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 55 transitions. [2020-07-08 23:40:24,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-08 23:40:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 23:40:24,902 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:24,902 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:24,903 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:40:24,903 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:24,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:24,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1949391841, now seen corresponding path program 1 times [2020-07-08 23:40:24,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:24,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [540939620] [2020-07-08 23:40:24,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:25,024 INFO L280 TraceCheckUtils]: 0: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-08 23:40:25,025 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {434#true} {434#true} #99#return; {434#true} is VALID [2020-07-08 23:40:25,025 INFO L263 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2020-07-08 23:40:25,026 INFO L280 TraceCheckUtils]: 1: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-08 23:40:25,026 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {434#true} {434#true} #99#return; {434#true} is VALID [2020-07-08 23:40:25,026 INFO L263 TraceCheckUtils]: 3: Hoare triple {434#true} call #t~ret7 := main(); {434#true} is VALID [2020-07-08 23:40:25,027 INFO L280 TraceCheckUtils]: 4: Hoare triple {434#true} havoc ~in~0; {434#true} is VALID [2020-07-08 23:40:25,027 INFO L280 TraceCheckUtils]: 5: Hoare triple {434#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {434#true} is VALID [2020-07-08 23:40:25,027 INFO L280 TraceCheckUtils]: 6: Hoare triple {434#true} ~inlen~0 := #t~nondet0; {434#true} is VALID [2020-07-08 23:40:25,028 INFO L280 TraceCheckUtils]: 7: Hoare triple {434#true} havoc #t~nondet0; {434#true} is VALID [2020-07-08 23:40:25,028 INFO L280 TraceCheckUtils]: 8: Hoare triple {434#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {434#true} is VALID [2020-07-08 23:40:25,029 INFO L280 TraceCheckUtils]: 9: Hoare triple {434#true} ~bufferlen~0 := #t~nondet1; {434#true} is VALID [2020-07-08 23:40:25,030 INFO L280 TraceCheckUtils]: 10: Hoare triple {434#true} havoc #t~nondet1; {434#true} is VALID [2020-07-08 23:40:25,030 INFO L280 TraceCheckUtils]: 11: Hoare triple {434#true} havoc ~buf~0; {434#true} is VALID [2020-07-08 23:40:25,030 INFO L280 TraceCheckUtils]: 12: Hoare triple {434#true} havoc ~buflim~0; {434#true} is VALID [2020-07-08 23:40:25,030 INFO L280 TraceCheckUtils]: 13: Hoare triple {434#true} assume ~bufferlen~0 > 1; {434#true} is VALID [2020-07-08 23:40:25,031 INFO L280 TraceCheckUtils]: 14: Hoare triple {434#true} assume ~inlen~0 > 0; {434#true} is VALID [2020-07-08 23:40:25,031 INFO L280 TraceCheckUtils]: 15: Hoare triple {434#true} assume ~bufferlen~0 < ~inlen~0; {434#true} is VALID [2020-07-08 23:40:25,033 INFO L280 TraceCheckUtils]: 16: Hoare triple {434#true} ~buf~0 := 0; {438#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:25,034 INFO L280 TraceCheckUtils]: 17: Hoare triple {438#(<= 0 main_~buf~0)} ~in~0 := 0; {438#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:25,036 INFO L280 TraceCheckUtils]: 18: Hoare triple {438#(<= 0 main_~buf~0)} ~buflim~0 := ~bufferlen~0 - 2; {438#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:25,037 INFO L280 TraceCheckUtils]: 19: Hoare triple {438#(<= 0 main_~buf~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {438#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:25,037 INFO L280 TraceCheckUtils]: 20: Hoare triple {438#(<= 0 main_~buf~0)} assume !(0 != #t~nondet2); {438#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:25,039 INFO L280 TraceCheckUtils]: 21: Hoare triple {438#(<= 0 main_~buf~0)} havoc #t~nondet2; {438#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:25,042 INFO L263 TraceCheckUtils]: 22: Hoare triple {438#(<= 0 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {439#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:25,047 INFO L280 TraceCheckUtils]: 23: Hoare triple {439#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {440#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:25,048 INFO L280 TraceCheckUtils]: 24: Hoare triple {440#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {435#false} is VALID [2020-07-08 23:40:25,048 INFO L280 TraceCheckUtils]: 25: Hoare triple {435#false} assume !false; {435#false} is VALID [2020-07-08 23:40:25,050 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 23:40:25,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [540939620] [2020-07-08 23:40:25,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:25,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:40:25,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303461867] [2020-07-08 23:40:25,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-08 23:40:25,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:25,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:40:25,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:25,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:40:25,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:25,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:40:25,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:40:25,092 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 5 states. [2020-07-08 23:40:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:25,432 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2020-07-08 23:40:25,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:40:25,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-08 23:40:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:40:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-08 23:40:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:40:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-08 23:40:25,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2020-07-08 23:40:25,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:25,543 INFO L225 Difference]: With dead ends: 66 [2020-07-08 23:40:25,543 INFO L226 Difference]: Without dead ends: 64 [2020-07-08 23:40:25,544 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 23:40:25,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-08 23:40:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2020-07-08 23:40:25,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:25,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 58 states. [2020-07-08 23:40:25,593 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 58 states. [2020-07-08 23:40:25,593 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 58 states. [2020-07-08 23:40:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:25,600 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2020-07-08 23:40:25,601 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2020-07-08 23:40:25,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:25,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:25,603 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 64 states. [2020-07-08 23:40:25,603 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 64 states. [2020-07-08 23:40:25,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:25,610 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2020-07-08 23:40:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2020-07-08 23:40:25,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:25,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:25,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:25,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-08 23:40:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2020-07-08 23:40:25,617 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 26 [2020-07-08 23:40:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:25,618 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2020-07-08 23:40:25,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:40:25,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 69 transitions. [2020-07-08 23:40:25,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:25,712 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-07-08 23:40:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 23:40:25,713 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:25,714 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-08 23:40:25,714 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:40:25,714 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:25,715 INFO L82 PathProgramCache]: Analyzing trace with hash -873076999, now seen corresponding path program 1 times [2020-07-08 23:40:25,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:25,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1934013697] [2020-07-08 23:40:25,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:25,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-08 23:40:25,821 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {821#true} {821#true} #99#return; {821#true} is VALID [2020-07-08 23:40:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:25,830 INFO L280 TraceCheckUtils]: 0: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2020-07-08 23:40:25,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2020-07-08 23:40:25,831 INFO L280 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-08 23:40:25,832 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {821#true} {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:25,832 INFO L263 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2020-07-08 23:40:25,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-08 23:40:25,833 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {821#true} {821#true} #99#return; {821#true} is VALID [2020-07-08 23:40:25,833 INFO L263 TraceCheckUtils]: 3: Hoare triple {821#true} call #t~ret7 := main(); {821#true} is VALID [2020-07-08 23:40:25,833 INFO L280 TraceCheckUtils]: 4: Hoare triple {821#true} havoc ~in~0; {821#true} is VALID [2020-07-08 23:40:25,834 INFO L280 TraceCheckUtils]: 5: Hoare triple {821#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {821#true} is VALID [2020-07-08 23:40:25,834 INFO L280 TraceCheckUtils]: 6: Hoare triple {821#true} ~inlen~0 := #t~nondet0; {821#true} is VALID [2020-07-08 23:40:25,834 INFO L280 TraceCheckUtils]: 7: Hoare triple {821#true} havoc #t~nondet0; {821#true} is VALID [2020-07-08 23:40:25,835 INFO L280 TraceCheckUtils]: 8: Hoare triple {821#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {821#true} is VALID [2020-07-08 23:40:25,835 INFO L280 TraceCheckUtils]: 9: Hoare triple {821#true} ~bufferlen~0 := #t~nondet1; {821#true} is VALID [2020-07-08 23:40:25,835 INFO L280 TraceCheckUtils]: 10: Hoare triple {821#true} havoc #t~nondet1; {821#true} is VALID [2020-07-08 23:40:25,836 INFO L280 TraceCheckUtils]: 11: Hoare triple {821#true} havoc ~buf~0; {821#true} is VALID [2020-07-08 23:40:25,836 INFO L280 TraceCheckUtils]: 12: Hoare triple {821#true} havoc ~buflim~0; {821#true} is VALID [2020-07-08 23:40:25,837 INFO L280 TraceCheckUtils]: 13: Hoare triple {821#true} assume ~bufferlen~0 > 1; {825#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:25,838 INFO L280 TraceCheckUtils]: 14: Hoare triple {825#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {825#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:25,838 INFO L280 TraceCheckUtils]: 15: Hoare triple {825#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {825#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:25,839 INFO L280 TraceCheckUtils]: 16: Hoare triple {825#(<= 2 main_~bufferlen~0)} ~buf~0 := 0; {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:25,840 INFO L280 TraceCheckUtils]: 17: Hoare triple {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 0; {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:25,841 INFO L280 TraceCheckUtils]: 18: Hoare triple {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:25,841 INFO L280 TraceCheckUtils]: 19: Hoare triple {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:25,842 INFO L280 TraceCheckUtils]: 20: Hoare triple {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(0 != #t~nondet2); {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:25,843 INFO L280 TraceCheckUtils]: 21: Hoare triple {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~nondet2; {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:25,843 INFO L263 TraceCheckUtils]: 22: Hoare triple {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {821#true} is VALID [2020-07-08 23:40:25,844 INFO L280 TraceCheckUtils]: 23: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2020-07-08 23:40:25,844 INFO L280 TraceCheckUtils]: 24: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2020-07-08 23:40:25,844 INFO L280 TraceCheckUtils]: 25: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-08 23:40:25,845 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {821#true} {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:25,847 INFO L263 TraceCheckUtils]: 27: Hoare triple {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {831#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:25,847 INFO L280 TraceCheckUtils]: 28: Hoare triple {831#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {832#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:25,848 INFO L280 TraceCheckUtils]: 29: Hoare triple {832#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {822#false} is VALID [2020-07-08 23:40:25,849 INFO L280 TraceCheckUtils]: 30: Hoare triple {822#false} assume !false; {822#false} is VALID [2020-07-08 23:40:25,851 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 23:40:25,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1934013697] [2020-07-08 23:40:25,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:25,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 23:40:25,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249947631] [2020-07-08 23:40:25,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-08 23:40:25,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:25,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 23:40:25,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:25,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 23:40:25,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:25,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 23:40:25,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:40:25,888 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 6 states. [2020-07-08 23:40:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:26,333 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2020-07-08 23:40:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 23:40:26,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-08 23:40:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:40:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2020-07-08 23:40:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:40:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2020-07-08 23:40:26,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2020-07-08 23:40:26,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:26,432 INFO L225 Difference]: With dead ends: 70 [2020-07-08 23:40:26,432 INFO L226 Difference]: Without dead ends: 68 [2020-07-08 23:40:26,433 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 23:40:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-08 23:40:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2020-07-08 23:40:26,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:26,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 64 states. [2020-07-08 23:40:26,508 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 64 states. [2020-07-08 23:40:26,508 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 64 states. [2020-07-08 23:40:26,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:26,515 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2020-07-08 23:40:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2020-07-08 23:40:26,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:26,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:26,519 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 68 states. [2020-07-08 23:40:26,519 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 68 states. [2020-07-08 23:40:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:26,526 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2020-07-08 23:40:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2020-07-08 23:40:26,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:26,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:26,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:26,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-08 23:40:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2020-07-08 23:40:26,536 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 31 [2020-07-08 23:40:26,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:26,536 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2020-07-08 23:40:26,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 23:40:26,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 76 transitions. [2020-07-08 23:40:26,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:26,646 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2020-07-08 23:40:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-08 23:40:26,647 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:26,647 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:26,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:40:26,648 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:26,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:26,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2057902492, now seen corresponding path program 1 times [2020-07-08 23:40:26,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:26,650 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1025023534] [2020-07-08 23:40:26,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:26,760 INFO L280 TraceCheckUtils]: 0: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-08 23:40:26,760 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1243#true} {1243#true} #99#return; {1243#true} is VALID [2020-07-08 23:40:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:26,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-08 23:40:26,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-08 23:40:26,782 INFO L280 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-08 23:40:26,785 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #111#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:26,804 INFO L280 TraceCheckUtils]: 0: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-08 23:40:26,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-08 23:40:26,805 INFO L280 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-08 23:40:26,807 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #113#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:26,807 INFO L263 TraceCheckUtils]: 0: Hoare triple {1243#true} call ULTIMATE.init(); {1243#true} is VALID [2020-07-08 23:40:26,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-08 23:40:26,808 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1243#true} {1243#true} #99#return; {1243#true} is VALID [2020-07-08 23:40:26,808 INFO L263 TraceCheckUtils]: 3: Hoare triple {1243#true} call #t~ret7 := main(); {1243#true} is VALID [2020-07-08 23:40:26,811 INFO L280 TraceCheckUtils]: 4: Hoare triple {1243#true} havoc ~in~0; {1243#true} is VALID [2020-07-08 23:40:26,812 INFO L280 TraceCheckUtils]: 5: Hoare triple {1243#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1243#true} is VALID [2020-07-08 23:40:26,812 INFO L280 TraceCheckUtils]: 6: Hoare triple {1243#true} ~inlen~0 := #t~nondet0; {1243#true} is VALID [2020-07-08 23:40:26,812 INFO L280 TraceCheckUtils]: 7: Hoare triple {1243#true} havoc #t~nondet0; {1243#true} is VALID [2020-07-08 23:40:26,813 INFO L280 TraceCheckUtils]: 8: Hoare triple {1243#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1243#true} is VALID [2020-07-08 23:40:26,813 INFO L280 TraceCheckUtils]: 9: Hoare triple {1243#true} ~bufferlen~0 := #t~nondet1; {1243#true} is VALID [2020-07-08 23:40:26,813 INFO L280 TraceCheckUtils]: 10: Hoare triple {1243#true} havoc #t~nondet1; {1243#true} is VALID [2020-07-08 23:40:26,816 INFO L280 TraceCheckUtils]: 11: Hoare triple {1243#true} havoc ~buf~0; {1243#true} is VALID [2020-07-08 23:40:26,816 INFO L280 TraceCheckUtils]: 12: Hoare triple {1243#true} havoc ~buflim~0; {1243#true} is VALID [2020-07-08 23:40:26,816 INFO L280 TraceCheckUtils]: 13: Hoare triple {1243#true} assume ~bufferlen~0 > 1; {1243#true} is VALID [2020-07-08 23:40:26,817 INFO L280 TraceCheckUtils]: 14: Hoare triple {1243#true} assume ~inlen~0 > 0; {1243#true} is VALID [2020-07-08 23:40:26,817 INFO L280 TraceCheckUtils]: 15: Hoare triple {1243#true} assume ~bufferlen~0 < ~inlen~0; {1243#true} is VALID [2020-07-08 23:40:26,819 INFO L280 TraceCheckUtils]: 16: Hoare triple {1243#true} ~buf~0 := 0; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:26,819 INFO L280 TraceCheckUtils]: 17: Hoare triple {1247#(<= 0 main_~buf~0)} ~in~0 := 0; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:26,820 INFO L280 TraceCheckUtils]: 18: Hoare triple {1247#(<= 0 main_~buf~0)} ~buflim~0 := ~bufferlen~0 - 2; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:26,821 INFO L280 TraceCheckUtils]: 19: Hoare triple {1247#(<= 0 main_~buf~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:26,834 INFO L280 TraceCheckUtils]: 20: Hoare triple {1247#(<= 0 main_~buf~0)} assume !(0 != #t~nondet2); {1247#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:26,837 INFO L280 TraceCheckUtils]: 21: Hoare triple {1247#(<= 0 main_~buf~0)} havoc #t~nondet2; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:26,837 INFO L263 TraceCheckUtils]: 22: Hoare triple {1247#(<= 0 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1243#true} is VALID [2020-07-08 23:40:26,837 INFO L280 TraceCheckUtils]: 23: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-08 23:40:26,838 INFO L280 TraceCheckUtils]: 24: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-08 23:40:26,838 INFO L280 TraceCheckUtils]: 25: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-08 23:40:26,839 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #111#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:26,839 INFO L263 TraceCheckUtils]: 27: Hoare triple {1247#(<= 0 main_~buf~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1243#true} is VALID [2020-07-08 23:40:26,840 INFO L280 TraceCheckUtils]: 28: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-08 23:40:26,840 INFO L280 TraceCheckUtils]: 29: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-08 23:40:26,840 INFO L280 TraceCheckUtils]: 30: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-08 23:40:26,842 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #113#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:26,842 INFO L280 TraceCheckUtils]: 32: Hoare triple {1247#(<= 0 main_~buf~0)} #t~post5 := ~buf~0; {1256#(<= 0 |main_#t~post5|)} is VALID [2020-07-08 23:40:26,843 INFO L280 TraceCheckUtils]: 33: Hoare triple {1256#(<= 0 |main_#t~post5|)} ~buf~0 := 1 + #t~post5; {1257#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:26,844 INFO L280 TraceCheckUtils]: 34: Hoare triple {1257#(<= 1 main_~buf~0)} havoc #t~post5; {1257#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:26,845 INFO L263 TraceCheckUtils]: 35: Hoare triple {1257#(<= 1 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1258#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:26,846 INFO L280 TraceCheckUtils]: 36: Hoare triple {1258#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1259#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:26,846 INFO L280 TraceCheckUtils]: 37: Hoare triple {1259#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1244#false} is VALID [2020-07-08 23:40:26,846 INFO L280 TraceCheckUtils]: 38: Hoare triple {1244#false} assume !false; {1244#false} is VALID [2020-07-08 23:40:26,848 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 23:40:26,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1025023534] [2020-07-08 23:40:26,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:26,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 23:40:26,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469004468] [2020-07-08 23:40:26,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-07-08 23:40:26,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:26,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 23:40:26,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:26,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 23:40:26,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:26,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 23:40:26,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:40:26,891 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 7 states. [2020-07-08 23:40:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:27,401 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2020-07-08 23:40:27,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 23:40:27,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-07-08 23:40:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:40:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2020-07-08 23:40:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:40:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2020-07-08 23:40:27,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 83 transitions. [2020-07-08 23:40:27,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:27,489 INFO L225 Difference]: With dead ends: 77 [2020-07-08 23:40:27,489 INFO L226 Difference]: Without dead ends: 75 [2020-07-08 23:40:27,490 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 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 23:40:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-08 23:40:27,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2020-07-08 23:40:27,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:27,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 72 states. [2020-07-08 23:40:27,577 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 72 states. [2020-07-08 23:40:27,577 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 72 states. [2020-07-08 23:40:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:27,582 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2020-07-08 23:40:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2020-07-08 23:40:27,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:27,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:27,583 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 75 states. [2020-07-08 23:40:27,583 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 75 states. [2020-07-08 23:40:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:27,588 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2020-07-08 23:40:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2020-07-08 23:40:27,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:27,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:27,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:27,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-08 23:40:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2020-07-08 23:40:27,594 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 39 [2020-07-08 23:40:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:27,595 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2020-07-08 23:40:27,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 23:40:27,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 84 transitions. [2020-07-08 23:40:27,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2020-07-08 23:40:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-08 23:40:27,717 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:27,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:27,717 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:40:27,717 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:27,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:27,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1847294180, now seen corresponding path program 1 times [2020-07-08 23:40:27,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:27,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1762510752] [2020-07-08 23:40:27,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:27,881 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-08 23:40:27,881 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1716#true} {1716#true} #99#return; {1716#true} is VALID [2020-07-08 23:40:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:27,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-08 23:40:27,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-08 23:40:27,888 INFO L280 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-08 23:40:27,889 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1716#true} {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:27,903 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-08 23:40:27,903 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-08 23:40:27,903 INFO L280 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-08 23:40:27,904 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1716#true} {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #113#return; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:27,919 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-08 23:40:27,919 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-08 23:40:27,919 INFO L280 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-08 23:40:27,920 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1716#true} {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #115#return; {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,920 INFO L263 TraceCheckUtils]: 0: Hoare triple {1716#true} call ULTIMATE.init(); {1716#true} is VALID [2020-07-08 23:40:27,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-08 23:40:27,921 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1716#true} {1716#true} #99#return; {1716#true} is VALID [2020-07-08 23:40:27,921 INFO L263 TraceCheckUtils]: 3: Hoare triple {1716#true} call #t~ret7 := main(); {1716#true} is VALID [2020-07-08 23:40:27,921 INFO L280 TraceCheckUtils]: 4: Hoare triple {1716#true} havoc ~in~0; {1716#true} is VALID [2020-07-08 23:40:27,921 INFO L280 TraceCheckUtils]: 5: Hoare triple {1716#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1716#true} is VALID [2020-07-08 23:40:27,921 INFO L280 TraceCheckUtils]: 6: Hoare triple {1716#true} ~inlen~0 := #t~nondet0; {1716#true} is VALID [2020-07-08 23:40:27,921 INFO L280 TraceCheckUtils]: 7: Hoare triple {1716#true} havoc #t~nondet0; {1716#true} is VALID [2020-07-08 23:40:27,922 INFO L280 TraceCheckUtils]: 8: Hoare triple {1716#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1716#true} is VALID [2020-07-08 23:40:27,922 INFO L280 TraceCheckUtils]: 9: Hoare triple {1716#true} ~bufferlen~0 := #t~nondet1; {1716#true} is VALID [2020-07-08 23:40:27,922 INFO L280 TraceCheckUtils]: 10: Hoare triple {1716#true} havoc #t~nondet1; {1716#true} is VALID [2020-07-08 23:40:27,922 INFO L280 TraceCheckUtils]: 11: Hoare triple {1716#true} havoc ~buf~0; {1716#true} is VALID [2020-07-08 23:40:27,922 INFO L280 TraceCheckUtils]: 12: Hoare triple {1716#true} havoc ~buflim~0; {1716#true} is VALID [2020-07-08 23:40:27,923 INFO L280 TraceCheckUtils]: 13: Hoare triple {1716#true} assume ~bufferlen~0 > 1; {1720#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,923 INFO L280 TraceCheckUtils]: 14: Hoare triple {1720#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {1720#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,924 INFO L280 TraceCheckUtils]: 15: Hoare triple {1720#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {1720#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,924 INFO L280 TraceCheckUtils]: 16: Hoare triple {1720#(<= 2 main_~bufferlen~0)} ~buf~0 := 0; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,925 INFO L280 TraceCheckUtils]: 17: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 0; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,925 INFO L280 TraceCheckUtils]: 18: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,926 INFO L280 TraceCheckUtils]: 19: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,926 INFO L280 TraceCheckUtils]: 20: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(0 != #t~nondet2); {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,927 INFO L280 TraceCheckUtils]: 21: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~nondet2; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,927 INFO L263 TraceCheckUtils]: 22: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1716#true} is VALID [2020-07-08 23:40:27,927 INFO L280 TraceCheckUtils]: 23: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-08 23:40:27,927 INFO L280 TraceCheckUtils]: 24: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-08 23:40:27,928 INFO L280 TraceCheckUtils]: 25: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-08 23:40:27,928 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1716#true} {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,929 INFO L263 TraceCheckUtils]: 27: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1716#true} is VALID [2020-07-08 23:40:27,929 INFO L280 TraceCheckUtils]: 28: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-08 23:40:27,929 INFO L280 TraceCheckUtils]: 29: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-08 23:40:27,929 INFO L280 TraceCheckUtils]: 30: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-08 23:40:27,930 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1716#true} {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #113#return; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,931 INFO L280 TraceCheckUtils]: 32: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post5 := ~buf~0; {1730#(<= (+ |main_#t~post5| 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,931 INFO L280 TraceCheckUtils]: 33: Hoare triple {1730#(<= (+ |main_#t~post5| 2) main_~bufferlen~0)} ~buf~0 := 1 + #t~post5; {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,932 INFO L280 TraceCheckUtils]: 34: Hoare triple {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~post5; {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,932 INFO L263 TraceCheckUtils]: 35: Hoare triple {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1716#true} is VALID [2020-07-08 23:40:27,933 INFO L280 TraceCheckUtils]: 36: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-08 23:40:27,933 INFO L280 TraceCheckUtils]: 37: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-08 23:40:27,933 INFO L280 TraceCheckUtils]: 38: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-08 23:40:27,935 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1716#true} {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #115#return; {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:27,936 INFO L263 TraceCheckUtils]: 40: Hoare triple {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1736#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:27,936 INFO L280 TraceCheckUtils]: 41: Hoare triple {1736#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1737#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:27,937 INFO L280 TraceCheckUtils]: 42: Hoare triple {1737#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1717#false} is VALID [2020-07-08 23:40:27,937 INFO L280 TraceCheckUtils]: 43: Hoare triple {1717#false} assume !false; {1717#false} is VALID [2020-07-08 23:40:27,939 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 23:40:27,940 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1762510752] [2020-07-08 23:40:27,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:27,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 23:40:27,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342284989] [2020-07-08 23:40:27,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-07-08 23:40:27,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:27,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 23:40:27,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:27,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 23:40:27,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:27,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 23:40:27,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 23:40:27,992 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 8 states. [2020-07-08 23:40:28,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:28,603 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2020-07-08 23:40:28,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 23:40:28,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-07-08 23:40:28,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:40:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2020-07-08 23:40:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:40:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2020-07-08 23:40:28,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 83 transitions. [2020-07-08 23:40:28,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:28,703 INFO L225 Difference]: With dead ends: 81 [2020-07-08 23:40:28,704 INFO L226 Difference]: Without dead ends: 63 [2020-07-08 23:40:28,704 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-08 23:40:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-08 23:40:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-07-08 23:40:28,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:28,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2020-07-08 23:40:28,778 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2020-07-08 23:40:28,778 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2020-07-08 23:40:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:28,782 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2020-07-08 23:40:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2020-07-08 23:40:28,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:28,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:28,783 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2020-07-08 23:40:28,783 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2020-07-08 23:40:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:28,787 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2020-07-08 23:40:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2020-07-08 23:40:28,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:28,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:28,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:28,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-08 23:40:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2020-07-08 23:40:28,792 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 44 [2020-07-08 23:40:28,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:28,793 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2020-07-08 23:40:28,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 23:40:28,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 69 transitions. [2020-07-08 23:40:28,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2020-07-08 23:40:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-08 23:40:28,885 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:28,885 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:28,885 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 23:40:28,885 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:28,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:28,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1076854334, now seen corresponding path program 1 times [2020-07-08 23:40:28,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:28,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [246243685] [2020-07-08 23:40:28,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:28,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-08 23:40:28,974 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2160#true} {2160#true} #99#return; {2160#true} is VALID [2020-07-08 23:40:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:28,979 INFO L280 TraceCheckUtils]: 0: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-08 23:40:28,979 INFO L280 TraceCheckUtils]: 1: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-08 23:40:28,979 INFO L280 TraceCheckUtils]: 2: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-08 23:40:28,980 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #103#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-08 23:40:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:28,987 INFO L280 TraceCheckUtils]: 0: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-08 23:40:28,987 INFO L280 TraceCheckUtils]: 1: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-08 23:40:28,988 INFO L280 TraceCheckUtils]: 2: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-08 23:40:28,988 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #105#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-08 23:40:28,989 INFO L263 TraceCheckUtils]: 0: Hoare triple {2160#true} call ULTIMATE.init(); {2160#true} is VALID [2020-07-08 23:40:28,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-08 23:40:28,989 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2160#true} {2160#true} #99#return; {2160#true} is VALID [2020-07-08 23:40:28,989 INFO L263 TraceCheckUtils]: 3: Hoare triple {2160#true} call #t~ret7 := main(); {2160#true} is VALID [2020-07-08 23:40:28,990 INFO L280 TraceCheckUtils]: 4: Hoare triple {2160#true} havoc ~in~0; {2160#true} is VALID [2020-07-08 23:40:28,990 INFO L280 TraceCheckUtils]: 5: Hoare triple {2160#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2160#true} is VALID [2020-07-08 23:40:28,990 INFO L280 TraceCheckUtils]: 6: Hoare triple {2160#true} ~inlen~0 := #t~nondet0; {2160#true} is VALID [2020-07-08 23:40:28,990 INFO L280 TraceCheckUtils]: 7: Hoare triple {2160#true} havoc #t~nondet0; {2160#true} is VALID [2020-07-08 23:40:28,990 INFO L280 TraceCheckUtils]: 8: Hoare triple {2160#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2160#true} is VALID [2020-07-08 23:40:28,991 INFO L280 TraceCheckUtils]: 9: Hoare triple {2160#true} ~bufferlen~0 := #t~nondet1; {2160#true} is VALID [2020-07-08 23:40:28,991 INFO L280 TraceCheckUtils]: 10: Hoare triple {2160#true} havoc #t~nondet1; {2160#true} is VALID [2020-07-08 23:40:28,991 INFO L280 TraceCheckUtils]: 11: Hoare triple {2160#true} havoc ~buf~0; {2160#true} is VALID [2020-07-08 23:40:28,991 INFO L280 TraceCheckUtils]: 12: Hoare triple {2160#true} havoc ~buflim~0; {2160#true} is VALID [2020-07-08 23:40:28,992 INFO L280 TraceCheckUtils]: 13: Hoare triple {2160#true} assume ~bufferlen~0 > 1; {2160#true} is VALID [2020-07-08 23:40:28,992 INFO L280 TraceCheckUtils]: 14: Hoare triple {2160#true} assume ~inlen~0 > 0; {2160#true} is VALID [2020-07-08 23:40:28,992 INFO L280 TraceCheckUtils]: 15: Hoare triple {2160#true} assume ~bufferlen~0 < ~inlen~0; {2160#true} is VALID [2020-07-08 23:40:28,992 INFO L280 TraceCheckUtils]: 16: Hoare triple {2160#true} ~buf~0 := 0; {2160#true} is VALID [2020-07-08 23:40:28,993 INFO L280 TraceCheckUtils]: 17: Hoare triple {2160#true} ~in~0 := 0; {2164#(<= 0 main_~in~0)} is VALID [2020-07-08 23:40:28,994 INFO L280 TraceCheckUtils]: 18: Hoare triple {2164#(<= 0 main_~in~0)} ~buflim~0 := ~bufferlen~0 - 2; {2164#(<= 0 main_~in~0)} is VALID [2020-07-08 23:40:28,994 INFO L280 TraceCheckUtils]: 19: Hoare triple {2164#(<= 0 main_~in~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2164#(<= 0 main_~in~0)} is VALID [2020-07-08 23:40:28,995 INFO L280 TraceCheckUtils]: 20: Hoare triple {2164#(<= 0 main_~in~0)} assume !!(0 != #t~nondet2); {2164#(<= 0 main_~in~0)} is VALID [2020-07-08 23:40:28,996 INFO L280 TraceCheckUtils]: 21: Hoare triple {2164#(<= 0 main_~in~0)} havoc #t~nondet2; {2164#(<= 0 main_~in~0)} is VALID [2020-07-08 23:40:28,996 INFO L280 TraceCheckUtils]: 22: Hoare triple {2164#(<= 0 main_~in~0)} assume !(~buf~0 == ~buflim~0); {2164#(<= 0 main_~in~0)} is VALID [2020-07-08 23:40:28,996 INFO L263 TraceCheckUtils]: 23: Hoare triple {2164#(<= 0 main_~in~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {2160#true} is VALID [2020-07-08 23:40:28,997 INFO L280 TraceCheckUtils]: 24: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-08 23:40:28,997 INFO L280 TraceCheckUtils]: 25: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-08 23:40:28,997 INFO L280 TraceCheckUtils]: 26: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-08 23:40:28,998 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #103#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-08 23:40:28,998 INFO L263 TraceCheckUtils]: 28: Hoare triple {2164#(<= 0 main_~in~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {2160#true} is VALID [2020-07-08 23:40:28,998 INFO L280 TraceCheckUtils]: 29: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-08 23:40:28,999 INFO L280 TraceCheckUtils]: 30: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-08 23:40:28,999 INFO L280 TraceCheckUtils]: 31: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-08 23:40:29,000 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #105#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-08 23:40:29,000 INFO L280 TraceCheckUtils]: 33: Hoare triple {2164#(<= 0 main_~in~0)} #t~post3 := ~buf~0; {2164#(<= 0 main_~in~0)} is VALID [2020-07-08 23:40:29,001 INFO L280 TraceCheckUtils]: 34: Hoare triple {2164#(<= 0 main_~in~0)} ~buf~0 := 1 + #t~post3; {2164#(<= 0 main_~in~0)} is VALID [2020-07-08 23:40:29,001 INFO L280 TraceCheckUtils]: 35: Hoare triple {2164#(<= 0 main_~in~0)} havoc #t~post3; {2164#(<= 0 main_~in~0)} is VALID [2020-07-08 23:40:29,002 INFO L280 TraceCheckUtils]: 36: Hoare triple {2164#(<= 0 main_~in~0)} #t~post4 := ~in~0; {2173#(<= 0 |main_#t~post4|)} is VALID [2020-07-08 23:40:29,003 INFO L280 TraceCheckUtils]: 37: Hoare triple {2173#(<= 0 |main_#t~post4|)} ~in~0 := 1 + #t~post4; {2174#(<= 1 main_~in~0)} is VALID [2020-07-08 23:40:29,003 INFO L280 TraceCheckUtils]: 38: Hoare triple {2174#(<= 1 main_~in~0)} havoc #t~post4; {2174#(<= 1 main_~in~0)} is VALID [2020-07-08 23:40:29,004 INFO L263 TraceCheckUtils]: 39: Hoare triple {2174#(<= 1 main_~in~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {2175#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:29,005 INFO L280 TraceCheckUtils]: 40: Hoare triple {2175#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2176#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:29,006 INFO L280 TraceCheckUtils]: 41: Hoare triple {2176#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2161#false} is VALID [2020-07-08 23:40:29,007 INFO L280 TraceCheckUtils]: 42: Hoare triple {2161#false} assume !false; {2161#false} is VALID [2020-07-08 23:40:29,008 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 23:40:29,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [246243685] [2020-07-08 23:40:29,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:29,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 23:40:29,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866814995] [2020-07-08 23:40:29,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-07-08 23:40:29,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:29,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 23:40:29,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:29,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 23:40:29,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:29,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 23:40:29,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:40:29,054 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 7 states. [2020-07-08 23:40:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:29,476 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-07-08 23:40:29,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 23:40:29,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-07-08 23:40:29,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:29,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:40:29,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2020-07-08 23:40:29,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:40:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2020-07-08 23:40:29,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 73 transitions. [2020-07-08 23:40:29,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:29,563 INFO L225 Difference]: With dead ends: 72 [2020-07-08 23:40:29,563 INFO L226 Difference]: Without dead ends: 70 [2020-07-08 23:40:29,563 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 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 23:40:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-08 23:40:29,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2020-07-08 23:40:29,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:29,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 65 states. [2020-07-08 23:40:29,649 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 65 states. [2020-07-08 23:40:29,650 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 65 states. [2020-07-08 23:40:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:29,653 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-08 23:40:29,653 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-08 23:40:29,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:29,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:29,654 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 70 states. [2020-07-08 23:40:29,654 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 70 states. [2020-07-08 23:40:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:29,657 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-08 23:40:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-08 23:40:29,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:29,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:29,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:29,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-08 23:40:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2020-07-08 23:40:29,662 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 43 [2020-07-08 23:40:29,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:29,662 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2020-07-08 23:40:29,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 23:40:29,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 72 transitions. [2020-07-08 23:40:29,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2020-07-08 23:40:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 23:40:29,746 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:29,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:29,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 23:40:29,747 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:29,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:29,747 INFO L82 PathProgramCache]: Analyzing trace with hash 146364602, now seen corresponding path program 1 times [2020-07-08 23:40:29,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:29,748 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2076344346] [2020-07-08 23:40:29,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:29,897 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-08 23:40:29,898 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2599#true} {2599#true} #99#return; {2599#true} is VALID [2020-07-08 23:40:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:29,905 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-08 23:40:29,906 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-08 23:40:29,906 INFO L280 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-08 23:40:29,910 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2599#true} {2605#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:29,918 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-08 23:40:29,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-08 23:40:29,919 INFO L280 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-08 23:40:29,920 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2599#true} {2605#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:29,936 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-08 23:40:29,936 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-08 23:40:29,937 INFO L280 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-08 23:40:29,937 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2599#true} {2615#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {2615#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:29,938 INFO L263 TraceCheckUtils]: 0: Hoare triple {2599#true} call ULTIMATE.init(); {2599#true} is VALID [2020-07-08 23:40:29,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-08 23:40:29,938 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2599#true} {2599#true} #99#return; {2599#true} is VALID [2020-07-08 23:40:29,938 INFO L263 TraceCheckUtils]: 3: Hoare triple {2599#true} call #t~ret7 := main(); {2599#true} is VALID [2020-07-08 23:40:29,938 INFO L280 TraceCheckUtils]: 4: Hoare triple {2599#true} havoc ~in~0; {2599#true} is VALID [2020-07-08 23:40:29,938 INFO L280 TraceCheckUtils]: 5: Hoare triple {2599#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2599#true} is VALID [2020-07-08 23:40:29,939 INFO L280 TraceCheckUtils]: 6: Hoare triple {2599#true} ~inlen~0 := #t~nondet0; {2599#true} is VALID [2020-07-08 23:40:29,939 INFO L280 TraceCheckUtils]: 7: Hoare triple {2599#true} havoc #t~nondet0; {2599#true} is VALID [2020-07-08 23:40:29,939 INFO L280 TraceCheckUtils]: 8: Hoare triple {2599#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2599#true} is VALID [2020-07-08 23:40:29,939 INFO L280 TraceCheckUtils]: 9: Hoare triple {2599#true} ~bufferlen~0 := #t~nondet1; {2599#true} is VALID [2020-07-08 23:40:29,939 INFO L280 TraceCheckUtils]: 10: Hoare triple {2599#true} havoc #t~nondet1; {2599#true} is VALID [2020-07-08 23:40:29,939 INFO L280 TraceCheckUtils]: 11: Hoare triple {2599#true} havoc ~buf~0; {2599#true} is VALID [2020-07-08 23:40:29,940 INFO L280 TraceCheckUtils]: 12: Hoare triple {2599#true} havoc ~buflim~0; {2599#true} is VALID [2020-07-08 23:40:29,944 INFO L280 TraceCheckUtils]: 13: Hoare triple {2599#true} assume ~bufferlen~0 > 1; {2603#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:29,947 INFO L280 TraceCheckUtils]: 14: Hoare triple {2603#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {2603#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:29,948 INFO L280 TraceCheckUtils]: 15: Hoare triple {2603#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {2604#(<= 3 main_~inlen~0)} is VALID [2020-07-08 23:40:29,949 INFO L280 TraceCheckUtils]: 16: Hoare triple {2604#(<= 3 main_~inlen~0)} ~buf~0 := 0; {2604#(<= 3 main_~inlen~0)} is VALID [2020-07-08 23:40:29,950 INFO L280 TraceCheckUtils]: 17: Hoare triple {2604#(<= 3 main_~inlen~0)} ~in~0 := 0; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:29,951 INFO L280 TraceCheckUtils]: 18: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:29,952 INFO L280 TraceCheckUtils]: 19: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:29,952 INFO L280 TraceCheckUtils]: 20: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} assume !!(0 != #t~nondet2); {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:29,953 INFO L280 TraceCheckUtils]: 21: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~nondet2; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:29,954 INFO L280 TraceCheckUtils]: 22: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:29,954 INFO L263 TraceCheckUtils]: 23: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {2599#true} is VALID [2020-07-08 23:40:29,954 INFO L280 TraceCheckUtils]: 24: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-08 23:40:29,954 INFO L280 TraceCheckUtils]: 25: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-08 23:40:29,955 INFO L280 TraceCheckUtils]: 26: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-08 23:40:29,956 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2599#true} {2605#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:29,956 INFO L263 TraceCheckUtils]: 28: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {2599#true} is VALID [2020-07-08 23:40:29,956 INFO L280 TraceCheckUtils]: 29: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-08 23:40:29,956 INFO L280 TraceCheckUtils]: 30: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-08 23:40:29,956 INFO L280 TraceCheckUtils]: 31: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-08 23:40:29,957 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2599#true} {2605#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:29,958 INFO L280 TraceCheckUtils]: 33: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post3 := ~buf~0; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:29,959 INFO L280 TraceCheckUtils]: 34: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:29,959 INFO L280 TraceCheckUtils]: 35: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~post3; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:29,960 INFO L280 TraceCheckUtils]: 36: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post4 := ~in~0; {2614#(<= (+ |main_#t~post4| 3) main_~inlen~0)} is VALID [2020-07-08 23:40:29,961 INFO L280 TraceCheckUtils]: 37: Hoare triple {2614#(<= (+ |main_#t~post4| 3) main_~inlen~0)} ~in~0 := 1 + #t~post4; {2615#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:29,961 INFO L280 TraceCheckUtils]: 38: Hoare triple {2615#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~post4; {2615#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:29,962 INFO L263 TraceCheckUtils]: 39: Hoare triple {2615#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {2599#true} is VALID [2020-07-08 23:40:29,962 INFO L280 TraceCheckUtils]: 40: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-08 23:40:29,964 INFO L280 TraceCheckUtils]: 41: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-08 23:40:29,965 INFO L280 TraceCheckUtils]: 42: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-08 23:40:29,969 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2599#true} {2615#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {2615#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:29,970 INFO L263 TraceCheckUtils]: 44: Hoare triple {2615#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {2620#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:29,971 INFO L280 TraceCheckUtils]: 45: Hoare triple {2620#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2621#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:29,972 INFO L280 TraceCheckUtils]: 46: Hoare triple {2621#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2600#false} is VALID [2020-07-08 23:40:29,972 INFO L280 TraceCheckUtils]: 47: Hoare triple {2600#false} assume !false; {2600#false} is VALID [2020-07-08 23:40:29,974 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 23:40:29,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2076344346] [2020-07-08 23:40:29,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:29,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 23:40:29,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177100363] [2020-07-08 23:40:29,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-08 23:40:29,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:29,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 23:40:30,023 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 23:40:30,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 23:40:30,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:30,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 23:40:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-08 23:40:30,024 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 9 states. [2020-07-08 23:40:30,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:30,917 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2020-07-08 23:40:30,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 23:40:30,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-08 23:40:30,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:40:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2020-07-08 23:40:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:40:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2020-07-08 23:40:30,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 104 transitions. [2020-07-08 23:40:31,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:31,057 INFO L225 Difference]: With dead ends: 98 [2020-07-08 23:40:31,057 INFO L226 Difference]: Without dead ends: 96 [2020-07-08 23:40:31,058 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-07-08 23:40:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-08 23:40:31,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2020-07-08 23:40:31,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:31,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 77 states. [2020-07-08 23:40:31,199 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 77 states. [2020-07-08 23:40:31,199 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 77 states. [2020-07-08 23:40:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:31,204 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2020-07-08 23:40:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2020-07-08 23:40:31,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:31,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:31,206 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 96 states. [2020-07-08 23:40:31,206 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 96 states. [2020-07-08 23:40:31,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:31,211 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2020-07-08 23:40:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2020-07-08 23:40:31,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:31,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:31,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:31,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-08 23:40:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2020-07-08 23:40:31,216 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 48 [2020-07-08 23:40:31,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:31,217 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2020-07-08 23:40:31,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 23:40:31,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 77 states and 85 transitions. [2020-07-08 23:40:31,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-07-08 23:40:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-08 23:40:31,347 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:31,348 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:31,348 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 23:40:31,348 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:31,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:31,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1943579560, now seen corresponding path program 1 times [2020-07-08 23:40:31,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:31,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223706212] [2020-07-08 23:40:31,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:31,429 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-08 23:40:31,429 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3178#true} {3178#true} #99#return; {3178#true} is VALID [2020-07-08 23:40:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:31,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-08 23:40:31,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-08 23:40:31,434 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-08 23:40:31,435 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #103#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:31,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-08 23:40:31,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-08 23:40:31,447 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-08 23:40:31,448 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #105#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:31,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-08 23:40:31,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-08 23:40:31,453 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-08 23:40:31,454 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #107#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:31,459 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-08 23:40:31,460 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-08 23:40:31,460 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-08 23:40:31,461 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #109#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:31,461 INFO L263 TraceCheckUtils]: 0: Hoare triple {3178#true} call ULTIMATE.init(); {3178#true} is VALID [2020-07-08 23:40:31,461 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-08 23:40:31,461 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3178#true} {3178#true} #99#return; {3178#true} is VALID [2020-07-08 23:40:31,462 INFO L263 TraceCheckUtils]: 3: Hoare triple {3178#true} call #t~ret7 := main(); {3178#true} is VALID [2020-07-08 23:40:31,462 INFO L280 TraceCheckUtils]: 4: Hoare triple {3178#true} havoc ~in~0; {3178#true} is VALID [2020-07-08 23:40:31,462 INFO L280 TraceCheckUtils]: 5: Hoare triple {3178#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3178#true} is VALID [2020-07-08 23:40:31,462 INFO L280 TraceCheckUtils]: 6: Hoare triple {3178#true} ~inlen~0 := #t~nondet0; {3178#true} is VALID [2020-07-08 23:40:31,462 INFO L280 TraceCheckUtils]: 7: Hoare triple {3178#true} havoc #t~nondet0; {3178#true} is VALID [2020-07-08 23:40:31,463 INFO L280 TraceCheckUtils]: 8: Hoare triple {3178#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3178#true} is VALID [2020-07-08 23:40:31,463 INFO L280 TraceCheckUtils]: 9: Hoare triple {3178#true} ~bufferlen~0 := #t~nondet1; {3178#true} is VALID [2020-07-08 23:40:31,463 INFO L280 TraceCheckUtils]: 10: Hoare triple {3178#true} havoc #t~nondet1; {3178#true} is VALID [2020-07-08 23:40:31,463 INFO L280 TraceCheckUtils]: 11: Hoare triple {3178#true} havoc ~buf~0; {3178#true} is VALID [2020-07-08 23:40:31,464 INFO L280 TraceCheckUtils]: 12: Hoare triple {3178#true} havoc ~buflim~0; {3178#true} is VALID [2020-07-08 23:40:31,464 INFO L280 TraceCheckUtils]: 13: Hoare triple {3178#true} assume ~bufferlen~0 > 1; {3178#true} is VALID [2020-07-08 23:40:31,464 INFO L280 TraceCheckUtils]: 14: Hoare triple {3178#true} assume ~inlen~0 > 0; {3178#true} is VALID [2020-07-08 23:40:31,464 INFO L280 TraceCheckUtils]: 15: Hoare triple {3178#true} assume ~bufferlen~0 < ~inlen~0; {3178#true} is VALID [2020-07-08 23:40:31,465 INFO L280 TraceCheckUtils]: 16: Hoare triple {3178#true} ~buf~0 := 0; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:31,465 INFO L280 TraceCheckUtils]: 17: Hoare triple {3182#(<= 0 main_~buf~0)} ~in~0 := 0; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:31,466 INFO L280 TraceCheckUtils]: 18: Hoare triple {3182#(<= 0 main_~buf~0)} ~buflim~0 := ~bufferlen~0 - 2; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:31,467 INFO L280 TraceCheckUtils]: 19: Hoare triple {3182#(<= 0 main_~buf~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:31,467 INFO L280 TraceCheckUtils]: 20: Hoare triple {3182#(<= 0 main_~buf~0)} assume !!(0 != #t~nondet2); {3182#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:31,468 INFO L280 TraceCheckUtils]: 21: Hoare triple {3182#(<= 0 main_~buf~0)} havoc #t~nondet2; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:31,469 INFO L280 TraceCheckUtils]: 22: Hoare triple {3182#(<= 0 main_~buf~0)} assume !(~buf~0 == ~buflim~0); {3182#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:31,469 INFO L263 TraceCheckUtils]: 23: Hoare triple {3182#(<= 0 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3178#true} is VALID [2020-07-08 23:40:31,469 INFO L280 TraceCheckUtils]: 24: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-08 23:40:31,469 INFO L280 TraceCheckUtils]: 25: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-08 23:40:31,470 INFO L280 TraceCheckUtils]: 26: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-08 23:40:31,471 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #103#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:31,471 INFO L263 TraceCheckUtils]: 28: Hoare triple {3182#(<= 0 main_~buf~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3178#true} is VALID [2020-07-08 23:40:31,471 INFO L280 TraceCheckUtils]: 29: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-08 23:40:31,471 INFO L280 TraceCheckUtils]: 30: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-08 23:40:31,472 INFO L280 TraceCheckUtils]: 31: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-08 23:40:31,473 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #105#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:31,474 INFO L280 TraceCheckUtils]: 33: Hoare triple {3182#(<= 0 main_~buf~0)} #t~post3 := ~buf~0; {3191#(<= 0 |main_#t~post3|)} is VALID [2020-07-08 23:40:31,475 INFO L280 TraceCheckUtils]: 34: Hoare triple {3191#(<= 0 |main_#t~post3|)} ~buf~0 := 1 + #t~post3; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:31,475 INFO L280 TraceCheckUtils]: 35: Hoare triple {3192#(<= 1 main_~buf~0)} havoc #t~post3; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:31,476 INFO L280 TraceCheckUtils]: 36: Hoare triple {3192#(<= 1 main_~buf~0)} #t~post4 := ~in~0; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:31,476 INFO L280 TraceCheckUtils]: 37: Hoare triple {3192#(<= 1 main_~buf~0)} ~in~0 := 1 + #t~post4; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:31,477 INFO L280 TraceCheckUtils]: 38: Hoare triple {3192#(<= 1 main_~buf~0)} havoc #t~post4; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:31,477 INFO L263 TraceCheckUtils]: 39: Hoare triple {3192#(<= 1 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3178#true} is VALID [2020-07-08 23:40:31,477 INFO L280 TraceCheckUtils]: 40: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-08 23:40:31,478 INFO L280 TraceCheckUtils]: 41: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-08 23:40:31,478 INFO L280 TraceCheckUtils]: 42: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-08 23:40:31,479 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #107#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:31,479 INFO L263 TraceCheckUtils]: 44: Hoare triple {3192#(<= 1 main_~buf~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3178#true} is VALID [2020-07-08 23:40:31,479 INFO L280 TraceCheckUtils]: 45: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-08 23:40:31,479 INFO L280 TraceCheckUtils]: 46: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-08 23:40:31,479 INFO L280 TraceCheckUtils]: 47: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-08 23:40:31,480 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #109#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:31,481 INFO L280 TraceCheckUtils]: 49: Hoare triple {3192#(<= 1 main_~buf~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:31,482 INFO L280 TraceCheckUtils]: 50: Hoare triple {3192#(<= 1 main_~buf~0)} assume !(0 != #t~nondet2); {3192#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:31,482 INFO L280 TraceCheckUtils]: 51: Hoare triple {3192#(<= 1 main_~buf~0)} havoc #t~nondet2; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:31,483 INFO L263 TraceCheckUtils]: 52: Hoare triple {3192#(<= 1 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3201#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:31,484 INFO L280 TraceCheckUtils]: 53: Hoare triple {3201#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3202#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:31,485 INFO L280 TraceCheckUtils]: 54: Hoare triple {3202#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3179#false} is VALID [2020-07-08 23:40:31,485 INFO L280 TraceCheckUtils]: 55: Hoare triple {3179#false} assume !false; {3179#false} is VALID [2020-07-08 23:40:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-08 23:40:31,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223706212] [2020-07-08 23:40:31,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:31,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 23:40:31,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775034045] [2020-07-08 23:40:31,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-08 23:40:31,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:31,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 23:40:31,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:31,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 23:40:31,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:31,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 23:40:31,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:40:31,544 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 7 states. [2020-07-08 23:40:32,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:32,036 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2020-07-08 23:40:32,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 23:40:32,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-08 23:40:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:40:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-08 23:40:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:40:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-08 23:40:32,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2020-07-08 23:40:32,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:32,123 INFO L225 Difference]: With dead ends: 83 [2020-07-08 23:40:32,124 INFO L226 Difference]: Without dead ends: 81 [2020-07-08 23:40:32,124 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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 23:40:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-08 23:40:32,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-08 23:40:32,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:32,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2020-07-08 23:40:32,278 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-08 23:40:32,278 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-08 23:40:32,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:32,283 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2020-07-08 23:40:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-07-08 23:40:32,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:32,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:32,284 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-08 23:40:32,284 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-08 23:40:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:32,287 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2020-07-08 23:40:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-07-08 23:40:32,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:32,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:32,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:32,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-08 23:40:32,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2020-07-08 23:40:32,291 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 56 [2020-07-08 23:40:32,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:32,292 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2020-07-08 23:40:32,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 23:40:32,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 88 transitions. [2020-07-08 23:40:32,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-07-08 23:40:32,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-08 23:40:32,425 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:32,425 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:32,426 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 23:40:32,426 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:32,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:32,427 INFO L82 PathProgramCache]: Analyzing trace with hash 903884048, now seen corresponding path program 1 times [2020-07-08 23:40:32,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:32,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [157974698] [2020-07-08 23:40:32,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:32,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-08 23:40:32,552 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3701#true} {3701#true} #99#return; {3701#true} is VALID [2020-07-08 23:40:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:32,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-08 23:40:32,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-08 23:40:32,558 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-08 23:40:32,559 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3701#true} {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #103#return; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:32,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-08 23:40:32,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-08 23:40:32,565 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-08 23:40:32,566 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3701#true} {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #105#return; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:32,571 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-08 23:40:32,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-08 23:40:32,572 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-08 23:40:32,572 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3701#true} {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #107#return; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:32,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-08 23:40:32,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-08 23:40:32,578 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-08 23:40:32,579 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3701#true} {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #109#return; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:32,584 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-08 23:40:32,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-08 23:40:32,584 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-08 23:40:32,585 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3701#true} {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #111#return; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,585 INFO L263 TraceCheckUtils]: 0: Hoare triple {3701#true} call ULTIMATE.init(); {3701#true} is VALID [2020-07-08 23:40:32,585 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-08 23:40:32,586 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3701#true} {3701#true} #99#return; {3701#true} is VALID [2020-07-08 23:40:32,586 INFO L263 TraceCheckUtils]: 3: Hoare triple {3701#true} call #t~ret7 := main(); {3701#true} is VALID [2020-07-08 23:40:32,586 INFO L280 TraceCheckUtils]: 4: Hoare triple {3701#true} havoc ~in~0; {3701#true} is VALID [2020-07-08 23:40:32,586 INFO L280 TraceCheckUtils]: 5: Hoare triple {3701#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3701#true} is VALID [2020-07-08 23:40:32,587 INFO L280 TraceCheckUtils]: 6: Hoare triple {3701#true} ~inlen~0 := #t~nondet0; {3701#true} is VALID [2020-07-08 23:40:32,587 INFO L280 TraceCheckUtils]: 7: Hoare triple {3701#true} havoc #t~nondet0; {3701#true} is VALID [2020-07-08 23:40:32,587 INFO L280 TraceCheckUtils]: 8: Hoare triple {3701#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3701#true} is VALID [2020-07-08 23:40:32,587 INFO L280 TraceCheckUtils]: 9: Hoare triple {3701#true} ~bufferlen~0 := #t~nondet1; {3701#true} is VALID [2020-07-08 23:40:32,587 INFO L280 TraceCheckUtils]: 10: Hoare triple {3701#true} havoc #t~nondet1; {3701#true} is VALID [2020-07-08 23:40:32,588 INFO L280 TraceCheckUtils]: 11: Hoare triple {3701#true} havoc ~buf~0; {3701#true} is VALID [2020-07-08 23:40:32,588 INFO L280 TraceCheckUtils]: 12: Hoare triple {3701#true} havoc ~buflim~0; {3701#true} is VALID [2020-07-08 23:40:32,589 INFO L280 TraceCheckUtils]: 13: Hoare triple {3701#true} assume ~bufferlen~0 > 1; {3705#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,589 INFO L280 TraceCheckUtils]: 14: Hoare triple {3705#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {3705#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,590 INFO L280 TraceCheckUtils]: 15: Hoare triple {3705#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {3705#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,590 INFO L280 TraceCheckUtils]: 16: Hoare triple {3705#(<= 2 main_~bufferlen~0)} ~buf~0 := 0; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,591 INFO L280 TraceCheckUtils]: 17: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 0; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,591 INFO L280 TraceCheckUtils]: 18: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,592 INFO L280 TraceCheckUtils]: 19: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,592 INFO L280 TraceCheckUtils]: 20: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !!(0 != #t~nondet2); {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,593 INFO L280 TraceCheckUtils]: 21: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~nondet2; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,593 INFO L280 TraceCheckUtils]: 22: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(~buf~0 == ~buflim~0); {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,593 INFO L263 TraceCheckUtils]: 23: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3701#true} is VALID [2020-07-08 23:40:32,593 INFO L280 TraceCheckUtils]: 24: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-08 23:40:32,594 INFO L280 TraceCheckUtils]: 25: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-08 23:40:32,594 INFO L280 TraceCheckUtils]: 26: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-08 23:40:32,595 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3701#true} {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #103#return; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,595 INFO L263 TraceCheckUtils]: 28: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3701#true} is VALID [2020-07-08 23:40:32,595 INFO L280 TraceCheckUtils]: 29: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-08 23:40:32,595 INFO L280 TraceCheckUtils]: 30: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-08 23:40:32,596 INFO L280 TraceCheckUtils]: 31: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-08 23:40:32,596 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3701#true} {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #105#return; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,597 INFO L280 TraceCheckUtils]: 33: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post3 := ~buf~0; {3715#(<= (+ |main_#t~post3| 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,597 INFO L280 TraceCheckUtils]: 34: Hoare triple {3715#(<= (+ |main_#t~post3| 2) main_~bufferlen~0)} ~buf~0 := 1 + #t~post3; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,598 INFO L280 TraceCheckUtils]: 35: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~post3; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,598 INFO L280 TraceCheckUtils]: 36: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #t~post4 := ~in~0; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,599 INFO L280 TraceCheckUtils]: 37: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} ~in~0 := 1 + #t~post4; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,600 INFO L280 TraceCheckUtils]: 38: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~post4; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,600 INFO L263 TraceCheckUtils]: 39: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3701#true} is VALID [2020-07-08 23:40:32,600 INFO L280 TraceCheckUtils]: 40: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-08 23:40:32,600 INFO L280 TraceCheckUtils]: 41: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-08 23:40:32,600 INFO L280 TraceCheckUtils]: 42: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-08 23:40:32,601 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3701#true} {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #107#return; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,601 INFO L263 TraceCheckUtils]: 44: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3701#true} is VALID [2020-07-08 23:40:32,601 INFO L280 TraceCheckUtils]: 45: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-08 23:40:32,601 INFO L280 TraceCheckUtils]: 46: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-08 23:40:32,601 INFO L280 TraceCheckUtils]: 47: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-08 23:40:32,602 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3701#true} {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #109#return; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,602 INFO L280 TraceCheckUtils]: 49: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,603 INFO L280 TraceCheckUtils]: 50: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} assume !(0 != #t~nondet2); {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,603 INFO L280 TraceCheckUtils]: 51: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~nondet2; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,603 INFO L263 TraceCheckUtils]: 52: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3701#true} is VALID [2020-07-08 23:40:32,603 INFO L280 TraceCheckUtils]: 53: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-08 23:40:32,603 INFO L280 TraceCheckUtils]: 54: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-08 23:40:32,603 INFO L280 TraceCheckUtils]: 55: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-08 23:40:32,604 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3701#true} {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #111#return; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:32,605 INFO L263 TraceCheckUtils]: 57: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3729#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:32,605 INFO L280 TraceCheckUtils]: 58: Hoare triple {3729#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3730#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:32,606 INFO L280 TraceCheckUtils]: 59: Hoare triple {3730#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3702#false} is VALID [2020-07-08 23:40:32,606 INFO L280 TraceCheckUtils]: 60: Hoare triple {3702#false} assume !false; {3702#false} is VALID [2020-07-08 23:40:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-08 23:40:32,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [157974698] [2020-07-08 23:40:32,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:32,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-08 23:40:32,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669015734] [2020-07-08 23:40:32,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-07-08 23:40:32,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:32,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 23:40:32,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:32,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 23:40:32,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:32,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 23:40:32,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 23:40:32,672 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 8 states. [2020-07-08 23:40:33,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:33,494 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2020-07-08 23:40:33,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 23:40:33,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-07-08 23:40:33,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:40:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2020-07-08 23:40:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:40:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2020-07-08 23:40:33,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2020-07-08 23:40:33,625 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 23:40:33,629 INFO L225 Difference]: With dead ends: 100 [2020-07-08 23:40:33,629 INFO L226 Difference]: Without dead ends: 98 [2020-07-08 23:40:33,630 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-08 23:40:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-08 23:40:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2020-07-08 23:40:33,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:33,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 94 states. [2020-07-08 23:40:33,820 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 94 states. [2020-07-08 23:40:33,820 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 94 states. [2020-07-08 23:40:33,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:33,825 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-08 23:40:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2020-07-08 23:40:33,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:33,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:33,827 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 98 states. [2020-07-08 23:40:33,827 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 98 states. [2020-07-08 23:40:33,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:33,831 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-08 23:40:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2020-07-08 23:40:33,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:33,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:33,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:33,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-08 23:40:33,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2020-07-08 23:40:33,835 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 61 [2020-07-08 23:40:33,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:33,836 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2020-07-08 23:40:33,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 23:40:33,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 106 transitions. [2020-07-08 23:40:34,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2020-07-08 23:40:34,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-08 23:40:34,014 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:34,014 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:34,015 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 23:40:34,015 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:34,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:34,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1662212275, now seen corresponding path program 1 times [2020-07-08 23:40:34,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:34,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [857018206] [2020-07-08 23:40:34,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:34,137 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-08 23:40:34,138 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4327#true} {4327#true} #99#return; {4327#true} is VALID [2020-07-08 23:40:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:34,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-08 23:40:34,143 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-08 23:40:34,143 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-08 23:40:34,144 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #103#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:34,153 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-08 23:40:34,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-08 23:40:34,154 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-08 23:40:34,154 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #105#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:34,164 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-08 23:40:34,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-08 23:40:34,165 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-08 23:40:34,167 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #107#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:34,173 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-08 23:40:34,174 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-08 23:40:34,174 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-08 23:40:34,175 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #109#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:34,179 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-08 23:40:34,180 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-08 23:40:34,180 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-08 23:40:34,180 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #111#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:34,189 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-08 23:40:34,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-08 23:40:34,190 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-08 23:40:34,191 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #113#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,191 INFO L263 TraceCheckUtils]: 0: Hoare triple {4327#true} call ULTIMATE.init(); {4327#true} is VALID [2020-07-08 23:40:34,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-08 23:40:34,191 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4327#true} {4327#true} #99#return; {4327#true} is VALID [2020-07-08 23:40:34,191 INFO L263 TraceCheckUtils]: 3: Hoare triple {4327#true} call #t~ret7 := main(); {4327#true} is VALID [2020-07-08 23:40:34,192 INFO L280 TraceCheckUtils]: 4: Hoare triple {4327#true} havoc ~in~0; {4327#true} is VALID [2020-07-08 23:40:34,192 INFO L280 TraceCheckUtils]: 5: Hoare triple {4327#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4327#true} is VALID [2020-07-08 23:40:34,192 INFO L280 TraceCheckUtils]: 6: Hoare triple {4327#true} ~inlen~0 := #t~nondet0; {4327#true} is VALID [2020-07-08 23:40:34,192 INFO L280 TraceCheckUtils]: 7: Hoare triple {4327#true} havoc #t~nondet0; {4327#true} is VALID [2020-07-08 23:40:34,192 INFO L280 TraceCheckUtils]: 8: Hoare triple {4327#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4327#true} is VALID [2020-07-08 23:40:34,193 INFO L280 TraceCheckUtils]: 9: Hoare triple {4327#true} ~bufferlen~0 := #t~nondet1; {4327#true} is VALID [2020-07-08 23:40:34,193 INFO L280 TraceCheckUtils]: 10: Hoare triple {4327#true} havoc #t~nondet1; {4327#true} is VALID [2020-07-08 23:40:34,193 INFO L280 TraceCheckUtils]: 11: Hoare triple {4327#true} havoc ~buf~0; {4327#true} is VALID [2020-07-08 23:40:34,193 INFO L280 TraceCheckUtils]: 12: Hoare triple {4327#true} havoc ~buflim~0; {4327#true} is VALID [2020-07-08 23:40:34,193 INFO L280 TraceCheckUtils]: 13: Hoare triple {4327#true} assume ~bufferlen~0 > 1; {4327#true} is VALID [2020-07-08 23:40:34,193 INFO L280 TraceCheckUtils]: 14: Hoare triple {4327#true} assume ~inlen~0 > 0; {4327#true} is VALID [2020-07-08 23:40:34,194 INFO L280 TraceCheckUtils]: 15: Hoare triple {4327#true} assume ~bufferlen~0 < ~inlen~0; {4327#true} is VALID [2020-07-08 23:40:34,210 INFO L280 TraceCheckUtils]: 16: Hoare triple {4327#true} ~buf~0 := 0; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:34,212 INFO L280 TraceCheckUtils]: 17: Hoare triple {4331#(<= 0 main_~buf~0)} ~in~0 := 0; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:34,213 INFO L280 TraceCheckUtils]: 18: Hoare triple {4331#(<= 0 main_~buf~0)} ~buflim~0 := ~bufferlen~0 - 2; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:34,214 INFO L280 TraceCheckUtils]: 19: Hoare triple {4331#(<= 0 main_~buf~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:34,214 INFO L280 TraceCheckUtils]: 20: Hoare triple {4331#(<= 0 main_~buf~0)} assume !!(0 != #t~nondet2); {4331#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:34,215 INFO L280 TraceCheckUtils]: 21: Hoare triple {4331#(<= 0 main_~buf~0)} havoc #t~nondet2; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:34,215 INFO L280 TraceCheckUtils]: 22: Hoare triple {4331#(<= 0 main_~buf~0)} assume !(~buf~0 == ~buflim~0); {4331#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:34,216 INFO L263 TraceCheckUtils]: 23: Hoare triple {4331#(<= 0 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4327#true} is VALID [2020-07-08 23:40:34,216 INFO L280 TraceCheckUtils]: 24: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-08 23:40:34,216 INFO L280 TraceCheckUtils]: 25: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-08 23:40:34,216 INFO L280 TraceCheckUtils]: 26: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-08 23:40:34,217 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #103#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:34,217 INFO L263 TraceCheckUtils]: 28: Hoare triple {4331#(<= 0 main_~buf~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4327#true} is VALID [2020-07-08 23:40:34,217 INFO L280 TraceCheckUtils]: 29: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-08 23:40:34,217 INFO L280 TraceCheckUtils]: 30: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-08 23:40:34,218 INFO L280 TraceCheckUtils]: 31: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-08 23:40:34,218 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #105#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-08 23:40:34,219 INFO L280 TraceCheckUtils]: 33: Hoare triple {4331#(<= 0 main_~buf~0)} #t~post3 := ~buf~0; {4340#(<= 0 |main_#t~post3|)} is VALID [2020-07-08 23:40:34,220 INFO L280 TraceCheckUtils]: 34: Hoare triple {4340#(<= 0 |main_#t~post3|)} ~buf~0 := 1 + #t~post3; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,221 INFO L280 TraceCheckUtils]: 35: Hoare triple {4341#(<= 1 main_~buf~0)} havoc #t~post3; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,221 INFO L280 TraceCheckUtils]: 36: Hoare triple {4341#(<= 1 main_~buf~0)} #t~post4 := ~in~0; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,222 INFO L280 TraceCheckUtils]: 37: Hoare triple {4341#(<= 1 main_~buf~0)} ~in~0 := 1 + #t~post4; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,222 INFO L280 TraceCheckUtils]: 38: Hoare triple {4341#(<= 1 main_~buf~0)} havoc #t~post4; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,223 INFO L263 TraceCheckUtils]: 39: Hoare triple {4341#(<= 1 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {4327#true} is VALID [2020-07-08 23:40:34,223 INFO L280 TraceCheckUtils]: 40: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-08 23:40:34,223 INFO L280 TraceCheckUtils]: 41: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-08 23:40:34,223 INFO L280 TraceCheckUtils]: 42: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-08 23:40:34,224 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #107#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,224 INFO L263 TraceCheckUtils]: 44: Hoare triple {4341#(<= 1 main_~buf~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {4327#true} is VALID [2020-07-08 23:40:34,224 INFO L280 TraceCheckUtils]: 45: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-08 23:40:34,224 INFO L280 TraceCheckUtils]: 46: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-08 23:40:34,225 INFO L280 TraceCheckUtils]: 47: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-08 23:40:34,226 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #109#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,226 INFO L280 TraceCheckUtils]: 49: Hoare triple {4341#(<= 1 main_~buf~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,227 INFO L280 TraceCheckUtils]: 50: Hoare triple {4341#(<= 1 main_~buf~0)} assume !(0 != #t~nondet2); {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,228 INFO L280 TraceCheckUtils]: 51: Hoare triple {4341#(<= 1 main_~buf~0)} havoc #t~nondet2; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,228 INFO L263 TraceCheckUtils]: 52: Hoare triple {4341#(<= 1 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4327#true} is VALID [2020-07-08 23:40:34,228 INFO L280 TraceCheckUtils]: 53: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-08 23:40:34,228 INFO L280 TraceCheckUtils]: 54: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-08 23:40:34,228 INFO L280 TraceCheckUtils]: 55: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-08 23:40:34,229 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #111#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,229 INFO L263 TraceCheckUtils]: 57: Hoare triple {4341#(<= 1 main_~buf~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4327#true} is VALID [2020-07-08 23:40:34,229 INFO L280 TraceCheckUtils]: 58: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-08 23:40:34,230 INFO L280 TraceCheckUtils]: 59: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-08 23:40:34,230 INFO L280 TraceCheckUtils]: 60: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-08 23:40:34,231 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #113#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-08 23:40:34,232 INFO L280 TraceCheckUtils]: 62: Hoare triple {4341#(<= 1 main_~buf~0)} #t~post5 := ~buf~0; {4358#(<= 1 |main_#t~post5|)} is VALID [2020-07-08 23:40:34,233 INFO L280 TraceCheckUtils]: 63: Hoare triple {4358#(<= 1 |main_#t~post5|)} ~buf~0 := 1 + #t~post5; {4359#(<= 2 main_~buf~0)} is VALID [2020-07-08 23:40:34,233 INFO L280 TraceCheckUtils]: 64: Hoare triple {4359#(<= 2 main_~buf~0)} havoc #t~post5; {4359#(<= 2 main_~buf~0)} is VALID [2020-07-08 23:40:34,234 INFO L263 TraceCheckUtils]: 65: Hoare triple {4359#(<= 2 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4360#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:34,235 INFO L280 TraceCheckUtils]: 66: Hoare triple {4360#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4361#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:34,235 INFO L280 TraceCheckUtils]: 67: Hoare triple {4361#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4328#false} is VALID [2020-07-08 23:40:34,235 INFO L280 TraceCheckUtils]: 68: Hoare triple {4328#false} assume !false; {4328#false} is VALID [2020-07-08 23:40:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-08 23:40:34,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [857018206] [2020-07-08 23:40:34,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:34,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 23:40:34,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796894694] [2020-07-08 23:40:34,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-07-08 23:40:34,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:34,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 23:40:34,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:34,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 23:40:34,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:34,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 23:40:34,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-08 23:40:34,293 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 9 states. [2020-07-08 23:40:34,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:34,916 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2020-07-08 23:40:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 23:40:34,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-07-08 23:40:34,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:40:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-07-08 23:40:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:40:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-07-08 23:40:34,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2020-07-08 23:40:35,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:35,002 INFO L225 Difference]: With dead ends: 100 [2020-07-08 23:40:35,003 INFO L226 Difference]: Without dead ends: 98 [2020-07-08 23:40:35,003 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-07-08 23:40:35,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-08 23:40:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-07-08 23:40:35,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:35,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 98 states. [2020-07-08 23:40:35,190 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2020-07-08 23:40:35,191 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2020-07-08 23:40:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:35,194 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2020-07-08 23:40:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-08 23:40:35,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:35,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:35,196 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2020-07-08 23:40:35,196 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2020-07-08 23:40:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:35,199 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2020-07-08 23:40:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-08 23:40:35,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:35,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:35,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:35,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-08 23:40:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2020-07-08 23:40:35,203 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 69 [2020-07-08 23:40:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:35,203 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2020-07-08 23:40:35,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 23:40:35,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 98 states and 109 transitions. [2020-07-08 23:40:35,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-08 23:40:35,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-07-08 23:40:35,381 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:35,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:35,381 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 23:40:35,382 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:35,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:35,382 INFO L82 PathProgramCache]: Analyzing trace with hash 71900773, now seen corresponding path program 1 times [2020-07-08 23:40:35,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:35,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1761142368] [2020-07-08 23:40:35,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:35,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,576 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4966#true} {4966#true} #99#return; {4966#true} is VALID [2020-07-08 23:40:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:35,579 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-08 23:40:35,580 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-08 23:40:35,580 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,580 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #103#return; {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:35,585 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-08 23:40:35,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-08 23:40:35,586 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,587 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #105#return; {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:35,599 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-08 23:40:35,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-08 23:40:35,600 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,601 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #107#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:35,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-08 23:40:35,607 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-08 23:40:35,608 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,608 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #109#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:35,617 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-08 23:40:35,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-08 23:40:35,618 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,620 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:35,626 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-08 23:40:35,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-08 23:40:35,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,628 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #113#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:35,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-08 23:40:35,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-08 23:40:35,639 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,640 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #115#return; {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,640 INFO L263 TraceCheckUtils]: 0: Hoare triple {4966#true} call ULTIMATE.init(); {4966#true} is VALID [2020-07-08 23:40:35,640 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,640 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4966#true} {4966#true} #99#return; {4966#true} is VALID [2020-07-08 23:40:35,641 INFO L263 TraceCheckUtils]: 3: Hoare triple {4966#true} call #t~ret7 := main(); {4966#true} is VALID [2020-07-08 23:40:35,641 INFO L280 TraceCheckUtils]: 4: Hoare triple {4966#true} havoc ~in~0; {4966#true} is VALID [2020-07-08 23:40:35,641 INFO L280 TraceCheckUtils]: 5: Hoare triple {4966#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4966#true} is VALID [2020-07-08 23:40:35,641 INFO L280 TraceCheckUtils]: 6: Hoare triple {4966#true} ~inlen~0 := #t~nondet0; {4966#true} is VALID [2020-07-08 23:40:35,641 INFO L280 TraceCheckUtils]: 7: Hoare triple {4966#true} havoc #t~nondet0; {4966#true} is VALID [2020-07-08 23:40:35,641 INFO L280 TraceCheckUtils]: 8: Hoare triple {4966#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4966#true} is VALID [2020-07-08 23:40:35,642 INFO L280 TraceCheckUtils]: 9: Hoare triple {4966#true} ~bufferlen~0 := #t~nondet1; {4966#true} is VALID [2020-07-08 23:40:35,642 INFO L280 TraceCheckUtils]: 10: Hoare triple {4966#true} havoc #t~nondet1; {4966#true} is VALID [2020-07-08 23:40:35,642 INFO L280 TraceCheckUtils]: 11: Hoare triple {4966#true} havoc ~buf~0; {4966#true} is VALID [2020-07-08 23:40:35,642 INFO L280 TraceCheckUtils]: 12: Hoare triple {4966#true} havoc ~buflim~0; {4966#true} is VALID [2020-07-08 23:40:35,643 INFO L280 TraceCheckUtils]: 13: Hoare triple {4966#true} assume ~bufferlen~0 > 1; {4970#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,643 INFO L280 TraceCheckUtils]: 14: Hoare triple {4970#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {4970#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,644 INFO L280 TraceCheckUtils]: 15: Hoare triple {4970#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {4970#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,645 INFO L280 TraceCheckUtils]: 16: Hoare triple {4970#(<= 2 main_~bufferlen~0)} ~buf~0 := 0; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,645 INFO L280 TraceCheckUtils]: 17: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 0; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,646 INFO L280 TraceCheckUtils]: 18: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {4972#(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 23:40:35,647 INFO L280 TraceCheckUtils]: 19: Hoare triple {4972#(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; {4972#(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 23:40:35,648 INFO L280 TraceCheckUtils]: 20: Hoare triple {4972#(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); {4972#(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 23:40:35,648 INFO L280 TraceCheckUtils]: 21: Hoare triple {4972#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~nondet2; {4972#(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 23:40:35,649 INFO L280 TraceCheckUtils]: 22: Hoare triple {4972#(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); {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,650 INFO L263 TraceCheckUtils]: 23: Hoare triple {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4966#true} is VALID [2020-07-08 23:40:35,650 INFO L280 TraceCheckUtils]: 24: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-08 23:40:35,650 INFO L280 TraceCheckUtils]: 25: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-08 23:40:35,650 INFO L280 TraceCheckUtils]: 26: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,651 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {4966#true} {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #103#return; {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,651 INFO L263 TraceCheckUtils]: 28: Hoare triple {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4966#true} is VALID [2020-07-08 23:40:35,651 INFO L280 TraceCheckUtils]: 29: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-08 23:40:35,652 INFO L280 TraceCheckUtils]: 30: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-08 23:40:35,652 INFO L280 TraceCheckUtils]: 31: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,653 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {4966#true} {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #105#return; {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,653 INFO L280 TraceCheckUtils]: 33: Hoare triple {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #t~post3 := ~buf~0; {4982#(<= (+ |main_#t~post3| 3) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,654 INFO L280 TraceCheckUtils]: 34: Hoare triple {4982#(<= (+ |main_#t~post3| 3) main_~bufferlen~0)} ~buf~0 := 1 + #t~post3; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,655 INFO L280 TraceCheckUtils]: 35: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~post3; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,655 INFO L280 TraceCheckUtils]: 36: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post4 := ~in~0; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,656 INFO L280 TraceCheckUtils]: 37: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 1 + #t~post4; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,656 INFO L280 TraceCheckUtils]: 38: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~post4; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,656 INFO L263 TraceCheckUtils]: 39: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {4966#true} is VALID [2020-07-08 23:40:35,656 INFO L280 TraceCheckUtils]: 40: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-08 23:40:35,657 INFO L280 TraceCheckUtils]: 41: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-08 23:40:35,657 INFO L280 TraceCheckUtils]: 42: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,658 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #107#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,658 INFO L263 TraceCheckUtils]: 44: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {4966#true} is VALID [2020-07-08 23:40:35,658 INFO L280 TraceCheckUtils]: 45: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-08 23:40:35,658 INFO L280 TraceCheckUtils]: 46: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-08 23:40:35,658 INFO L280 TraceCheckUtils]: 47: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,659 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #109#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,660 INFO L280 TraceCheckUtils]: 49: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,660 INFO L280 TraceCheckUtils]: 50: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(0 != #t~nondet2); {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,661 INFO L280 TraceCheckUtils]: 51: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~nondet2; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,661 INFO L263 TraceCheckUtils]: 52: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4966#true} is VALID [2020-07-08 23:40:35,661 INFO L280 TraceCheckUtils]: 53: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-08 23:40:35,661 INFO L280 TraceCheckUtils]: 54: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-08 23:40:35,662 INFO L280 TraceCheckUtils]: 55: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,662 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,663 INFO L263 TraceCheckUtils]: 57: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4966#true} is VALID [2020-07-08 23:40:35,663 INFO L280 TraceCheckUtils]: 58: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-08 23:40:35,663 INFO L280 TraceCheckUtils]: 59: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-08 23:40:35,663 INFO L280 TraceCheckUtils]: 60: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,664 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #113#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,665 INFO L280 TraceCheckUtils]: 62: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post5 := ~buf~0; {4999#(<= (+ |main_#t~post5| 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,665 INFO L280 TraceCheckUtils]: 63: Hoare triple {4999#(<= (+ |main_#t~post5| 2) main_~bufferlen~0)} ~buf~0 := 1 + #t~post5; {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,666 INFO L280 TraceCheckUtils]: 64: Hoare triple {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~post5; {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,666 INFO L263 TraceCheckUtils]: 65: Hoare triple {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4966#true} is VALID [2020-07-08 23:40:35,666 INFO L280 TraceCheckUtils]: 66: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-08 23:40:35,666 INFO L280 TraceCheckUtils]: 67: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-08 23:40:35,667 INFO L280 TraceCheckUtils]: 68: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-08 23:40:35,667 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {4966#true} {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #115#return; {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:35,668 INFO L263 TraceCheckUtils]: 70: Hoare triple {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {5005#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:35,669 INFO L280 TraceCheckUtils]: 71: Hoare triple {5005#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {5006#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:35,669 INFO L280 TraceCheckUtils]: 72: Hoare triple {5006#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4967#false} is VALID [2020-07-08 23:40:35,670 INFO L280 TraceCheckUtils]: 73: Hoare triple {4967#false} assume !false; {4967#false} is VALID [2020-07-08 23:40:35,679 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 23:40:35,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1761142368] [2020-07-08 23:40:35,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:35,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-08 23:40:35,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518578625] [2020-07-08 23:40:35,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-07-08 23:40:35,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:35,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 23:40:35,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:35,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 23:40:35,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:35,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 23:40:35,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:40:35,738 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 11 states. [2020-07-08 23:40:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:37,232 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2020-07-08 23:40:37,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-08 23:40:37,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-07-08 23:40:37,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:40:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2020-07-08 23:40:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:40:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2020-07-08 23:40:37,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 113 transitions. [2020-07-08 23:40:37,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:37,396 INFO L225 Difference]: With dead ends: 119 [2020-07-08 23:40:37,397 INFO L226 Difference]: Without dead ends: 101 [2020-07-08 23:40:37,398 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2020-07-08 23:40:37,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-08 23:40:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2020-07-08 23:40:37,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:37,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 95 states. [2020-07-08 23:40:37,582 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 95 states. [2020-07-08 23:40:37,582 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 95 states. [2020-07-08 23:40:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:37,586 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2020-07-08 23:40:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2020-07-08 23:40:37,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:37,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:37,587 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 101 states. [2020-07-08 23:40:37,587 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 101 states. [2020-07-08 23:40:37,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:37,591 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2020-07-08 23:40:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2020-07-08 23:40:37,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:37,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:37,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:37,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-08 23:40:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2020-07-08 23:40:37,595 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 74 [2020-07-08 23:40:37,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:37,595 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2020-07-08 23:40:37,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 23:40:37,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 95 states and 102 transitions. [2020-07-08 23:40:37,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2020-07-08 23:40:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-08 23:40:37,764 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:37,765 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:37,765 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 23:40:37,765 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:37,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:37,765 INFO L82 PathProgramCache]: Analyzing trace with hash -50388093, now seen corresponding path program 1 times [2020-07-08 23:40:37,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:37,766 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1012923880] [2020-07-08 23:40:37,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:37,937 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:37,937 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5661#true} {5661#true} #99#return; {5661#true} is VALID [2020-07-08 23:40:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:37,941 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-08 23:40:37,941 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-08 23:40:37,941 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:37,942 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5661#true} {5667#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:37,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-08 23:40:37,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-08 23:40:37,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:37,950 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5661#true} {5667#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:37,954 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-08 23:40:37,954 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-08 23:40:37,954 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:37,955 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:37,968 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-08 23:40:37,968 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-08 23:40:37,968 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:37,969 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #109#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:37,983 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-08 23:40:37,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-08 23:40:37,983 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:37,984 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #103#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:37,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-08 23:40:37,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-08 23:40:37,989 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:37,990 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #105#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:37,994 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-08 23:40:37,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-08 23:40:37,995 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:37,996 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5661#true} {5695#(<= (+ main_~in~0 1) main_~inlen~0)} #107#return; {5695#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 23:40:37,996 INFO L263 TraceCheckUtils]: 0: Hoare triple {5661#true} call ULTIMATE.init(); {5661#true} is VALID [2020-07-08 23:40:37,996 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:37,996 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5661#true} {5661#true} #99#return; {5661#true} is VALID [2020-07-08 23:40:37,996 INFO L263 TraceCheckUtils]: 3: Hoare triple {5661#true} call #t~ret7 := main(); {5661#true} is VALID [2020-07-08 23:40:37,997 INFO L280 TraceCheckUtils]: 4: Hoare triple {5661#true} havoc ~in~0; {5661#true} is VALID [2020-07-08 23:40:37,997 INFO L280 TraceCheckUtils]: 5: Hoare triple {5661#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5661#true} is VALID [2020-07-08 23:40:37,997 INFO L280 TraceCheckUtils]: 6: Hoare triple {5661#true} ~inlen~0 := #t~nondet0; {5661#true} is VALID [2020-07-08 23:40:37,997 INFO L280 TraceCheckUtils]: 7: Hoare triple {5661#true} havoc #t~nondet0; {5661#true} is VALID [2020-07-08 23:40:37,997 INFO L280 TraceCheckUtils]: 8: Hoare triple {5661#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5661#true} is VALID [2020-07-08 23:40:37,997 INFO L280 TraceCheckUtils]: 9: Hoare triple {5661#true} ~bufferlen~0 := #t~nondet1; {5661#true} is VALID [2020-07-08 23:40:37,998 INFO L280 TraceCheckUtils]: 10: Hoare triple {5661#true} havoc #t~nondet1; {5661#true} is VALID [2020-07-08 23:40:37,998 INFO L280 TraceCheckUtils]: 11: Hoare triple {5661#true} havoc ~buf~0; {5661#true} is VALID [2020-07-08 23:40:37,998 INFO L280 TraceCheckUtils]: 12: Hoare triple {5661#true} havoc ~buflim~0; {5661#true} is VALID [2020-07-08 23:40:37,999 INFO L280 TraceCheckUtils]: 13: Hoare triple {5661#true} assume ~bufferlen~0 > 1; {5665#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:37,999 INFO L280 TraceCheckUtils]: 14: Hoare triple {5665#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {5665#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:38,000 INFO L280 TraceCheckUtils]: 15: Hoare triple {5665#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {5666#(<= 3 main_~inlen~0)} is VALID [2020-07-08 23:40:38,001 INFO L280 TraceCheckUtils]: 16: Hoare triple {5666#(<= 3 main_~inlen~0)} ~buf~0 := 0; {5666#(<= 3 main_~inlen~0)} is VALID [2020-07-08 23:40:38,001 INFO L280 TraceCheckUtils]: 17: Hoare triple {5666#(<= 3 main_~inlen~0)} ~in~0 := 0; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:38,002 INFO L280 TraceCheckUtils]: 18: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:38,002 INFO L280 TraceCheckUtils]: 19: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:38,003 INFO L280 TraceCheckUtils]: 20: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} assume !!(0 != #t~nondet2); {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:38,003 INFO L280 TraceCheckUtils]: 21: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~nondet2; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:38,004 INFO L280 TraceCheckUtils]: 22: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:38,004 INFO L263 TraceCheckUtils]: 23: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {5661#true} is VALID [2020-07-08 23:40:38,004 INFO L280 TraceCheckUtils]: 24: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-08 23:40:38,004 INFO L280 TraceCheckUtils]: 25: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-08 23:40:38,005 INFO L280 TraceCheckUtils]: 26: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:38,005 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {5661#true} {5667#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:38,006 INFO L263 TraceCheckUtils]: 28: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {5661#true} is VALID [2020-07-08 23:40:38,006 INFO L280 TraceCheckUtils]: 29: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-08 23:40:38,006 INFO L280 TraceCheckUtils]: 30: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-08 23:40:38,006 INFO L280 TraceCheckUtils]: 31: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:38,007 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {5661#true} {5667#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:38,007 INFO L280 TraceCheckUtils]: 33: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post3 := ~buf~0; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:38,008 INFO L280 TraceCheckUtils]: 34: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:38,009 INFO L280 TraceCheckUtils]: 35: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~post3; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:38,009 INFO L280 TraceCheckUtils]: 36: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post4 := ~in~0; {5676#(<= (+ |main_#t~post4| 3) main_~inlen~0)} is VALID [2020-07-08 23:40:38,010 INFO L280 TraceCheckUtils]: 37: Hoare triple {5676#(<= (+ |main_#t~post4| 3) main_~inlen~0)} ~in~0 := 1 + #t~post4; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:38,011 INFO L280 TraceCheckUtils]: 38: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~post4; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:38,011 INFO L263 TraceCheckUtils]: 39: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {5661#true} is VALID [2020-07-08 23:40:38,011 INFO L280 TraceCheckUtils]: 40: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-08 23:40:38,011 INFO L280 TraceCheckUtils]: 41: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-08 23:40:38,011 INFO L280 TraceCheckUtils]: 42: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:38,012 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:38,012 INFO L263 TraceCheckUtils]: 44: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {5661#true} is VALID [2020-07-08 23:40:38,013 INFO L280 TraceCheckUtils]: 45: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-08 23:40:38,013 INFO L280 TraceCheckUtils]: 46: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-08 23:40:38,013 INFO L280 TraceCheckUtils]: 47: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:38,014 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #109#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:38,014 INFO L280 TraceCheckUtils]: 49: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:38,015 INFO L280 TraceCheckUtils]: 50: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} assume !!(0 != #t~nondet2); {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:38,015 INFO L280 TraceCheckUtils]: 51: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~nondet2; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:38,016 INFO L280 TraceCheckUtils]: 52: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:38,016 INFO L263 TraceCheckUtils]: 53: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {5661#true} is VALID [2020-07-08 23:40:38,016 INFO L280 TraceCheckUtils]: 54: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-08 23:40:38,016 INFO L280 TraceCheckUtils]: 55: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-08 23:40:38,016 INFO L280 TraceCheckUtils]: 56: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:38,018 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #103#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:38,018 INFO L263 TraceCheckUtils]: 58: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {5661#true} is VALID [2020-07-08 23:40:38,018 INFO L280 TraceCheckUtils]: 59: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-08 23:40:38,018 INFO L280 TraceCheckUtils]: 60: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-08 23:40:38,019 INFO L280 TraceCheckUtils]: 61: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:38,019 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #105#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:38,020 INFO L280 TraceCheckUtils]: 63: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post3 := ~buf~0; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:38,020 INFO L280 TraceCheckUtils]: 64: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:38,021 INFO L280 TraceCheckUtils]: 65: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~post3; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:38,022 INFO L280 TraceCheckUtils]: 66: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post4 := ~in~0; {5694#(<= (+ |main_#t~post4| 2) main_~inlen~0)} is VALID [2020-07-08 23:40:38,022 INFO L280 TraceCheckUtils]: 67: Hoare triple {5694#(<= (+ |main_#t~post4| 2) main_~inlen~0)} ~in~0 := 1 + #t~post4; {5695#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 23:40:38,023 INFO L280 TraceCheckUtils]: 68: Hoare triple {5695#(<= (+ main_~in~0 1) main_~inlen~0)} havoc #t~post4; {5695#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 23:40:38,023 INFO L263 TraceCheckUtils]: 69: Hoare triple {5695#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {5661#true} is VALID [2020-07-08 23:40:38,023 INFO L280 TraceCheckUtils]: 70: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-08 23:40:38,023 INFO L280 TraceCheckUtils]: 71: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-08 23:40:38,024 INFO L280 TraceCheckUtils]: 72: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-08 23:40:38,024 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {5661#true} {5695#(<= (+ main_~in~0 1) main_~inlen~0)} #107#return; {5695#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 23:40:38,025 INFO L263 TraceCheckUtils]: 74: Hoare triple {5695#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {5700#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:38,026 INFO L280 TraceCheckUtils]: 75: Hoare triple {5700#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {5701#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:38,026 INFO L280 TraceCheckUtils]: 76: Hoare triple {5701#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5662#false} is VALID [2020-07-08 23:40:38,027 INFO L280 TraceCheckUtils]: 77: Hoare triple {5662#false} assume !false; {5662#false} is VALID [2020-07-08 23:40:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-08 23:40:38,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1012923880] [2020-07-08 23:40:38,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:38,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-08 23:40:38,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925210976] [2020-07-08 23:40:38,033 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-07-08 23:40:38,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:38,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 23:40:38,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:38,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 23:40:38,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:38,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 23:40:38,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:40:38,105 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 11 states. [2020-07-08 23:40:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:39,519 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2020-07-08 23:40:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 23:40:39,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-07-08 23:40:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:40:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2020-07-08 23:40:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:40:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2020-07-08 23:40:39,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 122 transitions. [2020-07-08 23:40:39,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:39,691 INFO L225 Difference]: With dead ends: 128 [2020-07-08 23:40:39,691 INFO L226 Difference]: Without dead ends: 126 [2020-07-08 23:40:39,692 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2020-07-08 23:40:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-07-08 23:40:39,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2020-07-08 23:40:39,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:39,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 107 states. [2020-07-08 23:40:39,927 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 107 states. [2020-07-08 23:40:39,927 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 107 states. [2020-07-08 23:40:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:39,932 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2020-07-08 23:40:39,932 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2020-07-08 23:40:39,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:39,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:39,933 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 126 states. [2020-07-08 23:40:39,933 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 126 states. [2020-07-08 23:40:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:39,937 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2020-07-08 23:40:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2020-07-08 23:40:39,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:39,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:39,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:39,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-07-08 23:40:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2020-07-08 23:40:39,941 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 78 [2020-07-08 23:40:39,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:39,941 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2020-07-08 23:40:39,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 23:40:39,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 107 states and 115 transitions. [2020-07-08 23:40:40,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:40,134 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2020-07-08 23:40:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-08 23:40:40,135 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:40,136 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:40,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-08 23:40:40,136 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:40,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:40,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1911943399, now seen corresponding path program 2 times [2020-07-08 23:40:40,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:40,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [575416709] [2020-07-08 23:40:40,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:40,375 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,376 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6444#true} {6444#true} #99#return; {6444#true} is VALID [2020-07-08 23:40:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:40,380 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,381 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,381 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,382 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6451#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #103#return; {6451#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 23:40:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:40,387 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,388 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,389 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6451#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #105#return; {6451#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 23:40:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:40,399 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,399 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,400 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #107#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:40,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,408 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,409 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #109#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:40,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,416 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,416 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,417 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #103#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:40,429 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,430 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,430 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,432 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #105#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:40,439 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,440 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,441 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #107#return; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:40,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,447 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,449 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #109#return; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:40,456 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,457 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,458 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #111#return; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,458 INFO L263 TraceCheckUtils]: 0: Hoare triple {6444#true} call ULTIMATE.init(); {6444#true} is VALID [2020-07-08 23:40:40,458 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,458 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6444#true} {6444#true} #99#return; {6444#true} is VALID [2020-07-08 23:40:40,459 INFO L263 TraceCheckUtils]: 3: Hoare triple {6444#true} call #t~ret7 := main(); {6444#true} is VALID [2020-07-08 23:40:40,459 INFO L280 TraceCheckUtils]: 4: Hoare triple {6444#true} havoc ~in~0; {6444#true} is VALID [2020-07-08 23:40:40,459 INFO L280 TraceCheckUtils]: 5: Hoare triple {6444#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {6444#true} is VALID [2020-07-08 23:40:40,459 INFO L280 TraceCheckUtils]: 6: Hoare triple {6444#true} ~inlen~0 := #t~nondet0; {6444#true} is VALID [2020-07-08 23:40:40,459 INFO L280 TraceCheckUtils]: 7: Hoare triple {6444#true} havoc #t~nondet0; {6444#true} is VALID [2020-07-08 23:40:40,459 INFO L280 TraceCheckUtils]: 8: Hoare triple {6444#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6444#true} is VALID [2020-07-08 23:40:40,460 INFO L280 TraceCheckUtils]: 9: Hoare triple {6444#true} ~bufferlen~0 := #t~nondet1; {6444#true} is VALID [2020-07-08 23:40:40,460 INFO L280 TraceCheckUtils]: 10: Hoare triple {6444#true} havoc #t~nondet1; {6444#true} is VALID [2020-07-08 23:40:40,460 INFO L280 TraceCheckUtils]: 11: Hoare triple {6444#true} havoc ~buf~0; {6444#true} is VALID [2020-07-08 23:40:40,460 INFO L280 TraceCheckUtils]: 12: Hoare triple {6444#true} havoc ~buflim~0; {6444#true} is VALID [2020-07-08 23:40:40,461 INFO L280 TraceCheckUtils]: 13: Hoare triple {6444#true} assume ~bufferlen~0 > 1; {6448#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,462 INFO L280 TraceCheckUtils]: 14: Hoare triple {6448#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {6448#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,462 INFO L280 TraceCheckUtils]: 15: Hoare triple {6448#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {6448#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,463 INFO L280 TraceCheckUtils]: 16: Hoare triple {6448#(<= 2 main_~bufferlen~0)} ~buf~0 := 0; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,463 INFO L280 TraceCheckUtils]: 17: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 0; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,464 INFO L280 TraceCheckUtils]: 18: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {6450#(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 23:40:40,465 INFO L280 TraceCheckUtils]: 19: Hoare triple {6450#(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; {6450#(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 23:40:40,466 INFO L280 TraceCheckUtils]: 20: Hoare triple {6450#(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); {6450#(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 23:40:40,466 INFO L280 TraceCheckUtils]: 21: Hoare triple {6450#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~nondet2; {6450#(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 23:40:40,467 INFO L280 TraceCheckUtils]: 22: Hoare triple {6450#(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); {6451#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 23:40:40,468 INFO L263 TraceCheckUtils]: 23: Hoare triple {6451#(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)); {6444#true} is VALID [2020-07-08 23:40:40,468 INFO L280 TraceCheckUtils]: 24: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,468 INFO L280 TraceCheckUtils]: 25: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,468 INFO L280 TraceCheckUtils]: 26: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,469 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {6444#true} {6451#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #103#return; {6451#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 23:40:40,469 INFO L263 TraceCheckUtils]: 28: Hoare triple {6451#(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)); {6444#true} is VALID [2020-07-08 23:40:40,469 INFO L280 TraceCheckUtils]: 29: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,470 INFO L280 TraceCheckUtils]: 30: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,470 INFO L280 TraceCheckUtils]: 31: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,470 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {6444#true} {6451#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #105#return; {6451#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 23:40:40,471 INFO L280 TraceCheckUtils]: 33: Hoare triple {6451#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #t~post3 := ~buf~0; {6460#(<= (+ |main_#t~post3| 3) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,472 INFO L280 TraceCheckUtils]: 34: Hoare triple {6460#(<= (+ |main_#t~post3| 3) main_~bufferlen~0)} ~buf~0 := 1 + #t~post3; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,473 INFO L280 TraceCheckUtils]: 35: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~post3; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,473 INFO L280 TraceCheckUtils]: 36: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post4 := ~in~0; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,474 INFO L280 TraceCheckUtils]: 37: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 1 + #t~post4; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,474 INFO L280 TraceCheckUtils]: 38: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~post4; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,475 INFO L263 TraceCheckUtils]: 39: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {6444#true} is VALID [2020-07-08 23:40:40,475 INFO L280 TraceCheckUtils]: 40: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,475 INFO L280 TraceCheckUtils]: 41: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,475 INFO L280 TraceCheckUtils]: 42: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,476 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #107#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,476 INFO L263 TraceCheckUtils]: 44: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {6444#true} is VALID [2020-07-08 23:40:40,476 INFO L280 TraceCheckUtils]: 45: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,476 INFO L280 TraceCheckUtils]: 46: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,477 INFO L280 TraceCheckUtils]: 47: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,477 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #109#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,478 INFO L280 TraceCheckUtils]: 49: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,479 INFO L280 TraceCheckUtils]: 50: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !!(0 != #t~nondet2); {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,479 INFO L280 TraceCheckUtils]: 51: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~nondet2; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,480 INFO L280 TraceCheckUtils]: 52: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(~buf~0 == ~buflim~0); {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,480 INFO L263 TraceCheckUtils]: 53: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {6444#true} is VALID [2020-07-08 23:40:40,480 INFO L280 TraceCheckUtils]: 54: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,481 INFO L280 TraceCheckUtils]: 55: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,481 INFO L280 TraceCheckUtils]: 56: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,482 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #103#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,482 INFO L263 TraceCheckUtils]: 58: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {6444#true} is VALID [2020-07-08 23:40:40,482 INFO L280 TraceCheckUtils]: 59: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,482 INFO L280 TraceCheckUtils]: 60: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,482 INFO L280 TraceCheckUtils]: 61: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,484 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #105#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,484 INFO L280 TraceCheckUtils]: 63: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post3 := ~buf~0; {6477#(<= (+ |main_#t~post3| 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,485 INFO L280 TraceCheckUtils]: 64: Hoare triple {6477#(<= (+ |main_#t~post3| 2) main_~bufferlen~0)} ~buf~0 := 1 + #t~post3; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,486 INFO L280 TraceCheckUtils]: 65: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~post3; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,486 INFO L280 TraceCheckUtils]: 66: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #t~post4 := ~in~0; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,487 INFO L280 TraceCheckUtils]: 67: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} ~in~0 := 1 + #t~post4; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,487 INFO L280 TraceCheckUtils]: 68: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~post4; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,487 INFO L263 TraceCheckUtils]: 69: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {6444#true} is VALID [2020-07-08 23:40:40,488 INFO L280 TraceCheckUtils]: 70: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,488 INFO L280 TraceCheckUtils]: 71: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,488 INFO L280 TraceCheckUtils]: 72: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,489 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {6444#true} {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #107#return; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,489 INFO L263 TraceCheckUtils]: 74: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {6444#true} is VALID [2020-07-08 23:40:40,489 INFO L280 TraceCheckUtils]: 75: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,489 INFO L280 TraceCheckUtils]: 76: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,489 INFO L280 TraceCheckUtils]: 77: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,490 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {6444#true} {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #109#return; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,490 INFO L280 TraceCheckUtils]: 79: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,491 INFO L280 TraceCheckUtils]: 80: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} assume !(0 != #t~nondet2); {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,491 INFO L280 TraceCheckUtils]: 81: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~nondet2; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,491 INFO L263 TraceCheckUtils]: 82: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {6444#true} is VALID [2020-07-08 23:40:40,491 INFO L280 TraceCheckUtils]: 83: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-08 23:40:40,492 INFO L280 TraceCheckUtils]: 84: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-08 23:40:40,492 INFO L280 TraceCheckUtils]: 85: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-08 23:40:40,493 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {6444#true} {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #111#return; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:40,494 INFO L263 TraceCheckUtils]: 87: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {6491#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:40,494 INFO L280 TraceCheckUtils]: 88: Hoare triple {6491#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {6492#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:40,495 INFO L280 TraceCheckUtils]: 89: Hoare triple {6492#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6445#false} is VALID [2020-07-08 23:40:40,495 INFO L280 TraceCheckUtils]: 90: Hoare triple {6445#false} assume !false; {6445#false} is VALID [2020-07-08 23:40:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-07-08 23:40:40,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [575416709] [2020-07-08 23:40:40,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:40,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-08 23:40:40,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462237244] [2020-07-08 23:40:40,508 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-07-08 23:40:40,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:40,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 23:40:40,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:40,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 23:40:40,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:40,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 23:40:40,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:40:40,595 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 11 states. [2020-07-08 23:40:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:42,167 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2020-07-08 23:40:42,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-08 23:40:42,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-07-08 23:40:42,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:40:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2020-07-08 23:40:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:40:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2020-07-08 23:40:42,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 127 transitions. [2020-07-08 23:40:42,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:42,352 INFO L225 Difference]: With dead ends: 134 [2020-07-08 23:40:42,352 INFO L226 Difference]: Without dead ends: 132 [2020-07-08 23:40:42,354 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2020-07-08 23:40:42,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-07-08 23:40:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2020-07-08 23:40:42,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:42,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 120 states. [2020-07-08 23:40:42,650 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 120 states. [2020-07-08 23:40:42,650 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 120 states. [2020-07-08 23:40:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:42,655 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2020-07-08 23:40:42,656 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2020-07-08 23:40:42,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:42,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:42,657 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 132 states. [2020-07-08 23:40:42,657 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 132 states. [2020-07-08 23:40:42,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:42,662 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2020-07-08 23:40:42,662 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2020-07-08 23:40:42,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:42,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:42,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:42,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-08 23:40:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2020-07-08 23:40:42,667 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 91 [2020-07-08 23:40:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:42,668 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2020-07-08 23:40:42,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 23:40:42,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 120 states and 133 transitions. [2020-07-08 23:40:42,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:42,892 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2020-07-08 23:40:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-07-08 23:40:42,894 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:42,894 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:42,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-08 23:40:42,894 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:42,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:42,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1949077486, now seen corresponding path program 2 times [2020-07-08 23:40:42,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:42,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1908839989] [2020-07-08 23:40:42,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:43,179 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,180 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7289#true} {7289#true} #99#return; {7289#true} is VALID [2020-07-08 23:40:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:43,184 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,185 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,187 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #103#return; {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 23:40:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:43,192 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,192 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,193 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #105#return; {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 23:40:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:43,198 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,199 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,200 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} #107#return; {7295#(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 23:40:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:43,208 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,209 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,209 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,210 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} #109#return; {7295#(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 23:40:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:43,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,217 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,218 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #103#return; {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:43,224 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,225 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,225 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,226 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #105#return; {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:43,233 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,234 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,237 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #107#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:43,242 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,242 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,242 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,244 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #109#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:43,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,252 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,253 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,253 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:43,261 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,261 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,262 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,269 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #113#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:43,275 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,276 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,276 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #115#return; {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,277 INFO L263 TraceCheckUtils]: 0: Hoare triple {7289#true} call ULTIMATE.init(); {7289#true} is VALID [2020-07-08 23:40:43,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,277 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7289#true} {7289#true} #99#return; {7289#true} is VALID [2020-07-08 23:40:43,277 INFO L263 TraceCheckUtils]: 3: Hoare triple {7289#true} call #t~ret7 := main(); {7289#true} is VALID [2020-07-08 23:40:43,277 INFO L280 TraceCheckUtils]: 4: Hoare triple {7289#true} havoc ~in~0; {7289#true} is VALID [2020-07-08 23:40:43,277 INFO L280 TraceCheckUtils]: 5: Hoare triple {7289#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7289#true} is VALID [2020-07-08 23:40:43,277 INFO L280 TraceCheckUtils]: 6: Hoare triple {7289#true} ~inlen~0 := #t~nondet0; {7289#true} is VALID [2020-07-08 23:40:43,278 INFO L280 TraceCheckUtils]: 7: Hoare triple {7289#true} havoc #t~nondet0; {7289#true} is VALID [2020-07-08 23:40:43,278 INFO L280 TraceCheckUtils]: 8: Hoare triple {7289#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7289#true} is VALID [2020-07-08 23:40:43,278 INFO L280 TraceCheckUtils]: 9: Hoare triple {7289#true} ~bufferlen~0 := #t~nondet1; {7289#true} is VALID [2020-07-08 23:40:43,278 INFO L280 TraceCheckUtils]: 10: Hoare triple {7289#true} havoc #t~nondet1; {7289#true} is VALID [2020-07-08 23:40:43,278 INFO L280 TraceCheckUtils]: 11: Hoare triple {7289#true} havoc ~buf~0; {7289#true} is VALID [2020-07-08 23:40:43,278 INFO L280 TraceCheckUtils]: 12: Hoare triple {7289#true} havoc ~buflim~0; {7289#true} is VALID [2020-07-08 23:40:43,279 INFO L280 TraceCheckUtils]: 13: Hoare triple {7289#true} assume ~bufferlen~0 > 1; {7293#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,279 INFO L280 TraceCheckUtils]: 14: Hoare triple {7293#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {7293#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,280 INFO L280 TraceCheckUtils]: 15: Hoare triple {7293#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {7293#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,280 INFO L280 TraceCheckUtils]: 16: Hoare triple {7293#(<= 2 main_~bufferlen~0)} ~buf~0 := 0; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,281 INFO L280 TraceCheckUtils]: 17: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 0; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,281 INFO L280 TraceCheckUtils]: 18: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {7295#(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 23:40:43,282 INFO L280 TraceCheckUtils]: 19: Hoare triple {7295#(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; {7295#(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 23:40:43,282 INFO L280 TraceCheckUtils]: 20: Hoare triple {7295#(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); {7295#(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 23:40:43,283 INFO L280 TraceCheckUtils]: 21: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~nondet2; {7295#(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 23:40:43,283 INFO L280 TraceCheckUtils]: 22: Hoare triple {7295#(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); {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 23:40:43,284 INFO L263 TraceCheckUtils]: 23: Hoare triple {7296#(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)); {7289#true} is VALID [2020-07-08 23:40:43,284 INFO L280 TraceCheckUtils]: 24: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,284 INFO L280 TraceCheckUtils]: 25: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,284 INFO L280 TraceCheckUtils]: 26: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,285 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {7289#true} {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #103#return; {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 23:40:43,286 INFO L263 TraceCheckUtils]: 28: Hoare triple {7296#(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)); {7289#true} is VALID [2020-07-08 23:40:43,286 INFO L280 TraceCheckUtils]: 29: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,286 INFO L280 TraceCheckUtils]: 30: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,286 INFO L280 TraceCheckUtils]: 31: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,287 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {7289#true} {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #105#return; {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 23:40:43,287 INFO L280 TraceCheckUtils]: 33: Hoare triple {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #t~post3 := ~buf~0; {7305#(and (<= (+ |main_#t~post3| 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-08 23:40:43,288 INFO L280 TraceCheckUtils]: 34: Hoare triple {7305#(and (<= (+ |main_#t~post3| 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} ~buf~0 := 1 + #t~post3; {7295#(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 23:40:43,288 INFO L280 TraceCheckUtils]: 35: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~post3; {7295#(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 23:40:43,289 INFO L280 TraceCheckUtils]: 36: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} #t~post4 := ~in~0; {7295#(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 23:40:43,289 INFO L280 TraceCheckUtils]: 37: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} ~in~0 := 1 + #t~post4; {7295#(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 23:40:43,290 INFO L280 TraceCheckUtils]: 38: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~post4; {7295#(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 23:40:43,290 INFO L263 TraceCheckUtils]: 39: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {7289#true} is VALID [2020-07-08 23:40:43,290 INFO L280 TraceCheckUtils]: 40: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,290 INFO L280 TraceCheckUtils]: 41: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,290 INFO L280 TraceCheckUtils]: 42: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,291 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {7289#true} {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} #107#return; {7295#(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 23:40:43,291 INFO L263 TraceCheckUtils]: 44: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {7289#true} is VALID [2020-07-08 23:40:43,291 INFO L280 TraceCheckUtils]: 45: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,292 INFO L280 TraceCheckUtils]: 46: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,292 INFO L280 TraceCheckUtils]: 47: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,292 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {7289#true} {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} #109#return; {7295#(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 23:40:43,293 INFO L280 TraceCheckUtils]: 49: Hoare triple {7295#(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; {7295#(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 23:40:43,293 INFO L280 TraceCheckUtils]: 50: Hoare triple {7295#(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); {7295#(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 23:40:43,294 INFO L280 TraceCheckUtils]: 51: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~nondet2; {7295#(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 23:40:43,295 INFO L280 TraceCheckUtils]: 52: Hoare triple {7295#(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); {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,295 INFO L263 TraceCheckUtils]: 53: Hoare triple {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {7289#true} is VALID [2020-07-08 23:40:43,295 INFO L280 TraceCheckUtils]: 54: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,295 INFO L280 TraceCheckUtils]: 55: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,295 INFO L280 TraceCheckUtils]: 56: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,296 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {7289#true} {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #103#return; {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,296 INFO L263 TraceCheckUtils]: 58: Hoare triple {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {7289#true} is VALID [2020-07-08 23:40:43,296 INFO L280 TraceCheckUtils]: 59: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,296 INFO L280 TraceCheckUtils]: 60: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,296 INFO L280 TraceCheckUtils]: 61: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,297 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {7289#true} {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #105#return; {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,297 INFO L280 TraceCheckUtils]: 63: Hoare triple {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #t~post3 := ~buf~0; {7323#(<= (+ |main_#t~post3| 3) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,298 INFO L280 TraceCheckUtils]: 64: Hoare triple {7323#(<= (+ |main_#t~post3| 3) main_~bufferlen~0)} ~buf~0 := 1 + #t~post3; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,299 INFO L280 TraceCheckUtils]: 65: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~post3; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,300 INFO L280 TraceCheckUtils]: 66: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post4 := ~in~0; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,300 INFO L280 TraceCheckUtils]: 67: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 1 + #t~post4; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,301 INFO L280 TraceCheckUtils]: 68: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~post4; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,301 INFO L263 TraceCheckUtils]: 69: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {7289#true} is VALID [2020-07-08 23:40:43,301 INFO L280 TraceCheckUtils]: 70: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,301 INFO L280 TraceCheckUtils]: 71: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,301 INFO L280 TraceCheckUtils]: 72: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,306 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #107#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,306 INFO L263 TraceCheckUtils]: 74: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {7289#true} is VALID [2020-07-08 23:40:43,306 INFO L280 TraceCheckUtils]: 75: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,306 INFO L280 TraceCheckUtils]: 76: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,307 INFO L280 TraceCheckUtils]: 77: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,308 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #109#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,310 INFO L280 TraceCheckUtils]: 79: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,312 INFO L280 TraceCheckUtils]: 80: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(0 != #t~nondet2); {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,312 INFO L280 TraceCheckUtils]: 81: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~nondet2; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,312 INFO L263 TraceCheckUtils]: 82: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {7289#true} is VALID [2020-07-08 23:40:43,312 INFO L280 TraceCheckUtils]: 83: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,312 INFO L280 TraceCheckUtils]: 84: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,313 INFO L280 TraceCheckUtils]: 85: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,313 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,313 INFO L263 TraceCheckUtils]: 87: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {7289#true} is VALID [2020-07-08 23:40:43,313 INFO L280 TraceCheckUtils]: 88: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,314 INFO L280 TraceCheckUtils]: 89: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,314 INFO L280 TraceCheckUtils]: 90: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,314 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #113#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,315 INFO L280 TraceCheckUtils]: 92: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post5 := ~buf~0; {7340#(<= (+ |main_#t~post5| 2) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,316 INFO L280 TraceCheckUtils]: 93: Hoare triple {7340#(<= (+ |main_#t~post5| 2) main_~bufferlen~0)} ~buf~0 := 1 + #t~post5; {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,317 INFO L280 TraceCheckUtils]: 94: Hoare triple {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~post5; {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,317 INFO L263 TraceCheckUtils]: 95: Hoare triple {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {7289#true} is VALID [2020-07-08 23:40:43,317 INFO L280 TraceCheckUtils]: 96: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-08 23:40:43,318 INFO L280 TraceCheckUtils]: 97: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-08 23:40:43,318 INFO L280 TraceCheckUtils]: 98: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-08 23:40:43,319 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {7289#true} {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #115#return; {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-08 23:40:43,325 INFO L263 TraceCheckUtils]: 100: Hoare triple {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {7346#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:43,325 INFO L280 TraceCheckUtils]: 101: Hoare triple {7346#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {7347#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:43,326 INFO L280 TraceCheckUtils]: 102: Hoare triple {7347#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {7290#false} is VALID [2020-07-08 23:40:43,326 INFO L280 TraceCheckUtils]: 103: Hoare triple {7290#false} assume !false; {7290#false} is VALID [2020-07-08 23:40:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2020-07-08 23:40:43,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1908839989] [2020-07-08 23:40:43,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:43,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-08 23:40:43,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832948255] [2020-07-08 23:40:43,342 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2020-07-08 23:40:43,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:43,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 23:40:43,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:43,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 23:40:43,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:43,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 23:40:43,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-07-08 23:40:43,439 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 13 states. [2020-07-08 23:40:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:44,765 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2020-07-08 23:40:44,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 23:40:44,766 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2020-07-08 23:40:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:40:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2020-07-08 23:40:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:40:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2020-07-08 23:40:44,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 60 transitions. [2020-07-08 23:40:44,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:44,858 INFO L225 Difference]: With dead ends: 126 [2020-07-08 23:40:44,859 INFO L226 Difference]: Without dead ends: 109 [2020-07-08 23:40:44,860 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2020-07-08 23:40:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-08 23:40:45,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2020-07-08 23:40:45,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:45,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 99 states. [2020-07-08 23:40:45,130 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 99 states. [2020-07-08 23:40:45,130 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 99 states. [2020-07-08 23:40:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:45,135 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2020-07-08 23:40:45,136 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2020-07-08 23:40:45,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:45,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:45,137 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 109 states. [2020-07-08 23:40:45,137 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 109 states. [2020-07-08 23:40:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:45,140 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2020-07-08 23:40:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2020-07-08 23:40:45,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:45,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:45,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:45,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-08 23:40:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2020-07-08 23:40:45,145 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 104 [2020-07-08 23:40:45,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:45,146 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2020-07-08 23:40:45,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 23:40:45,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 99 states and 102 transitions. [2020-07-08 23:40:45,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2020-07-08 23:40:45,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-08 23:40:45,302 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:45,302 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 23:40:45,303 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-08 23:40:45,303 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:45,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:45,303 INFO L82 PathProgramCache]: Analyzing trace with hash 55355532, now seen corresponding path program 2 times [2020-07-08 23:40:45,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:45,304 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [441635707] [2020-07-08 23:40:45,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:45,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,620 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8036#true} {8036#true} #99#return; {8036#true} is VALID [2020-07-08 23:40:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:45,627 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,628 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,628 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,629 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8045#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #103#return; {8045#(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 23:40:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:45,635 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,636 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,637 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8045#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #105#return; {8045#(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 23:40:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:45,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,641 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,642 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,642 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8056#(<= (+ main_~in~0 3) main_~inlen~0)} #107#return; {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:45,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,647 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8056#(<= (+ main_~in~0 3) main_~inlen~0)} #109#return; {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:45,651 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,652 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,653 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8056#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:45,657 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,657 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,658 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,659 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8056#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:45,663 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,664 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,664 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,665 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8074#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:45,669 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,670 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,670 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8074#(<= (+ main_~in~0 2) main_~inlen~0)} #109#return; {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:45,680 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,681 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,681 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,682 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8074#(<= (+ main_~in~0 2) main_~inlen~0)} #103#return; {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:45,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,705 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,709 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8074#(<= (+ main_~in~0 2) main_~inlen~0)} #105#return; {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:45,716 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,717 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,717 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,718 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8092#(<= (+ main_~in~0 1) main_~inlen~0)} #107#return; {8092#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 23:40:45,718 INFO L263 TraceCheckUtils]: 0: Hoare triple {8036#true} call ULTIMATE.init(); {8036#true} is VALID [2020-07-08 23:40:45,718 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,719 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8036#true} {8036#true} #99#return; {8036#true} is VALID [2020-07-08 23:40:45,719 INFO L263 TraceCheckUtils]: 3: Hoare triple {8036#true} call #t~ret7 := main(); {8036#true} is VALID [2020-07-08 23:40:45,719 INFO L280 TraceCheckUtils]: 4: Hoare triple {8036#true} havoc ~in~0; {8036#true} is VALID [2020-07-08 23:40:45,719 INFO L280 TraceCheckUtils]: 5: Hoare triple {8036#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8036#true} is VALID [2020-07-08 23:40:45,719 INFO L280 TraceCheckUtils]: 6: Hoare triple {8036#true} ~inlen~0 := #t~nondet0; {8036#true} is VALID [2020-07-08 23:40:45,720 INFO L280 TraceCheckUtils]: 7: Hoare triple {8036#true} havoc #t~nondet0; {8036#true} is VALID [2020-07-08 23:40:45,720 INFO L280 TraceCheckUtils]: 8: Hoare triple {8036#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8036#true} is VALID [2020-07-08 23:40:45,720 INFO L280 TraceCheckUtils]: 9: Hoare triple {8036#true} ~bufferlen~0 := #t~nondet1; {8036#true} is VALID [2020-07-08 23:40:45,720 INFO L280 TraceCheckUtils]: 10: Hoare triple {8036#true} havoc #t~nondet1; {8036#true} is VALID [2020-07-08 23:40:45,720 INFO L280 TraceCheckUtils]: 11: Hoare triple {8036#true} havoc ~buf~0; {8036#true} is VALID [2020-07-08 23:40:45,721 INFO L280 TraceCheckUtils]: 12: Hoare triple {8036#true} havoc ~buflim~0; {8036#true} is VALID [2020-07-08 23:40:45,721 INFO L280 TraceCheckUtils]: 13: Hoare triple {8036#true} assume ~bufferlen~0 > 1; {8040#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:45,722 INFO L280 TraceCheckUtils]: 14: Hoare triple {8040#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {8040#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:45,723 INFO L280 TraceCheckUtils]: 15: Hoare triple {8040#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {8041#(and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))} is VALID [2020-07-08 23:40:45,723 INFO L280 TraceCheckUtils]: 16: Hoare triple {8041#(and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))} ~buf~0 := 0; {8042#(and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)))} is VALID [2020-07-08 23:40:45,724 INFO L280 TraceCheckUtils]: 17: Hoare triple {8042#(and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)))} ~in~0 := 0; {8043#(and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0))} is VALID [2020-07-08 23:40:45,725 INFO L280 TraceCheckUtils]: 18: Hoare triple {8043#(and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0))} ~buflim~0 := ~bufferlen~0 - 2; {8044#(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 23:40:45,726 INFO L280 TraceCheckUtils]: 19: Hoare triple {8044#(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; {8044#(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 23:40:45,727 INFO L280 TraceCheckUtils]: 20: Hoare triple {8044#(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); {8044#(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 23:40:45,727 INFO L280 TraceCheckUtils]: 21: Hoare triple {8044#(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))} havoc #t~nondet2; {8044#(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 23:40:45,728 INFO L280 TraceCheckUtils]: 22: Hoare triple {8044#(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); {8045#(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 23:40:45,729 INFO L263 TraceCheckUtils]: 23: Hoare triple {8045#(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)); {8036#true} is VALID [2020-07-08 23:40:45,729 INFO L280 TraceCheckUtils]: 24: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,729 INFO L280 TraceCheckUtils]: 25: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,729 INFO L280 TraceCheckUtils]: 26: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,730 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {8036#true} {8045#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #103#return; {8045#(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 23:40:45,730 INFO L263 TraceCheckUtils]: 28: Hoare triple {8045#(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)); {8036#true} is VALID [2020-07-08 23:40:45,731 INFO L280 TraceCheckUtils]: 29: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,731 INFO L280 TraceCheckUtils]: 30: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,731 INFO L280 TraceCheckUtils]: 31: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,732 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {8036#true} {8045#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #105#return; {8045#(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 23:40:45,733 INFO L280 TraceCheckUtils]: 33: Hoare triple {8045#(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; {8054#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-08 23:40:45,733 INFO L280 TraceCheckUtils]: 34: Hoare triple {8054#(<= (+ main_~in~0 4) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {8054#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-08 23:40:45,734 INFO L280 TraceCheckUtils]: 35: Hoare triple {8054#(<= (+ main_~in~0 4) main_~inlen~0)} havoc #t~post3; {8054#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-08 23:40:45,735 INFO L280 TraceCheckUtils]: 36: Hoare triple {8054#(<= (+ main_~in~0 4) main_~inlen~0)} #t~post4 := ~in~0; {8055#(<= (+ |main_#t~post4| 4) main_~inlen~0)} is VALID [2020-07-08 23:40:45,736 INFO L280 TraceCheckUtils]: 37: Hoare triple {8055#(<= (+ |main_#t~post4| 4) main_~inlen~0)} ~in~0 := 1 + #t~post4; {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,736 INFO L280 TraceCheckUtils]: 38: Hoare triple {8056#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~post4; {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,736 INFO L263 TraceCheckUtils]: 39: Hoare triple {8056#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {8036#true} is VALID [2020-07-08 23:40:45,737 INFO L280 TraceCheckUtils]: 40: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,737 INFO L280 TraceCheckUtils]: 41: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,737 INFO L280 TraceCheckUtils]: 42: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,738 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {8036#true} {8056#(<= (+ main_~in~0 3) main_~inlen~0)} #107#return; {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,738 INFO L263 TraceCheckUtils]: 44: Hoare triple {8056#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {8036#true} is VALID [2020-07-08 23:40:45,738 INFO L280 TraceCheckUtils]: 45: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,738 INFO L280 TraceCheckUtils]: 46: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,739 INFO L280 TraceCheckUtils]: 47: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,739 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {8036#true} {8056#(<= (+ main_~in~0 3) main_~inlen~0)} #109#return; {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,740 INFO L280 TraceCheckUtils]: 49: Hoare triple {8056#(<= (+ main_~in~0 3) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,740 INFO L280 TraceCheckUtils]: 50: Hoare triple {8056#(<= (+ main_~in~0 3) main_~inlen~0)} assume !!(0 != #t~nondet2); {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,741 INFO L280 TraceCheckUtils]: 51: Hoare triple {8056#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~nondet2; {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,741 INFO L280 TraceCheckUtils]: 52: Hoare triple {8056#(<= (+ main_~in~0 3) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,741 INFO L263 TraceCheckUtils]: 53: Hoare triple {8056#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {8036#true} is VALID [2020-07-08 23:40:45,742 INFO L280 TraceCheckUtils]: 54: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,742 INFO L280 TraceCheckUtils]: 55: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,742 INFO L280 TraceCheckUtils]: 56: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,743 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {8036#true} {8056#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,743 INFO L263 TraceCheckUtils]: 58: Hoare triple {8056#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {8036#true} is VALID [2020-07-08 23:40:45,743 INFO L280 TraceCheckUtils]: 59: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,743 INFO L280 TraceCheckUtils]: 60: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,744 INFO L280 TraceCheckUtils]: 61: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,744 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {8036#true} {8056#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,745 INFO L280 TraceCheckUtils]: 63: Hoare triple {8056#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post3 := ~buf~0; {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,745 INFO L280 TraceCheckUtils]: 64: Hoare triple {8056#(<= (+ main_~in~0 3) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,746 INFO L280 TraceCheckUtils]: 65: Hoare triple {8056#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~post3; {8056#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,746 INFO L280 TraceCheckUtils]: 66: Hoare triple {8056#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post4 := ~in~0; {8073#(<= (+ |main_#t~post4| 3) main_~inlen~0)} is VALID [2020-07-08 23:40:45,747 INFO L280 TraceCheckUtils]: 67: Hoare triple {8073#(<= (+ |main_#t~post4| 3) main_~inlen~0)} ~in~0 := 1 + #t~post4; {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,748 INFO L280 TraceCheckUtils]: 68: Hoare triple {8074#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~post4; {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,748 INFO L263 TraceCheckUtils]: 69: Hoare triple {8074#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {8036#true} is VALID [2020-07-08 23:40:45,748 INFO L280 TraceCheckUtils]: 70: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,748 INFO L280 TraceCheckUtils]: 71: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,749 INFO L280 TraceCheckUtils]: 72: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,749 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {8036#true} {8074#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,750 INFO L263 TraceCheckUtils]: 74: Hoare triple {8074#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {8036#true} is VALID [2020-07-08 23:40:45,750 INFO L280 TraceCheckUtils]: 75: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,750 INFO L280 TraceCheckUtils]: 76: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,750 INFO L280 TraceCheckUtils]: 77: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,751 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {8036#true} {8074#(<= (+ main_~in~0 2) main_~inlen~0)} #109#return; {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,751 INFO L280 TraceCheckUtils]: 79: Hoare triple {8074#(<= (+ main_~in~0 2) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,752 INFO L280 TraceCheckUtils]: 80: Hoare triple {8074#(<= (+ main_~in~0 2) main_~inlen~0)} assume !!(0 != #t~nondet2); {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,752 INFO L280 TraceCheckUtils]: 81: Hoare triple {8074#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~nondet2; {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,753 INFO L280 TraceCheckUtils]: 82: Hoare triple {8074#(<= (+ main_~in~0 2) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,753 INFO L263 TraceCheckUtils]: 83: Hoare triple {8074#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {8036#true} is VALID [2020-07-08 23:40:45,753 INFO L280 TraceCheckUtils]: 84: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,753 INFO L280 TraceCheckUtils]: 85: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,753 INFO L280 TraceCheckUtils]: 86: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,754 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {8036#true} {8074#(<= (+ main_~in~0 2) main_~inlen~0)} #103#return; {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,754 INFO L263 TraceCheckUtils]: 88: Hoare triple {8074#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {8036#true} is VALID [2020-07-08 23:40:45,755 INFO L280 TraceCheckUtils]: 89: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,755 INFO L280 TraceCheckUtils]: 90: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,755 INFO L280 TraceCheckUtils]: 91: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,756 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {8036#true} {8074#(<= (+ main_~in~0 2) main_~inlen~0)} #105#return; {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,756 INFO L280 TraceCheckUtils]: 93: Hoare triple {8074#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post3 := ~buf~0; {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,757 INFO L280 TraceCheckUtils]: 94: Hoare triple {8074#(<= (+ main_~in~0 2) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,757 INFO L280 TraceCheckUtils]: 95: Hoare triple {8074#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~post3; {8074#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,758 INFO L280 TraceCheckUtils]: 96: Hoare triple {8074#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post4 := ~in~0; {8091#(<= (+ |main_#t~post4| 2) main_~inlen~0)} is VALID [2020-07-08 23:40:45,758 INFO L280 TraceCheckUtils]: 97: Hoare triple {8091#(<= (+ |main_#t~post4| 2) main_~inlen~0)} ~in~0 := 1 + #t~post4; {8092#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 23:40:45,759 INFO L280 TraceCheckUtils]: 98: Hoare triple {8092#(<= (+ main_~in~0 1) main_~inlen~0)} havoc #t~post4; {8092#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 23:40:45,759 INFO L263 TraceCheckUtils]: 99: Hoare triple {8092#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {8036#true} is VALID [2020-07-08 23:40:45,759 INFO L280 TraceCheckUtils]: 100: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-08 23:40:45,760 INFO L280 TraceCheckUtils]: 101: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-08 23:40:45,760 INFO L280 TraceCheckUtils]: 102: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-08 23:40:45,761 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {8036#true} {8092#(<= (+ main_~in~0 1) main_~inlen~0)} #107#return; {8092#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 23:40:45,762 INFO L263 TraceCheckUtils]: 104: Hoare triple {8092#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {8097#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:45,762 INFO L280 TraceCheckUtils]: 105: Hoare triple {8097#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {8098#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:45,763 INFO L280 TraceCheckUtils]: 106: Hoare triple {8098#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8037#false} is VALID [2020-07-08 23:40:45,763 INFO L280 TraceCheckUtils]: 107: Hoare triple {8037#false} assume !false; {8037#false} is VALID [2020-07-08 23:40:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-07-08 23:40:45,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [441635707] [2020-07-08 23:40:45,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:45,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-08 23:40:45,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730500202] [2020-07-08 23:40:45,779 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 108 [2020-07-08 23:40:45,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:45,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-08 23:40:45,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:45,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-08 23:40:45,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:45,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-08 23:40:45,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-07-08 23:40:45,872 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 17 states. [2020-07-08 23:40:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:47,870 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2020-07-08 23:40:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-08 23:40:47,871 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 108 [2020-07-08 23:40:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 23:40:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2020-07-08 23:40:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 23:40:47,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2020-07-08 23:40:47,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 114 transitions. [2020-07-08 23:40:48,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:48,037 INFO L225 Difference]: With dead ends: 130 [2020-07-08 23:40:48,037 INFO L226 Difference]: Without dead ends: 128 [2020-07-08 23:40:48,038 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2020-07-08 23:40:48,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-08 23:40:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2020-07-08 23:40:48,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:48,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 117 states. [2020-07-08 23:40:48,392 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 117 states. [2020-07-08 23:40:48,392 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 117 states. [2020-07-08 23:40:48,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:48,396 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2020-07-08 23:40:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2020-07-08 23:40:48,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:48,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:48,397 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 128 states. [2020-07-08 23:40:48,397 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 128 states. [2020-07-08 23:40:48,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:48,402 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2020-07-08 23:40:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2020-07-08 23:40:48,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:48,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:48,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:48,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-08 23:40:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2020-07-08 23:40:48,408 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 108 [2020-07-08 23:40:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:48,409 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2020-07-08 23:40:48,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-08 23:40:48,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 117 states and 123 transitions. [2020-07-08 23:40:48,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2020-07-08 23:40:48,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-07-08 23:40:48,662 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:48,662 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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 23:40:48,662 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-08 23:40:48,662 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:48,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:48,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1897035733, now seen corresponding path program 3 times [2020-07-08 23:40:48,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:48,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [356949541] [2020-07-08 23:40:48,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,347 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,347 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8881#true} {8881#true} #99#return; {8881#true} is VALID [2020-07-08 23:40:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,356 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,358 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8881#true} {8890#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #103#return; {8890#(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 23:40:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,367 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,368 INFO L280 TraceCheckUtils]: 2: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,369 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8881#true} {8890#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #105#return; {8890#(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 23:40:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,375 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,376 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,377 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8881#true} {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} #107#return; {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 23:40:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,383 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,384 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,384 INFO L280 TraceCheckUtils]: 2: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,386 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8881#true} {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} #109#return; {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 23:40:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,392 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,394 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8881#true} {8890#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #103#return; {8890#(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 23:40:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,401 INFO L280 TraceCheckUtils]: 2: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,402 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8881#true} {8890#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #105#return; {8890#(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 23:40:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,408 INFO L280 TraceCheckUtils]: 2: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,409 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8881#true} {8921#(<= (+ main_~in~0 3) main_~inlen~0)} #107#return; {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,414 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,415 INFO L280 TraceCheckUtils]: 2: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,416 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8881#true} {8921#(<= (+ main_~in~0 3) main_~inlen~0)} #109#return; {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,423 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,423 INFO L280 TraceCheckUtils]: 2: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,425 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8881#true} {8921#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,430 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,430 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,431 INFO L280 TraceCheckUtils]: 2: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,432 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8881#true} {8921#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,443 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,443 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,445 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8881#true} {8939#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,459 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,459 INFO L280 TraceCheckUtils]: 2: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,460 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8881#true} {8939#(<= (+ main_~in~0 2) main_~inlen~0)} #109#return; {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,467 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,467 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,467 INFO L280 TraceCheckUtils]: 2: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,469 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8881#true} {8939#(<= (+ main_~in~0 2) main_~inlen~0)} #103#return; {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,474 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,474 INFO L280 TraceCheckUtils]: 2: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,476 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8881#true} {8939#(<= (+ main_~in~0 2) main_~inlen~0)} #105#return; {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:49,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,485 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,486 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8881#true} {8957#(<= (+ main_~in~0 1) main_~inlen~0)} #107#return; {8957#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 23:40:49,487 INFO L263 TraceCheckUtils]: 0: Hoare triple {8881#true} call ULTIMATE.init(); {8881#true} is VALID [2020-07-08 23:40:49,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,487 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8881#true} {8881#true} #99#return; {8881#true} is VALID [2020-07-08 23:40:49,487 INFO L263 TraceCheckUtils]: 3: Hoare triple {8881#true} call #t~ret7 := main(); {8881#true} is VALID [2020-07-08 23:40:49,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {8881#true} havoc ~in~0; {8881#true} is VALID [2020-07-08 23:40:49,488 INFO L280 TraceCheckUtils]: 5: Hoare triple {8881#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8881#true} is VALID [2020-07-08 23:40:49,488 INFO L280 TraceCheckUtils]: 6: Hoare triple {8881#true} ~inlen~0 := #t~nondet0; {8881#true} is VALID [2020-07-08 23:40:49,489 INFO L280 TraceCheckUtils]: 7: Hoare triple {8881#true} havoc #t~nondet0; {8881#true} is VALID [2020-07-08 23:40:49,489 INFO L280 TraceCheckUtils]: 8: Hoare triple {8881#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8881#true} is VALID [2020-07-08 23:40:49,489 INFO L280 TraceCheckUtils]: 9: Hoare triple {8881#true} ~bufferlen~0 := #t~nondet1; {8881#true} is VALID [2020-07-08 23:40:49,489 INFO L280 TraceCheckUtils]: 10: Hoare triple {8881#true} havoc #t~nondet1; {8881#true} is VALID [2020-07-08 23:40:49,490 INFO L280 TraceCheckUtils]: 11: Hoare triple {8881#true} havoc ~buf~0; {8881#true} is VALID [2020-07-08 23:40:49,490 INFO L280 TraceCheckUtils]: 12: Hoare triple {8881#true} havoc ~buflim~0; {8881#true} is VALID [2020-07-08 23:40:49,491 INFO L280 TraceCheckUtils]: 13: Hoare triple {8881#true} assume ~bufferlen~0 > 1; {8885#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:49,492 INFO L280 TraceCheckUtils]: 14: Hoare triple {8885#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {8885#(<= 2 main_~bufferlen~0)} is VALID [2020-07-08 23:40:49,493 INFO L280 TraceCheckUtils]: 15: Hoare triple {8885#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {8886#(and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))} is VALID [2020-07-08 23:40:49,495 INFO L280 TraceCheckUtils]: 16: Hoare triple {8886#(and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))} ~buf~0 := 0; {8887#(and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)))} is VALID [2020-07-08 23:40:49,496 INFO L280 TraceCheckUtils]: 17: Hoare triple {8887#(and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)))} ~in~0 := 0; {8888#(and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0))} is VALID [2020-07-08 23:40:49,497 INFO L280 TraceCheckUtils]: 18: Hoare triple {8888#(and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0))} ~buflim~0 := ~bufferlen~0 - 2; {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 23:40:49,498 INFO L280 TraceCheckUtils]: 19: Hoare triple {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 23:40:49,500 INFO L280 TraceCheckUtils]: 20: Hoare triple {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} assume !!(0 != #t~nondet2); {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 23:40:49,501 INFO L280 TraceCheckUtils]: 21: Hoare triple {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~nondet2; {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 23:40:49,502 INFO L280 TraceCheckUtils]: 22: Hoare triple {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} assume !(~buf~0 == ~buflim~0); {8890#(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 23:40:49,502 INFO L263 TraceCheckUtils]: 23: Hoare triple {8890#(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)); {8881#true} is VALID [2020-07-08 23:40:49,503 INFO L280 TraceCheckUtils]: 24: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,503 INFO L280 TraceCheckUtils]: 25: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,503 INFO L280 TraceCheckUtils]: 26: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,505 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {8881#true} {8890#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #103#return; {8890#(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 23:40:49,505 INFO L263 TraceCheckUtils]: 28: Hoare triple {8890#(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)); {8881#true} is VALID [2020-07-08 23:40:49,505 INFO L280 TraceCheckUtils]: 29: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,505 INFO L280 TraceCheckUtils]: 30: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,506 INFO L280 TraceCheckUtils]: 31: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,507 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {8881#true} {8890#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #105#return; {8890#(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 23:40:49,508 INFO L280 TraceCheckUtils]: 33: Hoare triple {8890#(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; {8899#(and (<= (+ |main_#t~post3| 1) main_~buflim~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ |main_#t~post3| main_~inlen~0)))} is VALID [2020-07-08 23:40:49,510 INFO L280 TraceCheckUtils]: 34: Hoare triple {8899#(and (<= (+ |main_#t~post3| 1) main_~buflim~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ |main_#t~post3| main_~inlen~0)))} ~buf~0 := 1 + #t~post3; {8900#(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 23:40:49,511 INFO L280 TraceCheckUtils]: 35: Hoare triple {8900#(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)))} havoc #t~post3; {8900#(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 23:40:49,512 INFO L280 TraceCheckUtils]: 36: Hoare triple {8900#(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; {8901#(and (or (<= (+ |main_#t~post4| main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 23:40:49,514 INFO L280 TraceCheckUtils]: 37: Hoare triple {8901#(and (or (<= (+ |main_#t~post4| main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} ~in~0 := 1 + #t~post4; {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 23:40:49,515 INFO L280 TraceCheckUtils]: 38: Hoare triple {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~post4; {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 23:40:49,515 INFO L263 TraceCheckUtils]: 39: Hoare triple {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {8881#true} is VALID [2020-07-08 23:40:49,515 INFO L280 TraceCheckUtils]: 40: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,516 INFO L280 TraceCheckUtils]: 41: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,516 INFO L280 TraceCheckUtils]: 42: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,517 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {8881#true} {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} #107#return; {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 23:40:49,518 INFO L263 TraceCheckUtils]: 44: Hoare triple {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {8881#true} is VALID [2020-07-08 23:40:49,518 INFO L280 TraceCheckUtils]: 45: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,518 INFO L280 TraceCheckUtils]: 46: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,518 INFO L280 TraceCheckUtils]: 47: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,520 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {8881#true} {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} #109#return; {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 23:40:49,521 INFO L280 TraceCheckUtils]: 49: Hoare triple {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 23:40:49,522 INFO L280 TraceCheckUtils]: 50: Hoare triple {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} assume !!(0 != #t~nondet2); {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 23:40:49,523 INFO L280 TraceCheckUtils]: 51: Hoare triple {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~nondet2; {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-08 23:40:49,525 INFO L280 TraceCheckUtils]: 52: Hoare triple {8902#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} assume !(~buf~0 == ~buflim~0); {8890#(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 23:40:49,525 INFO L263 TraceCheckUtils]: 53: Hoare triple {8890#(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)); {8881#true} is VALID [2020-07-08 23:40:49,525 INFO L280 TraceCheckUtils]: 54: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,526 INFO L280 TraceCheckUtils]: 55: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,526 INFO L280 TraceCheckUtils]: 56: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,527 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {8881#true} {8890#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #103#return; {8890#(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 23:40:49,528 INFO L263 TraceCheckUtils]: 58: Hoare triple {8890#(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)); {8881#true} is VALID [2020-07-08 23:40:49,528 INFO L280 TraceCheckUtils]: 59: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,528 INFO L280 TraceCheckUtils]: 60: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,528 INFO L280 TraceCheckUtils]: 61: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,530 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {8881#true} {8890#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #105#return; {8890#(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 23:40:49,531 INFO L280 TraceCheckUtils]: 63: Hoare triple {8890#(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; {8919#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-08 23:40:49,532 INFO L280 TraceCheckUtils]: 64: Hoare triple {8919#(<= (+ main_~in~0 4) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {8919#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-08 23:40:49,533 INFO L280 TraceCheckUtils]: 65: Hoare triple {8919#(<= (+ main_~in~0 4) main_~inlen~0)} havoc #t~post3; {8919#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-08 23:40:49,534 INFO L280 TraceCheckUtils]: 66: Hoare triple {8919#(<= (+ main_~in~0 4) main_~inlen~0)} #t~post4 := ~in~0; {8920#(<= (+ |main_#t~post4| 4) main_~inlen~0)} is VALID [2020-07-08 23:40:49,535 INFO L280 TraceCheckUtils]: 67: Hoare triple {8920#(<= (+ |main_#t~post4| 4) main_~inlen~0)} ~in~0 := 1 + #t~post4; {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,536 INFO L280 TraceCheckUtils]: 68: Hoare triple {8921#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~post4; {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,536 INFO L263 TraceCheckUtils]: 69: Hoare triple {8921#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {8881#true} is VALID [2020-07-08 23:40:49,536 INFO L280 TraceCheckUtils]: 70: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,537 INFO L280 TraceCheckUtils]: 71: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,537 INFO L280 TraceCheckUtils]: 72: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,538 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {8881#true} {8921#(<= (+ main_~in~0 3) main_~inlen~0)} #107#return; {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,538 INFO L263 TraceCheckUtils]: 74: Hoare triple {8921#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {8881#true} is VALID [2020-07-08 23:40:49,539 INFO L280 TraceCheckUtils]: 75: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,539 INFO L280 TraceCheckUtils]: 76: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,539 INFO L280 TraceCheckUtils]: 77: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,540 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {8881#true} {8921#(<= (+ main_~in~0 3) main_~inlen~0)} #109#return; {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,541 INFO L280 TraceCheckUtils]: 79: Hoare triple {8921#(<= (+ main_~in~0 3) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,542 INFO L280 TraceCheckUtils]: 80: Hoare triple {8921#(<= (+ main_~in~0 3) main_~inlen~0)} assume !!(0 != #t~nondet2); {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,543 INFO L280 TraceCheckUtils]: 81: Hoare triple {8921#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~nondet2; {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,544 INFO L280 TraceCheckUtils]: 82: Hoare triple {8921#(<= (+ main_~in~0 3) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,544 INFO L263 TraceCheckUtils]: 83: Hoare triple {8921#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {8881#true} is VALID [2020-07-08 23:40:49,544 INFO L280 TraceCheckUtils]: 84: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,544 INFO L280 TraceCheckUtils]: 85: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,545 INFO L280 TraceCheckUtils]: 86: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,546 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {8881#true} {8921#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,546 INFO L263 TraceCheckUtils]: 88: Hoare triple {8921#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {8881#true} is VALID [2020-07-08 23:40:49,547 INFO L280 TraceCheckUtils]: 89: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,547 INFO L280 TraceCheckUtils]: 90: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,547 INFO L280 TraceCheckUtils]: 91: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,548 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {8881#true} {8921#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,549 INFO L280 TraceCheckUtils]: 93: Hoare triple {8921#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post3 := ~buf~0; {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,550 INFO L280 TraceCheckUtils]: 94: Hoare triple {8921#(<= (+ main_~in~0 3) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,551 INFO L280 TraceCheckUtils]: 95: Hoare triple {8921#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~post3; {8921#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,552 INFO L280 TraceCheckUtils]: 96: Hoare triple {8921#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post4 := ~in~0; {8938#(<= (+ |main_#t~post4| 3) main_~inlen~0)} is VALID [2020-07-08 23:40:49,553 INFO L280 TraceCheckUtils]: 97: Hoare triple {8938#(<= (+ |main_#t~post4| 3) main_~inlen~0)} ~in~0 := 1 + #t~post4; {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,554 INFO L280 TraceCheckUtils]: 98: Hoare triple {8939#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~post4; {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,554 INFO L263 TraceCheckUtils]: 99: Hoare triple {8939#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {8881#true} is VALID [2020-07-08 23:40:49,555 INFO L280 TraceCheckUtils]: 100: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,555 INFO L280 TraceCheckUtils]: 101: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,555 INFO L280 TraceCheckUtils]: 102: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,556 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {8881#true} {8939#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,557 INFO L263 TraceCheckUtils]: 104: Hoare triple {8939#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {8881#true} is VALID [2020-07-08 23:40:49,557 INFO L280 TraceCheckUtils]: 105: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,557 INFO L280 TraceCheckUtils]: 106: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,558 INFO L280 TraceCheckUtils]: 107: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,559 INFO L275 TraceCheckUtils]: 108: Hoare quadruple {8881#true} {8939#(<= (+ main_~in~0 2) main_~inlen~0)} #109#return; {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,560 INFO L280 TraceCheckUtils]: 109: Hoare triple {8939#(<= (+ main_~in~0 2) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,560 INFO L280 TraceCheckUtils]: 110: Hoare triple {8939#(<= (+ main_~in~0 2) main_~inlen~0)} assume !!(0 != #t~nondet2); {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,561 INFO L280 TraceCheckUtils]: 111: Hoare triple {8939#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~nondet2; {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,562 INFO L280 TraceCheckUtils]: 112: Hoare triple {8939#(<= (+ main_~in~0 2) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,562 INFO L263 TraceCheckUtils]: 113: Hoare triple {8939#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {8881#true} is VALID [2020-07-08 23:40:49,563 INFO L280 TraceCheckUtils]: 114: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,563 INFO L280 TraceCheckUtils]: 115: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,563 INFO L280 TraceCheckUtils]: 116: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,565 INFO L275 TraceCheckUtils]: 117: Hoare quadruple {8881#true} {8939#(<= (+ main_~in~0 2) main_~inlen~0)} #103#return; {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,565 INFO L263 TraceCheckUtils]: 118: Hoare triple {8939#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {8881#true} is VALID [2020-07-08 23:40:49,565 INFO L280 TraceCheckUtils]: 119: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,565 INFO L280 TraceCheckUtils]: 120: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,566 INFO L280 TraceCheckUtils]: 121: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,566 INFO L275 TraceCheckUtils]: 122: Hoare quadruple {8881#true} {8939#(<= (+ main_~in~0 2) main_~inlen~0)} #105#return; {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,567 INFO L280 TraceCheckUtils]: 123: Hoare triple {8939#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post3 := ~buf~0; {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,568 INFO L280 TraceCheckUtils]: 124: Hoare triple {8939#(<= (+ main_~in~0 2) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,568 INFO L280 TraceCheckUtils]: 125: Hoare triple {8939#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~post3; {8939#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,569 INFO L280 TraceCheckUtils]: 126: Hoare triple {8939#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post4 := ~in~0; {8956#(<= (+ |main_#t~post4| 2) main_~inlen~0)} is VALID [2020-07-08 23:40:49,569 INFO L280 TraceCheckUtils]: 127: Hoare triple {8956#(<= (+ |main_#t~post4| 2) main_~inlen~0)} ~in~0 := 1 + #t~post4; {8957#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 23:40:49,570 INFO L280 TraceCheckUtils]: 128: Hoare triple {8957#(<= (+ main_~in~0 1) main_~inlen~0)} havoc #t~post4; {8957#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 23:40:49,570 INFO L263 TraceCheckUtils]: 129: Hoare triple {8957#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {8881#true} is VALID [2020-07-08 23:40:49,570 INFO L280 TraceCheckUtils]: 130: Hoare triple {8881#true} ~cond := #in~cond; {8881#true} is VALID [2020-07-08 23:40:49,571 INFO L280 TraceCheckUtils]: 131: Hoare triple {8881#true} assume !(0 == ~cond); {8881#true} is VALID [2020-07-08 23:40:49,571 INFO L280 TraceCheckUtils]: 132: Hoare triple {8881#true} assume true; {8881#true} is VALID [2020-07-08 23:40:49,572 INFO L275 TraceCheckUtils]: 133: Hoare quadruple {8881#true} {8957#(<= (+ main_~in~0 1) main_~inlen~0)} #107#return; {8957#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-08 23:40:49,573 INFO L263 TraceCheckUtils]: 134: Hoare triple {8957#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {8962#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:49,573 INFO L280 TraceCheckUtils]: 135: Hoare triple {8962#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {8963#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:49,574 INFO L280 TraceCheckUtils]: 136: Hoare triple {8963#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8882#false} is VALID [2020-07-08 23:40:49,574 INFO L280 TraceCheckUtils]: 137: Hoare triple {8882#false} assume !false; {8882#false} is VALID [2020-07-08 23:40:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2020-07-08 23:40:49,635 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [356949541] [2020-07-08 23:40:49,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:49,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-07-08 23:40:49,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272790620] [2020-07-08 23:40:49,640 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2020-07-08 23:40:49,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:49,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-08 23:40:49,813 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 23:40:49,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-08 23:40:49,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:49,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-08 23:40:49,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2020-07-08 23:40:49,814 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 21 states. [2020-07-08 23:40:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:52,449 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2020-07-08 23:40:52,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 23:40:52,450 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2020-07-08 23:40:52,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:52,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 23:40:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2020-07-08 23:40:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 23:40:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2020-07-08 23:40:52,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 55 transitions. [2020-07-08 23:40:52,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:52,579 INFO L225 Difference]: With dead ends: 117 [2020-07-08 23:40:52,579 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 23:40:52,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2020-07-08 23:40:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 23:40:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 23:40:52,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:52,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:52,585 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:52,586 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:52,586 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:40:52,586 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:40:52,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:52,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:52,587 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:52,587 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:52,588 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:40:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:40:52,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:52,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:52,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:52,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 23:40:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 23:40:52,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2020-07-08 23:40:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:52,590 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 23:40:52,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-08 23:40:52,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 23:40:52,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:40:52,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:52,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-08 23:40:52,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 23:40:53,825 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-07-08 23:40:54,130 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-07-08 23:40:54,380 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-07-08 23:40:54,517 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2020-07-08 23:40:54,652 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2020-07-08 23:40:54,949 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 26 [2020-07-08 23:40:55,235 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 29 [2020-07-08 23:40:55,905 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 36 [2020-07-08 23:40:55,917 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:40:55,917 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:40:55,917 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:40:55,917 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 23:40:55,917 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 23:40:55,918 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:40:55,918 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:40:55,918 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:40:55,918 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 23:40:55,918 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-08 23:40:55,918 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:40:55,919 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse2 (<= 0 main_~in~0)) (.cse3 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse4 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse5 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~buflim~0 3) .cse1) .cse2 .cse3 .cse4 (<= 1 main_~buf~0) .cse5) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse2 .cse3 .cse4 (<= 0 main_~buf~0) .cse5))) [2020-07-08 23:40:55,919 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 45) the Hoare annotation is: true [2020-07-08 23:40:55,919 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-08 23:40:55,919 INFO L271 CegarLoopResult]: At program point L44(lines 14 45) the Hoare annotation is: true [2020-07-08 23:40:55,919 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 |main_#t~post5|) (<= (+ |main_#t~post5| 2) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-08 23:40:55,920 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 |main_#t~post5|) (<= (+ |main_#t~post5| 2) main_~bufferlen~0) (<= 1 main_~buf~0)) [2020-07-08 23:40:55,920 INFO L264 CegarLoopResult]: At program point L36(lines 26 37) the Hoare annotation is: (let ((.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~buflim~0 3) .cse1) (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse0 (<= 0 main_~in~0) .cse2 .cse3 (<= 0 main_~buf~0)))) [2020-07-08 23:40:55,920 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse9 (+ main_~in~0 main_~buflim~0 3))) (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse2 (<= (+ |main_#t~post3| 1) main_~buflim~0)) (.cse3 (<= .cse9 (+ |main_#t~post3| main_~inlen~0))) (.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse4 (<= 0 |main_#t~post3|)) (.cse6 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse5 (<= 0 main_~in~0)) (.cse7 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse8 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 main_~buf~0) .cse8) (and .cse0 .cse2 .cse3 (<= .cse9 .cse1) .cse4 .cse6 .cse5 .cse7 (<= 1 main_~buf~0) .cse8)))) [2020-07-08 23:40:55,921 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (and (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= (+ |main_#t~post3| 1) main_~buflim~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ |main_#t~post3| main_~inlen~0)) (<= main_~buf~0 main_~buflim~0) (<= 0 |main_#t~post3|) (<= 0 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-07-08 23:40:55,921 INFO L264 CegarLoopResult]: At program point L28(lines 28 29) the Hoare annotation is: (let ((.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~buflim~0 3) .cse1) (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse0 (<= 0 main_~in~0) .cse2 .cse3 (<= 0 main_~buf~0)))) [2020-07-08 23:40:55,921 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 0 main_~buf~0)) [2020-07-08 23:40:55,921 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-08 23:40:55,922 INFO L264 CegarLoopResult]: At program point L20-1(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-07-08 23:40:55,922 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-08 23:40:55,922 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-08 23:40:55,922 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-07-08 23:40:55,923 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 1 main_~buf~0)) [2020-07-08 23:40:55,923 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2020-07-08 23:40:55,923 INFO L264 CegarLoopResult]: At program point L33(lines 33 34) the Hoare annotation is: (and (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0) (<= 0 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-07-08 23:40:55,923 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 0 main_~buf~0)) [2020-07-08 23:40:55,924 INFO L264 CegarLoopResult]: At program point L21(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-07-08 23:40:55,924 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-08 23:40:55,924 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-08 23:40:55,924 INFO L271 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-07-08 23:40:55,924 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 45) the Hoare annotation is: true [2020-07-08 23:40:55,924 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-08 23:40:55,925 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-08 23:40:55,925 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0))) (and (<= 0 |main_#t~post4|) (<= (+ main_~in~0 main_~buflim~0 4) .cse0) (<= main_~buf~0 main_~buflim~0) (<= (+ |main_#t~post4| main_~buflim~0 4) .cse0) (<= 0 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-07-08 23:40:55,925 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0))) (and (<= 0 |main_#t~post4|) (<= (+ main_~in~0 main_~buflim~0 3) .cse0) (<= main_~buf~0 main_~buflim~0) (<= (+ |main_#t~post4| main_~buflim~0 4) .cse0) (<= 1 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-07-08 23:40:55,926 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0)) (.cse1 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse0) (<= 0 main_~in~0) .cse1 .cse2 (<= 0 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~buflim~0 3) .cse0) .cse1 (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3))) [2020-07-08 23:40:55,926 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 45) the Hoare annotation is: true [2020-07-08 23:40:55,926 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0)) (.cse1 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse0) (<= 0 main_~in~0) .cse1 .cse2 (<= 0 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~buflim~0 3) .cse0) .cse1 (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3))) [2020-07-08 23:40:55,926 INFO L264 CegarLoopResult]: At program point L26-1(lines 26 37) the Hoare annotation is: (let ((.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~buflim~0 3) .cse1) (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse0 (<= 0 main_~in~0) .cse2 .cse3 (<= 0 main_~buf~0)))) [2020-07-08 23:40:55,927 INFO L264 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-08 23:40:55,927 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-07-08 23:40:55,927 INFO L264 CegarLoopResult]: At program point L26-4(line 26) the Hoare annotation is: (let ((.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~buflim~0 3) .cse1) (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse0 (<= 0 main_~in~0) .cse2 .cse3 (<= 0 main_~buf~0)))) [2020-07-08 23:40:55,927 INFO L264 CegarLoopResult]: At program point L26-5(lines 26 37) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-08 23:40:55,927 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-08 23:40:55,928 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-07-08 23:40:55,928 INFO L271 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: true [2020-07-08 23:40:55,928 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-08 23:40:55,928 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_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-07-08 23:40:55,929 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_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-07-08 23:40:55,929 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 23:40:55,929 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-08 23:40:55,929 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 23:40:55,929 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-08 23:40:55,929 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-08 23:40:55,930 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 23:40:55,935 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:40:55,939 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:40:55,939 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:40:55,941 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-08 23:40:55,941 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-08 23:40:55,979 INFO L163 areAnnotationChecker]: CFG has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:40:56,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:40:56 BoogieIcfgContainer [2020-07-08 23:40:56,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:40:56,009 INFO L168 Benchmark]: Toolchain (without parser) took 33154.37 ms. Allocated memory was 134.7 MB in the beginning and 487.1 MB in the end (delta: 352.3 MB). Free memory was 100.0 MB in the beginning and 431.0 MB in the end (delta: -331.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:56,015 INFO L168 Benchmark]: CDTParser took 0.84 ms. Allocated memory is still 134.7 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 23:40:56,016 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.39 ms. Allocated memory is still 134.7 MB. Free memory was 99.7 MB in the beginning and 89.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:56,017 INFO L168 Benchmark]: Boogie Preprocessor took 153.82 ms. Allocated memory was 134.7 MB in the beginning and 199.2 MB in the end (delta: 64.5 MB). Free memory was 89.5 MB in the beginning and 178.3 MB in the end (delta: -88.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:56,017 INFO L168 Benchmark]: RCFGBuilder took 512.55 ms. Allocated memory is still 199.2 MB. Free memory was 178.3 MB in the beginning and 151.7 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:56,020 INFO L168 Benchmark]: TraceAbstraction took 32094.08 ms. Allocated memory was 199.2 MB in the beginning and 487.1 MB in the end (delta: 287.8 MB). Free memory was 151.0 MB in the beginning and 431.0 MB in the end (delta: -280.1 MB). Peak memory consumption was 7.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:56,024 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.84 ms. Allocated memory is still 134.7 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 388.39 ms. Allocated memory is still 134.7 MB. Free memory was 99.7 MB in the beginning and 89.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 153.82 ms. Allocated memory was 134.7 MB in the beginning and 199.2 MB in the end (delta: 64.5 MB). Free memory was 89.5 MB in the beginning and 178.3 MB in the end (delta: -88.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 512.55 ms. Allocated memory is still 199.2 MB. Free memory was 178.3 MB in the beginning and 151.7 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32094.08 ms. Allocated memory was 199.2 MB in the beginning and 487.1 MB in the end (delta: 287.8 MB). Free memory was 151.0 MB in the beginning and 431.0 MB in the end (delta: -280.1 MB). Peak memory consumption was 7.8 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: (((((buf <= buflim && in + buflim + 3 <= buf + inlen) && 1 <= in) && buflim + 2 <= bufferlen) && 1 <= buf) && bufferlen + 1 <= inlen) || (((((in + bufferlen + 1 <= buf + inlen && buf <= buflim) && 0 <= in) && buflim + 2 <= bufferlen) && bufferlen + 1 <= inlen) && 0 <= buf) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 28.6s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 861 SDtfs, 914 SDslu, 3777 SDs, 0 SdLazy, 1775 SolverSat, 413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 239 SyntacticMatches, 2 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 101 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 289 PreInvPairs, 460 NumberOfFragments, 917 HoareAnnotationTreeSize, 289 FomulaSimplifications, 48443 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 55 FomulaSimplificationsInter, 3826 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1034 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1018 ConstructedInterpolants, 0 QuantifiedInterpolants, 273104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 1511/1684 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...