/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:28:26,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:28:26,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:28:26,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:28:26,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:28:26,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:28:26,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:28:26,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:28:26,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:28:26,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:28:26,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:28:26,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:28:26,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:28:26,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:28:26,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:28:26,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:28:26,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:28:26,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:28:26,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:28:26,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:28:26,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:28:26,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:28:26,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:28:26,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:28:26,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:28:26,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:28:26,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:28:26,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:28:26,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:28:26,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:28:26,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:28:26,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:28:26,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:28:26,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:28:26,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:28:26,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:28:26,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:28:26,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:28:26,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:28:26,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:28:26,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:28:26,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:28:26,113 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:28:26,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:28:26,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:28:26,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:28:26,115 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:28:26,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:28:26,116 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:28:26,116 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:28:26,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:28:26,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:28:26,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:28:26,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:28:26,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:28:26,117 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:28:26,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:28:26,117 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:28:26,118 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:28:26,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:28:26,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:28:26,118 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:28:26,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:28:26,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:28:26,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:28:26,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:28:26,119 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:28:26,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:28:26,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:28:26,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:28:26,120 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:28:26,120 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:28:26,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:28:26,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:28:26,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:28:26,507 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:28:26,507 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:28:26,508 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2020-07-10 15:28:26,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb765d4e/e0199c8fa0ae49c58ae8698679d9d79d/FLAG9f9bad098 [2020-07-10 15:28:27,221 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:28:27,222 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2020-07-10 15:28:27,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb765d4e/e0199c8fa0ae49c58ae8698679d9d79d/FLAG9f9bad098 [2020-07-10 15:28:27,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb765d4e/e0199c8fa0ae49c58ae8698679d9d79d [2020-07-10 15:28:27,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:28:27,576 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:28:27,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:27,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:28:27,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:28:27,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@654fe4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27, skipping insertion in model container [2020-07-10 15:28:27,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:28:27,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:28:27,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:27,829 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:28:27,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:27,883 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:28:27,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27 WrapperNode [2020-07-10 15:28:27,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:27,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:28:27,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:28:27,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:28:27,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:28,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:28,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:28,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:28:28,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:28:28,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:28:28,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:28:28,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (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-10 15:28:28,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:28:28,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:28:28,086 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:28:28,086 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:28:28,087 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:28:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:28:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:28:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:28:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:28:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:28:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:28:28,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:28:28,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:28:28,751 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:28:28,751 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 15:28:28,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:28 BoogieIcfgContainer [2020-07-10 15:28:28,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:28:28,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:28:28,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:28:28,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:28:28,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:28:27" (1/3) ... [2020-07-10 15:28:28,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba7d7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:28, skipping insertion in model container [2020-07-10 15:28:28,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (2/3) ... [2020-07-10 15:28:28,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba7d7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:28, skipping insertion in model container [2020-07-10 15:28:28,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:28" (3/3) ... [2020-07-10 15:28:28,769 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2020-07-10 15:28:28,782 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:28:28,795 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:28:28,814 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:28:28,841 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:28:28,841 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:28:28,841 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:28:28,842 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:28:28,842 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:28:28,842 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:28:28,842 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:28:28,842 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:28:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-07-10 15:28:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:28:28,875 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:28,876 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:28,877 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:28,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:28,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1128800291, now seen corresponding path program 1 times [2020-07-10 15:28:28,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:28,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904046264] [2020-07-10 15:28:28,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,192 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-10 15:28:29,193 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {45#true} {45#true} #86#return; {45#true} is VALID [2020-07-10 15:28:29,196 INFO L263 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2020-07-10 15:28:29,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-10 15:28:29,198 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #86#return; {45#true} is VALID [2020-07-10 15:28:29,198 INFO L263 TraceCheckUtils]: 3: Hoare triple {45#true} call #t~ret10 := main(); {45#true} is VALID [2020-07-10 15:28:29,199 INFO L280 TraceCheckUtils]: 4: Hoare triple {45#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {45#true} is VALID [2020-07-10 15:28:29,200 INFO L280 TraceCheckUtils]: 5: Hoare triple {45#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {45#true} is VALID [2020-07-10 15:28:29,200 INFO L280 TraceCheckUtils]: 6: Hoare triple {45#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {45#true} is VALID [2020-07-10 15:28:29,201 INFO L280 TraceCheckUtils]: 7: Hoare triple {45#true} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {45#true} is VALID [2020-07-10 15:28:29,203 INFO L280 TraceCheckUtils]: 8: Hoare triple {45#true} assume 1 + ~i~0 < ~len~0; {49#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:29,206 INFO L263 TraceCheckUtils]: 9: Hoare triple {49#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {50#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:29,208 INFO L280 TraceCheckUtils]: 10: Hoare triple {50#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {51#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:29,209 INFO L280 TraceCheckUtils]: 11: Hoare triple {51#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {46#false} is VALID [2020-07-10 15:28:29,210 INFO L280 TraceCheckUtils]: 12: Hoare triple {46#false} assume !false; {46#false} is VALID [2020-07-10 15:28:29,212 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-10 15:28:29,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904046264] [2020-07-10 15:28:29,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:29,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:29,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574381051] [2020-07-10 15:28:29,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 15:28:29,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:29,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:29,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:29,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:29,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:29,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:29,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:29,296 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2020-07-10 15:28:30,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:30,109 INFO L93 Difference]: Finished difference Result 87 states and 154 transitions. [2020-07-10 15:28:30,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:30,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 15:28:30,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2020-07-10 15:28:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2020-07-10 15:28:30,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 154 transitions. [2020-07-10 15:28:30,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:30,442 INFO L225 Difference]: With dead ends: 87 [2020-07-10 15:28:30,443 INFO L226 Difference]: Without dead ends: 46 [2020-07-10 15:28:30,453 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-10 15:28:30,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-10 15:28:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2020-07-10 15:28:30,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:30,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 42 states. [2020-07-10 15:28:30,554 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 42 states. [2020-07-10 15:28:30,554 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 42 states. [2020-07-10 15:28:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:30,576 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2020-07-10 15:28:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2020-07-10 15:28:30,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:30,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:30,584 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 46 states. [2020-07-10 15:28:30,585 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 46 states. [2020-07-10 15:28:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:30,592 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2020-07-10 15:28:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2020-07-10 15:28:30,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:30,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:30,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:30,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 15:28:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2020-07-10 15:28:30,603 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 13 [2020-07-10 15:28:30,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:30,604 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2020-07-10 15:28:30,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2020-07-10 15:28:30,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:28:30,605 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:30,606 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:30,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:28:30,607 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:30,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:30,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1106844324, now seen corresponding path program 1 times [2020-07-10 15:28:30,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:30,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749111944] [2020-07-10 15:28:30,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:30,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {349#true} assume true; {349#true} is VALID [2020-07-10 15:28:30,699 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {349#true} {349#true} #86#return; {349#true} is VALID [2020-07-10 15:28:30,700 INFO L263 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2020-07-10 15:28:30,700 INFO L280 TraceCheckUtils]: 1: Hoare triple {349#true} assume true; {349#true} is VALID [2020-07-10 15:28:30,700 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {349#true} {349#true} #86#return; {349#true} is VALID [2020-07-10 15:28:30,701 INFO L263 TraceCheckUtils]: 3: Hoare triple {349#true} call #t~ret10 := main(); {349#true} is VALID [2020-07-10 15:28:30,701 INFO L280 TraceCheckUtils]: 4: Hoare triple {349#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {349#true} is VALID [2020-07-10 15:28:30,702 INFO L280 TraceCheckUtils]: 5: Hoare triple {349#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {349#true} is VALID [2020-07-10 15:28:30,703 INFO L280 TraceCheckUtils]: 6: Hoare triple {349#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {353#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2020-07-10 15:28:30,704 INFO L280 TraceCheckUtils]: 7: Hoare triple {353#(<= (+ main_~i~0 1) main_~len~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {353#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2020-07-10 15:28:30,705 INFO L280 TraceCheckUtils]: 8: Hoare triple {353#(<= (+ main_~i~0 1) main_~len~0)} assume !(1 + ~i~0 < ~len~0); {353#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2020-07-10 15:28:30,707 INFO L263 TraceCheckUtils]: 9: Hoare triple {353#(<= (+ main_~i~0 1) main_~len~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {354#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:30,708 INFO L280 TraceCheckUtils]: 10: Hoare triple {354#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {355#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:30,709 INFO L280 TraceCheckUtils]: 11: Hoare triple {355#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {350#false} is VALID [2020-07-10 15:28:30,710 INFO L280 TraceCheckUtils]: 12: Hoare triple {350#false} assume !false; {350#false} is VALID [2020-07-10 15:28:30,711 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-10 15:28:30,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749111944] [2020-07-10 15:28:30,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:30,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:30,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430063947] [2020-07-10 15:28:30,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 15:28:30,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:30,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:30,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:30,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:30,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:30,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:30,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:30,736 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2020-07-10 15:28:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:31,243 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2020-07-10 15:28:31,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:31,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 15:28:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-10 15:28:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-10 15:28:31,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-10 15:28:31,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:31,361 INFO L225 Difference]: With dead ends: 54 [2020-07-10 15:28:31,361 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 15:28:31,362 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-10 15:28:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 15:28:31,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2020-07-10 15:28:31,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:31,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2020-07-10 15:28:31,403 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2020-07-10 15:28:31,403 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2020-07-10 15:28:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:31,409 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2020-07-10 15:28:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2020-07-10 15:28:31,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:31,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:31,412 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2020-07-10 15:28:31,412 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2020-07-10 15:28:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:31,417 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2020-07-10 15:28:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2020-07-10 15:28:31,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:31,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:31,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:31,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-10 15:28:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2020-07-10 15:28:31,424 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2020-07-10 15:28:31,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:31,425 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2020-07-10 15:28:31,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2020-07-10 15:28:31,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:28:31,426 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:31,427 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:31,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:28:31,427 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:31,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:31,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1247762898, now seen corresponding path program 1 times [2020-07-10 15:28:31,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:31,429 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74468639] [2020-07-10 15:28:31,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:31,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {624#true} assume true; {624#true} is VALID [2020-07-10 15:28:31,566 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {624#true} {624#true} #86#return; {624#true} is VALID [2020-07-10 15:28:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:31,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {624#true} ~cond := #in~cond; {624#true} is VALID [2020-07-10 15:28:31,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {624#true} assume !(0 == ~cond); {624#true} is VALID [2020-07-10 15:28:31,578 INFO L280 TraceCheckUtils]: 2: Hoare triple {624#true} assume true; {624#true} is VALID [2020-07-10 15:28:31,579 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {624#true} {628#(<= 0 main_~i~0)} #90#return; {628#(<= 0 main_~i~0)} is VALID [2020-07-10 15:28:31,580 INFO L263 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {624#true} is VALID [2020-07-10 15:28:31,580 INFO L280 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2020-07-10 15:28:31,581 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #86#return; {624#true} is VALID [2020-07-10 15:28:31,581 INFO L263 TraceCheckUtils]: 3: Hoare triple {624#true} call #t~ret10 := main(); {624#true} is VALID [2020-07-10 15:28:31,581 INFO L280 TraceCheckUtils]: 4: Hoare triple {624#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {624#true} is VALID [2020-07-10 15:28:31,583 INFO L280 TraceCheckUtils]: 5: Hoare triple {624#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {628#(<= 0 main_~i~0)} is VALID [2020-07-10 15:28:31,585 INFO L280 TraceCheckUtils]: 6: Hoare triple {628#(<= 0 main_~i~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {628#(<= 0 main_~i~0)} is VALID [2020-07-10 15:28:31,586 INFO L280 TraceCheckUtils]: 7: Hoare triple {628#(<= 0 main_~i~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {628#(<= 0 main_~i~0)} is VALID [2020-07-10 15:28:31,587 INFO L280 TraceCheckUtils]: 8: Hoare triple {628#(<= 0 main_~i~0)} assume 1 + ~i~0 < ~len~0; {628#(<= 0 main_~i~0)} is VALID [2020-07-10 15:28:31,587 INFO L263 TraceCheckUtils]: 9: Hoare triple {628#(<= 0 main_~i~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {624#true} is VALID [2020-07-10 15:28:31,588 INFO L280 TraceCheckUtils]: 10: Hoare triple {624#true} ~cond := #in~cond; {624#true} is VALID [2020-07-10 15:28:31,588 INFO L280 TraceCheckUtils]: 11: Hoare triple {624#true} assume !(0 == ~cond); {624#true} is VALID [2020-07-10 15:28:31,588 INFO L280 TraceCheckUtils]: 12: Hoare triple {624#true} assume true; {624#true} is VALID [2020-07-10 15:28:31,590 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {624#true} {628#(<= 0 main_~i~0)} #90#return; {628#(<= 0 main_~i~0)} is VALID [2020-07-10 15:28:31,592 INFO L263 TraceCheckUtils]: 14: Hoare triple {628#(<= 0 main_~i~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {633#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:31,594 INFO L280 TraceCheckUtils]: 15: Hoare triple {633#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {634#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:31,595 INFO L280 TraceCheckUtils]: 16: Hoare triple {634#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {625#false} is VALID [2020-07-10 15:28:31,596 INFO L280 TraceCheckUtils]: 17: Hoare triple {625#false} assume !false; {625#false} is VALID [2020-07-10 15:28:31,597 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-10 15:28:31,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74468639] [2020-07-10 15:28:31,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:31,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:31,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264317980] [2020-07-10 15:28:31,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 15:28:31,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:31,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:31,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:31,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:31,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:31,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:31,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:31,628 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand 5 states. [2020-07-10 15:28:32,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:32,046 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2020-07-10 15:28:32,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:32,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 15:28:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2020-07-10 15:28:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2020-07-10 15:28:32,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2020-07-10 15:28:32,138 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-10 15:28:32,143 INFO L225 Difference]: With dead ends: 56 [2020-07-10 15:28:32,143 INFO L226 Difference]: Without dead ends: 54 [2020-07-10 15:28:32,144 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-10 15:28:32,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-10 15:28:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-10 15:28:32,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:32,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2020-07-10 15:28:32,225 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-10 15:28:32,225 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-10 15:28:32,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:32,231 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2020-07-10 15:28:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-07-10 15:28:32,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:32,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:32,232 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-10 15:28:32,233 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-10 15:28:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:32,239 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2020-07-10 15:28:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-07-10 15:28:32,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:32,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:32,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:32,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 15:28:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-07-10 15:28:32,246 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 18 [2020-07-10 15:28:32,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:32,247 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-07-10 15:28:32,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-07-10 15:28:32,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:28:32,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:32,250 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:32,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:28:32,251 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:32,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:32,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2050697988, now seen corresponding path program 1 times [2020-07-10 15:28:32,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:32,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382570973] [2020-07-10 15:28:32,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,393 INFO L280 TraceCheckUtils]: 0: Hoare triple {913#true} assume true; {913#true} is VALID [2020-07-10 15:28:32,394 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {913#true} {913#true} #86#return; {913#true} is VALID [2020-07-10 15:28:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {913#true} ~cond := #in~cond; {913#true} is VALID [2020-07-10 15:28:32,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {913#true} assume !(0 == ~cond); {913#true} is VALID [2020-07-10 15:28:32,415 INFO L280 TraceCheckUtils]: 2: Hoare triple {913#true} assume true; {913#true} is VALID [2020-07-10 15:28:32,417 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {913#true} {918#(< main_~j~0 main_~bufsize~0)} #114#return; {918#(< main_~j~0 main_~bufsize~0)} is VALID [2020-07-10 15:28:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,433 INFO L280 TraceCheckUtils]: 0: Hoare triple {913#true} ~cond := #in~cond; {913#true} is VALID [2020-07-10 15:28:32,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {913#true} assume !(0 == ~cond); {913#true} is VALID [2020-07-10 15:28:32,434 INFO L280 TraceCheckUtils]: 2: Hoare triple {913#true} assume true; {913#true} is VALID [2020-07-10 15:28:32,436 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {913#true} {918#(< main_~j~0 main_~bufsize~0)} #116#return; {918#(< main_~j~0 main_~bufsize~0)} is VALID [2020-07-10 15:28:32,436 INFO L263 TraceCheckUtils]: 0: Hoare triple {913#true} call ULTIMATE.init(); {913#true} is VALID [2020-07-10 15:28:32,437 INFO L280 TraceCheckUtils]: 1: Hoare triple {913#true} assume true; {913#true} is VALID [2020-07-10 15:28:32,437 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {913#true} {913#true} #86#return; {913#true} is VALID [2020-07-10 15:28:32,437 INFO L263 TraceCheckUtils]: 3: Hoare triple {913#true} call #t~ret10 := main(); {913#true} is VALID [2020-07-10 15:28:32,438 INFO L280 TraceCheckUtils]: 4: Hoare triple {913#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {913#true} is VALID [2020-07-10 15:28:32,440 INFO L280 TraceCheckUtils]: 5: Hoare triple {913#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {917#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:32,447 INFO L280 TraceCheckUtils]: 6: Hoare triple {917#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {917#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:32,448 INFO L280 TraceCheckUtils]: 7: Hoare triple {917#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {918#(< main_~j~0 main_~bufsize~0)} is VALID [2020-07-10 15:28:32,454 INFO L280 TraceCheckUtils]: 8: Hoare triple {918#(< main_~j~0 main_~bufsize~0)} assume !(1 + ~i~0 < ~len~0); {918#(< main_~j~0 main_~bufsize~0)} is VALID [2020-07-10 15:28:32,454 INFO L263 TraceCheckUtils]: 9: Hoare triple {918#(< main_~j~0 main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {913#true} is VALID [2020-07-10 15:28:32,455 INFO L280 TraceCheckUtils]: 10: Hoare triple {913#true} ~cond := #in~cond; {913#true} is VALID [2020-07-10 15:28:32,455 INFO L280 TraceCheckUtils]: 11: Hoare triple {913#true} assume !(0 == ~cond); {913#true} is VALID [2020-07-10 15:28:32,456 INFO L280 TraceCheckUtils]: 12: Hoare triple {913#true} assume true; {913#true} is VALID [2020-07-10 15:28:32,457 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {913#true} {918#(< main_~j~0 main_~bufsize~0)} #114#return; {918#(< main_~j~0 main_~bufsize~0)} is VALID [2020-07-10 15:28:32,457 INFO L263 TraceCheckUtils]: 14: Hoare triple {918#(< main_~j~0 main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {913#true} is VALID [2020-07-10 15:28:32,458 INFO L280 TraceCheckUtils]: 15: Hoare triple {913#true} ~cond := #in~cond; {913#true} is VALID [2020-07-10 15:28:32,458 INFO L280 TraceCheckUtils]: 16: Hoare triple {913#true} assume !(0 == ~cond); {913#true} is VALID [2020-07-10 15:28:32,458 INFO L280 TraceCheckUtils]: 17: Hoare triple {913#true} assume true; {913#true} is VALID [2020-07-10 15:28:32,460 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {913#true} {918#(< main_~j~0 main_~bufsize~0)} #116#return; {918#(< main_~j~0 main_~bufsize~0)} is VALID [2020-07-10 15:28:32,461 INFO L263 TraceCheckUtils]: 19: Hoare triple {918#(< main_~j~0 main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {927#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:32,462 INFO L280 TraceCheckUtils]: 20: Hoare triple {927#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {928#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:32,463 INFO L280 TraceCheckUtils]: 21: Hoare triple {928#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {914#false} is VALID [2020-07-10 15:28:32,464 INFO L280 TraceCheckUtils]: 22: Hoare triple {914#false} assume !false; {914#false} is VALID [2020-07-10 15:28:32,465 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-10 15:28:32,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382570973] [2020-07-10 15:28:32,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:32,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:32,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299142724] [2020-07-10 15:28:32,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 15:28:32,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:32,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:32,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:32,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:32,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:32,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:32,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:32,495 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 6 states. [2020-07-10 15:28:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:33,116 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2020-07-10 15:28:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:33,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 15:28:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2020-07-10 15:28:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2020-07-10 15:28:33,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2020-07-10 15:28:33,219 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-10 15:28:33,223 INFO L225 Difference]: With dead ends: 60 [2020-07-10 15:28:33,223 INFO L226 Difference]: Without dead ends: 58 [2020-07-10 15:28:33,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-10 15:28:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-10 15:28:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-07-10 15:28:33,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:33,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2020-07-10 15:28:33,301 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2020-07-10 15:28:33,301 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2020-07-10 15:28:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:33,306 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-07-10 15:28:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2020-07-10 15:28:33,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:33,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:33,307 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2020-07-10 15:28:33,307 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2020-07-10 15:28:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:33,312 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-07-10 15:28:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2020-07-10 15:28:33,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:33,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:33,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:33,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-10 15:28:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2020-07-10 15:28:33,317 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 23 [2020-07-10 15:28:33,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:33,318 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2020-07-10 15:28:33,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:33,318 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2020-07-10 15:28:33,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:28:33,319 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:33,319 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] [2020-07-10 15:28:33,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:28:33,320 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:33,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:33,321 INFO L82 PathProgramCache]: Analyzing trace with hash -35497745, now seen corresponding path program 1 times [2020-07-10 15:28:33,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:33,321 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658595123] [2020-07-10 15:28:33,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-10 15:28:33,401 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1227#true} {1227#true} #86#return; {1227#true} is VALID [2020-07-10 15:28:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2020-07-10 15:28:33,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2020-07-10 15:28:33,410 INFO L280 TraceCheckUtils]: 2: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-10 15:28:33,411 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1227#true} {1231#(<= 0 main_~j~0)} #114#return; {1231#(<= 0 main_~j~0)} is VALID [2020-07-10 15:28:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,420 INFO L280 TraceCheckUtils]: 0: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2020-07-10 15:28:33,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2020-07-10 15:28:33,421 INFO L280 TraceCheckUtils]: 2: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-10 15:28:33,422 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1227#true} {1231#(<= 0 main_~j~0)} #116#return; {1231#(<= 0 main_~j~0)} is VALID [2020-07-10 15:28:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,431 INFO L280 TraceCheckUtils]: 0: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2020-07-10 15:28:33,432 INFO L280 TraceCheckUtils]: 1: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2020-07-10 15:28:33,432 INFO L280 TraceCheckUtils]: 2: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-10 15:28:33,434 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1227#true} {1231#(<= 0 main_~j~0)} #118#return; {1231#(<= 0 main_~j~0)} is VALID [2020-07-10 15:28:33,434 INFO L263 TraceCheckUtils]: 0: Hoare triple {1227#true} call ULTIMATE.init(); {1227#true} is VALID [2020-07-10 15:28:33,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-10 15:28:33,435 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1227#true} {1227#true} #86#return; {1227#true} is VALID [2020-07-10 15:28:33,435 INFO L263 TraceCheckUtils]: 3: Hoare triple {1227#true} call #t~ret10 := main(); {1227#true} is VALID [2020-07-10 15:28:33,435 INFO L280 TraceCheckUtils]: 4: Hoare triple {1227#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {1227#true} is VALID [2020-07-10 15:28:33,436 INFO L280 TraceCheckUtils]: 5: Hoare triple {1227#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {1227#true} is VALID [2020-07-10 15:28:33,437 INFO L280 TraceCheckUtils]: 6: Hoare triple {1227#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {1231#(<= 0 main_~j~0)} is VALID [2020-07-10 15:28:33,438 INFO L280 TraceCheckUtils]: 7: Hoare triple {1231#(<= 0 main_~j~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {1231#(<= 0 main_~j~0)} is VALID [2020-07-10 15:28:33,439 INFO L280 TraceCheckUtils]: 8: Hoare triple {1231#(<= 0 main_~j~0)} assume !(1 + ~i~0 < ~len~0); {1231#(<= 0 main_~j~0)} is VALID [2020-07-10 15:28:33,439 INFO L263 TraceCheckUtils]: 9: Hoare triple {1231#(<= 0 main_~j~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1227#true} is VALID [2020-07-10 15:28:33,439 INFO L280 TraceCheckUtils]: 10: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2020-07-10 15:28:33,440 INFO L280 TraceCheckUtils]: 11: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2020-07-10 15:28:33,440 INFO L280 TraceCheckUtils]: 12: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-10 15:28:33,441 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1227#true} {1231#(<= 0 main_~j~0)} #114#return; {1231#(<= 0 main_~j~0)} is VALID [2020-07-10 15:28:33,441 INFO L263 TraceCheckUtils]: 14: Hoare triple {1231#(<= 0 main_~j~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1227#true} is VALID [2020-07-10 15:28:33,442 INFO L280 TraceCheckUtils]: 15: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2020-07-10 15:28:33,442 INFO L280 TraceCheckUtils]: 16: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2020-07-10 15:28:33,442 INFO L280 TraceCheckUtils]: 17: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-10 15:28:33,444 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1227#true} {1231#(<= 0 main_~j~0)} #116#return; {1231#(<= 0 main_~j~0)} is VALID [2020-07-10 15:28:33,445 INFO L263 TraceCheckUtils]: 19: Hoare triple {1231#(<= 0 main_~j~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {1227#true} is VALID [2020-07-10 15:28:33,445 INFO L280 TraceCheckUtils]: 20: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2020-07-10 15:28:33,445 INFO L280 TraceCheckUtils]: 21: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2020-07-10 15:28:33,445 INFO L280 TraceCheckUtils]: 22: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-10 15:28:33,447 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1227#true} {1231#(<= 0 main_~j~0)} #118#return; {1231#(<= 0 main_~j~0)} is VALID [2020-07-10 15:28:33,448 INFO L263 TraceCheckUtils]: 24: Hoare triple {1231#(<= 0 main_~j~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {1244#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:33,449 INFO L280 TraceCheckUtils]: 25: Hoare triple {1244#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1245#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:33,451 INFO L280 TraceCheckUtils]: 26: Hoare triple {1245#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1228#false} is VALID [2020-07-10 15:28:33,451 INFO L280 TraceCheckUtils]: 27: Hoare triple {1228#false} assume !false; {1228#false} is VALID [2020-07-10 15:28:33,453 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-10 15:28:33,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658595123] [2020-07-10 15:28:33,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:33,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:33,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582900663] [2020-07-10 15:28:33,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-10 15:28:33,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:33,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:33,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:33,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:33,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:33,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:33,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:33,485 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 5 states. [2020-07-10 15:28:33,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:33,911 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2020-07-10 15:28:33,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:33,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-10 15:28:33,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2020-07-10 15:28:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2020-07-10 15:28:33,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2020-07-10 15:28:34,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:34,003 INFO L225 Difference]: With dead ends: 65 [2020-07-10 15:28:34,003 INFO L226 Difference]: Without dead ends: 63 [2020-07-10 15:28:34,004 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-10 15:28:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-10 15:28:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2020-07-10 15:28:34,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:34,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2020-07-10 15:28:34,079 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2020-07-10 15:28:34,079 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2020-07-10 15:28:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:34,083 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2020-07-10 15:28:34,083 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2020-07-10 15:28:34,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:34,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:34,084 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2020-07-10 15:28:34,085 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2020-07-10 15:28:34,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:34,088 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2020-07-10 15:28:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2020-07-10 15:28:34,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:34,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:34,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:34,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-10 15:28:34,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2020-07-10 15:28:34,095 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 28 [2020-07-10 15:28:34,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:34,095 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2020-07-10 15:28:34,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:34,096 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2020-07-10 15:28:34,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-10 15:28:34,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:34,097 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:34,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:28:34,098 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:34,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:34,098 INFO L82 PathProgramCache]: Analyzing trace with hash 663071772, now seen corresponding path program 1 times [2020-07-10 15:28:34,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:34,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859635392] [2020-07-10 15:28:34,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-10 15:28:34,188 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1564#true} {1564#true} #86#return; {1564#true} is VALID [2020-07-10 15:28:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-10 15:28:34,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-10 15:28:34,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-10 15:28:34,198 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #90#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,206 INFO L280 TraceCheckUtils]: 0: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-10 15:28:34,207 INFO L280 TraceCheckUtils]: 1: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-10 15:28:34,207 INFO L280 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-10 15:28:34,208 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #92#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-10 15:28:34,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-10 15:28:34,217 INFO L280 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-10 15:28:34,218 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #94#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,227 INFO L280 TraceCheckUtils]: 0: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-10 15:28:34,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-10 15:28:34,228 INFO L280 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-10 15:28:34,230 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #96#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,237 INFO L280 TraceCheckUtils]: 0: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-10 15:28:34,238 INFO L280 TraceCheckUtils]: 1: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-10 15:28:34,238 INFO L280 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-10 15:28:34,239 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #98#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,246 INFO L280 TraceCheckUtils]: 0: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-10 15:28:34,247 INFO L280 TraceCheckUtils]: 1: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-10 15:28:34,247 INFO L280 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-10 15:28:34,248 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #100#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:34,249 INFO L263 TraceCheckUtils]: 0: Hoare triple {1564#true} call ULTIMATE.init(); {1564#true} is VALID [2020-07-10 15:28:34,249 INFO L280 TraceCheckUtils]: 1: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-10 15:28:34,249 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1564#true} {1564#true} #86#return; {1564#true} is VALID [2020-07-10 15:28:34,249 INFO L263 TraceCheckUtils]: 3: Hoare triple {1564#true} call #t~ret10 := main(); {1564#true} is VALID [2020-07-10 15:28:34,250 INFO L280 TraceCheckUtils]: 4: Hoare triple {1564#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {1564#true} is VALID [2020-07-10 15:28:34,250 INFO L280 TraceCheckUtils]: 5: Hoare triple {1564#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {1564#true} is VALID [2020-07-10 15:28:34,250 INFO L280 TraceCheckUtils]: 6: Hoare triple {1564#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {1564#true} is VALID [2020-07-10 15:28:34,251 INFO L280 TraceCheckUtils]: 7: Hoare triple {1564#true} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {1564#true} is VALID [2020-07-10 15:28:34,252 INFO L280 TraceCheckUtils]: 8: Hoare triple {1564#true} assume 1 + ~i~0 < ~len~0; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:34,252 INFO L263 TraceCheckUtils]: 9: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {1564#true} is VALID [2020-07-10 15:28:34,252 INFO L280 TraceCheckUtils]: 10: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-10 15:28:34,253 INFO L280 TraceCheckUtils]: 11: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-10 15:28:34,253 INFO L280 TraceCheckUtils]: 12: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-10 15:28:34,254 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #90#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:34,254 INFO L263 TraceCheckUtils]: 14: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1564#true} is VALID [2020-07-10 15:28:34,255 INFO L280 TraceCheckUtils]: 15: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-10 15:28:34,255 INFO L280 TraceCheckUtils]: 16: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-10 15:28:34,255 INFO L280 TraceCheckUtils]: 17: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-10 15:28:34,256 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #92#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:34,257 INFO L280 TraceCheckUtils]: 19: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:34,258 INFO L280 TraceCheckUtils]: 20: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:34,259 INFO L263 TraceCheckUtils]: 21: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1564#true} is VALID [2020-07-10 15:28:34,259 INFO L280 TraceCheckUtils]: 22: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-10 15:28:34,259 INFO L280 TraceCheckUtils]: 23: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-10 15:28:34,259 INFO L280 TraceCheckUtils]: 24: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-10 15:28:34,260 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #94#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:34,261 INFO L263 TraceCheckUtils]: 26: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1564#true} is VALID [2020-07-10 15:28:34,261 INFO L280 TraceCheckUtils]: 27: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-10 15:28:34,261 INFO L280 TraceCheckUtils]: 28: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-10 15:28:34,261 INFO L280 TraceCheckUtils]: 29: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-10 15:28:34,263 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #96#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:34,263 INFO L263 TraceCheckUtils]: 31: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {1564#true} is VALID [2020-07-10 15:28:34,263 INFO L280 TraceCheckUtils]: 32: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-10 15:28:34,264 INFO L280 TraceCheckUtils]: 33: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-10 15:28:34,264 INFO L280 TraceCheckUtils]: 34: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-10 15:28:34,265 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #98#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:34,265 INFO L263 TraceCheckUtils]: 36: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {1564#true} is VALID [2020-07-10 15:28:34,266 INFO L280 TraceCheckUtils]: 37: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-10 15:28:34,266 INFO L280 TraceCheckUtils]: 38: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-10 15:28:34,266 INFO L280 TraceCheckUtils]: 39: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-10 15:28:34,267 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #100#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-10 15:28:34,268 INFO L280 TraceCheckUtils]: 41: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1593#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2020-07-10 15:28:34,270 INFO L263 TraceCheckUtils]: 42: Hoare triple {1593#(<= (+ main_~i~0 1) main_~len~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1594#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:34,270 INFO L280 TraceCheckUtils]: 43: Hoare triple {1594#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1595#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:34,271 INFO L280 TraceCheckUtils]: 44: Hoare triple {1595#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1565#false} is VALID [2020-07-10 15:28:34,271 INFO L280 TraceCheckUtils]: 45: Hoare triple {1565#false} assume !false; {1565#false} is VALID [2020-07-10 15:28:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-10 15:28:34,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859635392] [2020-07-10 15:28:34,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:34,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:34,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782746712] [2020-07-10 15:28:34,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-10 15:28:34,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:34,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:34,340 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-10 15:28:34,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:34,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:34,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:34,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:34,342 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 6 states. [2020-07-10 15:28:35,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:35,026 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2020-07-10 15:28:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:35,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-10 15:28:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2020-07-10 15:28:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2020-07-10 15:28:35,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2020-07-10 15:28:35,136 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-10 15:28:35,140 INFO L225 Difference]: With dead ends: 74 [2020-07-10 15:28:35,140 INFO L226 Difference]: Without dead ends: 72 [2020-07-10 15:28:35,141 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:35,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-10 15:28:35,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2020-07-10 15:28:35,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:35,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 66 states. [2020-07-10 15:28:35,231 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 66 states. [2020-07-10 15:28:35,231 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 66 states. [2020-07-10 15:28:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:35,235 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2020-07-10 15:28:35,235 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2020-07-10 15:28:35,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:35,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:35,236 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 72 states. [2020-07-10 15:28:35,236 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 72 states. [2020-07-10 15:28:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:35,241 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2020-07-10 15:28:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2020-07-10 15:28:35,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:35,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:35,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:35,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:35,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-10 15:28:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2020-07-10 15:28:35,246 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 46 [2020-07-10 15:28:35,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:35,246 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2020-07-10 15:28:35,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2020-07-10 15:28:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-10 15:28:35,248 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:35,248 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:35,249 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:28:35,249 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:35,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:35,249 INFO L82 PathProgramCache]: Analyzing trace with hash -801825860, now seen corresponding path program 1 times [2020-07-10 15:28:35,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:35,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102734941] [2020-07-10 15:28:35,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,371 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,372 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1951#true} {1951#true} #86#return; {1951#true} is VALID [2020-07-10 15:28:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,380 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,380 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,381 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,382 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #90#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,390 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,391 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,391 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #92#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,399 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,401 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #94#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,408 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,410 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #96#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,417 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,417 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,419 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #98#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,425 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,426 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,426 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,428 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #100#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,441 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,441 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,443 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} #102#return; {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,458 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,459 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,462 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} #104#return; {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,462 INFO L263 TraceCheckUtils]: 0: Hoare triple {1951#true} call ULTIMATE.init(); {1951#true} is VALID [2020-07-10 15:28:35,463 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,463 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1951#true} {1951#true} #86#return; {1951#true} is VALID [2020-07-10 15:28:35,463 INFO L263 TraceCheckUtils]: 3: Hoare triple {1951#true} call #t~ret10 := main(); {1951#true} is VALID [2020-07-10 15:28:35,463 INFO L280 TraceCheckUtils]: 4: Hoare triple {1951#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {1951#true} is VALID [2020-07-10 15:28:35,465 INFO L280 TraceCheckUtils]: 5: Hoare triple {1951#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {1955#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,465 INFO L280 TraceCheckUtils]: 6: Hoare triple {1955#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {1955#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,466 INFO L280 TraceCheckUtils]: 7: Hoare triple {1955#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,467 INFO L280 TraceCheckUtils]: 8: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} assume 1 + ~i~0 < ~len~0; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,467 INFO L263 TraceCheckUtils]: 9: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {1951#true} is VALID [2020-07-10 15:28:35,467 INFO L280 TraceCheckUtils]: 10: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,467 INFO L280 TraceCheckUtils]: 11: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,467 INFO L280 TraceCheckUtils]: 12: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,469 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #90#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,469 INFO L263 TraceCheckUtils]: 14: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1951#true} is VALID [2020-07-10 15:28:35,469 INFO L280 TraceCheckUtils]: 15: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,469 INFO L280 TraceCheckUtils]: 16: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,470 INFO L280 TraceCheckUtils]: 17: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,471 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #92#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,474 INFO L280 TraceCheckUtils]: 19: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,476 INFO L280 TraceCheckUtils]: 20: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,476 INFO L263 TraceCheckUtils]: 21: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1951#true} is VALID [2020-07-10 15:28:35,476 INFO L280 TraceCheckUtils]: 22: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,476 INFO L280 TraceCheckUtils]: 23: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,477 INFO L280 TraceCheckUtils]: 24: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,478 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #94#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,478 INFO L263 TraceCheckUtils]: 26: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1951#true} is VALID [2020-07-10 15:28:35,479 INFO L280 TraceCheckUtils]: 27: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,479 INFO L280 TraceCheckUtils]: 28: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,479 INFO L280 TraceCheckUtils]: 29: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,481 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #96#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,481 INFO L263 TraceCheckUtils]: 31: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {1951#true} is VALID [2020-07-10 15:28:35,481 INFO L280 TraceCheckUtils]: 32: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,482 INFO L280 TraceCheckUtils]: 33: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,482 INFO L280 TraceCheckUtils]: 34: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,483 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #98#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,484 INFO L263 TraceCheckUtils]: 36: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {1951#true} is VALID [2020-07-10 15:28:35,484 INFO L280 TraceCheckUtils]: 37: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,484 INFO L280 TraceCheckUtils]: 38: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,485 INFO L280 TraceCheckUtils]: 39: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,486 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #100#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,488 INFO L280 TraceCheckUtils]: 41: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,489 INFO L263 TraceCheckUtils]: 42: Hoare triple {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1951#true} is VALID [2020-07-10 15:28:35,489 INFO L280 TraceCheckUtils]: 43: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,489 INFO L280 TraceCheckUtils]: 44: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,490 INFO L280 TraceCheckUtils]: 45: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,491 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1951#true} {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} #102#return; {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,491 INFO L263 TraceCheckUtils]: 47: Hoare triple {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1951#true} is VALID [2020-07-10 15:28:35,492 INFO L280 TraceCheckUtils]: 48: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-10 15:28:35,492 INFO L280 TraceCheckUtils]: 49: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-10 15:28:35,492 INFO L280 TraceCheckUtils]: 50: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-10 15:28:35,494 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {1951#true} {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} #104#return; {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:35,497 INFO L263 TraceCheckUtils]: 52: Hoare triple {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {1990#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:35,498 INFO L280 TraceCheckUtils]: 53: Hoare triple {1990#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1991#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:35,500 INFO L280 TraceCheckUtils]: 54: Hoare triple {1991#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1952#false} is VALID [2020-07-10 15:28:35,500 INFO L280 TraceCheckUtils]: 55: Hoare triple {1952#false} assume !false; {1952#false} is VALID [2020-07-10 15:28:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-07-10 15:28:35,505 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102734941] [2020-07-10 15:28:35,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:35,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:28:35,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537745810] [2020-07-10 15:28:35,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-10 15:28:35,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:35,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:28:35,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:35,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:28:35,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:35,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:28:35,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:35,564 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 7 states. [2020-07-10 15:28:36,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:36,325 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2020-07-10 15:28:36,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:28:36,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-10 15:28:36,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2020-07-10 15:28:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2020-07-10 15:28:36,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2020-07-10 15:28:36,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:36,434 INFO L225 Difference]: With dead ends: 74 [2020-07-10 15:28:36,434 INFO L226 Difference]: Without dead ends: 72 [2020-07-10 15:28:36,435 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 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-10 15:28:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-10 15:28:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2020-07-10 15:28:36,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:36,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 70 states. [2020-07-10 15:28:36,524 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 70 states. [2020-07-10 15:28:36,524 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 70 states. [2020-07-10 15:28:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:36,528 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2020-07-10 15:28:36,528 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2020-07-10 15:28:36,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:36,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:36,530 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 72 states. [2020-07-10 15:28:36,530 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 72 states. [2020-07-10 15:28:36,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:36,534 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2020-07-10 15:28:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2020-07-10 15:28:36,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:36,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:36,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:36,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-10 15:28:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2020-07-10 15:28:36,538 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 56 [2020-07-10 15:28:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:36,539 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2020-07-10 15:28:36,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:28:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2020-07-10 15:28:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-10 15:28:36,540 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:36,540 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:36,541 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:28:36,541 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:36,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1730547273, now seen corresponding path program 1 times [2020-07-10 15:28:36,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:36,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180926708] [2020-07-10 15:28:36,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:36,738 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,738 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2354#true} {2354#true} #86#return; {2354#true} is VALID [2020-07-10 15:28:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:36,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,748 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,750 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #90#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:36,758 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,758 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,759 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,761 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #92#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:36,769 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,769 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,769 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,770 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #94#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:36,776 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,777 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,778 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #96#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:36,784 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,784 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,785 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,786 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #98#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:36,792 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,793 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,794 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #100#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:36,800 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,800 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,801 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,802 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #102#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:36,808 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,809 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,810 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #104#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:36,817 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,817 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,817 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,818 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #106#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:36,825 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,827 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #108#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,827 INFO L263 TraceCheckUtils]: 0: Hoare triple {2354#true} call ULTIMATE.init(); {2354#true} is VALID [2020-07-10 15:28:36,827 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,828 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2354#true} {2354#true} #86#return; {2354#true} is VALID [2020-07-10 15:28:36,828 INFO L263 TraceCheckUtils]: 3: Hoare triple {2354#true} call #t~ret10 := main(); {2354#true} is VALID [2020-07-10 15:28:36,828 INFO L280 TraceCheckUtils]: 4: Hoare triple {2354#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {2354#true} is VALID [2020-07-10 15:28:36,829 INFO L280 TraceCheckUtils]: 5: Hoare triple {2354#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {2358#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,830 INFO L280 TraceCheckUtils]: 6: Hoare triple {2358#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {2358#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,831 INFO L280 TraceCheckUtils]: 7: Hoare triple {2358#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,832 INFO L280 TraceCheckUtils]: 8: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} assume 1 + ~i~0 < ~len~0; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,833 INFO L263 TraceCheckUtils]: 9: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {2354#true} is VALID [2020-07-10 15:28:36,833 INFO L280 TraceCheckUtils]: 10: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,833 INFO L280 TraceCheckUtils]: 11: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,833 INFO L280 TraceCheckUtils]: 12: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,835 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #90#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,835 INFO L263 TraceCheckUtils]: 14: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2354#true} is VALID [2020-07-10 15:28:36,835 INFO L280 TraceCheckUtils]: 15: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,836 INFO L280 TraceCheckUtils]: 16: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,836 INFO L280 TraceCheckUtils]: 17: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,837 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #92#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,838 INFO L280 TraceCheckUtils]: 19: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,838 INFO L280 TraceCheckUtils]: 20: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,839 INFO L263 TraceCheckUtils]: 21: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {2354#true} is VALID [2020-07-10 15:28:36,839 INFO L280 TraceCheckUtils]: 22: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,839 INFO L280 TraceCheckUtils]: 23: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,839 INFO L280 TraceCheckUtils]: 24: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,841 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #94#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,841 INFO L263 TraceCheckUtils]: 26: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2354#true} is VALID [2020-07-10 15:28:36,841 INFO L280 TraceCheckUtils]: 27: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,842 INFO L280 TraceCheckUtils]: 28: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,842 INFO L280 TraceCheckUtils]: 29: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,843 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #96#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,844 INFO L263 TraceCheckUtils]: 31: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2354#true} is VALID [2020-07-10 15:28:36,844 INFO L280 TraceCheckUtils]: 32: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,844 INFO L280 TraceCheckUtils]: 33: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,844 INFO L280 TraceCheckUtils]: 34: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,845 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #98#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,845 INFO L263 TraceCheckUtils]: 36: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {2354#true} is VALID [2020-07-10 15:28:36,846 INFO L280 TraceCheckUtils]: 37: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,846 INFO L280 TraceCheckUtils]: 38: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,846 INFO L280 TraceCheckUtils]: 39: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,847 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #100#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,849 INFO L280 TraceCheckUtils]: 41: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,849 INFO L263 TraceCheckUtils]: 42: Hoare triple {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {2354#true} is VALID [2020-07-10 15:28:36,850 INFO L280 TraceCheckUtils]: 43: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,850 INFO L280 TraceCheckUtils]: 44: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,850 INFO L280 TraceCheckUtils]: 45: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,851 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #102#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,851 INFO L263 TraceCheckUtils]: 47: Hoare triple {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2354#true} is VALID [2020-07-10 15:28:36,852 INFO L280 TraceCheckUtils]: 48: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,852 INFO L280 TraceCheckUtils]: 49: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,852 INFO L280 TraceCheckUtils]: 50: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,853 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #104#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,853 INFO L263 TraceCheckUtils]: 52: Hoare triple {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2354#true} is VALID [2020-07-10 15:28:36,854 INFO L280 TraceCheckUtils]: 53: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,854 INFO L280 TraceCheckUtils]: 54: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,854 INFO L280 TraceCheckUtils]: 55: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,855 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #106#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,856 INFO L263 TraceCheckUtils]: 57: Hoare triple {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {2354#true} is VALID [2020-07-10 15:28:36,856 INFO L280 TraceCheckUtils]: 58: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-10 15:28:36,857 INFO L280 TraceCheckUtils]: 59: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-10 15:28:36,857 INFO L280 TraceCheckUtils]: 60: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-10 15:28:36,858 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #108#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,860 INFO L280 TraceCheckUtils]: 62: Hoare triple {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2401#(<= (+ main_~j~0 3) main_~bufsize~0)} is VALID [2020-07-10 15:28:36,861 INFO L263 TraceCheckUtils]: 63: Hoare triple {2401#(<= (+ main_~j~0 3) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2402#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:36,862 INFO L280 TraceCheckUtils]: 64: Hoare triple {2402#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2403#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:36,863 INFO L280 TraceCheckUtils]: 65: Hoare triple {2403#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2355#false} is VALID [2020-07-10 15:28:36,864 INFO L280 TraceCheckUtils]: 66: Hoare triple {2355#false} assume !false; {2355#false} is VALID [2020-07-10 15:28:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-07-10 15:28:36,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180926708] [2020-07-10 15:28:36,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:36,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 15:28:36,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764780849] [2020-07-10 15:28:36,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2020-07-10 15:28:36,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:36,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:28:36,933 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-10 15:28:36,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:28:36,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:36,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:28:36,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:36,935 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 8 states. [2020-07-10 15:28:37,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:37,753 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2020-07-10 15:28:37,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:28:37,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2020-07-10 15:28:37,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2020-07-10 15:28:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2020-07-10 15:28:37,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 61 transitions. [2020-07-10 15:28:37,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:37,849 INFO L225 Difference]: With dead ends: 72 [2020-07-10 15:28:37,849 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:28:37,851 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:28:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:28:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:28:37,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:37,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:37,852 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:37,853 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:37,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:37,853 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:37,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:37,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:37,854 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:37,854 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:37,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:37,855 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:37,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:37,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:37,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:37,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:28:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:28:37,856 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2020-07-10 15:28:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:37,856 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:28:37,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:28:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:37,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:37,857 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 15:28:37,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:28:38,472 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:28:38,473 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:38,473 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:38,473 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:28:38,473 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:28:38,473 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:28:38,474 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:28:38,474 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 15:28:38,474 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:28:38,474 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:28:38,474 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-10 15:28:38,474 INFO L268 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-07-10 15:28:38,475 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 56) no Hoare annotation was computed. [2020-07-10 15:28:38,475 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 54) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-07-10 15:28:38,475 INFO L268 CegarLoopResult]: For program point L23-3(lines 23 54) no Hoare annotation was computed. [2020-07-10 15:28:38,475 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-10 15:28:38,475 INFO L264 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~j~0)) [2020-07-10 15:28:38,475 INFO L268 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-07-10 15:28:38,475 INFO L268 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2020-07-10 15:28:38,476 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 53) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0)) [2020-07-10 15:28:38,476 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-10 15:28:38,476 INFO L268 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2020-07-10 15:28:38,476 INFO L264 CegarLoopResult]: At program point L45(lines 25 52) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-10 15:28:38,476 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0)) [2020-07-10 15:28:38,476 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0)) [2020-07-10 15:28:38,477 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~j~0)) [2020-07-10 15:28:38,477 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-10 15:28:38,477 INFO L264 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (and (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-10 15:28:38,477 INFO L268 CegarLoopResult]: For program point L25(lines 25 52) no Hoare annotation was computed. [2020-07-10 15:28:38,477 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-10 15:28:38,477 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 56) no Hoare annotation was computed. [2020-07-10 15:28:38,478 INFO L268 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2020-07-10 15:28:38,478 INFO L268 CegarLoopResult]: For program point L38(line 38) no Hoare annotation was computed. [2020-07-10 15:28:38,478 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-10 15:28:38,478 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 56) the Hoare annotation is: true [2020-07-10 15:28:38,478 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (and (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-10 15:28:38,478 INFO L264 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (and (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-10 15:28:38,479 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-10 15:28:38,479 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~j~0)) [2020-07-10 15:28:38,479 INFO L264 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~j~0)) [2020-07-10 15:28:38,479 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 15:28:38,479 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:28:38,479 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-10 15:28:38,479 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:28:38,479 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:28:38,480 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-10 15:28:38,484 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:28:38,484 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:28:38,484 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 15:28:38,485 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:28:38,485 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:28:38,485 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:38,485 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:38,485 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:38,485 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 15:28:38,485 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 15:28:38,485 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:28:38,485 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:28:38,485 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:38,485 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:28:38,485 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:28:38,485 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-10 15:28:38,486 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-10 15:28:38,487 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:28:38,487 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:28:38,487 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-10 15:28:38,487 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:28:38,487 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-10 15:28:38,488 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 15:28:38,488 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,488 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,488 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,488 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,488 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,488 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,489 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,489 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,489 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,489 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,489 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,489 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,489 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,489 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,489 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,490 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:38,490 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 15:28:38,490 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 15:28:38,490 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 15:28:38,490 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 15:28:38,490 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-10 15:28:38,490 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-10 15:28:38,491 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 15:28:38,491 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 15:28:38,491 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 15:28:38,491 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 15:28:38,491 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:28:38,491 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:28:38,492 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 15:28:38,492 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 15:28:38,492 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:28:38,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:28:38 BoogieIcfgContainer [2020-07-10 15:28:38,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:28:38,511 INFO L168 Benchmark]: Toolchain (without parser) took 10934.43 ms. Allocated memory was 143.1 MB in the beginning and 323.5 MB in the end (delta: 180.4 MB). Free memory was 101.5 MB in the beginning and 181.8 MB in the end (delta: -80.3 MB). Peak memory consumption was 100.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:38,512 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-10 15:28:38,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.77 ms. Allocated memory is still 143.1 MB. Free memory was 101.3 MB in the beginning and 90.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:38,513 INFO L168 Benchmark]: Boogie Preprocessor took 126.42 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 90.6 MB in the beginning and 179.5 MB in the end (delta: -89.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:38,514 INFO L168 Benchmark]: RCFGBuilder took 747.26 ms. Allocated memory is still 200.8 MB. Free memory was 179.5 MB in the beginning and 149.0 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:38,515 INFO L168 Benchmark]: TraceAbstraction took 9747.64 ms. Allocated memory was 200.8 MB in the beginning and 323.5 MB in the end (delta: 122.7 MB). Free memory was 149.0 MB in the beginning and 181.8 MB in the end (delta: -32.8 MB). Peak memory consumption was 89.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:38,519 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.31 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 306.77 ms. Allocated memory is still 143.1 MB. Free memory was 101.3 MB in the beginning and 90.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.42 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 90.6 MB in the beginning and 179.5 MB in the end (delta: -89.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 747.26 ms. Allocated memory is still 200.8 MB. Free memory was 179.5 MB in the beginning and 149.0 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9747.64 ms. Allocated memory was 200.8 MB in the beginning and 323.5 MB in the end (delta: 122.7 MB). Free memory was 149.0 MB in the beginning and 181.8 MB in the end (delta: -32.8 MB). Peak memory consumption was 89.9 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: 24]: Loop Invariant Derived loop invariant: (0 <= i && limit + 4 <= bufsize) && 0 <= j - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((i + 1 <= len && 0 <= i) && limit + 4 <= bufsize) && 0 <= j) && j + 5 <= bufsize - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.0s, OverallIterations: 8, TraceHistogramMax: 11, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 395 SDtfs, 104 SDslu, 1002 SDs, 0 SdLazy, 517 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 55 PreInvPairs, 76 NumberOfFragments, 368 HoareAnnotationTreeSize, 55 FomulaSimplifications, 480 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 114 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 23622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...