/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:29:04,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:29:04,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:29:04,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:29:04,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:29:04,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:29:04,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:29:04,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:29:04,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:29:04,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:29:04,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:29:04,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:29:04,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:29:04,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:29:04,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:29:04,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:29:04,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:29:04,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:29:04,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:29:04,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:29:04,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:29:04,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:29:04,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:29:04,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:29:04,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:29:04,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:29:04,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:29:04,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:29:04,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:29:04,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:29:04,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:29:04,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:29:04,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:29:04,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:29:04,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:29:04,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:29:04,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:29:04,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:29:04,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:29:04,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:29:04,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:29:04,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:29:04,541 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:29:04,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:29:04,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:29:04,543 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:29:04,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:29:04,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:29:04,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:29:04,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:29:04,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:29:04,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:29:04,544 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:29:04,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:29:04,544 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:29:04,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:29:04,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:29:04,545 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:29:04,545 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:29:04,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:29:04,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:29:04,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:29:04,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:29:04,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:29:04,547 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:29:04,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:29:04,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:29:04,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:29:04,877 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:29:04,877 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:29:04,878 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-11 02:29:04,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca27c41a/8655a4bb51914deb9e8135ad9342650a/FLAGc72632e6a [2020-07-11 02:29:05,409 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:29:05,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i [2020-07-11 02:29:05,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca27c41a/8655a4bb51914deb9e8135ad9342650a/FLAGc72632e6a [2020-07-11 02:29:05,784 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca27c41a/8655a4bb51914deb9e8135ad9342650a [2020-07-11 02:29:05,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:29:05,796 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:29:05,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:29:05,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:29:05,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:29:05,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:29:05" (1/1) ... [2020-07-11 02:29:05,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723da32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:05, skipping insertion in model container [2020-07-11 02:29:05,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:29:05" (1/1) ... [2020-07-11 02:29:05,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:29:05,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:29:06,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:29:06,020 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:29:06,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:29:06,056 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:29:06,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:06 WrapperNode [2020-07-11 02:29:06,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:29:06,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:29:06,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:29:06,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:29:06,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:06" (1/1) ... [2020-07-11 02:29:06,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:06" (1/1) ... [2020-07-11 02:29:06,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:06" (1/1) ... [2020-07-11 02:29:06,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:06" (1/1) ... [2020-07-11 02:29:06,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:06" (1/1) ... [2020-07-11 02:29:06,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:06" (1/1) ... [2020-07-11 02:29:06,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:06" (1/1) ... [2020-07-11 02:29:06,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:29:06,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:29:06,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:29:06,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:29:06,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:06" (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-11 02:29:06,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:29:06,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:29:06,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:29:06,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:29:06,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:29:06,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:29:06,250 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:29:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:29:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:29:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:29:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:29:06,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:29:06,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:29:06,656 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:29:06,657 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 02:29:06,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:29:06 BoogieIcfgContainer [2020-07-11 02:29:06,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:29:06,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:29:06,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:29:06,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:29:06,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:29:05" (1/3) ... [2020-07-11 02:29:06,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7545ab86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:29:06, skipping insertion in model container [2020-07-11 02:29:06,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:06" (2/3) ... [2020-07-11 02:29:06,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7545ab86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:29:06, skipping insertion in model container [2020-07-11 02:29:06,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:29:06" (3/3) ... [2020-07-11 02:29:06,673 INFO L109 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok.i [2020-07-11 02:29:06,685 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:29:06,694 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:29:06,720 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:29:06,748 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:29:06,748 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:29:06,749 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:29:06,749 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:29:06,749 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:29:06,749 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:29:06,749 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:29:06,750 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:29:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-07-11 02:29:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-11 02:29:06,780 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:29:06,781 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-11 02:29:06,781 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:29:06,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:29:06,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1281286412, now seen corresponding path program 1 times [2020-07-11 02:29:06,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:29:06,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2077864807] [2020-07-11 02:29:06,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:29:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:07,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {55#true} assume true; {55#true} is VALID [2020-07-11 02:29:07,133 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {55#true} {55#true} #107#return; {55#true} is VALID [2020-07-11 02:29:07,136 INFO L263 TraceCheckUtils]: 0: Hoare triple {55#true} call ULTIMATE.init(); {55#true} is VALID [2020-07-11 02:29:07,136 INFO L280 TraceCheckUtils]: 1: Hoare triple {55#true} assume true; {55#true} is VALID [2020-07-11 02:29:07,137 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {55#true} {55#true} #107#return; {55#true} is VALID [2020-07-11 02:29:07,137 INFO L263 TraceCheckUtils]: 3: Hoare triple {55#true} call #t~ret4 := main(); {55#true} is VALID [2020-07-11 02:29:07,138 INFO L280 TraceCheckUtils]: 4: Hoare triple {55#true} havoc ~p~0; {55#true} is VALID [2020-07-11 02:29:07,138 INFO L280 TraceCheckUtils]: 5: Hoare triple {55#true} havoc ~i~0; {55#true} is VALID [2020-07-11 02:29:07,138 INFO L280 TraceCheckUtils]: 6: Hoare triple {55#true} havoc ~leader_len~0; {55#true} is VALID [2020-07-11 02:29:07,139 INFO L280 TraceCheckUtils]: 7: Hoare triple {55#true} havoc ~bufsize~0; {55#true} is VALID [2020-07-11 02:29:07,139 INFO L280 TraceCheckUtils]: 8: Hoare triple {55#true} havoc ~bufsize_0~0; {55#true} is VALID [2020-07-11 02:29:07,140 INFO L280 TraceCheckUtils]: 9: Hoare triple {55#true} havoc ~ielen~0; {55#true} is VALID [2020-07-11 02:29:07,140 INFO L280 TraceCheckUtils]: 10: Hoare triple {55#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {55#true} is VALID [2020-07-11 02:29:07,140 INFO L280 TraceCheckUtils]: 11: Hoare triple {55#true} ~leader_len~0 := #t~nondet0; {55#true} is VALID [2020-07-11 02:29:07,141 INFO L280 TraceCheckUtils]: 12: Hoare triple {55#true} havoc #t~nondet0; {55#true} is VALID [2020-07-11 02:29:07,141 INFO L280 TraceCheckUtils]: 13: Hoare triple {55#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {55#true} is VALID [2020-07-11 02:29:07,142 INFO L280 TraceCheckUtils]: 14: Hoare triple {55#true} ~bufsize~0 := #t~nondet1; {55#true} is VALID [2020-07-11 02:29:07,142 INFO L280 TraceCheckUtils]: 15: Hoare triple {55#true} havoc #t~nondet1; {55#true} is VALID [2020-07-11 02:29:07,143 INFO L280 TraceCheckUtils]: 16: Hoare triple {55#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {55#true} is VALID [2020-07-11 02:29:07,143 INFO L280 TraceCheckUtils]: 17: Hoare triple {55#true} ~ielen~0 := #t~nondet2; {55#true} is VALID [2020-07-11 02:29:07,144 INFO L280 TraceCheckUtils]: 18: Hoare triple {55#true} havoc #t~nondet2; {55#true} is VALID [2020-07-11 02:29:07,144 INFO L280 TraceCheckUtils]: 19: Hoare triple {55#true} assume !!(~leader_len~0 < 1000000); {55#true} is VALID [2020-07-11 02:29:07,145 INFO L280 TraceCheckUtils]: 20: Hoare triple {55#true} assume !!(~bufsize~0 < 1000000); {55#true} is VALID [2020-07-11 02:29:07,145 INFO L280 TraceCheckUtils]: 21: Hoare triple {55#true} assume !!(~ielen~0 < 1000000); {55#true} is VALID [2020-07-11 02:29:07,148 INFO L280 TraceCheckUtils]: 22: Hoare triple {55#true} assume ~leader_len~0 > 0; {59#(<= 1 main_~leader_len~0)} is VALID [2020-07-11 02:29:07,151 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-11 02:29:07,154 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-11 02:29:07,155 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-11 02:29:07,157 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-11 02:29:07,158 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-11 02:29:07,159 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-11 02:29:07,161 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-11 02:29:07,163 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-11 02:29:07,164 INFO L280 TraceCheckUtils]: 31: Hoare triple {61#(<= 1 main_~p~0)} ~i~0 := 0; {61#(<= 1 main_~p~0)} is VALID [2020-07-11 02:29:07,165 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-11 02:29:07,167 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-11 02:29:07,169 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-11 02:29:07,170 INFO L280 TraceCheckUtils]: 35: Hoare triple {63#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {56#false} is VALID [2020-07-11 02:29:07,171 INFO L280 TraceCheckUtils]: 36: Hoare triple {56#false} assume !false; {56#false} is VALID [2020-07-11 02:29:07,178 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-11 02:29:07,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2077864807] [2020-07-11 02:29:07,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:29:07,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 02:29:07,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015330055] [2020-07-11 02:29:07,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-11 02:29:07,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:29:07,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:29:07,302 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-11 02:29:07,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:29:07,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:29:07,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:29:07,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:29:07,314 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 7 states. [2020-07-11 02:29:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:07,930 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2020-07-11 02:29:07,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 02:29:07,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-11 02:29:07,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:29:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:29:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2020-07-11 02:29:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:29:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2020-07-11 02:29:07,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 93 transitions. [2020-07-11 02:29:08,072 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-11 02:29:08,087 INFO L225 Difference]: With dead ends: 77 [2020-07-11 02:29:08,087 INFO L226 Difference]: Without dead ends: 49 [2020-07-11 02:29:08,092 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-11 02:29:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-11 02:29:08,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-11 02:29:08,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:29:08,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-11 02:29:08,214 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-11 02:29:08,214 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-11 02:29:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:08,229 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2020-07-11 02:29:08,229 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2020-07-11 02:29:08,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:08,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:08,234 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-11 02:29:08,234 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-11 02:29:08,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:08,244 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2020-07-11 02:29:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2020-07-11 02:29:08,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:08,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:08,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:29:08,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:29:08,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-11 02:29:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2020-07-11 02:29:08,255 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 37 [2020-07-11 02:29:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:29:08,256 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2020-07-11 02:29:08,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:29:08,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2020-07-11 02:29:08,320 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-11 02:29:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2020-07-11 02:29:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-11 02:29:08,323 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:29:08,324 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-11 02:29:08,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:29:08,325 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:29:08,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:29:08,327 INFO L82 PathProgramCache]: Analyzing trace with hash -594029260, now seen corresponding path program 1 times [2020-07-11 02:29:08,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:29:08,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [227226686] [2020-07-11 02:29:08,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:29:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:08,506 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-11 02:29:08,506 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {422#true} {422#true} #107#return; {422#true} is VALID [2020-07-11 02:29:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:08,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~cond := #in~cond; {422#true} is VALID [2020-07-11 02:29:08,517 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume !(0 == ~cond); {422#true} is VALID [2020-07-11 02:29:08,517 INFO L280 TraceCheckUtils]: 2: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-11 02:29:08,519 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-11 02:29:08,519 INFO L263 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2020-07-11 02:29:08,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-11 02:29:08,520 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #107#return; {422#true} is VALID [2020-07-11 02:29:08,520 INFO L263 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret4 := main(); {422#true} is VALID [2020-07-11 02:29:08,521 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} havoc ~p~0; {422#true} is VALID [2020-07-11 02:29:08,521 INFO L280 TraceCheckUtils]: 5: Hoare triple {422#true} havoc ~i~0; {422#true} is VALID [2020-07-11 02:29:08,521 INFO L280 TraceCheckUtils]: 6: Hoare triple {422#true} havoc ~leader_len~0; {422#true} is VALID [2020-07-11 02:29:08,522 INFO L280 TraceCheckUtils]: 7: Hoare triple {422#true} havoc ~bufsize~0; {422#true} is VALID [2020-07-11 02:29:08,522 INFO L280 TraceCheckUtils]: 8: Hoare triple {422#true} havoc ~bufsize_0~0; {422#true} is VALID [2020-07-11 02:29:08,522 INFO L280 TraceCheckUtils]: 9: Hoare triple {422#true} havoc ~ielen~0; {422#true} is VALID [2020-07-11 02:29:08,523 INFO L280 TraceCheckUtils]: 10: Hoare triple {422#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {422#true} is VALID [2020-07-11 02:29:08,523 INFO L280 TraceCheckUtils]: 11: Hoare triple {422#true} ~leader_len~0 := #t~nondet0; {422#true} is VALID [2020-07-11 02:29:08,523 INFO L280 TraceCheckUtils]: 12: Hoare triple {422#true} havoc #t~nondet0; {422#true} is VALID [2020-07-11 02:29:08,524 INFO L280 TraceCheckUtils]: 13: Hoare triple {422#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {422#true} is VALID [2020-07-11 02:29:08,524 INFO L280 TraceCheckUtils]: 14: Hoare triple {422#true} ~bufsize~0 := #t~nondet1; {422#true} is VALID [2020-07-11 02:29:08,524 INFO L280 TraceCheckUtils]: 15: Hoare triple {422#true} havoc #t~nondet1; {422#true} is VALID [2020-07-11 02:29:08,525 INFO L280 TraceCheckUtils]: 16: Hoare triple {422#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {422#true} is VALID [2020-07-11 02:29:08,525 INFO L280 TraceCheckUtils]: 17: Hoare triple {422#true} ~ielen~0 := #t~nondet2; {422#true} is VALID [2020-07-11 02:29:08,525 INFO L280 TraceCheckUtils]: 18: Hoare triple {422#true} havoc #t~nondet2; {422#true} is VALID [2020-07-11 02:29:08,526 INFO L280 TraceCheckUtils]: 19: Hoare triple {422#true} assume !!(~leader_len~0 < 1000000); {422#true} is VALID [2020-07-11 02:29:08,526 INFO L280 TraceCheckUtils]: 20: Hoare triple {422#true} assume !!(~bufsize~0 < 1000000); {422#true} is VALID [2020-07-11 02:29:08,526 INFO L280 TraceCheckUtils]: 21: Hoare triple {422#true} assume !!(~ielen~0 < 1000000); {422#true} is VALID [2020-07-11 02:29:08,527 INFO L280 TraceCheckUtils]: 22: Hoare triple {422#true} assume ~leader_len~0 > 0; {422#true} is VALID [2020-07-11 02:29:08,527 INFO L280 TraceCheckUtils]: 23: Hoare triple {422#true} assume ~bufsize~0 > 0; {422#true} is VALID [2020-07-11 02:29:08,528 INFO L280 TraceCheckUtils]: 24: Hoare triple {422#true} assume ~ielen~0 > 0; {422#true} is VALID [2020-07-11 02:29:08,528 INFO L280 TraceCheckUtils]: 25: Hoare triple {422#true} assume !(~bufsize~0 < ~leader_len~0); {422#true} is VALID [2020-07-11 02:29:08,529 INFO L280 TraceCheckUtils]: 26: Hoare triple {422#true} ~p~0 := 0; {426#(<= main_~p~0 0)} is VALID [2020-07-11 02:29:08,530 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-11 02:29:08,532 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-11 02:29:08,533 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-11 02:29:08,534 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-11 02:29:08,535 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-11 02:29:08,536 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-11 02:29:08,537 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-11 02:29:08,537 INFO L280 TraceCheckUtils]: 34: Hoare triple {422#true} ~cond := #in~cond; {422#true} is VALID [2020-07-11 02:29:08,537 INFO L280 TraceCheckUtils]: 35: Hoare triple {422#true} assume !(0 == ~cond); {422#true} is VALID [2020-07-11 02:29:08,538 INFO L280 TraceCheckUtils]: 36: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-11 02:29:08,539 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-11 02:29:08,541 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-11 02:29:08,542 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-11 02:29:08,543 INFO L280 TraceCheckUtils]: 40: Hoare triple {435#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {423#false} is VALID [2020-07-11 02:29:08,543 INFO L280 TraceCheckUtils]: 41: Hoare triple {423#false} assume !false; {423#false} is VALID [2020-07-11 02:29:08,547 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-11 02:29:08,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [227226686] [2020-07-11 02:29:08,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:29:08,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 02:29:08,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297917030] [2020-07-11 02:29:08,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-07-11 02:29:08,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:29:08,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 02:29:08,603 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-11 02:29:08,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 02:29:08,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:29:08,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 02:29:08,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:29:08,605 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 8 states. [2020-07-11 02:29:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:09,102 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-11 02:29:09,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 02:29:09,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-07-11 02:29:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:29:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:29:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2020-07-11 02:29:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:29:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2020-07-11 02:29:09,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 57 transitions. [2020-07-11 02:29:09,195 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-11 02:29:09,198 INFO L225 Difference]: With dead ends: 59 [2020-07-11 02:29:09,199 INFO L226 Difference]: Without dead ends: 57 [2020-07-11 02:29:09,200 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-11 02:29:09,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-11 02:29:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2020-07-11 02:29:09,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:29:09,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2020-07-11 02:29:09,257 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2020-07-11 02:29:09,257 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2020-07-11 02:29:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:09,263 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-07-11 02:29:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-07-11 02:29:09,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:09,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:09,264 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2020-07-11 02:29:09,264 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2020-07-11 02:29:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:09,268 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-07-11 02:29:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-07-11 02:29:09,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:09,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:09,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:29:09,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:29:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-11 02:29:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2020-07-11 02:29:09,273 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 42 [2020-07-11 02:29:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:29:09,274 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2020-07-11 02:29:09,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 02:29:09,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 57 transitions. [2020-07-11 02:29:09,332 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-11 02:29:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2020-07-11 02:29:09,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-11 02:29:09,334 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:29:09,335 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-11 02:29:09,335 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:29:09,335 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:29:09,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:29:09,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1318797830, now seen corresponding path program 1 times [2020-07-11 02:29:09,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:29:09,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1759520592] [2020-07-11 02:29:09,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:29:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:09,597 INFO L280 TraceCheckUtils]: 0: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-11 02:29:09,598 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {790#true} {790#true} #107#return; {790#true} is VALID [2020-07-11 02:29:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:09,615 INFO L280 TraceCheckUtils]: 0: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2020-07-11 02:29:09,615 INFO L280 TraceCheckUtils]: 1: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2020-07-11 02:29:09,615 INFO L280 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-11 02:29:09,616 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-11 02:29:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:09,636 INFO L280 TraceCheckUtils]: 0: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2020-07-11 02:29:09,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2020-07-11 02:29:09,636 INFO L280 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-11 02:29:09,638 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-11 02:29:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:09,658 INFO L280 TraceCheckUtils]: 0: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2020-07-11 02:29:09,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2020-07-11 02:29:09,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-11 02:29:09,660 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-11 02:29:09,661 INFO L263 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2020-07-11 02:29:09,662 INFO L280 TraceCheckUtils]: 1: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-11 02:29:09,662 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {790#true} {790#true} #107#return; {790#true} is VALID [2020-07-11 02:29:09,662 INFO L263 TraceCheckUtils]: 3: Hoare triple {790#true} call #t~ret4 := main(); {790#true} is VALID [2020-07-11 02:29:09,662 INFO L280 TraceCheckUtils]: 4: Hoare triple {790#true} havoc ~p~0; {790#true} is VALID [2020-07-11 02:29:09,663 INFO L280 TraceCheckUtils]: 5: Hoare triple {790#true} havoc ~i~0; {790#true} is VALID [2020-07-11 02:29:09,663 INFO L280 TraceCheckUtils]: 6: Hoare triple {790#true} havoc ~leader_len~0; {790#true} is VALID [2020-07-11 02:29:09,663 INFO L280 TraceCheckUtils]: 7: Hoare triple {790#true} havoc ~bufsize~0; {790#true} is VALID [2020-07-11 02:29:09,663 INFO L280 TraceCheckUtils]: 8: Hoare triple {790#true} havoc ~bufsize_0~0; {790#true} is VALID [2020-07-11 02:29:09,664 INFO L280 TraceCheckUtils]: 9: Hoare triple {790#true} havoc ~ielen~0; {790#true} is VALID [2020-07-11 02:29:09,664 INFO L280 TraceCheckUtils]: 10: Hoare triple {790#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {790#true} is VALID [2020-07-11 02:29:09,669 INFO L280 TraceCheckUtils]: 11: Hoare triple {790#true} ~leader_len~0 := #t~nondet0; {790#true} is VALID [2020-07-11 02:29:09,670 INFO L280 TraceCheckUtils]: 12: Hoare triple {790#true} havoc #t~nondet0; {790#true} is VALID [2020-07-11 02:29:09,670 INFO L280 TraceCheckUtils]: 13: Hoare triple {790#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {790#true} is VALID [2020-07-11 02:29:09,670 INFO L280 TraceCheckUtils]: 14: Hoare triple {790#true} ~bufsize~0 := #t~nondet1; {790#true} is VALID [2020-07-11 02:29:09,670 INFO L280 TraceCheckUtils]: 15: Hoare triple {790#true} havoc #t~nondet1; {790#true} is VALID [2020-07-11 02:29:09,671 INFO L280 TraceCheckUtils]: 16: Hoare triple {790#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {790#true} is VALID [2020-07-11 02:29:09,671 INFO L280 TraceCheckUtils]: 17: Hoare triple {790#true} ~ielen~0 := #t~nondet2; {790#true} is VALID [2020-07-11 02:29:09,671 INFO L280 TraceCheckUtils]: 18: Hoare triple {790#true} havoc #t~nondet2; {790#true} is VALID [2020-07-11 02:29:09,671 INFO L280 TraceCheckUtils]: 19: Hoare triple {790#true} assume !!(~leader_len~0 < 1000000); {790#true} is VALID [2020-07-11 02:29:09,672 INFO L280 TraceCheckUtils]: 20: Hoare triple {790#true} assume !!(~bufsize~0 < 1000000); {790#true} is VALID [2020-07-11 02:29:09,672 INFO L280 TraceCheckUtils]: 21: Hoare triple {790#true} assume !!(~ielen~0 < 1000000); {790#true} is VALID [2020-07-11 02:29:09,675 INFO L280 TraceCheckUtils]: 22: Hoare triple {790#true} assume ~leader_len~0 > 0; {790#true} is VALID [2020-07-11 02:29:09,676 INFO L280 TraceCheckUtils]: 23: Hoare triple {790#true} assume ~bufsize~0 > 0; {790#true} is VALID [2020-07-11 02:29:09,676 INFO L280 TraceCheckUtils]: 24: Hoare triple {790#true} assume ~ielen~0 > 0; {790#true} is VALID [2020-07-11 02:29:09,676 INFO L280 TraceCheckUtils]: 25: Hoare triple {790#true} assume !(~bufsize~0 < ~leader_len~0); {790#true} is VALID [2020-07-11 02:29:09,689 INFO L280 TraceCheckUtils]: 26: Hoare triple {790#true} ~p~0 := 0; {794#(<= main_~p~0 0)} is VALID [2020-07-11 02:29:09,690 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-11 02:29:09,691 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-11 02:29:09,693 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-11 02:29:09,694 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-11 02:29:09,695 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-11 02:29:09,695 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-11 02:29:09,696 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-11 02:29:09,696 INFO L280 TraceCheckUtils]: 34: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2020-07-11 02:29:09,696 INFO L280 TraceCheckUtils]: 35: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2020-07-11 02:29:09,696 INFO L280 TraceCheckUtils]: 36: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-11 02:29:09,697 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-11 02:29:09,698 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-11 02:29:09,698 INFO L280 TraceCheckUtils]: 39: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2020-07-11 02:29:09,698 INFO L280 TraceCheckUtils]: 40: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2020-07-11 02:29:09,698 INFO L280 TraceCheckUtils]: 41: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-11 02:29:09,699 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-11 02:29:09,701 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-11 02:29:09,702 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-11 02:29:09,703 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-11 02:29:09,703 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-11 02:29:09,704 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-11 02:29:09,705 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-11 02:29:09,705 INFO L280 TraceCheckUtils]: 49: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2020-07-11 02:29:09,705 INFO L280 TraceCheckUtils]: 50: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2020-07-11 02:29:09,705 INFO L280 TraceCheckUtils]: 51: Hoare triple {790#true} assume true; {790#true} is VALID [2020-07-11 02:29:09,706 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-11 02:29:09,707 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-11 02:29:09,708 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-11 02:29:09,709 INFO L280 TraceCheckUtils]: 55: Hoare triple {815#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {791#false} is VALID [2020-07-11 02:29:09,709 INFO L280 TraceCheckUtils]: 56: Hoare triple {791#false} assume !false; {791#false} is VALID [2020-07-11 02:29:09,714 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-11 02:29:09,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1759520592] [2020-07-11 02:29:09,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:29:09,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-11 02:29:09,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506813674] [2020-07-11 02:29:09,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2020-07-11 02:29:09,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:29:09,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 02:29:09,770 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-11 02:29:09,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 02:29:09,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:29:09,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 02:29:09,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-07-11 02:29:09,772 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 12 states. [2020-07-11 02:29:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:10,679 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-07-11 02:29:10,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-11 02:29:10,680 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2020-07-11 02:29:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:29:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:29:10,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 55 transitions. [2020-07-11 02:29:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:29:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 55 transitions. [2020-07-11 02:29:10,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 55 transitions. [2020-07-11 02:29:10,750 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-11 02:29:10,751 INFO L225 Difference]: With dead ends: 57 [2020-07-11 02:29:10,751 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:29:10,752 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-11 02:29:10,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:29:10,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:29:10,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:29:10,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:29:10,753 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:29:10,753 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:29:10,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:10,754 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:29:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:29:10,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:10,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:10,754 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:29:10,755 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:29:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:10,755 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:29:10,755 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:29:10,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:10,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:10,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:29:10,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:29:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:29:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:29:10,756 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2020-07-11 02:29:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:29:10,757 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:29:10,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 02:29:10,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:29:10,757 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-11 02:29:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:29:10,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:10,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:29:10,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:29:11,196 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:29:11,196 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:29:11,196 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:29:11,196 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:29:11,196 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:29:11,196 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:29:11,196 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:29:11,197 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:29:11,197 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-11 02:29:11,197 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-11 02:29:11,197 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:29:11,197 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-11 02:29:11,197 INFO L264 CegarLoopResult]: At program point L27-1(lines 14 45) the Hoare annotation is: (<= 1 main_~leader_len~0) [2020-07-11 02:29:11,197 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 45) the Hoare annotation is: true [2020-07-11 02:29:11,197 INFO L271 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-07-11 02:29:11,197 INFO L271 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-07-11 02:29:11,198 INFO L271 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: true [2020-07-11 02:29:11,198 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-11 02:29:11,198 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-11 02:29:11,198 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-11 02:29:11,198 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (<= 1 main_~leader_len~0) [2020-07-11 02:29:11,198 INFO L264 CegarLoopResult]: At program point L28(lines 14 45) the Hoare annotation is: (<= 1 main_~leader_len~0) [2020-07-11 02:29:11,198 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-11 02:29:11,198 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (<= 1 main_~leader_len~0) [2020-07-11 02:29:11,198 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-11 02:29:11,199 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-11 02:29:11,199 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-11 02:29:11,199 INFO L264 CegarLoopResult]: At program point L29(lines 14 45) the Hoare annotation is: (<= 1 main_~leader_len~0) [2020-07-11 02:29:11,199 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-11 02:29:11,199 INFO L271 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-07-11 02:29:11,199 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-11 02:29:11,200 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-11 02:29:11,200 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-11 02:29:11,200 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-11 02:29:11,200 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-11 02:29:11,200 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-11 02:29:11,200 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-11 02:29:11,201 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-11 02:29:11,201 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-11 02:29:11,201 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-11 02:29:11,201 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 45) the Hoare annotation is: true [2020-07-11 02:29:11,201 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-07-11 02:29:11,201 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-07-11 02:29:11,201 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-11 02:29:11,202 INFO L271 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: true [2020-07-11 02:29:11,202 INFO L271 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: true [2020-07-11 02:29:11,202 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-11 02:29:11,202 INFO L271 CegarLoopResult]: At program point L43(lines 13 45) the Hoare annotation is: true [2020-07-11 02:29:11,202 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-11 02:29:11,202 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-11 02:29:11,202 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-11 02:29:11,202 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-11 02:29:11,203 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-11 02:29:11,203 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:29:11,203 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-11 02:29:11,203 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-11 02:29:11,203 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:29:11,208 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:29:11,209 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:29:11,210 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:29:11,211 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-11 02:29:11,211 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-11 02:29:11,226 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-11 02:29:11,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:29:11 BoogieIcfgContainer [2020-07-11 02:29:11,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:29:11,244 INFO L168 Benchmark]: Toolchain (without parser) took 5447.22 ms. Allocated memory was 138.9 MB in the beginning and 274.2 MB in the end (delta: 135.3 MB). Free memory was 103.6 MB in the beginning and 130.3 MB in the end (delta: -26.8 MB). Peak memory consumption was 108.5 MB. Max. memory is 7.1 GB. [2020-07-11 02:29:11,245 INFO L168 Benchmark]: CDTParser took 0.91 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 02:29:11,246 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.66 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 93.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:29:11,247 INFO L168 Benchmark]: Boogie Preprocessor took 37.19 ms. Allocated memory is still 138.9 MB. Free memory was 93.2 MB in the beginning and 91.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:29:11,248 INFO L168 Benchmark]: RCFGBuilder took 567.02 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 91.7 MB in the beginning and 156.4 MB in the end (delta: -64.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-11 02:29:11,249 INFO L168 Benchmark]: TraceAbstraction took 4575.92 ms. Allocated memory was 202.9 MB in the beginning and 274.2 MB in the end (delta: 71.3 MB). Free memory was 155.7 MB in the beginning and 130.3 MB in the end (delta: 25.4 MB). Peak memory consumption was 96.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:29:11,252 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.91 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 260.66 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 93.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 37.19 ms. Allocated memory is still 138.9 MB. Free memory was 93.2 MB in the beginning and 91.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 567.02 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 91.7 MB in the beginning and 156.4 MB in the end (delta: -64.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4575.92 ms. Allocated memory was 202.9 MB in the beginning and 274.2 MB in the end (delta: 71.3 MB). Free memory was 155.7 MB in the beginning and 130.3 MB in the end (delta: 25.4 MB). Peak memory consumption was 96.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 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.3s, 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.5s 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.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 15406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 21/23 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...