/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:22:46,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:22:46,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:22:46,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:22:46,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:22:46,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:22:46,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:22:46,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:22:46,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:22:46,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:22:46,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:22:46,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:22:46,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:22:46,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:22:46,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:22:46,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:22:46,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:22:46,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:22:46,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:22:47,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:22:47,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:22:47,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:22:47,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:22:47,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:22:47,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:22:47,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:22:47,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:22:47,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:22:47,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:22:47,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:22:47,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:22:47,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:22:47,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:22:47,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:22:47,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:22:47,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:22:47,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:22:47,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:22:47,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:22:47,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:22:47,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:22:47,021 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:22:47,031 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:22:47,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:22:47,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:22:47,033 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:22:47,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:22:47,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:22:47,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:22:47,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:22:47,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:22:47,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:22:47,034 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:22:47,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:22:47,035 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:22:47,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:22:47,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:22:47,035 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:22:47,036 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:22:47,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:22:47,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:22:47,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:22:47,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:22:47,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:22:47,039 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:22:47,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:22:47,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:22:47,339 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:22:47,341 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:22:47,341 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:22:47,342 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i [2020-07-10 20:22:47,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d940738b8/8455084522d445f4b9614ced79e9bc3a/FLAGfbd06b8a7 [2020-07-10 20:22:47,936 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:22:47,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i [2020-07-10 20:22:47,945 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d940738b8/8455084522d445f4b9614ced79e9bc3a/FLAGfbd06b8a7 [2020-07-10 20:22:48,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d940738b8/8455084522d445f4b9614ced79e9bc3a [2020-07-10 20:22:48,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:22:48,312 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:22:48,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:48,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:22:48,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:22:48,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:48" (1/1) ... [2020-07-10 20:22:48,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47eb17af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:48, skipping insertion in model container [2020-07-10 20:22:48,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:48" (1/1) ... [2020-07-10 20:22:48,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:22:48,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:22:48,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:48,531 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:22:48,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:48,568 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:22:48,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:48 WrapperNode [2020-07-10 20:22:48,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:48,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:22:48,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:22:48,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:22:48,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:48" (1/1) ... [2020-07-10 20:22:48,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:48" (1/1) ... [2020-07-10 20:22:48,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:48" (1/1) ... [2020-07-10 20:22:48,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:48" (1/1) ... [2020-07-10 20:22:48,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:48" (1/1) ... [2020-07-10 20:22:48,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:48" (1/1) ... [2020-07-10 20:22:48,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:48" (1/1) ... [2020-07-10 20:22:48,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:22:48,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:22:48,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:22:48,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:22:48,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:48" (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 20:22:48,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:22:48,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:22:48,763 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:22:48,763 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:22:48,764 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:22:48,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:22:48,764 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:22:48,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:22:48,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:22:48,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:22:48,765 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:22:48,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:22:48,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:22:49,227 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:22:49,227 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:22:49,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:49 BoogieIcfgContainer [2020-07-10 20:22:49,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:22:49,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:22:49,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:22:49,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:22:49,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:22:48" (1/3) ... [2020-07-10 20:22:49,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9e3667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:49, skipping insertion in model container [2020-07-10 20:22:49,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:48" (2/3) ... [2020-07-10 20:22:49,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9e3667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:49, skipping insertion in model container [2020-07-10 20:22:49,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:49" (3/3) ... [2020-07-10 20:22:49,241 INFO L109 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok.i [2020-07-10 20:22:49,252 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:22:49,260 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:22:49,271 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:22:49,293 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:22:49,293 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:22:49,294 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:22:49,294 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:22:49,294 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:22:49,294 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:22:49,295 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:22:49,295 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:22:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-07-10 20:22:49,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 20:22:49,322 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:49,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:49,324 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:49,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1281286412, now seen corresponding path program 1 times [2020-07-10 20:22:49,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:49,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1042521526] [2020-07-10 20:22:49,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:49,653 INFO L280 TraceCheckUtils]: 0: Hoare triple {55#true} assume true; {55#true} is VALID [2020-07-10 20:22:49,654 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {55#true} {55#true} #107#return; {55#true} is VALID [2020-07-10 20:22:49,656 INFO L263 TraceCheckUtils]: 0: Hoare triple {55#true} call ULTIMATE.init(); {55#true} is VALID [2020-07-10 20:22:49,657 INFO L280 TraceCheckUtils]: 1: Hoare triple {55#true} assume true; {55#true} is VALID [2020-07-10 20:22:49,657 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {55#true} {55#true} #107#return; {55#true} is VALID [2020-07-10 20:22:49,658 INFO L263 TraceCheckUtils]: 3: Hoare triple {55#true} call #t~ret4 := main(); {55#true} is VALID [2020-07-10 20:22:49,658 INFO L280 TraceCheckUtils]: 4: Hoare triple {55#true} havoc ~p~0; {55#true} is VALID [2020-07-10 20:22:49,659 INFO L280 TraceCheckUtils]: 5: Hoare triple {55#true} havoc ~i~0; {55#true} is VALID [2020-07-10 20:22:49,659 INFO L280 TraceCheckUtils]: 6: Hoare triple {55#true} havoc ~leader_len~0; {55#true} is VALID [2020-07-10 20:22:49,660 INFO L280 TraceCheckUtils]: 7: Hoare triple {55#true} havoc ~bufsize~0; {55#true} is VALID [2020-07-10 20:22:49,660 INFO L280 TraceCheckUtils]: 8: Hoare triple {55#true} havoc ~bufsize_0~0; {55#true} is VALID [2020-07-10 20:22:49,661 INFO L280 TraceCheckUtils]: 9: Hoare triple {55#true} havoc ~ielen~0; {55#true} is VALID [2020-07-10 20:22:49,661 INFO L280 TraceCheckUtils]: 10: Hoare triple {55#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {55#true} is VALID [2020-07-10 20:22:49,662 INFO L280 TraceCheckUtils]: 11: Hoare triple {55#true} ~leader_len~0 := #t~nondet0; {55#true} is VALID [2020-07-10 20:22:49,662 INFO L280 TraceCheckUtils]: 12: Hoare triple {55#true} havoc #t~nondet0; {55#true} is VALID [2020-07-10 20:22:49,662 INFO L280 TraceCheckUtils]: 13: Hoare triple {55#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {55#true} is VALID [2020-07-10 20:22:49,663 INFO L280 TraceCheckUtils]: 14: Hoare triple {55#true} ~bufsize~0 := #t~nondet1; {55#true} is VALID [2020-07-10 20:22:49,663 INFO L280 TraceCheckUtils]: 15: Hoare triple {55#true} havoc #t~nondet1; {55#true} is VALID [2020-07-10 20:22:49,664 INFO L280 TraceCheckUtils]: 16: Hoare triple {55#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {55#true} is VALID [2020-07-10 20:22:49,664 INFO L280 TraceCheckUtils]: 17: Hoare triple {55#true} ~ielen~0 := #t~nondet2; {55#true} is VALID [2020-07-10 20:22:49,665 INFO L280 TraceCheckUtils]: 18: Hoare triple {55#true} havoc #t~nondet2; {55#true} is VALID [2020-07-10 20:22:49,665 INFO L280 TraceCheckUtils]: 19: Hoare triple {55#true} assume !!(~leader_len~0 < 1000000); {55#true} is VALID [2020-07-10 20:22:49,666 INFO L280 TraceCheckUtils]: 20: Hoare triple {55#true} assume !!(~bufsize~0 < 1000000); {55#true} is VALID [2020-07-10 20:22:49,666 INFO L280 TraceCheckUtils]: 21: Hoare triple {55#true} assume !!(~ielen~0 < 1000000); {55#true} is VALID [2020-07-10 20:22:49,668 INFO L280 TraceCheckUtils]: 22: Hoare triple {55#true} assume ~leader_len~0 > 0; {59#(<= 1 main_~leader_len~0)} is VALID [2020-07-10 20:22:49,670 INFO L280 TraceCheckUtils]: 23: Hoare triple {59#(<= 1 main_~leader_len~0)} assume ~bufsize~0 > 0; {59#(<= 1 main_~leader_len~0)} is VALID [2020-07-10 20:22:49,671 INFO L280 TraceCheckUtils]: 24: Hoare triple {59#(<= 1 main_~leader_len~0)} assume ~ielen~0 > 0; {59#(<= 1 main_~leader_len~0)} is VALID [2020-07-10 20:22:49,672 INFO L280 TraceCheckUtils]: 25: Hoare triple {59#(<= 1 main_~leader_len~0)} assume !(~bufsize~0 < ~leader_len~0); {59#(<= 1 main_~leader_len~0)} is VALID [2020-07-10 20:22:49,673 INFO L280 TraceCheckUtils]: 26: Hoare triple {59#(<= 1 main_~leader_len~0)} ~p~0 := 0; {60#(<= 1 (+ main_~leader_len~0 main_~p~0))} is VALID [2020-07-10 20:22:49,674 INFO L280 TraceCheckUtils]: 27: Hoare triple {60#(<= 1 (+ main_~leader_len~0 main_~p~0))} ~bufsize_0~0 := ~bufsize~0; {60#(<= 1 (+ main_~leader_len~0 main_~p~0))} is VALID [2020-07-10 20:22:49,675 INFO L280 TraceCheckUtils]: 28: Hoare triple {60#(<= 1 (+ main_~leader_len~0 main_~p~0))} ~bufsize~0 := ~bufsize~0 - ~leader_len~0; {60#(<= 1 (+ main_~leader_len~0 main_~p~0))} is VALID [2020-07-10 20:22:49,677 INFO L280 TraceCheckUtils]: 29: Hoare triple {60#(<= 1 (+ main_~leader_len~0 main_~p~0))} ~p~0 := ~p~0 + ~leader_len~0; {61#(<= 1 main_~p~0)} is VALID [2020-07-10 20:22:49,678 INFO L280 TraceCheckUtils]: 30: Hoare triple {61#(<= 1 main_~p~0)} assume !(~bufsize~0 < 2 * ~ielen~0); {61#(<= 1 main_~p~0)} is VALID [2020-07-10 20:22:49,679 INFO L280 TraceCheckUtils]: 31: Hoare triple {61#(<= 1 main_~p~0)} ~i~0 := 0; {61#(<= 1 main_~p~0)} is VALID [2020-07-10 20:22:49,680 INFO L280 TraceCheckUtils]: 32: Hoare triple {61#(<= 1 main_~p~0)} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {61#(<= 1 main_~p~0)} is VALID [2020-07-10 20:22:49,682 INFO L263 TraceCheckUtils]: 33: Hoare triple {61#(<= 1 main_~p~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {62#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:49,685 INFO L280 TraceCheckUtils]: 34: Hoare triple {62#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {63#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:49,686 INFO L280 TraceCheckUtils]: 35: Hoare triple {63#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {56#false} is VALID [2020-07-10 20:22:49,687 INFO L280 TraceCheckUtils]: 36: Hoare triple {56#false} assume !false; {56#false} is VALID [2020-07-10 20:22:49,694 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 20:22:49,695 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:49,697 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1042521526] [2020-07-10 20:22:49,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:49,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:22:49,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923223516] [2020-07-10 20:22:49,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-10 20:22:49,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:49,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:22:49,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:49,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:22:49,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:49,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:22:49,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:22:49,789 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 7 states. [2020-07-10 20:22:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:50,411 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2020-07-10 20:22:50,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 20:22:50,411 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-10 20:22:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:50,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:22:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2020-07-10 20:22:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:22:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2020-07-10 20:22:50,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 93 transitions. [2020-07-10 20:22:50,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:50,575 INFO L225 Difference]: With dead ends: 77 [2020-07-10 20:22:50,575 INFO L226 Difference]: Without dead ends: 49 [2020-07-10 20:22:50,582 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:22:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-10 20:22:50,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-10 20:22:50,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:50,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-10 20:22:50,701 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-10 20:22:50,701 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-10 20:22:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:50,709 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2020-07-10 20:22:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2020-07-10 20:22:50,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:50,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:50,716 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-10 20:22:50,716 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-10 20:22:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:50,724 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2020-07-10 20:22:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2020-07-10 20:22:50,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:50,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:50,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:50,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-10 20:22:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2020-07-10 20:22:50,736 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 37 [2020-07-10 20:22:50,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:50,738 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2020-07-10 20:22:50,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:22:50,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2020-07-10 20:22:50,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:50,798 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2020-07-10 20:22:50,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 20:22:50,799 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:50,800 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:50,800 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:22:50,801 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:50,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:50,802 INFO L82 PathProgramCache]: Analyzing trace with hash -594029260, now seen corresponding path program 1 times [2020-07-10 20:22:50,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:50,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1546348161] [2020-07-10 20:22:50,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:51,013 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-10 20:22:51,014 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {422#true} {422#true} #107#return; {422#true} is VALID [2020-07-10 20:22:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:51,022 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~cond := #in~cond; {422#true} is VALID [2020-07-10 20:22:51,023 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume !(0 == ~cond); {422#true} is VALID [2020-07-10 20:22:51,023 INFO L280 TraceCheckUtils]: 2: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-10 20:22:51,024 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {422#true} {429#(<= (+ main_~p~0 3) main_~bufsize_0~0)} #111#return; {429#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2020-07-10 20:22:51,025 INFO L263 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2020-07-10 20:22:51,025 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-10 20:22:51,025 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #107#return; {422#true} is VALID [2020-07-10 20:22:51,026 INFO L263 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret4 := main(); {422#true} is VALID [2020-07-10 20:22:51,026 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} havoc ~p~0; {422#true} is VALID [2020-07-10 20:22:51,027 INFO L280 TraceCheckUtils]: 5: Hoare triple {422#true} havoc ~i~0; {422#true} is VALID [2020-07-10 20:22:51,027 INFO L280 TraceCheckUtils]: 6: Hoare triple {422#true} havoc ~leader_len~0; {422#true} is VALID [2020-07-10 20:22:51,027 INFO L280 TraceCheckUtils]: 7: Hoare triple {422#true} havoc ~bufsize~0; {422#true} is VALID [2020-07-10 20:22:51,028 INFO L280 TraceCheckUtils]: 8: Hoare triple {422#true} havoc ~bufsize_0~0; {422#true} is VALID [2020-07-10 20:22:51,028 INFO L280 TraceCheckUtils]: 9: Hoare triple {422#true} havoc ~ielen~0; {422#true} is VALID [2020-07-10 20:22:51,028 INFO L280 TraceCheckUtils]: 10: Hoare triple {422#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {422#true} is VALID [2020-07-10 20:22:51,029 INFO L280 TraceCheckUtils]: 11: Hoare triple {422#true} ~leader_len~0 := #t~nondet0; {422#true} is VALID [2020-07-10 20:22:51,029 INFO L280 TraceCheckUtils]: 12: Hoare triple {422#true} havoc #t~nondet0; {422#true} is VALID [2020-07-10 20:22:51,029 INFO L280 TraceCheckUtils]: 13: Hoare triple {422#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {422#true} is VALID [2020-07-10 20:22:51,030 INFO L280 TraceCheckUtils]: 14: Hoare triple {422#true} ~bufsize~0 := #t~nondet1; {422#true} is VALID [2020-07-10 20:22:51,030 INFO L280 TraceCheckUtils]: 15: Hoare triple {422#true} havoc #t~nondet1; {422#true} is VALID [2020-07-10 20:22:51,030 INFO L280 TraceCheckUtils]: 16: Hoare triple {422#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {422#true} is VALID [2020-07-10 20:22:51,031 INFO L280 TraceCheckUtils]: 17: Hoare triple {422#true} ~ielen~0 := #t~nondet2; {422#true} is VALID [2020-07-10 20:22:51,031 INFO L280 TraceCheckUtils]: 18: Hoare triple {422#true} havoc #t~nondet2; {422#true} is VALID [2020-07-10 20:22:51,032 INFO L280 TraceCheckUtils]: 19: Hoare triple {422#true} assume !!(~leader_len~0 < 1000000); {422#true} is VALID [2020-07-10 20:22:51,032 INFO L280 TraceCheckUtils]: 20: Hoare triple {422#true} assume !!(~bufsize~0 < 1000000); {422#true} is VALID [2020-07-10 20:22:51,032 INFO L280 TraceCheckUtils]: 21: Hoare triple {422#true} assume !!(~ielen~0 < 1000000); {422#true} is VALID [2020-07-10 20:22:51,033 INFO L280 TraceCheckUtils]: 22: Hoare triple {422#true} assume ~leader_len~0 > 0; {422#true} is VALID [2020-07-10 20:22:51,033 INFO L280 TraceCheckUtils]: 23: Hoare triple {422#true} assume ~bufsize~0 > 0; {422#true} is VALID [2020-07-10 20:22:51,033 INFO L280 TraceCheckUtils]: 24: Hoare triple {422#true} assume ~ielen~0 > 0; {422#true} is VALID [2020-07-10 20:22:51,034 INFO L280 TraceCheckUtils]: 25: Hoare triple {422#true} assume !(~bufsize~0 < ~leader_len~0); {422#true} is VALID [2020-07-10 20:22:51,035 INFO L280 TraceCheckUtils]: 26: Hoare triple {422#true} ~p~0 := 0; {426#(<= main_~p~0 0)} is VALID [2020-07-10 20:22:51,036 INFO L280 TraceCheckUtils]: 27: Hoare triple {426#(<= main_~p~0 0)} ~bufsize_0~0 := ~bufsize~0; {427#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2020-07-10 20:22:51,037 INFO L280 TraceCheckUtils]: 28: Hoare triple {427#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} ~bufsize~0 := ~bufsize~0 - ~leader_len~0; {428#(<= (+ main_~leader_len~0 main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2020-07-10 20:22:51,038 INFO L280 TraceCheckUtils]: 29: Hoare triple {428#(<= (+ main_~leader_len~0 main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} ~p~0 := ~p~0 + ~leader_len~0; {427#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2020-07-10 20:22:51,039 INFO L280 TraceCheckUtils]: 30: Hoare triple {427#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0); {427#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2020-07-10 20:22:51,040 INFO L280 TraceCheckUtils]: 31: Hoare triple {427#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} ~i~0 := 0; {427#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2020-07-10 20:22:51,041 INFO L280 TraceCheckUtils]: 32: Hoare triple {427#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {429#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2020-07-10 20:22:51,041 INFO L263 TraceCheckUtils]: 33: Hoare triple {429#(<= (+ main_~p~0 3) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {422#true} is VALID [2020-07-10 20:22:51,041 INFO L280 TraceCheckUtils]: 34: Hoare triple {422#true} ~cond := #in~cond; {422#true} is VALID [2020-07-10 20:22:51,042 INFO L280 TraceCheckUtils]: 35: Hoare triple {422#true} assume !(0 == ~cond); {422#true} is VALID [2020-07-10 20:22:51,042 INFO L280 TraceCheckUtils]: 36: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-10 20:22:51,043 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {422#true} {429#(<= (+ main_~p~0 3) main_~bufsize_0~0)} #111#return; {429#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2020-07-10 20:22:51,045 INFO L263 TraceCheckUtils]: 38: Hoare triple {429#(<= (+ main_~p~0 3) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {434#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:51,046 INFO L280 TraceCheckUtils]: 39: Hoare triple {434#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {435#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:51,046 INFO L280 TraceCheckUtils]: 40: Hoare triple {435#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {423#false} is VALID [2020-07-10 20:22:51,047 INFO L280 TraceCheckUtils]: 41: Hoare triple {423#false} assume !false; {423#false} is VALID [2020-07-10 20:22:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:51,051 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:51,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1546348161] [2020-07-10 20:22:51,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:51,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:22:51,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692027825] [2020-07-10 20:22:51,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-07-10 20:22:51,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:51,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:22:51,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:51,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:22:51,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:51,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:22:51,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:22:51,110 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 8 states. [2020-07-10 20:22:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:51,633 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-10 20:22:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 20:22:51,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-07-10 20:22:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:22:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2020-07-10 20:22:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:22:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2020-07-10 20:22:51,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 57 transitions. [2020-07-10 20:22:51,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:51,722 INFO L225 Difference]: With dead ends: 59 [2020-07-10 20:22:51,722 INFO L226 Difference]: Without dead ends: 57 [2020-07-10 20:22:51,724 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:22:51,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-10 20:22:51,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2020-07-10 20:22:51,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:51,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2020-07-10 20:22:51,790 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2020-07-10 20:22:51,790 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2020-07-10 20:22:51,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:51,796 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-07-10 20:22:51,796 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-07-10 20:22:51,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:51,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:51,798 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2020-07-10 20:22:51,798 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2020-07-10 20:22:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:51,802 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-07-10 20:22:51,803 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-07-10 20:22:51,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:51,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:51,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:51,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-10 20:22:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2020-07-10 20:22:51,808 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 42 [2020-07-10 20:22:51,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:51,809 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2020-07-10 20:22:51,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:22:51,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 57 transitions. [2020-07-10 20:22:51,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2020-07-10 20:22:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-10 20:22:51,893 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:51,893 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:51,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:22:51,894 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:51,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:51,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1318797830, now seen corresponding path program 1 times [2020-07-10 20:22:51,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:51,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [436479778] [2020-07-10 20:22:51,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:52,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-10 20:22:52,153 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {790#true} {790#true} #107#return; {790#true} is VALID [2020-07-10 20:22:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:52,171 INFO L280 TraceCheckUtils]: 0: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2020-07-10 20:22:52,172 INFO L280 TraceCheckUtils]: 1: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2020-07-10 20:22:52,172 INFO L280 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-10 20:22:52,173 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {790#true} {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} #111#return; {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2020-07-10 20:22:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:52,182 INFO L280 TraceCheckUtils]: 0: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2020-07-10 20:22:52,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2020-07-10 20:22:52,182 INFO L280 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-10 20:22:52,183 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {790#true} {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} #113#return; {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2020-07-10 20:22:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:52,190 INFO L280 TraceCheckUtils]: 0: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2020-07-10 20:22:52,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2020-07-10 20:22:52,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-10 20:22:52,192 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {790#true} {809#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #111#return; {809#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2020-07-10 20:22:52,192 INFO L263 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2020-07-10 20:22:52,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-10 20:22:52,193 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {790#true} {790#true} #107#return; {790#true} is VALID [2020-07-10 20:22:52,193 INFO L263 TraceCheckUtils]: 3: Hoare triple {790#true} call #t~ret4 := main(); {790#true} is VALID [2020-07-10 20:22:52,193 INFO L280 TraceCheckUtils]: 4: Hoare triple {790#true} havoc ~p~0; {790#true} is VALID [2020-07-10 20:22:52,194 INFO L280 TraceCheckUtils]: 5: Hoare triple {790#true} havoc ~i~0; {790#true} is VALID [2020-07-10 20:22:52,194 INFO L280 TraceCheckUtils]: 6: Hoare triple {790#true} havoc ~leader_len~0; {790#true} is VALID [2020-07-10 20:22:52,194 INFO L280 TraceCheckUtils]: 7: Hoare triple {790#true} havoc ~bufsize~0; {790#true} is VALID [2020-07-10 20:22:52,195 INFO L280 TraceCheckUtils]: 8: Hoare triple {790#true} havoc ~bufsize_0~0; {790#true} is VALID [2020-07-10 20:22:52,195 INFO L280 TraceCheckUtils]: 9: Hoare triple {790#true} havoc ~ielen~0; {790#true} is VALID [2020-07-10 20:22:52,195 INFO L280 TraceCheckUtils]: 10: Hoare triple {790#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {790#true} is VALID [2020-07-10 20:22:52,196 INFO L280 TraceCheckUtils]: 11: Hoare triple {790#true} ~leader_len~0 := #t~nondet0; {790#true} is VALID [2020-07-10 20:22:52,196 INFO L280 TraceCheckUtils]: 12: Hoare triple {790#true} havoc #t~nondet0; {790#true} is VALID [2020-07-10 20:22:52,196 INFO L280 TraceCheckUtils]: 13: Hoare triple {790#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {790#true} is VALID [2020-07-10 20:22:52,196 INFO L280 TraceCheckUtils]: 14: Hoare triple {790#true} ~bufsize~0 := #t~nondet1; {790#true} is VALID [2020-07-10 20:22:52,197 INFO L280 TraceCheckUtils]: 15: Hoare triple {790#true} havoc #t~nondet1; {790#true} is VALID [2020-07-10 20:22:52,197 INFO L280 TraceCheckUtils]: 16: Hoare triple {790#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {790#true} is VALID [2020-07-10 20:22:52,197 INFO L280 TraceCheckUtils]: 17: Hoare triple {790#true} ~ielen~0 := #t~nondet2; {790#true} is VALID [2020-07-10 20:22:52,198 INFO L280 TraceCheckUtils]: 18: Hoare triple {790#true} havoc #t~nondet2; {790#true} is VALID [2020-07-10 20:22:52,198 INFO L280 TraceCheckUtils]: 19: Hoare triple {790#true} assume !!(~leader_len~0 < 1000000); {790#true} is VALID [2020-07-10 20:22:52,198 INFO L280 TraceCheckUtils]: 20: Hoare triple {790#true} assume !!(~bufsize~0 < 1000000); {790#true} is VALID [2020-07-10 20:22:52,199 INFO L280 TraceCheckUtils]: 21: Hoare triple {790#true} assume !!(~ielen~0 < 1000000); {790#true} is VALID [2020-07-10 20:22:52,199 INFO L280 TraceCheckUtils]: 22: Hoare triple {790#true} assume ~leader_len~0 > 0; {790#true} is VALID [2020-07-10 20:22:52,199 INFO L280 TraceCheckUtils]: 23: Hoare triple {790#true} assume ~bufsize~0 > 0; {790#true} is VALID [2020-07-10 20:22:52,200 INFO L280 TraceCheckUtils]: 24: Hoare triple {790#true} assume ~ielen~0 > 0; {790#true} is VALID [2020-07-10 20:22:52,200 INFO L280 TraceCheckUtils]: 25: Hoare triple {790#true} assume !(~bufsize~0 < ~leader_len~0); {790#true} is VALID [2020-07-10 20:22:52,201 INFO L280 TraceCheckUtils]: 26: Hoare triple {790#true} ~p~0 := 0; {794#(<= main_~p~0 0)} is VALID [2020-07-10 20:22:52,202 INFO L280 TraceCheckUtils]: 27: Hoare triple {794#(<= main_~p~0 0)} ~bufsize_0~0 := ~bufsize~0; {795#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2020-07-10 20:22:52,213 INFO L280 TraceCheckUtils]: 28: Hoare triple {795#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} ~bufsize~0 := ~bufsize~0 - ~leader_len~0; {796#(<= (+ main_~leader_len~0 main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2020-07-10 20:22:52,215 INFO L280 TraceCheckUtils]: 29: Hoare triple {796#(<= (+ main_~leader_len~0 main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} ~p~0 := ~p~0 + ~leader_len~0; {795#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2020-07-10 20:22:52,216 INFO L280 TraceCheckUtils]: 30: Hoare triple {795#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0); {797#(<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0)} is VALID [2020-07-10 20:22:52,218 INFO L280 TraceCheckUtils]: 31: Hoare triple {797#(<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0)} ~i~0 := 0; {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2020-07-10 20:22:52,219 INFO L280 TraceCheckUtils]: 32: Hoare triple {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2020-07-10 20:22:52,219 INFO L263 TraceCheckUtils]: 33: Hoare triple {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {790#true} is VALID [2020-07-10 20:22:52,220 INFO L280 TraceCheckUtils]: 34: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2020-07-10 20:22:52,220 INFO L280 TraceCheckUtils]: 35: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2020-07-10 20:22:52,220 INFO L280 TraceCheckUtils]: 36: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-10 20:22:52,221 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {790#true} {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} #111#return; {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2020-07-10 20:22:52,221 INFO L263 TraceCheckUtils]: 38: Hoare triple {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {790#true} is VALID [2020-07-10 20:22:52,222 INFO L280 TraceCheckUtils]: 39: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2020-07-10 20:22:52,222 INFO L280 TraceCheckUtils]: 40: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2020-07-10 20:22:52,222 INFO L280 TraceCheckUtils]: 41: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-10 20:22:52,223 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {790#true} {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} #113#return; {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2020-07-10 20:22:52,224 INFO L280 TraceCheckUtils]: 43: Hoare triple {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} ~p~0 := 2 + ~p~0; {807#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0) 2))} is VALID [2020-07-10 20:22:52,225 INFO L280 TraceCheckUtils]: 44: Hoare triple {807#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0) 2))} #t~post3 := ~i~0; {808#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 |main_#t~post3|) 2))} is VALID [2020-07-10 20:22:52,226 INFO L280 TraceCheckUtils]: 45: Hoare triple {808#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 |main_#t~post3|) 2))} ~i~0 := 1 + #t~post3; {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2020-07-10 20:22:52,227 INFO L280 TraceCheckUtils]: 46: Hoare triple {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} havoc #t~post3; {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} is VALID [2020-07-10 20:22:52,227 INFO L280 TraceCheckUtils]: 47: Hoare triple {798#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0)))} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {809#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2020-07-10 20:22:52,228 INFO L263 TraceCheckUtils]: 48: Hoare triple {809#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {790#true} is VALID [2020-07-10 20:22:52,228 INFO L280 TraceCheckUtils]: 49: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2020-07-10 20:22:52,228 INFO L280 TraceCheckUtils]: 50: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2020-07-10 20:22:52,229 INFO L280 TraceCheckUtils]: 51: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-10 20:22:52,229 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {790#true} {809#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #111#return; {809#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2020-07-10 20:22:52,231 INFO L263 TraceCheckUtils]: 53: Hoare triple {809#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {814#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:52,231 INFO L280 TraceCheckUtils]: 54: Hoare triple {814#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {815#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:52,232 INFO L280 TraceCheckUtils]: 55: Hoare triple {815#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {791#false} is VALID [2020-07-10 20:22:52,232 INFO L280 TraceCheckUtils]: 56: Hoare triple {791#false} assume !false; {791#false} is VALID [2020-07-10 20:22:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 20:22:52,238 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:52,239 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [436479778] [2020-07-10 20:22:52,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:52,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 20:22:52,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484695342] [2020-07-10 20:22:52,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2020-07-10 20:22:52,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:52,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 20:22:52,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:52,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 20:22:52,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:52,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 20:22:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:22:52,299 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 12 states. [2020-07-10 20:22:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:53,207 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-07-10 20:22:53,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-10 20:22:53,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2020-07-10 20:22:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:22:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 55 transitions. [2020-07-10 20:22:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:22:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 55 transitions. [2020-07-10 20:22:53,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 55 transitions. [2020-07-10 20:22:53,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:53,290 INFO L225 Difference]: With dead ends: 57 [2020-07-10 20:22:53,290 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:22:53,292 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2020-07-10 20:22:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:22:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:22:53,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:53,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:53,293 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:53,293 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:53,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:53,294 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:53,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:53,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:53,294 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:53,294 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:53,295 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:53,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:53,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:53,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:53,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:22:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:22:53,296 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2020-07-10 20:22:53,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:53,297 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:22:53,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 20:22:53,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:22:53,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:53,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:53,298 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:22:53,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:22:53,736 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:53,737 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:53,737 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:53,737 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:22:53,737 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:22:53,737 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:53,738 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:22:53,738 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:22:53,738 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 20:22:53,738 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-10 20:22:53,738 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:22:53,738 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-10 20:22:53,738 INFO L264 CegarLoopResult]: At program point L27-1(lines 14 45) the Hoare annotation is: (<= 1 main_~leader_len~0) [2020-07-10 20:22:53,739 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 45) the Hoare annotation is: true [2020-07-10 20:22:53,739 INFO L271 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-07-10 20:22:53,739 INFO L271 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-07-10 20:22:53,739 INFO L271 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: true [2020-07-10 20:22:53,739 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-10 20:22:53,739 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0))) (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= 1 main_~p~0) (<= 1 main_~leader_len~0)) [2020-07-10 20:22:53,739 INFO L264 CegarLoopResult]: At program point L36(lines 36 37) the Hoare annotation is: (and (<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0) (<= 1 main_~p~0) (<= 1 main_~leader_len~0)) [2020-07-10 20:22:53,740 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (<= 1 main_~leader_len~0) [2020-07-10 20:22:53,740 INFO L264 CegarLoopResult]: At program point L28(lines 14 45) the Hoare annotation is: (<= 1 main_~leader_len~0) [2020-07-10 20:22:53,740 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-10 20:22:53,740 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (<= 1 main_~leader_len~0) [2020-07-10 20:22:53,740 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-10 20:22:53,740 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-10 20:22:53,740 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (and (<= main_~p~0 0) (<= 1 (+ main_~leader_len~0 main_~p~0))) [2020-07-10 20:22:53,741 INFO L264 CegarLoopResult]: At program point L29(lines 14 45) the Hoare annotation is: (<= 1 main_~leader_len~0) [2020-07-10 20:22:53,741 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-10 20:22:53,741 INFO L271 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-07-10 20:22:53,741 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-10 20:22:53,741 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-10 20:22:53,741 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-10 20:22:53,741 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-10 20:22:53,742 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0) (<= 1 main_~p~0) (<= 1 main_~leader_len~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0)) [2020-07-10 20:22:53,742 INFO L264 CegarLoopResult]: At program point L38-3(lines 38 42) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0) 2)) (<= 1 main_~p~0) (<= 1 main_~leader_len~0)) [2020-07-10 20:22:53,742 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0) (<= main_~p~0 0) (<= 1 (+ main_~leader_len~0 main_~p~0))) [2020-07-10 20:22:53,742 INFO L264 CegarLoopResult]: At program point L38-4(line 38) the Hoare annotation is: (let ((.cse0 (+ main_~p~0 (* 2 main_~ielen~0)))) (and (<= .cse0 (+ main_~bufsize_0~0 (* 2 |main_#t~post3|) 2)) (<= .cse0 (+ main_~bufsize_0~0 (* 2 main_~i~0) 2)) (<= 1 main_~p~0) (<= 1 main_~leader_len~0))) [2020-07-10 20:22:53,742 INFO L264 CegarLoopResult]: At program point L38-5(line 38) the Hoare annotation is: (let ((.cse0 (+ main_~p~0 (* 2 main_~ielen~0)))) (and (<= .cse0 (+ main_~bufsize_0~0 (* 2 |main_#t~post3|) 2)) (<= .cse0 (+ main_~bufsize_0~0 (* 2 main_~i~0))) (<= 1 main_~p~0) (<= 1 main_~leader_len~0))) [2020-07-10 20:22:53,742 INFO L264 CegarLoopResult]: At program point L38-6(lines 38 42) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0))) (<= 1 main_~p~0) (<= 1 main_~leader_len~0)) [2020-07-10 20:22:53,743 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 45) the Hoare annotation is: true [2020-07-10 20:22:53,743 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-07-10 20:22:53,743 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-07-10 20:22:53,743 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-10 20:22:53,743 INFO L271 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: true [2020-07-10 20:22:53,743 INFO L271 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: true [2020-07-10 20:22:53,743 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-10 20:22:53,744 INFO L271 CegarLoopResult]: At program point L43(lines 13 45) the Hoare annotation is: true [2020-07-10 20:22:53,744 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0))) (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= 1 main_~p~0) (<= 1 main_~leader_len~0)) [2020-07-10 20:22:53,744 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* 2 main_~i~0))) (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= 1 main_~p~0) (<= 1 main_~leader_len~0)) [2020-07-10 20:22:53,744 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= (+ main_~leader_len~0 main_~bufsize~0 main_~p~0) main_~bufsize_0~0) (<= main_~p~0 0) (<= 1 (+ main_~leader_len~0 main_~p~0))) [2020-07-10 20:22:53,744 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 20:22:53,744 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:22:53,745 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:22:53,745 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:22:53,745 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:22:53,745 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:22:53,750 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:22:53,751 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:22:53,752 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:22:53,753 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-10 20:22:53,753 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-10 20:22:53,766 INFO L163 areAnnotationChecker]: CFG has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:22:53,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:22:53 BoogieIcfgContainer [2020-07-10 20:22:53,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:22:53,783 INFO L168 Benchmark]: Toolchain (without parser) took 5469.99 ms. Allocated memory was 136.3 MB in the beginning and 290.5 MB in the end (delta: 154.1 MB). Free memory was 99.3 MB in the beginning and 174.9 MB in the end (delta: -75.6 MB). Peak memory consumption was 78.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:53,783 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 136.3 MB. Free memory is still 117.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 20:22:53,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.24 ms. Allocated memory is still 136.3 MB. Free memory was 99.3 MB in the beginning and 89.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:53,785 INFO L168 Benchmark]: Boogie Preprocessor took 34.80 ms. Allocated memory is still 136.3 MB. Free memory was 89.2 MB in the beginning and 87.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:53,786 INFO L168 Benchmark]: RCFGBuilder took 628.26 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 87.5 MB in the beginning and 154.0 MB in the end (delta: -66.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:53,787 INFO L168 Benchmark]: TraceAbstraction took 4546.06 ms. Allocated memory was 200.8 MB in the beginning and 290.5 MB in the end (delta: 89.7 MB). Free memory was 153.0 MB in the beginning and 174.9 MB in the end (delta: -21.9 MB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:53,791 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.19 ms. Allocated memory is still 136.3 MB. Free memory is still 117.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 254.24 ms. Allocated memory is still 136.3 MB. Free memory was 99.3 MB in the beginning and 89.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.80 ms. Allocated memory is still 136.3 MB. Free memory was 89.2 MB in the beginning and 87.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 628.26 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 87.5 MB in the beginning and 154.0 MB in the end (delta: -66.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4546.06 ms. Allocated memory was 200.8 MB in the beginning and 290.5 MB in the end (delta: 89.7 MB). Free memory was 153.0 MB in the beginning and 174.9 MB in the end (delta: -21.9 MB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (p + 2 * ielen <= bufsize_0 + 2 * i && 1 <= p) && 1 <= leader_len - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.0s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 136 SDtfs, 57 SDslu, 695 SDs, 0 SdLazy, 279 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 82 PreInvPairs, 109 NumberOfFragments, 311 HoareAnnotationTreeSize, 82 FomulaSimplifications, 187 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 52 FomulaSimplificationsInter, 24 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...