./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 29969c1b5a197d33024eb68a6c5fbf980597fe76 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:15:10,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:15:10,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:15:10,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:15:10,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:15:10,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:15:10,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:15:10,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:15:10,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:15:10,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:15:10,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:15:10,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:15:10,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:15:10,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:15:10,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:15:10,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:15:10,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:15:10,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:15:10,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:15:10,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:15:10,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:15:10,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:15:10,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:15:10,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:15:10,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:15:10,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:15:10,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:15:10,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:15:10,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:15:10,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:15:10,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:15:10,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:15:10,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:15:10,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:15:10,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:15:10,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:15:10,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:15:10,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:15:10,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:15:10,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:15:10,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:15:10,367 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:15:10,382 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:15:10,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:15:10,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:15:10,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:15:10,385 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:15:10,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:15:10,386 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:15:10,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:15:10,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:15:10,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:15:10,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:15:10,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:15:10,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:15:10,388 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:15:10,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:15:10,388 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:15:10,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:15:10,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:15:10,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:15:10,389 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:15:10,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:15:10,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:15:10,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:15:10,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:15:10,391 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:15:10,391 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:15:10,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:15:10,392 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:15:10,392 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:15:10,392 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 29969c1b5a197d33024eb68a6c5fbf980597fe76 [2020-07-28 18:15:10,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:15:10,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:15:10,724 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:15:10,726 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:15:10,727 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:15:10,728 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2020-07-28 18:15:10,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dfce4ba2/5e54e561e13c40ea9ba5845dfab23f53/FLAGd6144f988 [2020-07-28 18:15:11,229 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:15:11,230 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2020-07-28 18:15:11,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dfce4ba2/5e54e561e13c40ea9ba5845dfab23f53/FLAGd6144f988 [2020-07-28 18:15:11,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dfce4ba2/5e54e561e13c40ea9ba5845dfab23f53 [2020-07-28 18:15:11,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:15:11,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:15:11,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:15:11,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:15:11,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:15:11,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:15:11" (1/1) ... [2020-07-28 18:15:11,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac37d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:11, skipping insertion in model container [2020-07-28 18:15:11,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:15:11" (1/1) ... [2020-07-28 18:15:11,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:15:11,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:15:11,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:15:11,871 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:15:11,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:15:11,910 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:15:11,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:11 WrapperNode [2020-07-28 18:15:11,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:15:11,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:15:11,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:15:11,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:15:11,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:11" (1/1) ... [2020-07-28 18:15:11,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:11" (1/1) ... [2020-07-28 18:15:12,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:15:12,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:15:12,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:15:12,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:15:12,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:11" (1/1) ... [2020-07-28 18:15:12,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:11" (1/1) ... [2020-07-28 18:15:12,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:11" (1/1) ... [2020-07-28 18:15:12,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:11" (1/1) ... [2020-07-28 18:15:12,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:11" (1/1) ... [2020-07-28 18:15:12,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:11" (1/1) ... [2020-07-28 18:15:12,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:11" (1/1) ... [2020-07-28 18:15:12,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:15:12,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:15:12,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:15:12,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:15:12,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:11" (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-28 18:15:12,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:15:12,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:15:12,936 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:15:12,938 INFO L295 CfgBuilder]: Removed 38 assume(true) statements. [2020-07-28 18:15:12,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:15:12 BoogieIcfgContainer [2020-07-28 18:15:12,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:15:12,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:15:12,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:15:12,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:15:12,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:15:11" (1/3) ... [2020-07-28 18:15:12,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cba4b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:15:12, skipping insertion in model container [2020-07-28 18:15:12,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:11" (2/3) ... [2020-07-28 18:15:12,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cba4b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:15:12, skipping insertion in model container [2020-07-28 18:15:12,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:15:12" (3/3) ... [2020-07-28 18:15:12,956 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2020-07-28 18:15:12,967 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:15:12,978 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-07-28 18:15:12,992 INFO L251 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-07-28 18:15:13,024 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:15:13,024 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:15:13,024 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:15:13,025 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:15:13,025 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:15:13,026 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:15:13,026 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:15:13,027 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:15:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2020-07-28 18:15:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 18:15:13,067 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:13,068 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:15:13,074 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:13,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:13,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1479268755, now seen corresponding path program 1 times [2020-07-28 18:15:13,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:13,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786272462] [2020-07-28 18:15:13,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:13,285 INFO L280 TraceCheckUtils]: 0: Hoare triple {78#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0;havoc main_~len~0;havoc main_~i~0;havoc main_~j~0;havoc main_~bufsize~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~bufsize~0 := main_#t~nondet0;havoc main_#t~nondet0; {78#true} is VALID [2020-07-28 18:15:13,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#true} assume !(main_~bufsize~0 < 0);assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~len~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~limit~0 := main_~bufsize~0 - 4;main_~i~0 := 0; {78#true} is VALID [2020-07-28 18:15:13,286 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} assume !!(main_~i~0 < main_~len~0);main_~j~0 := 0; {78#true} is VALID [2020-07-28 18:15:13,286 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} assume !!(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); {78#true} is VALID [2020-07-28 18:15:13,288 INFO L280 TraceCheckUtils]: 4: Hoare triple {78#true} assume 1 + main_~i~0 < main_~len~0;__VERIFIER_assert_#in~cond := (if 1 + main_~i~0 < main_~len~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {80#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:13,289 INFO L280 TraceCheckUtils]: 5: Hoare triple {80#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {79#false} is VALID [2020-07-28 18:15:13,289 INFO L280 TraceCheckUtils]: 6: Hoare triple {79#false} assume !false; {79#false} is VALID [2020-07-28 18:15:13,292 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-28 18:15:13,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786272462] [2020-07-28 18:15:13,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:13,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:15:13,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347860230] [2020-07-28 18:15:13,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-28 18:15:13,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:13,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:15:13,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:13,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:15:13,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:13,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:15:13,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:15:13,335 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2020-07-28 18:15:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:13,692 INFO L93 Difference]: Finished difference Result 154 states and 201 transitions. [2020-07-28 18:15:13,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:15:13,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-28 18:15:13,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:15:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2020-07-28 18:15:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:15:13,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2020-07-28 18:15:13,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 201 transitions. [2020-07-28 18:15:13,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:14,005 INFO L225 Difference]: With dead ends: 154 [2020-07-28 18:15:14,006 INFO L226 Difference]: Without dead ends: 73 [2020-07-28 18:15:14,010 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:15:14,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-28 18:15:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2020-07-28 18:15:14,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:14,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 69 states. [2020-07-28 18:15:14,076 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 69 states. [2020-07-28 18:15:14,076 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 69 states. [2020-07-28 18:15:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:14,084 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2020-07-28 18:15:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2020-07-28 18:15:14,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:14,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:14,086 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 73 states. [2020-07-28 18:15:14,086 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 73 states. [2020-07-28 18:15:14,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:14,092 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2020-07-28 18:15:14,092 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2020-07-28 18:15:14,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:14,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:14,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:14,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-28 18:15:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2020-07-28 18:15:14,101 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 7 [2020-07-28 18:15:14,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:14,102 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2020-07-28 18:15:14,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:15:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-07-28 18:15:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 18:15:14,103 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:14,103 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:15:14,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:15:14,104 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:14,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:14,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1391586898, now seen corresponding path program 1 times [2020-07-28 18:15:14,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:14,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713876851] [2020-07-28 18:15:14,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:14,190 INFO L280 TraceCheckUtils]: 0: Hoare triple {515#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0;havoc main_~len~0;havoc main_~i~0;havoc main_~j~0;havoc main_~bufsize~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~bufsize~0 := main_#t~nondet0;havoc main_#t~nondet0; {515#true} is VALID [2020-07-28 18:15:14,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {515#true} assume !(main_~bufsize~0 < 0);assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~len~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~limit~0 := main_~bufsize~0 - 4;main_~i~0 := 0; {515#true} is VALID [2020-07-28 18:15:14,193 INFO L280 TraceCheckUtils]: 2: Hoare triple {515#true} assume !!(main_~i~0 < main_~len~0);main_~j~0 := 0; {517#(<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:14,194 INFO L280 TraceCheckUtils]: 3: Hoare triple {517#(<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0)} assume !!(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); {517#(<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:14,195 INFO L280 TraceCheckUtils]: 4: Hoare triple {517#(<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0)} assume !(1 + main_~i~0 < main_~len~0); {517#(<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:14,197 INFO L280 TraceCheckUtils]: 5: Hoare triple {517#(<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0)} __VERIFIER_assert_#in~cond := (if main_~i~0 < main_~len~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {518#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:14,198 INFO L280 TraceCheckUtils]: 6: Hoare triple {518#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {516#false} is VALID [2020-07-28 18:15:14,198 INFO L280 TraceCheckUtils]: 7: Hoare triple {516#false} assume !false; {516#false} is VALID [2020-07-28 18:15:14,199 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-28 18:15:14,200 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713876851] [2020-07-28 18:15:14,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:14,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 18:15:14,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133760466] [2020-07-28 18:15:14,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-28 18:15:14,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:14,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:15:14,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:14,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:15:14,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:14,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:15:14,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:15:14,218 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 4 states. [2020-07-28 18:15:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:14,578 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2020-07-28 18:15:14,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:15:14,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-28 18:15:14,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:15:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2020-07-28 18:15:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:15:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2020-07-28 18:15:14,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2020-07-28 18:15:14,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:14,715 INFO L225 Difference]: With dead ends: 76 [2020-07-28 18:15:14,715 INFO L226 Difference]: Without dead ends: 72 [2020-07-28 18:15:14,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:15:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-28 18:15:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2020-07-28 18:15:14,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:14,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 65 states. [2020-07-28 18:15:14,761 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 65 states. [2020-07-28 18:15:14,761 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 65 states. [2020-07-28 18:15:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:14,766 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2020-07-28 18:15:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2020-07-28 18:15:14,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:14,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:14,768 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 72 states. [2020-07-28 18:15:14,769 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 72 states. [2020-07-28 18:15:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:14,773 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2020-07-28 18:15:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2020-07-28 18:15:14,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:14,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:14,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:14,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-28 18:15:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2020-07-28 18:15:14,779 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 8 [2020-07-28 18:15:14,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:14,780 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2020-07-28 18:15:14,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:15:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-28 18:15:14,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 18:15:14,781 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:14,781 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:15:14,782 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:15:14,782 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:14,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:14,783 INFO L82 PathProgramCache]: Analyzing trace with hash 57057392, now seen corresponding path program 1 times [2020-07-28 18:15:14,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:14,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617699942] [2020-07-28 18:15:14,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:14,865 INFO L280 TraceCheckUtils]: 0: Hoare triple {852#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0;havoc main_~len~0;havoc main_~i~0;havoc main_~j~0;havoc main_~bufsize~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~bufsize~0 := main_#t~nondet0;havoc main_#t~nondet0; {852#true} is VALID [2020-07-28 18:15:14,867 INFO L280 TraceCheckUtils]: 1: Hoare triple {852#true} assume !(main_~bufsize~0 < 0);assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~len~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~limit~0 := main_~bufsize~0 - 4;main_~i~0 := 0; {854#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:15:14,867 INFO L280 TraceCheckUtils]: 2: Hoare triple {854#(<= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < main_~len~0);main_~j~0 := 0; {854#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:15:14,868 INFO L280 TraceCheckUtils]: 3: Hoare triple {854#(<= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); {854#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:15:14,869 INFO L280 TraceCheckUtils]: 4: Hoare triple {854#(<= 0 ULTIMATE.start_main_~i~0)} assume 1 + main_~i~0 < main_~len~0;__VERIFIER_assert_#in~cond := (if 1 + main_~i~0 < main_~len~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {854#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:15:14,869 INFO L280 TraceCheckUtils]: 5: Hoare triple {854#(<= 0 ULTIMATE.start_main_~i~0)} assume !(0 == __VERIFIER_assert_~cond); {854#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:15:14,871 INFO L280 TraceCheckUtils]: 6: Hoare triple {854#(<= 0 ULTIMATE.start_main_~i~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {855#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:14,877 INFO L280 TraceCheckUtils]: 7: Hoare triple {855#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {853#false} is VALID [2020-07-28 18:15:14,877 INFO L280 TraceCheckUtils]: 8: Hoare triple {853#false} assume !false; {853#false} is VALID [2020-07-28 18:15:14,878 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-28 18:15:14,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617699942] [2020-07-28 18:15:14,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:14,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 18:15:14,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089760342] [2020-07-28 18:15:14,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-28 18:15:14,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:14,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:15:14,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:14,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:15:14,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:14,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:15:14,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:15:14,896 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 4 states. [2020-07-28 18:15:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:15,245 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2020-07-28 18:15:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:15:15,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-28 18:15:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:15:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2020-07-28 18:15:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:15:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2020-07-28 18:15:15,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 74 transitions. [2020-07-28 18:15:15,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:15,336 INFO L225 Difference]: With dead ends: 69 [2020-07-28 18:15:15,337 INFO L226 Difference]: Without dead ends: 61 [2020-07-28 18:15:15,337 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:15:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-28 18:15:15,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2020-07-28 18:15:15,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:15,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 57 states. [2020-07-28 18:15:15,410 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 57 states. [2020-07-28 18:15:15,410 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 57 states. [2020-07-28 18:15:15,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:15,413 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2020-07-28 18:15:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2020-07-28 18:15:15,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:15,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:15,414 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 61 states. [2020-07-28 18:15:15,415 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 61 states. [2020-07-28 18:15:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:15,417 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2020-07-28 18:15:15,418 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2020-07-28 18:15:15,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:15,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:15,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:15,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-28 18:15:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2020-07-28 18:15:15,421 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 9 [2020-07-28 18:15:15,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:15,422 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2020-07-28 18:15:15,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:15:15,422 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2020-07-28 18:15:15,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 18:15:15,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:15,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:15:15,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 18:15:15,423 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:15,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:15,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1711132744, now seen corresponding path program 1 times [2020-07-28 18:15:15,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:15,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058137027] [2020-07-28 18:15:15,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:15,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {1149#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0;havoc main_~len~0;havoc main_~i~0;havoc main_~j~0;havoc main_~bufsize~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~bufsize~0 := main_#t~nondet0;havoc main_#t~nondet0; {1149#true} is VALID [2020-07-28 18:15:15,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {1149#true} assume !(main_~bufsize~0 < 0);assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~len~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~limit~0 := main_~bufsize~0 - 4;main_~i~0 := 0; {1151#(<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:15,502 INFO L280 TraceCheckUtils]: 2: Hoare triple {1151#(<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)} assume !!(main_~i~0 < main_~len~0);main_~j~0 := 0; {1151#(<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:15,503 INFO L280 TraceCheckUtils]: 3: Hoare triple {1151#(<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)} assume !!(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); {1152#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:15,504 INFO L280 TraceCheckUtils]: 4: Hoare triple {1152#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} assume !(1 + main_~i~0 < main_~len~0); {1152#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:15,504 INFO L280 TraceCheckUtils]: 5: Hoare triple {1152#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} __VERIFIER_assert_#in~cond := (if main_~i~0 < main_~len~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1152#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:15,505 INFO L280 TraceCheckUtils]: 6: Hoare triple {1152#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} assume !(0 == __VERIFIER_assert_~cond); {1152#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:15,506 INFO L280 TraceCheckUtils]: 7: Hoare triple {1152#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1152#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:15,507 INFO L280 TraceCheckUtils]: 8: Hoare triple {1152#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} assume !(0 == __VERIFIER_assert_~cond); {1152#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:15,508 INFO L280 TraceCheckUtils]: 9: Hoare triple {1152#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} __VERIFIER_assert_#in~cond := (if main_~j~0 < main_~bufsize~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1153#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:15,509 INFO L280 TraceCheckUtils]: 10: Hoare triple {1153#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {1150#false} is VALID [2020-07-28 18:15:15,509 INFO L280 TraceCheckUtils]: 11: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2020-07-28 18:15:15,513 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-28 18:15:15,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058137027] [2020-07-28 18:15:15,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:15,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 18:15:15,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390635246] [2020-07-28 18:15:15,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-28 18:15:15,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:15,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:15:15,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:15,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:15:15,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:15,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:15:15,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:15:15,545 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 5 states. [2020-07-28 18:15:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:16,005 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2020-07-28 18:15:16,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 18:15:16,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-28 18:15:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:15:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2020-07-28 18:15:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:15:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2020-07-28 18:15:16,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2020-07-28 18:15:16,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:16,106 INFO L225 Difference]: With dead ends: 61 [2020-07-28 18:15:16,107 INFO L226 Difference]: Without dead ends: 57 [2020-07-28 18:15:16,107 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:15:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-28 18:15:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2020-07-28 18:15:16,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:16,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 53 states. [2020-07-28 18:15:16,172 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 53 states. [2020-07-28 18:15:16,172 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 53 states. [2020-07-28 18:15:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:16,174 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2020-07-28 18:15:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2020-07-28 18:15:16,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:16,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:16,175 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 57 states. [2020-07-28 18:15:16,175 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 57 states. [2020-07-28 18:15:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:16,177 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2020-07-28 18:15:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2020-07-28 18:15:16,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:16,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:16,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:16,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-28 18:15:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2020-07-28 18:15:16,180 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2020-07-28 18:15:16,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:16,180 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2020-07-28 18:15:16,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:15:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2020-07-28 18:15:16,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 18:15:16,181 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:16,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:15:16,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 18:15:16,182 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:16,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:16,182 INFO L82 PathProgramCache]: Analyzing trace with hash 574068571, now seen corresponding path program 1 times [2020-07-28 18:15:16,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:16,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874284774] [2020-07-28 18:15:16,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:16,246 INFO L280 TraceCheckUtils]: 0: Hoare triple {1431#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0;havoc main_~len~0;havoc main_~i~0;havoc main_~j~0;havoc main_~bufsize~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~bufsize~0 := main_#t~nondet0;havoc main_#t~nondet0; {1431#true} is VALID [2020-07-28 18:15:16,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {1431#true} assume !(main_~bufsize~0 < 0);assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~len~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~limit~0 := main_~bufsize~0 - 4;main_~i~0 := 0; {1431#true} is VALID [2020-07-28 18:15:16,247 INFO L280 TraceCheckUtils]: 2: Hoare triple {1431#true} assume !!(main_~i~0 < main_~len~0);main_~j~0 := 0; {1433#(<= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:15:16,248 INFO L280 TraceCheckUtils]: 3: Hoare triple {1433#(<= 0 ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); {1433#(<= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:15:16,249 INFO L280 TraceCheckUtils]: 4: Hoare triple {1433#(<= 0 ULTIMATE.start_main_~j~0)} assume !(1 + main_~i~0 < main_~len~0); {1433#(<= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:15:16,250 INFO L280 TraceCheckUtils]: 5: Hoare triple {1433#(<= 0 ULTIMATE.start_main_~j~0)} __VERIFIER_assert_#in~cond := (if main_~i~0 < main_~len~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1433#(<= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:15:16,250 INFO L280 TraceCheckUtils]: 6: Hoare triple {1433#(<= 0 ULTIMATE.start_main_~j~0)} assume !(0 == __VERIFIER_assert_~cond); {1433#(<= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:15:16,251 INFO L280 TraceCheckUtils]: 7: Hoare triple {1433#(<= 0 ULTIMATE.start_main_~j~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1433#(<= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:15:16,252 INFO L280 TraceCheckUtils]: 8: Hoare triple {1433#(<= 0 ULTIMATE.start_main_~j~0)} assume !(0 == __VERIFIER_assert_~cond); {1433#(<= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:15:16,252 INFO L280 TraceCheckUtils]: 9: Hoare triple {1433#(<= 0 ULTIMATE.start_main_~j~0)} __VERIFIER_assert_#in~cond := (if main_~j~0 < main_~bufsize~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1433#(<= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:15:16,253 INFO L280 TraceCheckUtils]: 10: Hoare triple {1433#(<= 0 ULTIMATE.start_main_~j~0)} assume !(0 == __VERIFIER_assert_~cond); {1433#(<= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:15:16,253 INFO L280 TraceCheckUtils]: 11: Hoare triple {1433#(<= 0 ULTIMATE.start_main_~j~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1434#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:16,254 INFO L280 TraceCheckUtils]: 12: Hoare triple {1434#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {1432#false} is VALID [2020-07-28 18:15:16,254 INFO L280 TraceCheckUtils]: 13: Hoare triple {1432#false} assume !false; {1432#false} is VALID [2020-07-28 18:15:16,255 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-28 18:15:16,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874284774] [2020-07-28 18:15:16,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:16,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 18:15:16,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077461476] [2020-07-28 18:15:16,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-28 18:15:16,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:16,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:15:16,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:16,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:15:16,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:16,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:15:16,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:15:16,281 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2020-07-28 18:15:16,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:16,601 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-28 18:15:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:15:16,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-28 18:15:16,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:15:16,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2020-07-28 18:15:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:15:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2020-07-28 18:15:16,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2020-07-28 18:15:16,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:16,679 INFO L225 Difference]: With dead ends: 58 [2020-07-28 18:15:16,679 INFO L226 Difference]: Without dead ends: 50 [2020-07-28 18:15:16,680 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:15:16,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-28 18:15:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-07-28 18:15:16,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:16,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 45 states. [2020-07-28 18:15:16,750 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 45 states. [2020-07-28 18:15:16,750 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 45 states. [2020-07-28 18:15:16,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:16,752 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2020-07-28 18:15:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2020-07-28 18:15:16,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:16,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:16,753 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 50 states. [2020-07-28 18:15:16,753 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 50 states. [2020-07-28 18:15:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:16,756 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2020-07-28 18:15:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2020-07-28 18:15:16,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:16,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:16,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:16,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-28 18:15:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-28 18:15:16,763 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 14 [2020-07-28 18:15:16,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:16,763 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-28 18:15:16,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:15:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-28 18:15:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 18:15:16,764 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:16,764 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] [2020-07-28 18:15:16,764 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-28 18:15:16,764 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:16,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash -470786895, now seen corresponding path program 1 times [2020-07-28 18:15:16,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:16,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319397631] [2020-07-28 18:15:16,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:16,830 INFO L280 TraceCheckUtils]: 0: Hoare triple {1684#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0;havoc main_~len~0;havoc main_~i~0;havoc main_~j~0;havoc main_~bufsize~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~bufsize~0 := main_#t~nondet0;havoc main_#t~nondet0; {1684#true} is VALID [2020-07-28 18:15:16,831 INFO L280 TraceCheckUtils]: 1: Hoare triple {1684#true} assume !(main_~bufsize~0 < 0);assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~len~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~limit~0 := main_~bufsize~0 - 4;main_~i~0 := 0; {1684#true} is VALID [2020-07-28 18:15:16,831 INFO L280 TraceCheckUtils]: 2: Hoare triple {1684#true} assume !!(main_~i~0 < main_~len~0);main_~j~0 := 0; {1684#true} is VALID [2020-07-28 18:15:16,831 INFO L280 TraceCheckUtils]: 3: Hoare triple {1684#true} assume !!(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); {1684#true} is VALID [2020-07-28 18:15:16,836 INFO L280 TraceCheckUtils]: 4: Hoare triple {1684#true} assume 1 + main_~i~0 < main_~len~0;__VERIFIER_assert_#in~cond := (if 1 + main_~i~0 < main_~len~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:16,837 INFO L280 TraceCheckUtils]: 5: Hoare triple {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} assume !(0 == __VERIFIER_assert_~cond); {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:16,838 INFO L280 TraceCheckUtils]: 6: Hoare triple {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:16,838 INFO L280 TraceCheckUtils]: 7: Hoare triple {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} assume !(0 == __VERIFIER_assert_~cond); {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:16,839 INFO L280 TraceCheckUtils]: 8: Hoare triple {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:16,840 INFO L280 TraceCheckUtils]: 9: Hoare triple {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;__VERIFIER_assert_#in~cond := (if main_~i~0 < main_~len~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:16,840 INFO L280 TraceCheckUtils]: 10: Hoare triple {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} assume !(0 == __VERIFIER_assert_~cond); {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:16,842 INFO L280 TraceCheckUtils]: 11: Hoare triple {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:16,844 INFO L280 TraceCheckUtils]: 12: Hoare triple {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} assume !(0 == __VERIFIER_assert_~cond); {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:16,846 INFO L280 TraceCheckUtils]: 13: Hoare triple {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} __VERIFIER_assert_#in~cond := (if main_~j~0 < main_~bufsize~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:16,848 INFO L280 TraceCheckUtils]: 14: Hoare triple {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} assume !(0 == __VERIFIER_assert_~cond); {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:16,850 INFO L280 TraceCheckUtils]: 15: Hoare triple {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:16,851 INFO L280 TraceCheckUtils]: 16: Hoare triple {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} assume !(0 == __VERIFIER_assert_~cond); {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:15:16,853 INFO L280 TraceCheckUtils]: 17: Hoare triple {1686#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;__VERIFIER_assert_#in~cond := (if main_~i~0 < main_~len~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1687#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:16,854 INFO L280 TraceCheckUtils]: 18: Hoare triple {1687#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {1685#false} is VALID [2020-07-28 18:15:16,855 INFO L280 TraceCheckUtils]: 19: Hoare triple {1685#false} assume !false; {1685#false} is VALID [2020-07-28 18:15:16,856 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-28 18:15:16,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319397631] [2020-07-28 18:15:16,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:16,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 18:15:16,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552978022] [2020-07-28 18:15:16,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-07-28 18:15:16,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:16,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:15:16,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:16,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:15:16,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:16,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:15:16,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:15:16,885 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2020-07-28 18:15:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:17,199 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-28 18:15:17,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:15:17,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-07-28 18:15:17,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:15:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2020-07-28 18:15:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:15:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2020-07-28 18:15:17,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2020-07-28 18:15:17,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:17,279 INFO L225 Difference]: With dead ends: 58 [2020-07-28 18:15:17,279 INFO L226 Difference]: Without dead ends: 56 [2020-07-28 18:15:17,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:15:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-28 18:15:17,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2020-07-28 18:15:17,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:17,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 43 states. [2020-07-28 18:15:17,358 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 43 states. [2020-07-28 18:15:17,358 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 43 states. [2020-07-28 18:15:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:17,360 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2020-07-28 18:15:17,360 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-28 18:15:17,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:17,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:17,361 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 56 states. [2020-07-28 18:15:17,361 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 56 states. [2020-07-28 18:15:17,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:17,363 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2020-07-28 18:15:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-28 18:15:17,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:17,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:17,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:17,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-28 18:15:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2020-07-28 18:15:17,365 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2020-07-28 18:15:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:17,366 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2020-07-28 18:15:17,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:15:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-07-28 18:15:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-28 18:15:17,367 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:17,367 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:15:17,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-28 18:15:17,367 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:17,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:17,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1892453097, now seen corresponding path program 1 times [2020-07-28 18:15:17,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:17,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810784250] [2020-07-28 18:15:17,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:17,477 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0;havoc main_~len~0;havoc main_~i~0;havoc main_~j~0;havoc main_~bufsize~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~bufsize~0 := main_#t~nondet0;havoc main_#t~nondet0; {1951#true} is VALID [2020-07-28 18:15:17,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(main_~bufsize~0 < 0);assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~len~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~limit~0 := main_~bufsize~0 - 4;main_~i~0 := 0; {1953#(<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {1953#(<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)} assume !!(main_~i~0 < main_~len~0);main_~j~0 := 0; {1953#(<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,480 INFO L280 TraceCheckUtils]: 3: Hoare triple {1953#(<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)} assume !!(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,481 INFO L280 TraceCheckUtils]: 4: Hoare triple {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} assume 1 + main_~i~0 < main_~len~0;__VERIFIER_assert_#in~cond := (if 1 + main_~i~0 < main_~len~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,481 INFO L280 TraceCheckUtils]: 5: Hoare triple {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} assume !(0 == __VERIFIER_assert_~cond); {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,482 INFO L280 TraceCheckUtils]: 6: Hoare triple {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,482 INFO L280 TraceCheckUtils]: 7: Hoare triple {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} assume !(0 == __VERIFIER_assert_~cond); {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,483 INFO L280 TraceCheckUtils]: 8: Hoare triple {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,483 INFO L280 TraceCheckUtils]: 9: Hoare triple {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;__VERIFIER_assert_#in~cond := (if main_~i~0 < main_~len~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,484 INFO L280 TraceCheckUtils]: 10: Hoare triple {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} assume !(0 == __VERIFIER_assert_~cond); {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,485 INFO L280 TraceCheckUtils]: 11: Hoare triple {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,485 INFO L280 TraceCheckUtils]: 12: Hoare triple {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} assume !(0 == __VERIFIER_assert_~cond); {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,486 INFO L280 TraceCheckUtils]: 13: Hoare triple {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} __VERIFIER_assert_#in~cond := (if main_~j~0 < main_~bufsize~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,487 INFO L280 TraceCheckUtils]: 14: Hoare triple {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} assume !(0 == __VERIFIER_assert_~cond); {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,487 INFO L280 TraceCheckUtils]: 15: Hoare triple {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,488 INFO L280 TraceCheckUtils]: 16: Hoare triple {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} assume !(0 == __VERIFIER_assert_~cond); {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,489 INFO L280 TraceCheckUtils]: 17: Hoare triple {1954#(<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;__VERIFIER_assert_#in~cond := (if main_~i~0 < main_~len~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1955#(<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,492 INFO L280 TraceCheckUtils]: 18: Hoare triple {1955#(<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0)} assume !(0 == __VERIFIER_assert_~cond); {1955#(<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,493 INFO L280 TraceCheckUtils]: 19: Hoare triple {1955#(<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1955#(<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,493 INFO L280 TraceCheckUtils]: 20: Hoare triple {1955#(<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0)} assume !(0 == __VERIFIER_assert_~cond); {1955#(<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0)} is VALID [2020-07-28 18:15:17,494 INFO L280 TraceCheckUtils]: 21: Hoare triple {1955#(<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0)} __VERIFIER_assert_#in~cond := (if main_~j~0 < main_~bufsize~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1956#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:17,495 INFO L280 TraceCheckUtils]: 22: Hoare triple {1956#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {1952#false} is VALID [2020-07-28 18:15:17,496 INFO L280 TraceCheckUtils]: 23: Hoare triple {1952#false} assume !false; {1952#false} is VALID [2020-07-28 18:15:17,497 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-28 18:15:17,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810784250] [2020-07-28 18:15:17,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:17,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-28 18:15:17,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707518183] [2020-07-28 18:15:17,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-28 18:15:17,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:17,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:15:17,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:17,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:15:17,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:17,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:15:17,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:15:17,535 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2020-07-28 18:15:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:17,997 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-28 18:15:17,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 18:15:17,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-28 18:15:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:15:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2020-07-28 18:15:17,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:15:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2020-07-28 18:15:18,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2020-07-28 18:15:18,084 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-28 18:15:18,084 INFO L225 Difference]: With dead ends: 49 [2020-07-28 18:15:18,084 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:15:18,085 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-07-28 18:15:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:15:18,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:15:18,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:18,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:18,087 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:18,087 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:18,087 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:15:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:15:18,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:18,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:18,088 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:18,088 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:18,088 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:15:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:15:18,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:18,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:18,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:18,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:18,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:15:18,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:15:18,090 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2020-07-28 18:15:18,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:18,090 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:15:18,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:15:18,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:15:18,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:18,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-28 18:15:18,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:15:18,774 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,774 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,774 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:15:18,774 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-28 18:15:18,775 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,775 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,775 INFO L271 CegarLoopResult]: At program point L55(lines 13 56) the Hoare annotation is: true [2020-07-28 18:15:18,775 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 54) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2020-07-28 18:15:18,775 INFO L268 CegarLoopResult]: For program point L23-3(lines 23 54) no Hoare annotation was computed. [2020-07-28 18:15:18,775 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,776 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)) [2020-07-28 18:15:18,776 INFO L268 CegarLoopResult]: For program point L7-3(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,776 INFO L264 CegarLoopResult]: At program point L7-5(lines 6 11) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)) [2020-07-28 18:15:18,776 INFO L268 CegarLoopResult]: For program point L7-6(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,776 INFO L264 CegarLoopResult]: At program point L7-8(lines 6 11) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)) [2020-07-28 18:15:18,776 INFO L268 CegarLoopResult]: For program point L7-9(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,776 INFO L264 CegarLoopResult]: At program point L7-11(lines 6 11) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)) [2020-07-28 18:15:18,777 INFO L268 CegarLoopResult]: For program point L7-12(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,777 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,777 INFO L264 CegarLoopResult]: At program point L7-14(lines 6 11) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)) [2020-07-28 18:15:18,777 INFO L268 CegarLoopResult]: For program point L7-15(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,780 INFO L264 CegarLoopResult]: At program point L7-17(lines 6 11) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)) [2020-07-28 18:15:18,781 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 53) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0) (or (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0))) [2020-07-28 18:15:18,781 INFO L268 CegarLoopResult]: For program point L7-18(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,781 INFO L264 CegarLoopResult]: At program point L7-20(lines 6 11) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2020-07-28 18:15:18,781 INFO L268 CegarLoopResult]: For program point L7-21(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,782 INFO L264 CegarLoopResult]: At program point L7-23(lines 6 11) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2020-07-28 18:15:18,782 INFO L268 CegarLoopResult]: For program point L7-24(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,782 INFO L264 CegarLoopResult]: At program point L7-26(lines 6 11) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2020-07-28 18:15:18,782 INFO L268 CegarLoopResult]: For program point L7-27(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,782 INFO L264 CegarLoopResult]: At program point L7-29(lines 6 11) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2020-07-28 18:15:18,783 INFO L268 CegarLoopResult]: For program point L7-30(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,783 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,783 INFO L268 CegarLoopResult]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,783 INFO L264 CegarLoopResult]: At program point L7-32(lines 6 11) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~i~0)) [2020-07-28 18:15:18,783 INFO L268 CegarLoopResult]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,784 INFO L268 CegarLoopResult]: For program point L7-33(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,784 INFO L268 CegarLoopResult]: For program point L8-3(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,784 INFO L268 CegarLoopResult]: For program point L8-4(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,784 INFO L264 CegarLoopResult]: At program point L7-35(lines 6 11) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~i~0)) [2020-07-28 18:15:18,784 INFO L268 CegarLoopResult]: For program point L8-5(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,784 INFO L268 CegarLoopResult]: For program point L7-36(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,785 INFO L268 CegarLoopResult]: For program point L8-6(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,785 INFO L268 CegarLoopResult]: For program point L8-7(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,785 INFO L264 CegarLoopResult]: At program point L7-38(lines 6 11) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)) [2020-07-28 18:15:18,785 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:15:18,785 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,786 INFO L268 CegarLoopResult]: For program point L8-8(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,786 INFO L268 CegarLoopResult]: For program point L7-39(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,786 INFO L268 CegarLoopResult]: For program point L8-9(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,786 INFO L268 CegarLoopResult]: For program point L8-10(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,786 INFO L264 CegarLoopResult]: At program point L7-41(lines 6 11) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)) [2020-07-28 18:15:18,787 INFO L268 CegarLoopResult]: For program point L8-11(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,787 INFO L268 CegarLoopResult]: For program point L7-42(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,787 INFO L268 CegarLoopResult]: For program point L8-12(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,787 INFO L268 CegarLoopResult]: For program point L8-13(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,787 INFO L264 CegarLoopResult]: At program point L7-44(lines 6 11) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)) [2020-07-28 18:15:18,788 INFO L268 CegarLoopResult]: For program point L8-14(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,788 INFO L268 CegarLoopResult]: For program point L7-45(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:18,788 INFO L268 CegarLoopResult]: For program point L25(lines 25 52) no Hoare annotation was computed. [2020-07-28 18:15:18,788 INFO L268 CegarLoopResult]: For program point L8-15(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,788 INFO L264 CegarLoopResult]: At program point L7-47(lines 6 11) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)) [2020-07-28 18:15:18,788 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,789 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,789 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,789 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,789 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:15:18,790 INFO L268 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2020-07-28 18:15:18,790 INFO L264 CegarLoopResult]: At program point L45(lines 25 52) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0)) [2020-07-28 18:15:18,790 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,791 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,791 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,791 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,791 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,791 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:18,797 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:15:18,797 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-28 18:15:18,797 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-28 18:15:18,797 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:15:18,797 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-28 18:15:18,798 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-28 18:15:18,803 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:15:18,804 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-28 18:15:18,808 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-28 18:15:18,808 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-28 18:15:18,808 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-28 18:15:18,808 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:15:18,808 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:15:18,809 WARN L170 areAnnotationChecker]: L7-36 has no Hoare annotation [2020-07-28 18:15:18,809 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:15:18,809 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:15:18,809 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-28 18:15:18,809 WARN L170 areAnnotationChecker]: L7-36 has no Hoare annotation [2020-07-28 18:15:18,809 WARN L170 areAnnotationChecker]: L7-36 has no Hoare annotation [2020-07-28 18:15:18,809 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-28 18:15:18,809 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-28 18:15:18,809 WARN L170 areAnnotationChecker]: L8-12 has no Hoare annotation [2020-07-28 18:15:18,809 WARN L170 areAnnotationChecker]: L8-12 has no Hoare annotation [2020-07-28 18:15:18,810 WARN L170 areAnnotationChecker]: L7-39 has no Hoare annotation [2020-07-28 18:15:18,810 WARN L170 areAnnotationChecker]: L8-1 has no Hoare annotation [2020-07-28 18:15:18,810 WARN L170 areAnnotationChecker]: L8-1 has no Hoare annotation [2020-07-28 18:15:18,810 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 18:15:18,810 WARN L170 areAnnotationChecker]: L7-39 has no Hoare annotation [2020-07-28 18:15:18,810 WARN L170 areAnnotationChecker]: L7-39 has no Hoare annotation [2020-07-28 18:15:18,810 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 18:15:18,810 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 18:15:18,810 WARN L170 areAnnotationChecker]: L8-13 has no Hoare annotation [2020-07-28 18:15:18,810 WARN L170 areAnnotationChecker]: L8-13 has no Hoare annotation [2020-07-28 18:15:18,810 WARN L170 areAnnotationChecker]: L7-42 has no Hoare annotation [2020-07-28 18:15:18,811 WARN L170 areAnnotationChecker]: L7-6 has no Hoare annotation [2020-07-28 18:15:18,811 WARN L170 areAnnotationChecker]: L7-6 has no Hoare annotation [2020-07-28 18:15:18,811 WARN L170 areAnnotationChecker]: L7-42 has no Hoare annotation [2020-07-28 18:15:18,811 WARN L170 areAnnotationChecker]: L7-42 has no Hoare annotation [2020-07-28 18:15:18,811 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-28 18:15:18,811 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-28 18:15:18,812 WARN L170 areAnnotationChecker]: L7-9 has no Hoare annotation [2020-07-28 18:15:18,812 WARN L170 areAnnotationChecker]: L8-14 has no Hoare annotation [2020-07-28 18:15:18,812 WARN L170 areAnnotationChecker]: L8-14 has no Hoare annotation [2020-07-28 18:15:18,813 WARN L170 areAnnotationChecker]: L7-45 has no Hoare annotation [2020-07-28 18:15:18,813 WARN L170 areAnnotationChecker]: L7-9 has no Hoare annotation [2020-07-28 18:15:18,813 WARN L170 areAnnotationChecker]: L7-9 has no Hoare annotation [2020-07-28 18:15:18,813 WARN L170 areAnnotationChecker]: L7-45 has no Hoare annotation [2020-07-28 18:15:18,813 WARN L170 areAnnotationChecker]: L7-45 has no Hoare annotation [2020-07-28 18:15:18,813 WARN L170 areAnnotationChecker]: L8-3 has no Hoare annotation [2020-07-28 18:15:18,814 WARN L170 areAnnotationChecker]: L8-3 has no Hoare annotation [2020-07-28 18:15:18,814 WARN L170 areAnnotationChecker]: L7-12 has no Hoare annotation [2020-07-28 18:15:18,814 WARN L170 areAnnotationChecker]: L8-15 has no Hoare annotation [2020-07-28 18:15:18,814 WARN L170 areAnnotationChecker]: L8-15 has no Hoare annotation [2020-07-28 18:15:18,815 WARN L170 areAnnotationChecker]: L7-12 has no Hoare annotation [2020-07-28 18:15:18,816 WARN L170 areAnnotationChecker]: L7-12 has no Hoare annotation [2020-07-28 18:15:18,816 WARN L170 areAnnotationChecker]: L8-4 has no Hoare annotation [2020-07-28 18:15:18,816 WARN L170 areAnnotationChecker]: L8-4 has no Hoare annotation [2020-07-28 18:15:18,816 WARN L170 areAnnotationChecker]: L7-15 has no Hoare annotation [2020-07-28 18:15:18,816 WARN L170 areAnnotationChecker]: L7-15 has no Hoare annotation [2020-07-28 18:15:18,816 WARN L170 areAnnotationChecker]: L7-15 has no Hoare annotation [2020-07-28 18:15:18,816 WARN L170 areAnnotationChecker]: L8-5 has no Hoare annotation [2020-07-28 18:15:18,816 WARN L170 areAnnotationChecker]: L8-5 has no Hoare annotation [2020-07-28 18:15:18,816 WARN L170 areAnnotationChecker]: L7-18 has no Hoare annotation [2020-07-28 18:15:18,816 WARN L170 areAnnotationChecker]: L7-18 has no Hoare annotation [2020-07-28 18:15:18,816 WARN L170 areAnnotationChecker]: L7-18 has no Hoare annotation [2020-07-28 18:15:18,817 WARN L170 areAnnotationChecker]: L8-6 has no Hoare annotation [2020-07-28 18:15:18,817 WARN L170 areAnnotationChecker]: L8-6 has no Hoare annotation [2020-07-28 18:15:18,817 WARN L170 areAnnotationChecker]: L7-21 has no Hoare annotation [2020-07-28 18:15:18,817 WARN L170 areAnnotationChecker]: L7-21 has no Hoare annotation [2020-07-28 18:15:18,817 WARN L170 areAnnotationChecker]: L7-21 has no Hoare annotation [2020-07-28 18:15:18,817 WARN L170 areAnnotationChecker]: L8-7 has no Hoare annotation [2020-07-28 18:15:18,817 WARN L170 areAnnotationChecker]: L8-7 has no Hoare annotation [2020-07-28 18:15:18,817 WARN L170 areAnnotationChecker]: L7-24 has no Hoare annotation [2020-07-28 18:15:18,817 WARN L170 areAnnotationChecker]: L7-24 has no Hoare annotation [2020-07-28 18:15:18,817 WARN L170 areAnnotationChecker]: L7-24 has no Hoare annotation [2020-07-28 18:15:18,817 WARN L170 areAnnotationChecker]: L8-8 has no Hoare annotation [2020-07-28 18:15:18,817 WARN L170 areAnnotationChecker]: L8-8 has no Hoare annotation [2020-07-28 18:15:18,818 WARN L170 areAnnotationChecker]: L7-27 has no Hoare annotation [2020-07-28 18:15:18,818 WARN L170 areAnnotationChecker]: L7-27 has no Hoare annotation [2020-07-28 18:15:18,818 WARN L170 areAnnotationChecker]: L7-27 has no Hoare annotation [2020-07-28 18:15:18,818 WARN L170 areAnnotationChecker]: L8-9 has no Hoare annotation [2020-07-28 18:15:18,818 WARN L170 areAnnotationChecker]: L8-9 has no Hoare annotation [2020-07-28 18:15:18,818 WARN L170 areAnnotationChecker]: L7-30 has no Hoare annotation [2020-07-28 18:15:18,818 WARN L170 areAnnotationChecker]: L7-30 has no Hoare annotation [2020-07-28 18:15:18,818 WARN L170 areAnnotationChecker]: L7-30 has no Hoare annotation [2020-07-28 18:15:18,818 WARN L170 areAnnotationChecker]: L8-10 has no Hoare annotation [2020-07-28 18:15:18,818 WARN L170 areAnnotationChecker]: L8-10 has no Hoare annotation [2020-07-28 18:15:18,818 WARN L170 areAnnotationChecker]: L7-33 has no Hoare annotation [2020-07-28 18:15:18,819 WARN L170 areAnnotationChecker]: L7-33 has no Hoare annotation [2020-07-28 18:15:18,819 WARN L170 areAnnotationChecker]: L7-33 has no Hoare annotation [2020-07-28 18:15:18,819 WARN L170 areAnnotationChecker]: L8-11 has no Hoare annotation [2020-07-28 18:15:18,819 WARN L170 areAnnotationChecker]: L8-11 has no Hoare annotation [2020-07-28 18:15:18,820 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:15:18,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:15:18 BoogieIcfgContainer [2020-07-28 18:15:18,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:15:18,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:15:18,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:15:18,848 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:15:18,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:15:12" (3/4) ... [2020-07-28 18:15:18,853 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:15:18,867 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2020-07-28 18:15:18,868 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:15:18,953 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:15:18,953 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:15:18,956 INFO L168 Benchmark]: Toolchain (without parser) took 7308.02 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.2 MB). Free memory was 952.2 MB in the beginning and 1.2 GB in the end (delta: -292.4 MB). Peak memory consumption was 3.9 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:18,957 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:15:18,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.38 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:18,958 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:18,958 INFO L168 Benchmark]: Boogie Preprocessor took 65.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:15:18,958 INFO L168 Benchmark]: RCFGBuilder took 836.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:18,959 INFO L168 Benchmark]: TraceAbstraction took 5901.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -153.5 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:18,959 INFO L168 Benchmark]: Witness Printer took 106.35 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:15:18,961 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.39 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 261.38 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 130.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 836.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5901.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -153.5 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. * Witness Printer took 106.35 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 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 - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - 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 16 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((((i + 2 <= len && limit + 4 <= bufsize) && 0 <= j) && !(0 == cond)) && 0 <= i) && j + 5 <= bufsize - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: (((limit + 4 <= bufsize && 0 <= j) && !(0 == cond)) && j + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((((0 <= j && limit + 4 <= bufsize) && !(0 == cond)) && 0 <= i) && i + 1 <= len) && j + 5 <= bufsize - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((((i + 2 <= len && limit + 4 <= bufsize) && 0 <= j) && !(0 == cond)) && 0 <= i) && j + 5 <= bufsize - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((limit + 4 <= bufsize && 0 <= j) && !(0 == cond)) && 0 <= i - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: (((limit + 4 <= bufsize && 0 <= j) && !(0 == cond)) && j + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((((0 <= j && limit + 4 <= bufsize) && !(0 == cond)) && 0 <= i) && i + 1 <= len) && j + 5 <= bufsize - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((((i + 2 <= len && limit + 4 <= bufsize) && 0 <= j) && !(0 == cond)) && 0 <= i) && j + 5 <= bufsize - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: (((limit + 4 <= bufsize && 0 <= j) && !(0 == cond)) && j + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: limit + 4 <= bufsize && 0 <= i - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((((i + 2 <= len && limit + 4 <= bufsize) && 0 <= j) && !(0 == cond)) && 0 <= i) && j + 5 <= bufsize - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((0 <= j && limit + 4 <= bufsize) && 0 <= i) && (!(0 == cond) || i + 1 <= len) - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((((0 <= j && limit + 4 <= bufsize) && !(0 == cond)) && 0 <= i) && i + 1 <= len) && j + 5 <= bufsize - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((((i + 2 <= len && limit + 4 <= bufsize) && 0 <= j) && !(0 == cond)) && 0 <= i) && j + 5 <= bufsize - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((limit + 4 <= bufsize && 0 <= j) && 0 <= i) && i + 1 <= len) && j + 5 <= bufsize - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: (((limit + 4 <= bufsize && 0 <= j) && !(0 == cond)) && j + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((((0 <= j && limit + 4 <= bufsize) && !(0 == cond)) && 0 <= i) && i + 1 <= len) && j + 5 <= bufsize - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((((i + 2 <= len && limit + 4 <= bufsize) && 0 <= j) && !(0 == cond)) && 0 <= i) && j + 5 <= bufsize - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((limit + 4 <= bufsize && 0 <= j) && !(0 == cond)) && 0 <= i - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 75 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.0s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 345 SDtfs, 310 SDslu, 149 SDs, 0 SdLazy, 338 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 46 NumberOfFragments, 430 HoareAnnotationTreeSize, 20 FomulaSimplifications, 4013 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 149 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 5168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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...